SETNX and MSETNX now respect the delete-on-write operation of EXPIREing keys

[redis.git] / TODO

diff --git a/TODO b/TODO
index a62743ea27c5c1553972982aca3f14400ef886c0..2a12f2f386f2cf70d2532016496c08f32ca59733 100644 (file)
--- a/TODO
+++ b/TODO
@@ -5,16 +5,16 @@ VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal)
 
 Most of the features already implemented for this release. The following is a list of the missing things in order to release the first beta tar.gz:
 
-* Man pages for SRANDMEMBER, missing Z-commands, ...
-* Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
-* ZRANGEBYSCORE LIMIT option and test.
-* check the command table for deny on OOM correctness.
+* Document "masterauth" in redis.conf, also merge the other related patch if it seems a safe one.
+* SETNX and MSETNX should use lookupKeWrite() in order to expire volatile keys when a write attempt is made.
 
 VERSION 1.4 TODO (Hash type)
 ============================
 
 * Hashes (HSET, HGET, HEXISTS, HLEN, ...).
+* Specially encoded memory-saving integer sets.
 * An utility able to export an .rdb file into a text-only JSON dump, we can't live anymore without such a tool. Probably an extension to redis-cli.
+* List ops like L/RPUSH L/RPOP should return the new list length.
 
 VERSION 1.6 TODO (Virtual memory)
 =================================
@@ -46,13 +46,26 @@ VERSION 2.2 TODO (Optimizations and latency)
 SHORT/LONG TERM RANDOM TODO ITEMS
 =================================
 
- * FORK command (fork()s executing the commands received by the current
-   client in the new process). Hint: large SORTs can use more cores,
-   copy-on-write will avoid memory problems.
- * SORT: Don't copy the list into a vector when BY argument is constant.
- * Write the hash table size of every db in the dump, so that Redis can resize the hash table just one time when loading a big DB.
- * LOCK / TRYLOCK / UNLOCK as described many times in the google group
- * Replication automated tests
- * BYTEDARRAY type
- * zmalloc() should avoid to add a private header for archs where there is some other kind of libc-specific way to get the size of a malloced block.
- * Read-only mode.
+Most of this can be seen just as proposals, the fact they are in this list
+it's not a guarantee they'll ever get implemented ;)
+
+* Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
+* FORK command (fork()s executing the commands received by the current
+  client in the new process). Hint: large SORTs can use more cores,
+  copy-on-write will avoid memory problems.
+* DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey.
+* SORT: Don't copy the list into a vector when BY argument is constant.
+* Write the hash table size of every db in the dump, so that Redis can resize the hash table just one time when loading a big DB.
+* LOCK / TRYLOCK / UNLOCK as described many times in the google group
+* Replication automated tests
+* Byte Array type (BA prefixed commands): BASETBIT BAGETBIT BASETU8 U16 U32 U64 S8 S16 S32 S64, ability to atomically INCRBY all the base types. BARANGE to get a range of bytes as a bulk value, BASETRANGE to set a range of bytes.
+* zmalloc() should avoid to add a private header for archs where there is some other kind of libc-specific way to get the size of a malloced block. Already done for Mac OS X.
+* Read-only mode.
+* Pattern-matching replication.
+
+DOCUMENTATION WISHLIST
+======================
+
+* Page explaining tips to reduce memory usage.
+* A Sorted sets HOWTO
+