TODO

   1 BEFORE REDIS 1.0.0-rc1
   2
   3  * Add number of keys for every DB in INFO
   4  * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
   5  * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
   6  * Cover most of the source code with test-redis.tcl
   7  * 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.
   8
   9 AFTER 1.0 stable release
  10
  11  * Consistent hashing implemented in all the client libraries having an user base
  12  * SORT: Don't copy the list into a vector when BY argument is constant.
  13  * SORT ... STORE keyname. Instead to return the SORTed data set it into key.
  14  * Profiling and optimization in order to limit the CPU usage at minimum
  15  * 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.
  16  * Elapsed time in logs for SAVE when saving is going to take more than 2 seconds
  17  * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  18  * Replication automated tests
  19  * some kind of sorted type, example:
  20         ZADD mykey foo 100
  21         ZADD mykey bar 50
  22    ZRANGE mykey 0 1 => bar foo
  23    This is able to take elements sorted because a binary tree is used to store
  24    the elements by 'score', with the actual value being the key. On the other
  25    side the type also takes an hash table with key->score mapping, so that when
  26    there is an update we lookup the current score and can traverse the tree.
  27  * BITMAP type
  28  * 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)
  29  * 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.
  30
  31 FUTURE HINTS
  32
  33 - 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.