TODO

   1 Pre 1.1 todo
   2
   3 * 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".
   4 * Man pages for MSET MSETNX and SRANDMEMBER.
   5 * Hashes (HSET, HGET, HEXISTS, HLEN, ...).
   6 * ZSETs
   7 * 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.
   8
   9 After 1.1 todo
  10
  11 * 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.
  12  * Add a command to inspect the currently selected DB index
  13  * Consistent hashing implemented in all the client libraries having an user base
  14  * SORT: Don't copy the list into a vector when BY argument is constant.
  15  * SORT ... STORE keyname. Instead to return the SORTed data set it into key.
  16  * Profiling and optimization in order to limit the CPU usage at minimum
  17  * 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.
  18  * Elapsed time in logs for SAVE when saving is going to take more than 2 seconds
  19  * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  20  * Replication automated tests
  21  * some kind of sorted type, example:
  22         ZADD mykey foo 100
  23         ZADD mykey bar 50
  24    ZRANGE mykey 0 1 => bar foo
  25    This is able to take elements sorted because a binary tree is used to store
  26    the elements by 'score', with the actual value being the key. On the other
  27    side the type also takes an hash table with key->score mapping, so that when
  28    there is an update we lookup the current score and can traverse the tree.
  29  * BITMAP / BYTEARRAY type?
  30  * 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)
  31  * 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.
  32
  33 FUTURE HINTS
  34
  35 - In memory compression: if in-memory values compression will be implemented, make sure to implement this so that addReply() is able to handle compressed objects, just creating an uncompressed version on the fly and adding this to the output queue instead of the original one. When insetad we need to look at the object string value (SORT BY for example), call a function that will turn the object into an uncompresed one.