2 # Redis test suite. Copyright (C) 2009 Salvatore Sanfilippo antirez@gmail.com
3 # This softare is released under the BSD License. See the COPYING file for
12 proc test
{name code okpattern
} {
13 puts -nonewline [format "%-70s " $name]
15 set retval
[uplevel 1 $code]
16 if {$okpattern eq
$retval ||
[string match
$okpattern $retval]} {
20 puts "!! ERROR expected\n'$okpattern'\nbut got\n'$retval'"
25 proc randstring
{min max
{type
binary}} {
26 set len
[expr {$min+int
(rand
()*($max-$min+1))}]
28 if {$type eq
{binary}} {
31 } elseif
{$type eq
{alpha
}} {
34 } elseif
{$type eq
{compr
}} {
39 append output
[format "%c" [expr {$minval+int
(rand
()*($maxval-$minval+1))}]]
45 # Useful for some test
46 proc zlistAlikeSort
{a b
} {
47 if {[lindex $a 0] > [lindex $b 0]} {return 1}
48 if {[lindex $a 0] < [lindex $b 0]} {return -1}
49 string compare
[lindex $a 1] [lindex $b 1]
52 proc main
{server port
} {
53 set r
[redis
$server $port]
57 # The following AUTH test should be enabled only when requirepass
58 # <PASSWORD> is set in redis.conf and redis-server was started with
59 # redis.conf as the first argument.
61 #test {AUTH with requirepass in redis.conf} {
65 test
{DEL all keys to start with a clean DB
} {
66 foreach key
[$r keys
*] {$r del
$key}
70 test
{SET and GET an item
} {
75 test
{DEL against a single item
} {
84 list [$r del foo1 foo2 foo3 foo4
] [$r mget foo1 foo2 foo3
]
87 test
{KEYS with pattern
} {
88 foreach key
{key_x key_y key_z foo_a foo_b foo_c
} {
94 test
{KEYS to get all keys
} {
96 } {foo_a foo_b foo_c key_x key_y key_z
}
102 test
{DEL all keys
} {
103 foreach key
[$r keys
*] {$r del
$key}
107 test
{Very big payload in GET
/SET
} {
108 set buf
[string repeat
"abcd" 1000000]
111 } [string repeat
"abcd" 1000000]
113 test
{SET
10000 numeric keys and access all them in reverse order
} {
114 for {set x
0} {$x < 10000} {incr x
} {
118 for {set x
9999} {$x >= 0} {incr x
-1} {
124 test
{DBSIZE should be
10001 now
} {
128 test
{INCR against non existing key
} {
130 append res
[$r incr novar
]
131 append res
[$r get novar
]
134 test
{INCR against key created by
incr itself
} {
138 test
{INCR against key originally
set with SET
} {
143 test
{INCR over
32bit value
} {
144 $r set novar
17179869184
148 test
{INCRBY over
32bit value with over
32bit increment
} {
149 $r set novar
17179869184
150 $r incrby novar
17179869184
153 test
{DECRBY over
32bit value with over
32bit increment
, negative res
} {
154 $r set novar
17179869184
155 $r decrby novar
17179869185
158 test
{SETNX target key missing
} {
159 $r setnx novar2 foobared
163 test
{SETNX target key exists
} {
164 $r setnx novar2 blabla
168 test
{SETNX will overwrite EXPIREing key
} {
178 append res
[$r exists newkey
]
180 append res
[$r exists newkey
]
183 test
{Zero length value in key. SET
/GET
/EXISTS
} {
185 set res
[$r get emptykey
]
186 append res
[$r exists emptykey
]
188 append res
[$r exists emptykey
]
191 test
{Commands pipelining
} {
193 puts -nonewline $fd "SET k1 4\r\nxyzk\r\nGET k1\r\nPING\r\n"
196 append res
[string match OK
* [::redis::redis_read_reply $fd]]
197 append res
[::redis::redis_read_reply $fd]
198 append res
[string match PONG
* [::redis::redis_read_reply $fd]]
202 test
{Non existing command
} {
203 catch {$r foobaredcommand
} err
204 string match ERR
* $err
207 test
{Basic LPUSH
, RPUSH
, LLENGTH
, LINDEX
} {
211 set res
[$r llen mylist
]
212 append res
[$r lindex mylist
0]
213 append res
[$r lindex mylist
1]
214 append res
[$r lindex mylist
2]
222 test
{Create a long
list and check every single element with LINDEX
} {
224 for {set i
0} {$i < 1000} {incr i
} {
227 for {set i
0} {$i < 1000} {incr i
} {
228 if {[$r lindex mylist
$i] eq
$i} {incr ok
}
229 if {[$r lindex mylist
[expr (-$i)-1]] eq
[expr 999-$i]} {
236 test
{Test elements with LINDEX in random access
} {
238 for {set i
0} {$i < 1000} {incr i
} {
239 set rint
[expr int
(rand
()*1000)]
240 if {[$r lindex mylist
$rint] eq
$rint} {incr ok
}
241 if {[$r lindex mylist
[expr (-$rint)-1]] eq
[expr 999-$rint]} {
248 test
{Check
if the
list is still ok
after a DEBUG RELOAD
} {
251 for {set i
0} {$i < 1000} {incr i
} {
252 set rint
[expr int
(rand
()*1000)]
253 if {[$r lindex mylist
$rint] eq
$rint} {incr ok
}
254 if {[$r lindex mylist
[expr (-$rint)-1]] eq
[expr 999-$rint]} {
261 test
{LLEN against non-list value
error} {
264 catch {$r llen mylist
} err
268 test
{LINDEX against non-list value
error} {
269 catch {$r lindex mylist
0} err
273 test
{LPUSH against non-list value
error} {
274 catch {$r lpush mylist
0} err
278 test
{RPUSH against non-list value
error} {
279 catch {$r rpush mylist
0} err
283 test
{RPOPLPUSH base case
} {
289 set v1
[$r rpoplpush mylist newlist
]
290 set v2
[$r rpoplpush mylist newlist
]
291 set l1
[$r lrange mylist
0 -1]
292 set l2
[$r lrange newlist
0 -1]
296 test
{RPOPLPUSH with the same
list as src and dst
} {
301 set l1
[$r lrange mylist
0 -1]
302 set v
[$r rpoplpush mylist mylist
]
303 set l2
[$r lrange mylist
0 -1]
305 } {{a b c
} c
{c a b
}}
307 test
{RPOPLPUSH target
list already exists
} {
315 set v1
[$r rpoplpush mylist newlist
]
316 set v2
[$r rpoplpush mylist newlist
]
317 set l1
[$r lrange mylist
0 -1]
318 set l2
[$r lrange newlist
0 -1]
320 } {d c
{a b
} {c d x
}}
322 test
{RPOPLPUSH against non existing key
} {
325 set v1
[$r rpoplpush mylist newlist
]
326 list $v1 [$r exists mylist
] [$r exists newlist
]
329 test
{RPOPLPUSH against non
list src key
} {
333 catch {$r rpoplpush mylist newlist
} err
334 list [$r type mylist
] [$r exists newlist
] [string range
$err 0 2]
337 test
{RPOPLPUSH against non
list dst key
} {
345 catch {$r rpoplpush mylist newlist
} err
346 list [$r lrange mylist
0 -1] [$r type newlist
] [string range
$err 0 2]
347 } {{a b c d
} string ERR
}
349 test
{RENAME basic usage
} {
351 $r rename mykey mykey1
352 $r rename mykey1 mykey2
356 test
{RENAME
source key should no longer exist
} {
360 test
{RENAME against already existing key
} {
363 $r rename mykey2 mykey
364 set res
[$r get mykey
]
365 append res
[$r exists mykey2
]
368 test
{RENAMENX basic usage
} {
372 $r renamenx mykey mykey2
373 set res
[$r get mykey2
]
374 append res
[$r exists mykey
]
377 test
{RENAMENX against already existing key
} {
380 $r renamenx mykey mykey2
383 test
{RENAMENX against already existing key
(2)} {
384 set res
[$r get mykey
]
385 append res
[$r get mykey2
]
388 test
{RENAME against non existing
source key
} {
389 catch {$r rename nokey foobar
} err
393 test
{RENAME where
source and dest key is the same
} {
394 catch {$r rename mykey mykey
} err
398 test
{DEL all keys again
(DB
0)} {
399 foreach key
[$r keys
*] {
405 test
{DEL all keys again
(DB
1)} {
407 foreach key
[$r keys
*] {
415 test
{MOVE basic usage
} {
419 lappend res
[$r exists mykey
]
420 lappend res
[$r dbsize
]
422 lappend res
[$r get mykey
]
423 lappend res
[$r dbsize
]
426 } [list 0 0 foobar
1]
428 test
{MOVE against key existing in the target DB
} {
433 test
{SET
/GET keys in different DBs
} {
441 lappend res
[$r get a
]
442 lappend res
[$r get b
]
444 lappend res
[$r get a
]
445 lappend res
[$r get b
]
448 } {hello world foo bared
}
450 test
{Basic LPOP
/RPOP
} {
455 list [$r lpop mylist
] [$r rpop mylist
] [$r lpop mylist
] [$r llen mylist
]
458 test
{LPOP
/RPOP against empty
list} {
462 test
{LPOP against non
list value
} {
464 catch {$r lpop notalist
} err
468 test
{Mass LPUSH
/LPOP
} {
470 for {set i
0} {$i < 1000} {incr i
} {
475 for {set i
0} {$i < 500} {incr i
} {
476 incr sum2
[$r lpop mylist
]
477 incr sum2
[$r rpop mylist
]
482 test
{LRANGE basics
} {
483 for {set i
0} {$i < 10} {incr i
} {
486 list [$r lrange mylist
1 -2] \
487 [$r lrange mylist
-3 -1] \
488 [$r lrange mylist
4 4]
489 } {{1 2 3 4 5 6 7 8} {7 8 9} 4}
491 test
{LRANGE inverted indexes
} {
495 test
{LRANGE out of range indexes including the full
list} {
496 $r lrange mylist
-1000 1000
497 } {0 1 2 3 4 5 6 7 8 9}
499 test
{LRANGE against non existing key
} {
500 $r lrange nosuchkey
0 1
503 test
{LTRIM basics
} {
505 for {set i
0} {$i < 100} {incr i
} {
509 $r lrange mylist
0 -1
514 $r lset mylist
-1 bar
515 $r lrange mylist
0 -1
518 test
{LSET out of range index
} {
519 catch {$r lset mylist
10 foo
} err
523 test
{LSET against non existing key
} {
524 catch {$r lset nosuchkey
10 foo
} err
528 test
{LSET against non
list value
} {
530 catch {$r lset nolist
0 foo
} err
534 test
{SADD
, SCARD
, SISMEMBER
, SMEMBERS basics
} {
537 list [$r scard myset
] [$r sismember myset foo
] \
538 [$r sismember myset bar
] [$r sismember myset bla
] \
539 [lsort [$r smembers myset
]]
540 } {2 1 1 0 {bar foo
}}
542 test
{SADD adding the same element multiple times
} {
549 test
{SADD against non
set} {
550 catch {$r sadd mylist foo
} err
557 lsort [$r smembers myset
]
560 test
{Mass SADD and SINTER with two sets
} {
561 for {set i
0} {$i < 1000} {incr i
} {
563 $r sadd set2
[expr $i+995]
565 lsort [$r sinter set1 set2
]
566 } {995 996 997 998 999}
568 test
{SUNION with two sets
} {
569 lsort [$r sunion set1 set2
]
570 } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
572 test
{SINTERSTORE with two sets
} {
573 $r sinterstore setres set1 set2
574 lsort [$r smembers setres
]
575 } {995 996 997 998 999}
577 test
{SINTERSTORE with two sets
, after a DEBUG RELOAD
} {
579 $r sinterstore setres set1 set2
580 lsort [$r smembers setres
]
581 } {995 996 997 998 999}
583 test
{SUNIONSTORE with two sets
} {
584 $r sunionstore setres set1 set2
585 lsort [$r smembers setres
]
586 } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
588 test
{SINTER against three sets
} {
593 lsort [$r sinter set1 set2 set3
]
596 test
{SINTERSTORE with three sets
} {
597 $r sinterstore setres set1 set2 set3
598 lsort [$r smembers setres
]
601 test
{SUNION with non existing keys
} {
602 lsort [$r sunion nokey1 set1 set2 nokey2
]
603 } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
605 test
{SDIFF with two sets
} {
606 for {set i
5} {$i < 1000} {incr i
} {
609 lsort [$r sdiff set1 set4
]
612 test
{SDIFF with three sets
} {
614 lsort [$r sdiff set1 set4 set5
]
617 test
{SDIFFSTORE with three sets
} {
618 $r sdiffstore sres set1 set4 set5
619 lsort [$r smembers sres
]
627 list [lsort [list [$r spop myset
] [$r spop myset
] [$r spop myset
]]] [$r scard myset
]
630 test
{SAVE
- make sure there are all the types as values
} {
631 # Wait for a background saving in progress to terminate
634 if {[string match
{*bgsave_in_progress
:1*} $i]} {
635 puts -nonewline "\nWaiting for background save to finish... "
642 $r lpush mysavelist hello
643 $r lpush mysavelist world
645 $r set mynormalkey
{blablablba
}
646 $r zadd mytestzset a
10
647 $r zadd mytestzset b
20
648 $r zadd mytestzset c
30
657 unset -nocomplain myset
659 for {set i
0} {$i < 100} {incr i
} {
660 set myset
([$r srandmember myset
]) 1
662 lsort [array names myset
]
665 test
{Create a random
list} {
667 array set seenrand
{}
668 for {set i
0} {$i < 10000} {incr i
} {
670 # Make sure all the weights are different because
671 # Redis does not use a stable sort but Tcl does.
672 set rint
[expr int
(rand
()*1000000)]
673 if {![info exists seenrand
($rint)]} break
675 set seenrand
($rint) x
677 $r set weight_
$i $rint
678 lappend tosort
[list $i $rint]
680 set sorted
[lsort -index 1 -real $tosort]
682 for {set i
0} {$i < 10000} {incr i
} {
683 lappend res
[lindex $sorted $i 0]
688 test
{SORT with BY against the newly created
list} {
689 $r sort tosort
{BY weight_
*}
692 test
{SORT direct
, numeric
, against the newly created
list} {
694 } [lsort -integer $res]
696 test
{SORT decreasing sort
} {
697 $r sort tosort
{DESC
}
698 } [lsort -decreasing -integer $res]
700 test
{SORT speed
, sorting
10000 elements
list using BY
, 100 times
} {
701 set start
[clock clicks
-milliseconds]
702 for {set i
0} {$i < 100} {incr i
} {
703 set sorted
[$r sort tosort
{BY weight_
* LIMIT
0 10}]
705 set elapsed
[expr [clock clicks
-milliseconds]-$start]
706 puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
711 test
{SORT speed
, sorting
10000 elements
list directly
, 100 times
} {
712 set start
[clock clicks
-milliseconds]
713 for {set i
0} {$i < 100} {incr i
} {
714 set sorted
[$r sort tosort
{LIMIT
0 10}]
716 set elapsed
[expr [clock clicks
-milliseconds]-$start]
717 puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
722 test
{SORT speed
, pseudo-sorting
10000 elements
list, BY
<const
>, 100 times
} {
723 set start
[clock clicks
-milliseconds]
724 for {set i
0} {$i < 100} {incr i
} {
725 set sorted
[$r sort tosort
{BY nokey LIMIT
0 10}]
727 set elapsed
[expr [clock clicks
-milliseconds]-$start]
728 puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
733 test
{SORT regression
for issue
#19, sorting floats} {
735 foreach x
{1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15} {
739 } [lsort -real {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15}]
741 test
{SORT with GET
#} {
746 $r mset weight_1
10 weight_2
5 weight_3
30
747 $r sort mylist BY weight_
* GET
#
750 test
{LREM
, remove all the occurrences
} {
754 $r rpush mylist foobar
755 $r rpush mylist foobared
760 set res
[$r lrem mylist
0 bar
]
761 list [$r lrange mylist
0 -1] $res
762 } {{foo foobar foobared zap test foo
} 2}
764 test
{LREM
, remove the first occurrence
} {
765 set res
[$r lrem mylist
1 foo
]
766 list [$r lrange mylist
0 -1] $res
767 } {{foobar foobared zap test foo
} 1}
769 test
{LREM
, remove non existing element
} {
770 set res
[$r lrem mylist
1 nosuchelement
]
771 list [$r lrange mylist
0 -1] $res
772 } {{foobar foobared zap test foo
} 0}
774 test
{LREM
, starting from tail with negative count
} {
778 $r rpush mylist foobar
779 $r rpush mylist foobared
785 set res
[$r lrem mylist
-1 bar
]
786 list [$r lrange mylist
0 -1] $res
787 } {{foo bar foobar foobared zap test foo foo
} 1}
789 test
{LREM
, starting from tail with negative count
(2)} {
790 set res
[$r lrem mylist
-2 foo
]
791 list [$r lrange mylist
0 -1] $res
792 } {{foo bar foobar foobared zap test
} 2}
794 test
{LREM
, deleting objects that may be encoded as integers
} {
795 $r lpush myotherlist
1
796 $r lpush myotherlist
2
797 $r lpush myotherlist
3
798 $r lrem myotherlist
1 2
809 test
{MGET against non existing key
} {
810 $r mget foo baazz bar
813 test
{MGET against non-string key
} {
816 $r mget foo baazz bar myset
825 for {set i
0} {$i < 100} {incr i
} {
826 set rkey
[$r randomkey
]
827 if {$rkey eq
{foo
}} {
830 if {$rkey eq
{bar
}} {
834 list $foo_seen $bar_seen
837 test
{RANDOMKEY against empty DB
} {
842 test
{RANDOMKEY regression
1} {
849 test
{GETSET
(set new value
)} {
850 list [$r getset foo xyz
] [$r get foo
]
853 test
{GETSET
(replace old value
)} {
855 list [$r getset foo xyz
] [$r get foo
]
858 test
{SMOVE basics
} {
865 $r smove myset1 myset2 a
866 list [lsort [$r smembers myset2
]] [lsort [$r smembers myset1
]]
869 test
{SMOVE non existing key
} {
870 list [$r smove myset1 myset2 foo
] [lsort [$r smembers myset2
]] [lsort [$r smembers myset1
]]
871 } {0 {a x y z
} {b c
}}
873 test
{SMOVE non existing src
set} {
874 list [$r smove noset myset2 foo
] [lsort [$r smembers myset2
]]
877 test
{SMOVE non existing dst
set} {
878 list [$r smove myset2 myset3 y
] [lsort [$r smembers myset2
]] [lsort [$r smembers myset3
]]
881 test
{SMOVE wrong src key type
} {
883 catch {$r smove x myset2 foo
} err
887 test
{SMOVE wrong dst key type
} {
889 catch {$r smove myset2 x foo
} err
893 test
{MSET base case
} {
894 $r mset x
10 y
"foo bar" z
"x x x x x x x\n\n\r\n"
896 } [list 10 {foo bar
} "x x x x x x x\n\n\r\n"]
898 test
{MSET wrong number of args
} {
899 catch {$r mset x
10 y
"foo bar" z
} err
903 test
{MSETNX with already existent key
} {
904 list [$r msetnx x1 xxx y2 yyy x
20] [$r exists x1
] [$r exists y2
]
907 test
{MSETNX with not existing keys
} {
908 list [$r msetnx x1 xxx y2 yyy
] [$r get x1
] [$r get y2
]
911 test
{MSETNX should remove all the volatile keys even on
failure} {
915 list [$r msetnx x A y B z C
] [$r mget x y z
]
918 test
{ZSET basic ZADD and score
update} {
922 set aux1
[$r zrange ztmp
0 -1]
924 set aux2
[$r zrange ztmp
0 -1]
931 for {set i
0} {$i < 1000} {incr i
} {
932 set score
[expr rand
()]
934 $r zadd zscoretest
$score $i
936 for {set i
0} {$i < 1000} {incr i
} {
937 if {[$r zscore zscoretest
$i] != [lindex $aux $i]} {
938 set err
"Expected score was [lindex $aux $i] but got [$r zscore zscoretest $i] for element $i"
945 test
{ZSCORE
after a DEBUG RELOAD
} {
949 for {set i
0} {$i < 1000} {incr i
} {
950 set score
[expr rand
()]
952 $r zadd zscoretest
$score $i
955 for {set i
0} {$i < 1000} {incr i
} {
956 if {[$r zscore zscoretest
$i] != [lindex $aux $i]} {
957 set err
"Expected score was [lindex $aux $i] but got [$r zscore zscoretest $i] for element $i"
964 test
{ZRANGE and ZREVRANGE
} {
965 list [$r zrange ztmp
0 -1] [$r zrevrange ztmp
0 -1]
968 test
{ZSETs stress tester
- sorting is working well?
} {
970 for {set test
0} {$test < 2} {incr test
} {
971 unset -nocomplain auxarray
972 array set auxarray
{}
975 for {set i
0} {$i < 1000} {incr i
} {
977 set score
[expr rand
()]
979 set score
[expr int
(rand
()*10)]
981 set auxarray
($i) $score
982 $r zadd myzset
$score $i
984 if {[expr rand
()] < .2} {
985 set j
[expr int
(rand
()*1000)]
987 set score
[expr rand
()]
989 set score
[expr int
(rand
()*10)]
991 set auxarray
($j) $score
992 $r zadd myzset
$score $j
995 foreach {item score
} [array get auxarray
] {
996 lappend auxlist
[list $score $item]
998 set sorted
[lsort -command zlistAlikeSort
$auxlist]
1001 lappend auxlist
[lindex $x 1]
1003 set fromredis
[$r zrange myzset
0 -1]
1005 for {set i
0} {$i < [llength $fromredis]} {incr i
} {
1006 if {[lindex $fromredis $i] != [lindex $auxlist $i]} {
1014 test
{ZINCRBY
- can create a new sorted
set} {
1016 $r zincrby zset
1 foo
1017 list [$r zrange zset
0 -1] [$r zscore zset foo
]
1020 test
{ZINCRBY
- increment and decrement
} {
1021 $r zincrby zset
2 foo
1022 $r zincrby zset
1 bar
1023 set v1
[$r zrange zset
0 -1]
1024 $r zincrby zset
10 bar
1025 $r zincrby zset
-5 foo
1026 $r zincrby zset
-5 bar
1027 set v2
[$r zrange zset
0 -1]
1028 list $v1 $v2 [$r zscore zset foo
] [$r zscore zset bar
]
1029 } {{bar foo
} {foo bar
} -2 6}
1031 test
{ZRANGEBYSCORE basics
} {
1038 $r zrangebyscore zset
2 4
1041 test
{ZRANGEBYSCORE fuzzy test
, 100 ranges in
1000 elements sorted
set} {
1044 for {set i
0} {$i < 1000} {incr i
} {
1045 $r zadd zset
[expr rand
()] $i
1047 for {set i
0} {$i < 100} {incr i
} {
1048 set min
[expr rand
()]
1049 set max
[expr rand
()]
1055 set low
[$r zrangebyscore zset
-inf $min]
1056 set ok
[$r zrangebyscore zset
$min $max]
1057 set high
[$r zrangebyscore zset
$max +inf
]
1059 set score
[$r zscore zset
$x]
1060 if {$score > $min} {
1061 append err
"Error, score for $x is $score > $min\n"
1065 set score
[$r zscore zset
$x]
1066 if {$score < $min ||
$score > $max} {
1067 append err
"Error, score for $x is $score outside $min-$max range\n"
1071 set score
[$r zscore zset
$x]
1072 if {$score < $max} {
1073 append err
"Error, score for $x is $score < $max\n"
1080 test
{ZRANGEBYSCORE with LIMIT
} {
1088 [$r zrangebyscore zset
0 10 LIMIT
0 2] \
1089 [$r zrangebyscore zset
0 10 LIMIT
2 3] \
1090 [$r zrangebyscore zset
0 10 LIMIT
2 10] \
1091 [$r zrangebyscore zset
0 10 LIMIT
20 10]
1092 } {{a b
} {c d e
} {c d e
} {}}
1094 test
{ZREMRANGE basics
} {
1101 list [$r zremrangebyscore zset
2 4] [$r zrange zset
0 -1]
1104 test
{ZREMRANGE from
-inf to
+inf
} {
1111 list [$r zremrangebyscore zset
-inf +inf
] [$r zrange zset
0 -1]
1114 test
{SORT against sorted sets
} {
1121 $r sort zset alpha desc
1124 test
{Sorted sets
+inf and
-inf handling
} {
1129 $r zadd zset
1000000 d
1130 $r zadd zset
+inf max
1131 $r zadd zset
-inf min
1135 test
{EXPIRE
- don't
set timeouts multiple times
} {
1137 set v1
[$r expire x
5]
1139 set v3
[$r expire x
10]
1141 list $v1 $v2 $v3 $v4
1144 test
{EXPIRE
- It should be still possible to
read 'x'
} {
1148 test
{EXPIRE
- After
6 seconds the key should no longer be here
} {
1150 list [$r get x
] [$r exists x
]
1153 test
{EXPIRE
- Delete on write policy
} {
1161 test
{EXPIREAT
- Check
for EXPIRE alike behavior
} {
1164 $r expireat x
[expr [clock seconds
]+15]
1168 test
{ZSETs skiplist implementation backlink consistency test
} {
1171 for {set j
0} {$j < $elements} {incr j
} {
1172 $r zadd myzset
[expr rand
()] "Element-$j"
1173 $r zrem myzset
"Element-[expr int(rand()*$elements)]"
1175 set l1
[$r zrange myzset
0 -1]
1176 set l2
[$r zrevrange myzset
0 -1]
1177 for {set j
0} {$j < [llength $l1]} {incr j
} {
1178 if {[lindex $l1 $j] ne
[lindex $l2 end-
$j]} {
1185 foreach fuzztype
{binary alpha compr
} {
1186 test
"FUZZ stresser with data model $fuzztype" {
1188 for {set i
0} {$i < 10000} {incr i
} {
1189 set fuzz
[randstring
0 512 $fuzztype]
1191 set got
[$r get foo
]
1192 if {$got ne
$fuzz} {
1193 set err
[list $fuzz $got]
1201 # Leave the user with a clean DB before to exit
1206 lappend aux
[$r dbsize
]
1209 lappend aux
[$r dbsize
]
1212 test
{Perform a final SAVE to leave a clean DB on disk
} {
1217 if {[string match
{*Darwin
*} [exec uname
-a]]} {
1218 test
{Check
for memory leaks
} {
1219 exec leaks redis-server
1224 puts "\n[expr $::passed+$::failed] tests, $::passed passed, $::failed failed"
1225 if {$::failed > 0} {
1226 puts "\n*** WARNING!!! $::failed FAILED TESTS ***\n"
1236 set randkey
[expr int
(rand
()*10000)]
1237 set randval
[expr int
(rand
()*10000)]
1238 set randidx0
[expr int
(rand
()*10)]
1239 set randidx1
[expr int
(rand
()*10)]
1240 set cmd
[expr int
(rand
()*20)]
1242 if {$cmd == 0} {$r set $randkey $randval}
1243 if {$cmd == 1} {$r get
$randkey}
1244 if {$cmd == 2} {$r incr $randkey}
1245 if {$cmd == 3} {$r lpush
$randkey $randval}
1246 if {$cmd == 4} {$r rpop
$randkey}
1247 if {$cmd == 5} {$r del
$randkey}
1248 if {$cmd == 6} {$r llen
$randkey}
1249 if {$cmd == 7} {$r lrange $randkey $randidx0 $randidx1}
1250 if {$cmd == 8} {$r ltrim
$randkey $randidx0 $randidx1}
1251 if {$cmd == 9} {$r lindex $randkey $randidx0}
1252 if {$cmd == 10} {$r lset $randkey $randidx0 $randval}
1253 if {$cmd == 11} {$r sadd
$randkey $randval}
1254 if {$cmd == 12} {$r srem
$randkey $randval}
1255 if {$cmd == 13} {$r smove
$randkey $randval}
1256 if {$cmd == 14} {$r scard
$randkey}
1257 if {$cmd == 15} {$r expire
$randkey [expr $randval%60]}
1265 # Before to run the test check if DB 9 and DB 10 are empty
1268 set db9size
[$r dbsize
]
1270 set db10size
[$r dbsize
]
1271 if {$db9size != 0 ||
$db10size != 0} {
1272 puts "Can't run the tests against DB 9 and 10: DBs are not empty."
1280 if {[llength $argv] == 0} {
1282 } elseif
{[llength $argv] == 1 && [lindex $argv 0] eq
{stress
}} {
1285 main
[lindex $argv 0] [lindex $argv 1]