}
}
+proc randstring {min max {type binary}} {
+ set len [expr {$min+int(rand()*($max-$min+1))}]
+ set output {}
+ if {$type eq {binary}} {
+ set minval 0
+ set maxval 255
+ } elseif {$type eq {alpha}} {
+ set minval 48
+ set maxval 122
+ } elseif {$type eq {compr}} {
+ set minval 48
+ set maxval 52
+ }
+ while {$len} {
+ append output [format "%c" [expr {$minval+int(rand()*($maxval-$minval+1))}]]
+ incr len -1
+ }
+ return $output
+}
+
+# Useful for some test
+proc zlistAlikeSort {a b} {
+ if {[lindex $a 0] > [lindex $b 0]} {return 1}
+ if {[lindex $a 0] < [lindex $b 0]} {return -1}
+ string compare [lindex $a 1] [lindex $b 1]
+}
+
proc main {server port} {
set r [redis $server $port]
set err ""
$r get x
} {}
+ test {Vararg DEL} {
+ $r set foo1 a
+ $r set foo2 b
+ $r set foo3 c
+ list [$r del foo1 foo2 foo3 foo4] [$r mget foo1 foo2 foo3]
+ } {3 {{} {} {}}}
+
test {KEYS with pattern} {
foreach key {key_x key_y key_z foo_a foo_b foo_c} {
$r set $key hello
$r incr novar
} {101}
+ test {INCR over 32bit value} {
+ $r set novar 17179869184
+ $r incr novar
+ } {17179869185}
+
+ test {INCRBY over 32bit value with over 32bit increment} {
+ $r set novar 17179869184
+ $r incrby novar 17179869184
+ } {34359738368}
+
+ test {DECRBY over 32bit value with over 32bit increment, negative res} {
+ $r set novar 17179869184
+ $r decrby novar 17179869185
+ } {-1}
+
test {SETNX target key missing} {
$r setnx novar2 foobared
$r get novar2
}
lsort [$r sinter set1 set2]
} {995 996 997 998 999}
+
+ test {SUNION with two sets} {
+ lsort [$r sunion set1 set2]
+ } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
test {SINTERSTORE with two sets} {
$r sinterstore setres set1 set2
lsort [$r smembers setres]
} {995 996 997 998 999}
+ test {SUNIONSTORE with two sets} {
+ $r sunionstore setres set1 set2
+ lsort [$r smembers setres]
+ } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
+
test {SINTER against three sets} {
$r sadd set3 999
$r sadd set3 995
$r sinterstore setres set1 set2 set3
lsort [$r smembers setres]
} {995 999}
-
+
+ test {SUNION with non existing keys} {
+ lsort [$r sunion nokey1 set1 set2 nokey2]
+ } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
+
+ test {SDIFF with two sets} {
+ for {set i 5} {$i < 1000} {incr i} {
+ $r sadd set4 $i
+ }
+ lsort [$r sdiff set1 set4]
+ } {0 1 2 3 4}
+
+ test {SDIFF with three sets} {
+ $r sadd set5 0
+ lsort [$r sdiff set1 set4 set5]
+ } {1 2 3 4}
+
+ test {SDIFFSTORE with three sets} {
+ $r sdiffstore sres set1 set4 set5
+ lsort [$r smembers sres]
+ } {1 2 3 4}
+
+ test {SPOP basics} {
+ $r del myset
+ $r sadd myset 1
+ $r sadd myset 2
+ $r sadd myset 3
+ list [lsort [list [$r spop myset] [$r spop myset] [$r spop myset]]] [$r scard myset]
+ } {{1 2 3} 0}
+
test {SAVE - make sure there are all the types as values} {
$r lpush mysavelist hello
$r lpush mysavelist world
$r set myemptykey {}
$r set mynormalkey {blablablba}
+ $r zadd mytestzset a 10
+ $r zadd mytestzset b 20
+ $r zadd mytestzset c 30
$r save
} {OK}
list [$r lrange mylist 0 -1] $res
} {{foo bar foobar foobared zap test} 2}
+ test {LREM, deleting objects that may be encoded as integers} {
+ $r lpush myotherlist 1
+ $r lpush myotherlist 2
+ $r lpush myotherlist 3
+ $r lrem myotherlist 1 2
+ $r llen myotherlist
+ } {2}
+
test {MGET} {
$r flushall
$r set foo BAR
$r randomkey
} {}
+ test {RANDOMKEY regression 1} {
+ $r flushall
+ $r set x 10
+ $r del x
+ $r randomkey
+ } {}
+
+ test {GETSET (set new value)} {
+ list [$r getset foo xyz] [$r get foo]
+ } {{} xyz}
+
+ test {GETSET (replace old value)} {
+ $r set foo bar
+ list [$r getset foo xyz] [$r get foo]
+ } {bar xyz}
+
+ test {SMOVE basics} {
+ $r sadd myset1 a
+ $r sadd myset1 b
+ $r sadd myset1 c
+ $r sadd myset2 x
+ $r sadd myset2 y
+ $r sadd myset2 z
+ $r smove myset1 myset2 a
+ list [lsort [$r smembers myset2]] [lsort [$r smembers myset1]]
+ } {{a x y z} {b c}}
+
+ test {SMOVE non existing key} {
+ list [$r smove myset1 myset2 foo] [lsort [$r smembers myset2]] [lsort [$r smembers myset1]]
+ } {0 {a x y z} {b c}}
+
+ test {SMOVE non existing src set} {
+ list [$r smove noset myset2 foo] [lsort [$r smembers myset2]]
+ } {0 {a x y z}}
+
+ test {SMOVE non existing dst set} {
+ list [$r smove myset2 myset3 y] [lsort [$r smembers myset2]] [lsort [$r smembers myset3]]
+ } {1 {a x z} y}
+
+ test {SMOVE wrong src key type} {
+ $r set x 10
+ catch {$r smove x myset2 foo} err
+ format $err
+ } {ERR*}
+
+ test {SMOVE wrong dst key type} {
+ $r set x 10
+ catch {$r smove myset2 x foo} err
+ format $err
+ } {ERR*}
+
+ test {MSET base case} {
+ $r mset x 10 y "foo bar" z "x x x x x x x\n\n\r\n"
+ $r mget x y z
+ } [list 10 {foo bar} "x x x x x x x\n\n\r\n"]
+
+ test {MSET wrong number of args} {
+ catch {$r mset x 10 y "foo bar" z} err
+ format $err
+ } {*wrong number*}
+
+ test {MSETNX with already existent key} {
+ list [$r msetnx x1 xxx y2 yyy x 20] [$r exists x1] [$r exists y2]
+ } {0 0 0}
+
+ test {MSETNX with not existing keys} {
+ list [$r msetnx x1 xxx y2 yyy] [$r get x1] [$r get y2]
+ } {1 xxx yyy}
+
+ test {ZSET basic ZADD and score update} {
+ $r zadd ztmp 10 x
+ $r zadd ztmp 20 y
+ $r zadd ztmp 30 z
+ set aux1 [$r zrange ztmp 0 -1]
+ $r zadd ztmp 1 y
+ set aux2 [$r zrange ztmp 0 -1]
+ list $aux1 $aux2
+ } {{x y z} {y x z}}
+
+ test {ZSCORE} {
+ list [$r zscore ztmp x] [$r zscore ztmp y] [$r zscore ztmp z]
+ } {10 1 30}
+
+ test {ZRANGE and ZREVRANGE} {
+ list [$r zrange ztmp 0 -1] [$r zrevrange ztmp 0 -1]
+ } {{y x z} {z x y}}
+
+ test {ZSETs stress tester - sorting is working well?} {
+ set delta 0
+ for {set test 0} {$test < 2} {incr test} {
+ unset -nocomplain auxarray
+ array set auxarray {}
+ set auxlist {}
+ $r del myzset
+ for {set i 0} {$i < 1000} {incr i} {
+ if {$test == 0} {
+ set score [expr rand()]
+ } else {
+ set score [expr int(rand()*10)]
+ }
+ set auxarray($i) $score
+ $r zadd myzset $score $i
+ # Random update
+ if {[expr rand()] < .2} {
+ set j [expr int(rand()*1000)]
+ if {$test == 0} {
+ set score [expr rand()]
+ } else {
+ set score [expr int(rand()*10)]
+ }
+ set auxarray($j) $score
+ $r zadd myzset $score $j
+ }
+ }
+ foreach {item score} [array get auxarray] {
+ lappend auxlist [list $score $item]
+ }
+ set sorted [lsort -command zlistAlikeSort $auxlist]
+ set auxlist {}
+ foreach x $sorted {
+ lappend auxlist [lindex $x 1]
+ }
+ set fromredis [$r zrange myzset 0 -1]
+ set delta 0
+ for {set i 0} {$i < [llength $fromredis]} {incr i} {
+ if {[lindex $fromredis $i] != [lindex $auxlist $i]} {
+ incr delta
+ }
+ }
+ }
+ format $delta
+ } {0}
+
+ test {ZSETs skiplist implementation backlink consistency test} {
+ set diff 0
+ set elements 10000
+ for {set j 0} {$j < $elements} {incr j} {
+ $r zadd myzset [expr rand()] "Element-$j"
+ $r zrem myzset "Element-[expr int(rand()*$elements)]"
+ }
+ set l1 [$r zrange myzset 0 -1]
+ set l2 [$r zrevrange myzset 0 -1]
+ for {set j 0} {$j < [llength $l1]} {incr j} {
+ if {[lindex $l1 $j] ne [lindex $l2 end-$j]} {
+ incr diff
+ }
+ }
+ format $diff
+ } {0}
+
+ foreach fuzztype {binary alpha compr} {
+ test "FUZZ stresser with data model $fuzztype" {
+ set err 0
+ for {set i 0} {$i < 10000} {incr i} {
+ set fuzz [randstring 0 512 $fuzztype]
+ $r set foo $fuzz
+ set got [$r get foo]
+ if {$got ne $fuzz} {
+ set err [list $fuzz $got]
+ break
+ }
+ }
+ set _ $err
+ } {0}
+ }
+
# Leave the user with a clean DB before to exit
test {FLUSHALL} {
$r flushall
projects / redis.git / blobdiff