epoll support enabled by default for Linux builds

[redis.git] / TODO

diff --git a/TODO b/TODO
index a8108a7aaf7ec82d46773c142fff74a5a47d0e98..528e833b02daa538dd316f6e4de6c8936e96ff16 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,24 +1,51 @@
-BEFORE REDIS 1.0.0-rc1
+VERSION 1.1 TODO (Zsets, Integer encoding, Append only journal)
+===============================================================
 
-- GETSET
-- Fix pure-PHP lib version 4 for the new protocol
-- persistent expires
-- network layer stresser in test in demo
-- maxclients directive
-- check 'server.dirty' everywere
-- replication automated tests
-- replication non stopping master<->slave syncronization
-- an external tool able to perform the 'difference' between two Redis servers. It's like 'diff', but against Redis servers, and the output is the set of commands needed to turn the first server into the second, suitable to be sent via netcat.
+Most of the features already implemented for this release. The following is a list of the missing things in order to release the first beta tar.gz:
 
-   $ ./redis-diff 192.168.1.1 192.168.1.2 > diff.txt
-   $ cat diff.txt | nc 192.168.1.1 6379
-   $ ./redis-diff 192.168.1.1 192.168.1.2
-   $ # No output now the servers are identical
+* 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".
+* Man pages for MSET MSETNX and SRANDMEMBER, missing Z-commands, ...
+* Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
+* Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
+* Append only mode: testing and a command to rebuild the log from scratch.
+* ZRANGEBYSCORE test, ZRANGEBYSCORE LIMIT option.
+* Sorted sets infinity tests.
+* Support for epool in ae.c.
 
-This command should be smart and don't use too much memory, that is, take two connections at the same time against the two servers and perform the comparison key by key. Probably the initial "KEYS *" is unavoidable.
+VERSION 1.2 TODO (Hash type)
+============================
 
-- objects sharing configuration, add the directive "objectsharingpool <size>"
+* Hashes (HSET, HGET, HEXISTS, HLEN, ...).
+* An utility able to export an .rdb file into a text-only JSON dump, we can't live anymore without such a tool. Probably an extension to redis-cli.
 
-FUTURE HINTS
+VERSION 1.3 TODO (Virtual memory)
+=================================
 
-- 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.
+* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
+
+VERSION 1.4 TODO (Fault tollerant sharding)
+===========================================
+
+* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
+
+Interesting readings about this:
+
+    - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
+
+VERSION 1.5 TODO (Optimizations and latency)
+============================================
+
+* Lower the CPU usage.
+* Lower the RAM usage everywhere possible.
+* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
+* Implement an UDP interface for low-latency GET/SET operations.
+
+SHORT/LONG TERM RANDOM TODO ITEMS
+=================================
+
+ * SORT: Don't copy the list into a vector when BY argument is constant.
+ * 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.
+ * LOCK / TRYLOCK / UNLOCK as described many times in the google group
+ * Replication automated tests
+ * BYTEDARRAY type
+ * 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.