TODO

   1  * 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.
   2  * Add a command to inspect the currently selected DB index
   3  * Consistent hashing implemented in all the client libraries having an user base
   4  * SORT: Don't copy the list into a vector when BY argument is constant.
   5  * SORT ... STORE keyname. Instead to return the SORTed data set it into key.
   6  * Profiling and optimization in order to limit the CPU usage at minimum
   7  * 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.
   8  * Elapsed time in logs for SAVE when saving is going to take more than 2 seconds
   9  * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  10  * Replication automated tests
  11  * some kind of sorted type, example:
  12         ZADD mykey foo 100
  13         ZADD mykey bar 50
  14    ZRANGE mykey 0 1 => bar foo
  15    This is able to take elements sorted because a binary tree is used to store
  16    the elements by 'score', with the actual value being the key. On the other
  17    side the type also takes an hash table with key->score mapping, so that when
  18    there is an update we lookup the current score and can traverse the tree.
  19  * BITMAP / BYTEARRAY type?
  20  * 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)
  21  * 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.
  22
  23 FUTURE HINTS
  24
  25 - 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.