backward support to skiplists for ZREVRANGE, still broken, committing since I've...

[redis.git] / TODO

diff --git a/TODO b/TODO
index 37dbeed456b1a2bcfbc8a31f375eec88fcd89c98..d95fb898801300f3cd15ca24210b30f086d56d5e 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,14 +1,15 @@
-BEFORE REDIS 1.0.0-rc1
+Pre 1.1 todo
 
- * SPOP man page
- * Add number of keys for every DB in INFO
- * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
- * Cover most of the source code with test-redis.tcl
- * Remove tmp-.... files when saving child exits in the wrong way, to do so use tmp-pid.rdb as filename so that the parent can rebuild the file name just from the child pid.
+* For now only the last argument gets integer encoded, so make sure that: 1) every multi bulk commands implemented will have the last arg that is indeed a value, and not used otherwise. 2) to explicitly call the function to encode the object in MSET and other commands where there are multiple "values".
+* Man pages for MSET MSETNX and SRANDMEMBER.
+* Hashes (HSET, HGET, HEXISTS, HLEN, ...).
+* ZSETs missing stuff: ZINCRBY, ZSCORE, ZREVRANGE, ZRANGEBYSCORE
+* 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.
 
-AFTER 1.0 stable release
+After 1.1 todo
 
- * Max command payload bytes configurable, with a pretty large default.
+* Expiring algorithm should be adaptive, if there are a lot of keys with an expire set and many of this happen to be already expired it should be, proportionally, more aggressive.
+ * Add a command to inspect the currently selected DB index
  * Consistent hashing implemented in all the client libraries having an user base
  * SORT: Don't copy the list into a vector when BY argument is constant.
  * SORT ... STORE keyname. Instead to return the SORTed data set it into key.
@@ -25,7 +26,7 @@ AFTER 1.0 stable release
    the elements by 'score', with the actual value being the key. On the other
    side the type also takes an hash table with key->score mapping, so that when
    there is an update we lookup the current score and can traverse the tree.
- * BITMAP type
+ * BITMAP / BYTEARRAY type?
  * LRANGE 4 0 should return the same elements as LRANGE 0 4 but in reverse order (only if we get enough motivated requests about it)
  * 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.