summaryrefslogtreecommitdiff
path: root/TODO
diff options
context:
space:
mode:
authorantirez <antirez@gmail.com>2010-03-09 13:18:49 +0100
committerantirez <antirez@gmail.com>2010-03-09 13:18:49 +0100
commitada386b2189aabee1cf862546d14cc35a827b4e1 (patch)
treed57a02328eaf0fe9550808932e6740748fec8910 /TODO
parentb1befe6a8e4fbec81e721d1a5a0871f88411a1c9 (diff)
downloadredis-ada386b2189aabee1cf862546d14cc35a827b4e1.tar.gz
Hash auto conversion from zipmap to hash table, type fixed for hashes, hash loading from disk
Diffstat (limited to 'TODO')
-rw-r--r--TODO1
1 files changed, 1 insertions, 0 deletions
diff --git a/TODO b/TODO
index e54a0aec3..f9fa8f2af 100644
--- a/TODO
+++ b/TODO
@@ -59,6 +59,7 @@ 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