X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/a3cc9e36aa9fe82bdd62cfb4916e3c1e4cb29583..724a51b1a95b9e6a6937ac363e11df647829d4c6:/TODO

diff --git a/TODO b/TODO
index a0876807..7722b34c 100644
--- a/TODO
+++ b/TODO
@@ -1,12 +1,5 @@
-BEFORE REDIS 1.0.0-rc1
-
- * 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
-
-AFTER 1.0 stable release
-
+ * 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.
@@ -23,7 +16,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.