X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/978c2c944cb540827ba53ceb2301e4bd460d9591..a71f072f7352e8879ac8e39dbfcf19369395ce93:/TODO diff --git a/TODO b/TODO index e54a0aec..2c119293 100644 --- a/TODO +++ b/TODO @@ -8,8 +8,6 @@ VERSION 2.0 TODO * Save dataset / fsync() on SIGTERM * MULTI/EXEC should support the "EXEC FSYNC" form? * BLPOP & C. tests (write a non blocking Tcl client as first step) -* ZCOUNT sortedset min max -* ZRANK: http://docs.google.com/viewer?a=v&q=cache:tCQaP3ZeN4YJ:courses.csail.mit.edu/6.046/spring04/handouts/ps5-sol.pdf+skip+list+rank+operation+augmented&hl=en&pid=bl&srcid=ADGEEShXuNjTcZyXw_1cq9OaWpSXy3PprjXqVzmM-LE0ETFznLyrDXJKQ_mBPNT10R8ErkoiXD9JbMw_FaoHmOA4yoGVrA7tZWiy393JwfCwuewuP93sjbkzZ_gnEp83jYhPYjThaIzw&sig=AHIEtbRF0GkYCdYRFtTJBE69senXZwFY0w * Once ZRANK is implemented, change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster. * Write doc for ZCOUNT, and for open / closed intervals of sorted sets range operations. @@ -29,7 +27,7 @@ Virtual Memory sub-TODO: * Hashes (GET/SET/DEL/INCRBY/EXISTS/FIELDS/LEN/MSET/MGET). Special encoding for hashes with less than N elements. * Write documentation for APPEND -* Implement LEN, SUBSTR, PEEK, POKE, SETBIT, GETBIT +* Implement LEN, PEEK, POKE, SETBIT, GETBIT VERSION 2.2 TODO (Fault tolerant sharding) =========================================== @@ -59,12 +57,14 @@ BIG ONES: SMALL ONES: +* If sizeof(double) == sizeof(void*) we could store the double value of sorted sets directly in place of the pointer instead of allocating it in the heap. * Delete on writes against expire policy should only happen after argument parsing for commands doing their own arg parsing stuff. * Give errors when incrementing a key that does not look like an integer, when providing as a sorted set score something can't be parsed as a double, and so forth. * MSADD (n keys) (n values). See this thread in the Redis google group: http://groups.google.com/group/redis-db/browse_thread/thread/e766d84eb375cd41 * Don't save empty lists / sets / zsets on disk with snapshotting. * Remove keys when a list / set / zset reaches length of 0. * An option to exec a command slave-side if the master connection is lost: even cooler: if the script returns "0" the slave elects itself as master, otherwise continue trying to reconnect. +* PING the master from time to time to check if it's gone. THE "MAYBE" TODO LIST: things that may or may not get implemented =================================================================