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

[redis.git] / TODO

diff --git a/TODO b/TODO
index 00885d170d07ceb30523ab100f28594bdb94ee33..e37e50f22bf34fddcbee4405cfae4e3e9fa60eac 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,9 +1,33 @@
-- Protocol changes as discussed in the Redis group
-- keys expire
-- sunion ssub
-- write integers in a special way on disk (and on memory?)
-- compact types for disk storing of short strings (no 4 bytes overhead!)
-- network layer stresser in test in demo
-- maxclients directive
-- check 'server.dirty' everywere
-- replication automated tests
+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
+ * 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
+
+ * 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.
+ * Profiling and optimization in order to limit the CPU usage at minimum
+ * 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.
+ * 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
+
+- 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.