multi bulk input protocol fixed

[redis.git] / TODO

diff --git a/TODO b/TODO
index a0876807446b1e2d46a2014d4af761ed63664482..531b9738c0f5bf8e93f1c6a78098d2c19c96700f 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,12 +1,11 @@
-BEFORE REDIS 1.0.0-rc1
+Pre 1.1 todo

 
 

- * Add number of keys for every DB in INFO
- * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
- * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
- * Cover most of the source code with test-redis.tcl
+* 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".

 
 

-AFTER 1.0 stable release
+After 1.1 todo

 
 

+* 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.
  * 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.


@@ -23,7 +22,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.
    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.
 
  * 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.