SPOP implemented. Hash table resizing for Sets and Expires too. Changed the resize...

[redis.git] / TODO

diff --git a/TODO b/TODO
index f09830e22dac15a269eaad70a059fc5d28c0a58b..e37e50f22bf34fddcbee4405cfae4e3e9fa60eac 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,17 +1,10 @@
 BEFORE REDIS 1.0.0-rc1
 
- * Warning if using default config, with hint about 'redis-server redis.conf'
  * Add number of keys for every DB in INFO
- * maxmemory support
- * maxclients support
  * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
- * What happens if the saving child gets killed or segfaults instead of ending normally? Handle this.
- * Make sinterstore / unionstore / sdiffstore returning the cardinality of the resulting set.
- * check 'server.dirty' everywere
- * Shutdown must kill other background savings before to start saving. Otherwise the DB can get replaced by the child that rename(2) after the parent for some reason. Child should trap the signal and remove the temp file name.
- * Objects sharing configuration, add the directive `objectsharingpool <size>`
- * Make sure to convert all the fstat() calls to 64bit versions.
+ * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
  * Cover most of the source code with test-redis.tcl
+ * 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.
 
 AFTER 1.0 stable release
 
@@ -23,6 +16,17 @@ AFTER 1.0 stable release
  * Elapsed time in logs for SAVE when saving is going to take more than 2 seconds
  * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  * Replication automated tests
+ * some kind of sorted type, example:
+        ZADD mykey foo 100
+        ZADD mykey bar 50
+   ZRANGE mykey 0 1 => bar foo
+   This is able to take elements sorted because a binary tree is used to store
+   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
+ * 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.
 
 FUTURE HINTS