From d214bb4894af1790d9e9974218c48730ce824845 Mon Sep 17 00:00:00 2001 From: antirez Date: Wed, 20 May 2009 10:44:08 +0200 Subject: [PATCH] Aman Gupta changes merged --- TODO | 3 ++- test-redis.tcl | 10 ---------- 2 files changed, 2 insertions(+), 11 deletions(-) diff --git a/TODO b/TODO index 52bd9ffb..e40a7ed4 100644 --- a/TODO +++ b/TODO @@ -18,7 +18,8 @@ BEFORE REDIS 1.0.0-rc1 AFTER 1.0 stable release * Consistent hashing implemented in all the client libraries having an user base - * Use partial qsort for SORT + LIMIT. Don't copy the list into a vector when BY argument is constant. + * 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 diff --git a/test-redis.tcl b/test-redis.tcl index 16723903..bd58cb2e 100644 --- a/test-redis.tcl +++ b/test-redis.tcl @@ -481,11 +481,6 @@ proc main {server port} { lsort [$r smembers setres] } [lsort -uniq "[$r smembers set1] [$r smembers set2]"] - test {SUNIONSTORE with same src and dest} { - $r sunionstore set1 set1 set1 - $r scard set1 - } {1000} - test {SINTER against three sets} { $r sadd set3 999 $r sadd set3 995 @@ -499,11 +494,6 @@ proc main {server port} { lsort [$r smembers setres] } {995 999} - test {SINTERSTORE with same src and dest} { - $r sinterstore set1 set1 set1 - $r scard set1 - } {1000} - test {SUNION with non existing keys} { lsort [$r sunion nokey1 set1 set2 nokey2] } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]