]>
Commit | Line | Data |
---|---|---|
1 | # test-redis.tcl | |
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 | |
4 | # more information. | |
5 | ||
6 | set tcl_precision 17 | |
7 | source redis.tcl | |
8 | ||
9 | set ::passed 0 | |
10 | set ::failed 0 | |
11 | set ::testnum 0 | |
12 | ||
13 | proc test {name code okpattern} { | |
14 | incr ::testnum | |
15 | if {$::testnum < $::first || $::testnum > $::last} return | |
16 | puts -nonewline [format "%-70s " "#$::testnum $name"] | |
17 | flush stdout | |
18 | set retval [uplevel 1 $code] | |
19 | if {$okpattern eq $retval || [string match $okpattern $retval]} { | |
20 | puts "PASSED" | |
21 | incr ::passed | |
22 | } else { | |
23 | puts "!! ERROR expected\n'$okpattern'\nbut got\n'$retval'" | |
24 | incr ::failed | |
25 | } | |
26 | if {$::traceleaks} { | |
27 | if {![string match {*0 leaks*} [exec leaks redis-server]]} { | |
28 | puts "--------- Test $::testnum LEAKED! --------" | |
29 | exit 1 | |
30 | } | |
31 | } | |
32 | } | |
33 | ||
34 | proc randstring {min max {type binary}} { | |
35 | set len [expr {$min+int(rand()*($max-$min+1))}] | |
36 | set output {} | |
37 | if {$type eq {binary}} { | |
38 | set minval 0 | |
39 | set maxval 255 | |
40 | } elseif {$type eq {alpha}} { | |
41 | set minval 48 | |
42 | set maxval 122 | |
43 | } elseif {$type eq {compr}} { | |
44 | set minval 48 | |
45 | set maxval 52 | |
46 | } | |
47 | while {$len} { | |
48 | append output [format "%c" [expr {$minval+int(rand()*($maxval-$minval+1))}]] | |
49 | incr len -1 | |
50 | } | |
51 | return $output | |
52 | } | |
53 | ||
54 | # Useful for some test | |
55 | proc zlistAlikeSort {a b} { | |
56 | if {[lindex $a 0] > [lindex $b 0]} {return 1} | |
57 | if {[lindex $a 0] < [lindex $b 0]} {return -1} | |
58 | string compare [lindex $a 1] [lindex $b 1] | |
59 | } | |
60 | ||
61 | proc waitForBgsave r { | |
62 | while 1 { | |
63 | set i [$r info] | |
64 | if {[string match {*bgsave_in_progress:1*} $i]} { | |
65 | puts -nonewline "\nWaiting for background save to finish... " | |
66 | flush stdout | |
67 | after 1000 | |
68 | } else { | |
69 | break | |
70 | } | |
71 | } | |
72 | } | |
73 | ||
74 | proc waitForBgrewriteaof r { | |
75 | while 1 { | |
76 | set i [$r info] | |
77 | if {[string match {*bgrewriteaof_in_progress:1*} $i]} { | |
78 | puts -nonewline "\nWaiting for background AOF rewrite to finish... " | |
79 | flush stdout | |
80 | after 1000 | |
81 | } else { | |
82 | break | |
83 | } | |
84 | } | |
85 | } | |
86 | ||
87 | proc randomInt {max} { | |
88 | expr {int(rand()*$max)} | |
89 | } | |
90 | ||
91 | proc randpath args { | |
92 | set path [expr {int(rand()*[llength $args])}] | |
93 | uplevel 1 [lindex $args $path] | |
94 | } | |
95 | ||
96 | proc randomValue {} { | |
97 | randpath { | |
98 | # Small enough to likely collide | |
99 | randomInt 1000 | |
100 | } { | |
101 | # 32 bit compressible signed/unsigned | |
102 | randpath {randomInt 2000000000} {randomInt 4000000000} | |
103 | } { | |
104 | # 64 bit | |
105 | randpath {randomInt 1000000000000} | |
106 | } { | |
107 | # Random string | |
108 | randpath {randstring 0 256 alpha} \ | |
109 | {randstring 0 256 compr} \ | |
110 | {randstring 0 256 binary} | |
111 | } | |
112 | } | |
113 | ||
114 | proc randomKey {} { | |
115 | randpath { | |
116 | # Small enough to likely collide | |
117 | randomInt 1000 | |
118 | } { | |
119 | # 32 bit compressible signed/unsigned | |
120 | randpath {randomInt 2000000000} {randomInt 4000000000} | |
121 | } { | |
122 | # 64 bit | |
123 | randpath {randomInt 1000000000000} | |
124 | } { | |
125 | # Random string | |
126 | randpath {randstring 1 256 alpha} \ | |
127 | {randstring 1 256 compr} | |
128 | } | |
129 | } | |
130 | ||
131 | proc createComplexDataset {r ops} { | |
132 | for {set j 0} {$j < $ops} {incr j} { | |
133 | set k [randomKey] | |
134 | set f [randomValue] | |
135 | set v [randomValue] | |
136 | randpath { | |
137 | set d [expr {rand()}] | |
138 | } { | |
139 | set d [expr {rand()}] | |
140 | } { | |
141 | set d [expr {rand()}] | |
142 | } { | |
143 | set d [expr {rand()}] | |
144 | } { | |
145 | set d [expr {rand()}] | |
146 | } { | |
147 | randpath {set d +inf} {set d -inf} | |
148 | } | |
149 | set t [$r type $k] | |
150 | ||
151 | if {$t eq {none}} { | |
152 | randpath { | |
153 | $r set $k $v | |
154 | } { | |
155 | $r lpush $k $v | |
156 | } { | |
157 | $r sadd $k $v | |
158 | } { | |
159 | $r zadd $k $d $v | |
160 | } { | |
161 | $r hset $k $f $v | |
162 | } | |
163 | set t [$r type $k] | |
164 | } | |
165 | ||
166 | switch $t { | |
167 | {string} { | |
168 | # Nothing to do | |
169 | } | |
170 | {list} { | |
171 | randpath {$r lpush $k $v} \ | |
172 | {$r rpush $k $v} \ | |
173 | {$r lrem $k 0 $v} \ | |
174 | {$r rpop $k} \ | |
175 | {$r lpop $k} | |
176 | } | |
177 | {set} { | |
178 | randpath {$r sadd $k $v} \ | |
179 | {$r srem $k $v} | |
180 | } | |
181 | {zset} { | |
182 | randpath {$r zadd $k $d $v} \ | |
183 | {$r zrem $k $v} | |
184 | } | |
185 | {hash} { | |
186 | randpath {$r hset $k $f $v} \ | |
187 | {$r hdel $k $f} | |
188 | } | |
189 | } | |
190 | } | |
191 | } | |
192 | ||
193 | proc datasetDigest r { | |
194 | set keys [lsort [$r keys *]] | |
195 | set digest {} | |
196 | foreach k $keys { | |
197 | set t [$r type $k] | |
198 | switch $t { | |
199 | {string} { | |
200 | set aux [::sha1::sha1 -hex [$r get $k]] | |
201 | } {list} { | |
202 | if {[$r llen $k] == 0} { | |
203 | set aux {} | |
204 | } else { | |
205 | set aux [::sha1::sha1 -hex [$r lrange $k 0 -1]] | |
206 | } | |
207 | } {set} { | |
208 | if {[$r scard $k] == 0} { | |
209 | set aux {} | |
210 | } else { | |
211 | set aux [::sha1::sha1 -hex [lsort [$r smembers $k]]] | |
212 | } | |
213 | } {zset} { | |
214 | if {[$r zcard $k] == 0} { | |
215 | set aux {} | |
216 | } else { | |
217 | set aux [::sha1::sha1 -hex [$r zrange $k 0 -1]] | |
218 | } | |
219 | } {hash} { | |
220 | if {[$r hlen $k] == 0} { | |
221 | set aux {} | |
222 | } else { | |
223 | set aux [::sha1::sha1 -hex [lsort [$r hgetall $k]]] | |
224 | } | |
225 | } default { | |
226 | error "Type not supported: $t" | |
227 | } | |
228 | } | |
229 | if {$aux eq {}} continue | |
230 | set digest [::sha1::sha1 -hex [join [list $aux $digest $k] "\n"]] | |
231 | } | |
232 | return $digest | |
233 | } | |
234 | ||
235 | proc main {} { | |
236 | set r [redis $::host $::port] | |
237 | $r select 9 | |
238 | set err "" | |
239 | set res "" | |
240 | ||
241 | # The following AUTH test should be enabled only when requirepass | |
242 | # <PASSWORD> is set in redis.conf and redis-server was started with | |
243 | # redis.conf as the first argument. | |
244 | ||
245 | #test {AUTH with requirepass in redis.conf} { | |
246 | # $r auth foobared | |
247 | #} {OK} | |
248 | ||
249 | test {DEL all keys to start with a clean DB} { | |
250 | foreach key [$r keys *] {$r del $key} | |
251 | $r dbsize | |
252 | } {0} | |
253 | ||
254 | test {SET and GET an item} { | |
255 | $r set x foobar | |
256 | $r get x | |
257 | } {foobar} | |
258 | ||
259 | test {SET and GET an empty item} { | |
260 | $r set x {} | |
261 | $r get x | |
262 | } {} | |
263 | ||
264 | test {DEL against a single item} { | |
265 | $r del x | |
266 | $r get x | |
267 | } {} | |
268 | ||
269 | test {Vararg DEL} { | |
270 | $r set foo1 a | |
271 | $r set foo2 b | |
272 | $r set foo3 c | |
273 | list [$r del foo1 foo2 foo3 foo4] [$r mget foo1 foo2 foo3] | |
274 | } {3 {{} {} {}}} | |
275 | ||
276 | test {KEYS with pattern} { | |
277 | foreach key {key_x key_y key_z foo_a foo_b foo_c} { | |
278 | $r set $key hello | |
279 | } | |
280 | lsort [$r keys foo*] | |
281 | } {foo_a foo_b foo_c} | |
282 | ||
283 | test {KEYS to get all keys} { | |
284 | lsort [$r keys *] | |
285 | } {foo_a foo_b foo_c key_x key_y key_z} | |
286 | ||
287 | test {DBSIZE} { | |
288 | $r dbsize | |
289 | } {6} | |
290 | ||
291 | test {DEL all keys} { | |
292 | foreach key [$r keys *] {$r del $key} | |
293 | $r dbsize | |
294 | } {0} | |
295 | ||
296 | test {Very big payload in GET/SET} { | |
297 | set buf [string repeat "abcd" 1000000] | |
298 | $r set foo $buf | |
299 | $r get foo | |
300 | } [string repeat "abcd" 1000000] | |
301 | ||
302 | test {Very big payload random access} { | |
303 | set err {} | |
304 | array set payload {} | |
305 | for {set j 0} {$j < 100} {incr j} { | |
306 | set size [expr 1+[randomInt 100000]] | |
307 | set buf [string repeat "pl-$j" $size] | |
308 | set payload($j) $buf | |
309 | $r set bigpayload_$j $buf | |
310 | } | |
311 | for {set j 0} {$j < 1000} {incr j} { | |
312 | set index [randomInt 100] | |
313 | set buf [$r get bigpayload_$index] | |
314 | if {$buf != $payload($index)} { | |
315 | set err "Values differ: I set '$payload($index)' but I read back '$buf'" | |
316 | break | |
317 | } | |
318 | } | |
319 | unset payload | |
320 | set _ $err | |
321 | } {} | |
322 | ||
323 | test {SET 10000 numeric keys and access all them in reverse order} { | |
324 | set err {} | |
325 | for {set x 0} {$x < 10000} {incr x} { | |
326 | $r set $x $x | |
327 | } | |
328 | set sum 0 | |
329 | for {set x 9999} {$x >= 0} {incr x -1} { | |
330 | set val [$r get $x] | |
331 | if {$val ne $x} { | |
332 | set err "Eleemnt at position $x is $val instead of $x" | |
333 | break | |
334 | } | |
335 | } | |
336 | set _ $err | |
337 | } {} | |
338 | ||
339 | test {DBSIZE should be 10101 now} { | |
340 | $r dbsize | |
341 | } {10101} | |
342 | ||
343 | test {INCR against non existing key} { | |
344 | set res {} | |
345 | append res [$r incr novar] | |
346 | append res [$r get novar] | |
347 | } {11} | |
348 | ||
349 | test {INCR against key created by incr itself} { | |
350 | $r incr novar | |
351 | } {2} | |
352 | ||
353 | test {INCR against key originally set with SET} { | |
354 | $r set novar 100 | |
355 | $r incr novar | |
356 | } {101} | |
357 | ||
358 | test {INCR over 32bit value} { | |
359 | $r set novar 17179869184 | |
360 | $r incr novar | |
361 | } {17179869185} | |
362 | ||
363 | test {INCRBY over 32bit value with over 32bit increment} { | |
364 | $r set novar 17179869184 | |
365 | $r incrby novar 17179869184 | |
366 | } {34359738368} | |
367 | ||
368 | test {INCR fails against key with spaces (no integer encoded)} { | |
369 | $r set novar " 11 " | |
370 | catch {$r incr novar} err | |
371 | format $err | |
372 | } {ERR*} | |
373 | ||
374 | test {INCR fails against a key holding a list} { | |
375 | $r rpush mylist 1 | |
376 | catch {$r incr novar} err | |
377 | $r rpop mylist | |
378 | format $err | |
379 | } {ERR*} | |
380 | ||
381 | test {DECRBY over 32bit value with over 32bit increment, negative res} { | |
382 | $r set novar 17179869184 | |
383 | $r decrby novar 17179869185 | |
384 | } {-1} | |
385 | ||
386 | test {SETNX target key missing} { | |
387 | $r setnx novar2 foobared | |
388 | $r get novar2 | |
389 | } {foobared} | |
390 | ||
391 | test {SETNX target key exists} { | |
392 | $r setnx novar2 blabla | |
393 | $r get novar2 | |
394 | } {foobared} | |
395 | ||
396 | test {SETNX will overwrite EXPIREing key} { | |
397 | $r set x 10 | |
398 | $r expire x 10000 | |
399 | $r setnx x 20 | |
400 | $r get x | |
401 | } {20} | |
402 | ||
403 | test {EXISTS} { | |
404 | set res {} | |
405 | $r set newkey test | |
406 | append res [$r exists newkey] | |
407 | $r del newkey | |
408 | append res [$r exists newkey] | |
409 | } {10} | |
410 | ||
411 | test {Zero length value in key. SET/GET/EXISTS} { | |
412 | $r set emptykey {} | |
413 | set res [$r get emptykey] | |
414 | append res [$r exists emptykey] | |
415 | $r del emptykey | |
416 | append res [$r exists emptykey] | |
417 | } {10} | |
418 | ||
419 | test {Commands pipelining} { | |
420 | set fd [$r channel] | |
421 | puts -nonewline $fd "SET k1 4\r\nxyzk\r\nGET k1\r\nPING\r\n" | |
422 | flush $fd | |
423 | set res {} | |
424 | append res [string match OK* [::redis::redis_read_reply $fd]] | |
425 | append res [::redis::redis_read_reply $fd] | |
426 | append res [string match PONG* [::redis::redis_read_reply $fd]] | |
427 | format $res | |
428 | } {1xyzk1} | |
429 | ||
430 | test {Non existing command} { | |
431 | catch {$r foobaredcommand} err | |
432 | string match ERR* $err | |
433 | } {1} | |
434 | ||
435 | test {Basic LPUSH, RPUSH, LLENGTH, LINDEX} { | |
436 | set res [$r lpush mylist a] | |
437 | append res [$r lpush mylist b] | |
438 | append res [$r rpush mylist c] | |
439 | append res [$r llen mylist] | |
440 | append res [$r rpush anotherlist d] | |
441 | append res [$r lpush anotherlist e] | |
442 | append res [$r llen anotherlist] | |
443 | append res [$r lindex mylist 0] | |
444 | append res [$r lindex mylist 1] | |
445 | append res [$r lindex mylist 2] | |
446 | append res [$r lindex anotherlist 0] | |
447 | append res [$r lindex anotherlist 1] | |
448 | list $res [$r lindex mylist 100] | |
449 | } {1233122baced {}} | |
450 | ||
451 | test {DEL a list} { | |
452 | $r del mylist | |
453 | $r exists mylist | |
454 | } {0} | |
455 | ||
456 | test {Create a long list and check every single element with LINDEX} { | |
457 | set ok 0 | |
458 | for {set i 0} {$i < 1000} {incr i} { | |
459 | $r rpush mylist $i | |
460 | } | |
461 | for {set i 0} {$i < 1000} {incr i} { | |
462 | if {[$r lindex mylist $i] eq $i} {incr ok} | |
463 | if {[$r lindex mylist [expr (-$i)-1]] eq [expr 999-$i]} { | |
464 | incr ok | |
465 | } | |
466 | } | |
467 | format $ok | |
468 | } {2000} | |
469 | ||
470 | test {Test elements with LINDEX in random access} { | |
471 | set ok 0 | |
472 | for {set i 0} {$i < 1000} {incr i} { | |
473 | set rint [expr int(rand()*1000)] | |
474 | if {[$r lindex mylist $rint] eq $rint} {incr ok} | |
475 | if {[$r lindex mylist [expr (-$rint)-1]] eq [expr 999-$rint]} { | |
476 | incr ok | |
477 | } | |
478 | } | |
479 | format $ok | |
480 | } {2000} | |
481 | ||
482 | test {Check if the list is still ok after a DEBUG RELOAD} { | |
483 | $r debug reload | |
484 | set ok 0 | |
485 | for {set i 0} {$i < 1000} {incr i} { | |
486 | set rint [expr int(rand()*1000)] | |
487 | if {[$r lindex mylist $rint] eq $rint} {incr ok} | |
488 | if {[$r lindex mylist [expr (-$rint)-1]] eq [expr 999-$rint]} { | |
489 | incr ok | |
490 | } | |
491 | } | |
492 | format $ok | |
493 | } {2000} | |
494 | ||
495 | test {LLEN against non-list value error} { | |
496 | $r del mylist | |
497 | $r set mylist foobar | |
498 | catch {$r llen mylist} err | |
499 | format $err | |
500 | } {ERR*} | |
501 | ||
502 | test {LLEN against non existing key} { | |
503 | $r llen not-a-key | |
504 | } {0} | |
505 | ||
506 | test {LINDEX against non-list value error} { | |
507 | catch {$r lindex mylist 0} err | |
508 | format $err | |
509 | } {ERR*} | |
510 | ||
511 | test {LINDEX against non existing key} { | |
512 | $r lindex not-a-key 10 | |
513 | } {} | |
514 | ||
515 | test {LPUSH against non-list value error} { | |
516 | catch {$r lpush mylist 0} err | |
517 | format $err | |
518 | } {ERR*} | |
519 | ||
520 | test {RPUSH against non-list value error} { | |
521 | catch {$r rpush mylist 0} err | |
522 | format $err | |
523 | } {ERR*} | |
524 | ||
525 | test {RPOPLPUSH base case} { | |
526 | $r del mylist | |
527 | $r rpush mylist a | |
528 | $r rpush mylist b | |
529 | $r rpush mylist c | |
530 | $r rpush mylist d | |
531 | set v1 [$r rpoplpush mylist newlist] | |
532 | set v2 [$r rpoplpush mylist newlist] | |
533 | set l1 [$r lrange mylist 0 -1] | |
534 | set l2 [$r lrange newlist 0 -1] | |
535 | list $v1 $v2 $l1 $l2 | |
536 | } {d c {a b} {c d}} | |
537 | ||
538 | test {RPOPLPUSH with the same list as src and dst} { | |
539 | $r del mylist | |
540 | $r rpush mylist a | |
541 | $r rpush mylist b | |
542 | $r rpush mylist c | |
543 | set l1 [$r lrange mylist 0 -1] | |
544 | set v [$r rpoplpush mylist mylist] | |
545 | set l2 [$r lrange mylist 0 -1] | |
546 | list $l1 $v $l2 | |
547 | } {{a b c} c {c a b}} | |
548 | ||
549 | test {RPOPLPUSH target list already exists} { | |
550 | $r del mylist | |
551 | $r del newlist | |
552 | $r rpush mylist a | |
553 | $r rpush mylist b | |
554 | $r rpush mylist c | |
555 | $r rpush mylist d | |
556 | $r rpush newlist x | |
557 | set v1 [$r rpoplpush mylist newlist] | |
558 | set v2 [$r rpoplpush mylist newlist] | |
559 | set l1 [$r lrange mylist 0 -1] | |
560 | set l2 [$r lrange newlist 0 -1] | |
561 | list $v1 $v2 $l1 $l2 | |
562 | } {d c {a b} {c d x}} | |
563 | ||
564 | test {RPOPLPUSH against non existing key} { | |
565 | $r del mylist | |
566 | $r del newlist | |
567 | set v1 [$r rpoplpush mylist newlist] | |
568 | list $v1 [$r exists mylist] [$r exists newlist] | |
569 | } {{} 0 0} | |
570 | ||
571 | test {RPOPLPUSH against non list src key} { | |
572 | $r del mylist | |
573 | $r del newlist | |
574 | $r set mylist x | |
575 | catch {$r rpoplpush mylist newlist} err | |
576 | list [$r type mylist] [$r exists newlist] [string range $err 0 2] | |
577 | } {string 0 ERR} | |
578 | ||
579 | test {RPOPLPUSH against non list dst key} { | |
580 | $r del mylist | |
581 | $r del newlist | |
582 | $r rpush mylist a | |
583 | $r rpush mylist b | |
584 | $r rpush mylist c | |
585 | $r rpush mylist d | |
586 | $r set newlist x | |
587 | catch {$r rpoplpush mylist newlist} err | |
588 | list [$r lrange mylist 0 -1] [$r type newlist] [string range $err 0 2] | |
589 | } {{a b c d} string ERR} | |
590 | ||
591 | test {RPOPLPUSH against non existing src key} { | |
592 | $r del mylist | |
593 | $r del newlist | |
594 | $r rpoplpush mylist newlist | |
595 | } {} | |
596 | ||
597 | test {RENAME basic usage} { | |
598 | $r set mykey hello | |
599 | $r rename mykey mykey1 | |
600 | $r rename mykey1 mykey2 | |
601 | $r get mykey2 | |
602 | } {hello} | |
603 | ||
604 | test {RENAME source key should no longer exist} { | |
605 | $r exists mykey | |
606 | } {0} | |
607 | ||
608 | test {RENAME against already existing key} { | |
609 | $r set mykey a | |
610 | $r set mykey2 b | |
611 | $r rename mykey2 mykey | |
612 | set res [$r get mykey] | |
613 | append res [$r exists mykey2] | |
614 | } {b0} | |
615 | ||
616 | test {RENAMENX basic usage} { | |
617 | $r del mykey | |
618 | $r del mykey2 | |
619 | $r set mykey foobar | |
620 | $r renamenx mykey mykey2 | |
621 | set res [$r get mykey2] | |
622 | append res [$r exists mykey] | |
623 | } {foobar0} | |
624 | ||
625 | test {RENAMENX against already existing key} { | |
626 | $r set mykey foo | |
627 | $r set mykey2 bar | |
628 | $r renamenx mykey mykey2 | |
629 | } {0} | |
630 | ||
631 | test {RENAMENX against already existing key (2)} { | |
632 | set res [$r get mykey] | |
633 | append res [$r get mykey2] | |
634 | } {foobar} | |
635 | ||
636 | test {RENAME against non existing source key} { | |
637 | catch {$r rename nokey foobar} err | |
638 | format $err | |
639 | } {ERR*} | |
640 | ||
641 | test {RENAME where source and dest key is the same} { | |
642 | catch {$r rename mykey mykey} err | |
643 | format $err | |
644 | } {ERR*} | |
645 | ||
646 | test {DEL all keys again (DB 0)} { | |
647 | foreach key [$r keys *] { | |
648 | $r del $key | |
649 | } | |
650 | $r dbsize | |
651 | } {0} | |
652 | ||
653 | test {DEL all keys again (DB 1)} { | |
654 | $r select 10 | |
655 | foreach key [$r keys *] { | |
656 | $r del $key | |
657 | } | |
658 | set res [$r dbsize] | |
659 | $r select 9 | |
660 | format $res | |
661 | } {0} | |
662 | ||
663 | test {MOVE basic usage} { | |
664 | $r set mykey foobar | |
665 | $r move mykey 10 | |
666 | set res {} | |
667 | lappend res [$r exists mykey] | |
668 | lappend res [$r dbsize] | |
669 | $r select 10 | |
670 | lappend res [$r get mykey] | |
671 | lappend res [$r dbsize] | |
672 | $r select 9 | |
673 | format $res | |
674 | } [list 0 0 foobar 1] | |
675 | ||
676 | test {MOVE against key existing in the target DB} { | |
677 | $r set mykey hello | |
678 | $r move mykey 10 | |
679 | } {0} | |
680 | ||
681 | test {SET/GET keys in different DBs} { | |
682 | $r set a hello | |
683 | $r set b world | |
684 | $r select 10 | |
685 | $r set a foo | |
686 | $r set b bared | |
687 | $r select 9 | |
688 | set res {} | |
689 | lappend res [$r get a] | |
690 | lappend res [$r get b] | |
691 | $r select 10 | |
692 | lappend res [$r get a] | |
693 | lappend res [$r get b] | |
694 | $r select 9 | |
695 | format $res | |
696 | } {hello world foo bared} | |
697 | ||
698 | test {Basic LPOP/RPOP} { | |
699 | $r del mylist | |
700 | $r rpush mylist 1 | |
701 | $r rpush mylist 2 | |
702 | $r lpush mylist 0 | |
703 | list [$r lpop mylist] [$r rpop mylist] [$r lpop mylist] [$r llen mylist] | |
704 | } [list 0 2 1 0] | |
705 | ||
706 | test {LPOP/RPOP against empty list} { | |
707 | $r lpop mylist | |
708 | } {} | |
709 | ||
710 | test {LPOP against non list value} { | |
711 | $r set notalist foo | |
712 | catch {$r lpop notalist} err | |
713 | format $err | |
714 | } {ERR*kind*} | |
715 | ||
716 | test {Mass LPUSH/LPOP} { | |
717 | set sum 0 | |
718 | for {set i 0} {$i < 1000} {incr i} { | |
719 | $r lpush mylist $i | |
720 | incr sum $i | |
721 | } | |
722 | set sum2 0 | |
723 | for {set i 0} {$i < 500} {incr i} { | |
724 | incr sum2 [$r lpop mylist] | |
725 | incr sum2 [$r rpop mylist] | |
726 | } | |
727 | expr $sum == $sum2 | |
728 | } {1} | |
729 | ||
730 | test {LRANGE basics} { | |
731 | for {set i 0} {$i < 10} {incr i} { | |
732 | $r rpush mylist $i | |
733 | } | |
734 | list [$r lrange mylist 1 -2] \ | |
735 | [$r lrange mylist -3 -1] \ | |
736 | [$r lrange mylist 4 4] | |
737 | } {{1 2 3 4 5 6 7 8} {7 8 9} 4} | |
738 | ||
739 | test {LRANGE inverted indexes} { | |
740 | $r lrange mylist 6 2 | |
741 | } {} | |
742 | ||
743 | test {LRANGE out of range indexes including the full list} { | |
744 | $r lrange mylist -1000 1000 | |
745 | } {0 1 2 3 4 5 6 7 8 9} | |
746 | ||
747 | test {LRANGE against non existing key} { | |
748 | $r lrange nosuchkey 0 1 | |
749 | } {} | |
750 | ||
751 | test {LTRIM basics} { | |
752 | $r del mylist | |
753 | for {set i 0} {$i < 100} {incr i} { | |
754 | $r lpush mylist $i | |
755 | $r ltrim mylist 0 4 | |
756 | } | |
757 | $r lrange mylist 0 -1 | |
758 | } {99 98 97 96 95} | |
759 | ||
760 | test {LTRIM stress testing} { | |
761 | set mylist {} | |
762 | set err {} | |
763 | for {set i 0} {$i < 20} {incr i} { | |
764 | lappend mylist $i | |
765 | } | |
766 | ||
767 | for {set j 0} {$j < 100} {incr j} { | |
768 | # Fill the list | |
769 | $r del mylist | |
770 | for {set i 0} {$i < 20} {incr i} { | |
771 | $r rpush mylist $i | |
772 | } | |
773 | # Trim at random | |
774 | set a [randomInt 20] | |
775 | set b [randomInt 20] | |
776 | $r ltrim mylist $a $b | |
777 | if {[$r lrange mylist 0 -1] ne [lrange $mylist $a $b]} { | |
778 | set err "[$r lrange mylist 0 -1] != [lrange $mylist $a $b]" | |
779 | break | |
780 | } | |
781 | } | |
782 | set _ $err | |
783 | } {} | |
784 | ||
785 | test {LSET} { | |
786 | $r del mylist | |
787 | foreach x {99 98 97 96 95} { | |
788 | $r rpush mylist $x | |
789 | } | |
790 | $r lset mylist 1 foo | |
791 | $r lset mylist -1 bar | |
792 | $r lrange mylist 0 -1 | |
793 | } {99 foo 97 96 bar} | |
794 | ||
795 | test {LSET out of range index} { | |
796 | catch {$r lset mylist 10 foo} err | |
797 | format $err | |
798 | } {ERR*range*} | |
799 | ||
800 | test {LSET against non existing key} { | |
801 | catch {$r lset nosuchkey 10 foo} err | |
802 | format $err | |
803 | } {ERR*key*} | |
804 | ||
805 | test {LSET against non list value} { | |
806 | $r set nolist foobar | |
807 | catch {$r lset nolist 0 foo} err | |
808 | format $err | |
809 | } {ERR*value*} | |
810 | ||
811 | test {SADD, SCARD, SISMEMBER, SMEMBERS basics} { | |
812 | $r sadd myset foo | |
813 | $r sadd myset bar | |
814 | list [$r scard myset] [$r sismember myset foo] \ | |
815 | [$r sismember myset bar] [$r sismember myset bla] \ | |
816 | [lsort [$r smembers myset]] | |
817 | } {2 1 1 0 {bar foo}} | |
818 | ||
819 | test {SADD adding the same element multiple times} { | |
820 | $r sadd myset foo | |
821 | $r sadd myset foo | |
822 | $r sadd myset foo | |
823 | $r scard myset | |
824 | } {2} | |
825 | ||
826 | test {SADD against non set} { | |
827 | catch {$r sadd mylist foo} err | |
828 | format $err | |
829 | } {ERR*kind*} | |
830 | ||
831 | test {SREM basics} { | |
832 | $r sadd myset ciao | |
833 | $r srem myset foo | |
834 | lsort [$r smembers myset] | |
835 | } {bar ciao} | |
836 | ||
837 | test {Mass SADD and SINTER with two sets} { | |
838 | for {set i 0} {$i < 1000} {incr i} { | |
839 | $r sadd set1 $i | |
840 | $r sadd set2 [expr $i+995] | |
841 | } | |
842 | lsort [$r sinter set1 set2] | |
843 | } {995 996 997 998 999} | |
844 | ||
845 | test {SUNION with two sets} { | |
846 | lsort [$r sunion set1 set2] | |
847 | } [lsort -uniq "[$r smembers set1] [$r smembers set2]"] | |
848 | ||
849 | test {SINTERSTORE with two sets} { | |
850 | $r sinterstore setres set1 set2 | |
851 | lsort [$r smembers setres] | |
852 | } {995 996 997 998 999} | |
853 | ||
854 | test {SINTERSTORE with two sets, after a DEBUG RELOAD} { | |
855 | $r debug reload | |
856 | $r sinterstore setres set1 set2 | |
857 | lsort [$r smembers setres] | |
858 | } {995 996 997 998 999} | |
859 | ||
860 | test {SUNIONSTORE with two sets} { | |
861 | $r sunionstore setres set1 set2 | |
862 | lsort [$r smembers setres] | |
863 | } [lsort -uniq "[$r smembers set1] [$r smembers set2]"] | |
864 | ||
865 | test {SUNIONSTORE against non existing keys} { | |
866 | $r set setres xxx | |
867 | list [$r sunionstore setres foo111 bar222] [$r exists xxx] | |
868 | } {0 0} | |
869 | ||
870 | test {SINTER against three sets} { | |
871 | $r sadd set3 999 | |
872 | $r sadd set3 995 | |
873 | $r sadd set3 1000 | |
874 | $r sadd set3 2000 | |
875 | lsort [$r sinter set1 set2 set3] | |
876 | } {995 999} | |
877 | ||
878 | test {SINTERSTORE with three sets} { | |
879 | $r sinterstore setres set1 set2 set3 | |
880 | lsort [$r smembers setres] | |
881 | } {995 999} | |
882 | ||
883 | test {SUNION with non existing keys} { | |
884 | lsort [$r sunion nokey1 set1 set2 nokey2] | |
885 | } [lsort -uniq "[$r smembers set1] [$r smembers set2]"] | |
886 | ||
887 | test {SDIFF with two sets} { | |
888 | for {set i 5} {$i < 1000} {incr i} { | |
889 | $r sadd set4 $i | |
890 | } | |
891 | lsort [$r sdiff set1 set4] | |
892 | } {0 1 2 3 4} | |
893 | ||
894 | test {SDIFF with three sets} { | |
895 | $r sadd set5 0 | |
896 | lsort [$r sdiff set1 set4 set5] | |
897 | } {1 2 3 4} | |
898 | ||
899 | test {SDIFFSTORE with three sets} { | |
900 | $r sdiffstore sres set1 set4 set5 | |
901 | lsort [$r smembers sres] | |
902 | } {1 2 3 4} | |
903 | ||
904 | test {SPOP basics} { | |
905 | $r del myset | |
906 | $r sadd myset 1 | |
907 | $r sadd myset 2 | |
908 | $r sadd myset 3 | |
909 | list [lsort [list [$r spop myset] [$r spop myset] [$r spop myset]]] [$r scard myset] | |
910 | } {{1 2 3} 0} | |
911 | ||
912 | test {SAVE - make sure there are all the types as values} { | |
913 | # Wait for a background saving in progress to terminate | |
914 | waitForBgsave $r | |
915 | $r lpush mysavelist hello | |
916 | $r lpush mysavelist world | |
917 | $r set myemptykey {} | |
918 | $r set mynormalkey {blablablba} | |
919 | $r zadd mytestzset 10 a | |
920 | $r zadd mytestzset 20 b | |
921 | $r zadd mytestzset 30 c | |
922 | $r save | |
923 | } {OK} | |
924 | ||
925 | test {SRANDMEMBER} { | |
926 | $r del myset | |
927 | $r sadd myset a | |
928 | $r sadd myset b | |
929 | $r sadd myset c | |
930 | unset -nocomplain myset | |
931 | array set myset {} | |
932 | for {set i 0} {$i < 100} {incr i} { | |
933 | set myset([$r srandmember myset]) 1 | |
934 | } | |
935 | lsort [array names myset] | |
936 | } {a b c} | |
937 | ||
938 | test {SORT ALPHA against integer encoded strings} { | |
939 | $r del mylist | |
940 | $r lpush mylist 2 | |
941 | $r lpush mylist 1 | |
942 | $r lpush mylist 3 | |
943 | $r lpush mylist 10 | |
944 | $r sort mylist alpha | |
945 | } {1 10 2 3} | |
946 | ||
947 | test {Create a random list and a random set} { | |
948 | set tosort {} | |
949 | array set seenrand {} | |
950 | for {set i 0} {$i < 10000} {incr i} { | |
951 | while 1 { | |
952 | # Make sure all the weights are different because | |
953 | # Redis does not use a stable sort but Tcl does. | |
954 | randpath { | |
955 | set rint [expr int(rand()*1000000)] | |
956 | } { | |
957 | set rint [expr rand()] | |
958 | } | |
959 | if {![info exists seenrand($rint)]} break | |
960 | } | |
961 | set seenrand($rint) x | |
962 | $r lpush tosort $i | |
963 | $r sadd tosort-set $i | |
964 | $r set weight_$i $rint | |
965 | $r hset wobj_$i weight $rint | |
966 | lappend tosort [list $i $rint] | |
967 | } | |
968 | set sorted [lsort -index 1 -real $tosort] | |
969 | set res {} | |
970 | for {set i 0} {$i < 10000} {incr i} { | |
971 | lappend res [lindex $sorted $i 0] | |
972 | } | |
973 | format {} | |
974 | } {} | |
975 | ||
976 | test {SORT with BY against the newly created list} { | |
977 | $r sort tosort {BY weight_*} | |
978 | } $res | |
979 | ||
980 | test {SORT with BY (hash field) against the newly created list} { | |
981 | $r sort tosort {BY wobj_*->weight} | |
982 | } $res | |
983 | ||
984 | test {SORT with GET (key+hash) with sanity check of each element (list)} { | |
985 | set err {} | |
986 | set l1 [$r sort tosort GET # GET weight_*] | |
987 | set l2 [$r sort tosort GET # GET wobj_*->weight] | |
988 | foreach {id1 w1} $l1 {id2 w2} $l2 { | |
989 | set realweight [$r get weight_$id1] | |
990 | if {$id1 != $id2} { | |
991 | set err "ID mismatch $id1 != $id2" | |
992 | break | |
993 | } | |
994 | if {$realweight != $w1 || $realweight != $w2} { | |
995 | set err "Weights mismatch! w1: $w1 w2: $w2 real: $realweight" | |
996 | break | |
997 | } | |
998 | } | |
999 | set _ $err | |
1000 | } {} | |
1001 | ||
1002 | test {SORT with BY, but against the newly created set} { | |
1003 | $r sort tosort-set {BY weight_*} | |
1004 | } $res | |
1005 | ||
1006 | test {SORT with BY (hash field), but against the newly created set} { | |
1007 | $r sort tosort-set {BY wobj_*->weight} | |
1008 | } $res | |
1009 | ||
1010 | test {SORT with BY and STORE against the newly created list} { | |
1011 | $r sort tosort {BY weight_*} store sort-res | |
1012 | $r lrange sort-res 0 -1 | |
1013 | } $res | |
1014 | ||
1015 | test {SORT with BY (hash field) and STORE against the newly created list} { | |
1016 | $r sort tosort {BY wobj_*->weight} store sort-res | |
1017 | $r lrange sort-res 0 -1 | |
1018 | } $res | |
1019 | ||
1020 | test {SORT direct, numeric, against the newly created list} { | |
1021 | $r sort tosort | |
1022 | } [lsort -integer $res] | |
1023 | ||
1024 | test {SORT decreasing sort} { | |
1025 | $r sort tosort {DESC} | |
1026 | } [lsort -decreasing -integer $res] | |
1027 | ||
1028 | test {SORT speed, sorting 10000 elements list using BY, 100 times} { | |
1029 | set start [clock clicks -milliseconds] | |
1030 | for {set i 0} {$i < 100} {incr i} { | |
1031 | set sorted [$r sort tosort {BY weight_* LIMIT 0 10}] | |
1032 | } | |
1033 | set elapsed [expr [clock clicks -milliseconds]-$start] | |
1034 | puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds " | |
1035 | flush stdout | |
1036 | format {} | |
1037 | } {} | |
1038 | ||
1039 | test {SORT speed, as above but against hash field} { | |
1040 | set start [clock clicks -milliseconds] | |
1041 | for {set i 0} {$i < 100} {incr i} { | |
1042 | set sorted [$r sort tosort {BY wobj_*->weight LIMIT 0 10}] | |
1043 | } | |
1044 | set elapsed [expr [clock clicks -milliseconds]-$start] | |
1045 | puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds " | |
1046 | flush stdout | |
1047 | format {} | |
1048 | } {} | |
1049 | ||
1050 | test {SORT speed, sorting 10000 elements list directly, 100 times} { | |
1051 | set start [clock clicks -milliseconds] | |
1052 | for {set i 0} {$i < 100} {incr i} { | |
1053 | set sorted [$r sort tosort {LIMIT 0 10}] | |
1054 | } | |
1055 | set elapsed [expr [clock clicks -milliseconds]-$start] | |
1056 | puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds " | |
1057 | flush stdout | |
1058 | format {} | |
1059 | } {} | |
1060 | ||
1061 | test {SORT speed, pseudo-sorting 10000 elements list, BY <const>, 100 times} { | |
1062 | set start [clock clicks -milliseconds] | |
1063 | for {set i 0} {$i < 100} {incr i} { | |
1064 | set sorted [$r sort tosort {BY nokey LIMIT 0 10}] | |
1065 | } | |
1066 | set elapsed [expr [clock clicks -milliseconds]-$start] | |
1067 | puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds " | |
1068 | flush stdout | |
1069 | format {} | |
1070 | } {} | |
1071 | ||
1072 | test {SORT regression for issue #19, sorting floats} { | |
1073 | $r flushdb | |
1074 | foreach x {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15} { | |
1075 | $r lpush mylist $x | |
1076 | } | |
1077 | $r sort mylist | |
1078 | } [lsort -real {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15}] | |
1079 | ||
1080 | test {SORT with GET #} { | |
1081 | $r del mylist | |
1082 | $r lpush mylist 1 | |
1083 | $r lpush mylist 2 | |
1084 | $r lpush mylist 3 | |
1085 | $r mset weight_1 10 weight_2 5 weight_3 30 | |
1086 | $r sort mylist BY weight_* GET # | |
1087 | } {2 1 3} | |
1088 | ||
1089 | test {SORT with constant GET} { | |
1090 | $r sort mylist GET foo | |
1091 | } {{} {} {}} | |
1092 | ||
1093 | test {LREM, remove all the occurrences} { | |
1094 | $r flushdb | |
1095 | $r rpush mylist foo | |
1096 | $r rpush mylist bar | |
1097 | $r rpush mylist foobar | |
1098 | $r rpush mylist foobared | |
1099 | $r rpush mylist zap | |
1100 | $r rpush mylist bar | |
1101 | $r rpush mylist test | |
1102 | $r rpush mylist foo | |
1103 | set res [$r lrem mylist 0 bar] | |
1104 | list [$r lrange mylist 0 -1] $res | |
1105 | } {{foo foobar foobared zap test foo} 2} | |
1106 | ||
1107 | test {LREM, remove the first occurrence} { | |
1108 | set res [$r lrem mylist 1 foo] | |
1109 | list [$r lrange mylist 0 -1] $res | |
1110 | } {{foobar foobared zap test foo} 1} | |
1111 | ||
1112 | test {LREM, remove non existing element} { | |
1113 | set res [$r lrem mylist 1 nosuchelement] | |
1114 | list [$r lrange mylist 0 -1] $res | |
1115 | } {{foobar foobared zap test foo} 0} | |
1116 | ||
1117 | test {LREM, starting from tail with negative count} { | |
1118 | $r flushdb | |
1119 | $r rpush mylist foo | |
1120 | $r rpush mylist bar | |
1121 | $r rpush mylist foobar | |
1122 | $r rpush mylist foobared | |
1123 | $r rpush mylist zap | |
1124 | $r rpush mylist bar | |
1125 | $r rpush mylist test | |
1126 | $r rpush mylist foo | |
1127 | $r rpush mylist foo | |
1128 | set res [$r lrem mylist -1 bar] | |
1129 | list [$r lrange mylist 0 -1] $res | |
1130 | } {{foo bar foobar foobared zap test foo foo} 1} | |
1131 | ||
1132 | test {LREM, starting from tail with negative count (2)} { | |
1133 | set res [$r lrem mylist -2 foo] | |
1134 | list [$r lrange mylist 0 -1] $res | |
1135 | } {{foo bar foobar foobared zap test} 2} | |
1136 | ||
1137 | test {LREM, deleting objects that may be encoded as integers} { | |
1138 | $r lpush myotherlist 1 | |
1139 | $r lpush myotherlist 2 | |
1140 | $r lpush myotherlist 3 | |
1141 | $r lrem myotherlist 1 2 | |
1142 | $r llen myotherlist | |
1143 | } {2} | |
1144 | ||
1145 | test {MGET} { | |
1146 | $r flushdb | |
1147 | $r set foo BAR | |
1148 | $r set bar FOO | |
1149 | $r mget foo bar | |
1150 | } {BAR FOO} | |
1151 | ||
1152 | test {MGET against non existing key} { | |
1153 | $r mget foo baazz bar | |
1154 | } {BAR {} FOO} | |
1155 | ||
1156 | test {MGET against non-string key} { | |
1157 | $r sadd myset ciao | |
1158 | $r sadd myset bau | |
1159 | $r mget foo baazz bar myset | |
1160 | } {BAR {} FOO {}} | |
1161 | ||
1162 | test {RANDOMKEY} { | |
1163 | $r flushdb | |
1164 | $r set foo x | |
1165 | $r set bar y | |
1166 | set foo_seen 0 | |
1167 | set bar_seen 0 | |
1168 | for {set i 0} {$i < 100} {incr i} { | |
1169 | set rkey [$r randomkey] | |
1170 | if {$rkey eq {foo}} { | |
1171 | set foo_seen 1 | |
1172 | } | |
1173 | if {$rkey eq {bar}} { | |
1174 | set bar_seen 1 | |
1175 | } | |
1176 | } | |
1177 | list $foo_seen $bar_seen | |
1178 | } {1 1} | |
1179 | ||
1180 | test {RANDOMKEY against empty DB} { | |
1181 | $r flushdb | |
1182 | $r randomkey | |
1183 | } {} | |
1184 | ||
1185 | test {RANDOMKEY regression 1} { | |
1186 | $r flushdb | |
1187 | $r set x 10 | |
1188 | $r del x | |
1189 | $r randomkey | |
1190 | } {} | |
1191 | ||
1192 | test {GETSET (set new value)} { | |
1193 | list [$r getset foo xyz] [$r get foo] | |
1194 | } {{} xyz} | |
1195 | ||
1196 | test {GETSET (replace old value)} { | |
1197 | $r set foo bar | |
1198 | list [$r getset foo xyz] [$r get foo] | |
1199 | } {bar xyz} | |
1200 | ||
1201 | test {SMOVE basics} { | |
1202 | $r sadd myset1 a | |
1203 | $r sadd myset1 b | |
1204 | $r sadd myset1 c | |
1205 | $r sadd myset2 x | |
1206 | $r sadd myset2 y | |
1207 | $r sadd myset2 z | |
1208 | $r smove myset1 myset2 a | |
1209 | list [lsort [$r smembers myset2]] [lsort [$r smembers myset1]] | |
1210 | } {{a x y z} {b c}} | |
1211 | ||
1212 | test {SMOVE non existing key} { | |
1213 | list [$r smove myset1 myset2 foo] [lsort [$r smembers myset2]] [lsort [$r smembers myset1]] | |
1214 | } {0 {a x y z} {b c}} | |
1215 | ||
1216 | test {SMOVE non existing src set} { | |
1217 | list [$r smove noset myset2 foo] [lsort [$r smembers myset2]] | |
1218 | } {0 {a x y z}} | |
1219 | ||
1220 | test {SMOVE non existing dst set} { | |
1221 | list [$r smove myset2 myset3 y] [lsort [$r smembers myset2]] [lsort [$r smembers myset3]] | |
1222 | } {1 {a x z} y} | |
1223 | ||
1224 | test {SMOVE wrong src key type} { | |
1225 | $r set x 10 | |
1226 | catch {$r smove x myset2 foo} err | |
1227 | format $err | |
1228 | } {ERR*} | |
1229 | ||
1230 | test {SMOVE wrong dst key type} { | |
1231 | $r set x 10 | |
1232 | catch {$r smove myset2 x foo} err | |
1233 | format $err | |
1234 | } {ERR*} | |
1235 | ||
1236 | test {MSET base case} { | |
1237 | $r mset x 10 y "foo bar" z "x x x x x x x\n\n\r\n" | |
1238 | $r mget x y z | |
1239 | } [list 10 {foo bar} "x x x x x x x\n\n\r\n"] | |
1240 | ||
1241 | test {MSET wrong number of args} { | |
1242 | catch {$r mset x 10 y "foo bar" z} err | |
1243 | format $err | |
1244 | } {*wrong number*} | |
1245 | ||
1246 | test {MSETNX with already existent key} { | |
1247 | list [$r msetnx x1 xxx y2 yyy x 20] [$r exists x1] [$r exists y2] | |
1248 | } {0 0 0} | |
1249 | ||
1250 | test {MSETNX with not existing keys} { | |
1251 | list [$r msetnx x1 xxx y2 yyy] [$r get x1] [$r get y2] | |
1252 | } {1 xxx yyy} | |
1253 | ||
1254 | test {MSETNX should remove all the volatile keys even on failure} { | |
1255 | $r mset x 1 y 2 z 3 | |
1256 | $r expire y 10000 | |
1257 | $r expire z 10000 | |
1258 | list [$r msetnx x A y B z C] [$r mget x y z] | |
1259 | } {0 {1 {} {}}} | |
1260 | ||
1261 | test {ZSET basic ZADD and score update} { | |
1262 | $r zadd ztmp 10 x | |
1263 | $r zadd ztmp 20 y | |
1264 | $r zadd ztmp 30 z | |
1265 | set aux1 [$r zrange ztmp 0 -1] | |
1266 | $r zadd ztmp 1 y | |
1267 | set aux2 [$r zrange ztmp 0 -1] | |
1268 | list $aux1 $aux2 | |
1269 | } {{x y z} {y x z}} | |
1270 | ||
1271 | test {ZCARD basics} { | |
1272 | $r zcard ztmp | |
1273 | } {3} | |
1274 | ||
1275 | test {ZCARD non existing key} { | |
1276 | $r zcard ztmp-blabla | |
1277 | } {0} | |
1278 | ||
1279 | test {ZRANK basics} { | |
1280 | $r zadd zranktmp 10 x | |
1281 | $r zadd zranktmp 20 y | |
1282 | $r zadd zranktmp 30 z | |
1283 | list [$r zrank zranktmp x] [$r zrank zranktmp y] [$r zrank zranktmp z] | |
1284 | } {0 1 2} | |
1285 | ||
1286 | test {ZREVRANK basics} { | |
1287 | list [$r zrevrank zranktmp x] [$r zrevrank zranktmp y] [$r zrevrank zranktmp z] | |
1288 | } {2 1 0} | |
1289 | ||
1290 | test {ZRANK - after deletion} { | |
1291 | $r zrem zranktmp y | |
1292 | list [$r zrank zranktmp x] [$r zrank zranktmp z] | |
1293 | } {0 1} | |
1294 | ||
1295 | test {ZSCORE} { | |
1296 | set aux {} | |
1297 | set err {} | |
1298 | for {set i 0} {$i < 1000} {incr i} { | |
1299 | set score [expr rand()] | |
1300 | lappend aux $score | |
1301 | $r zadd zscoretest $score $i | |
1302 | } | |
1303 | for {set i 0} {$i < 1000} {incr i} { | |
1304 | if {[$r zscore zscoretest $i] != [lindex $aux $i]} { | |
1305 | set err "Expected score was [lindex $aux $i] but got [$r zscore zscoretest $i] for element $i" | |
1306 | break | |
1307 | } | |
1308 | } | |
1309 | set _ $err | |
1310 | } {} | |
1311 | ||
1312 | test {ZSCORE after a DEBUG RELOAD} { | |
1313 | set aux {} | |
1314 | set err {} | |
1315 | $r del zscoretest | |
1316 | for {set i 0} {$i < 1000} {incr i} { | |
1317 | set score [expr rand()] | |
1318 | lappend aux $score | |
1319 | $r zadd zscoretest $score $i | |
1320 | } | |
1321 | $r debug reload | |
1322 | for {set i 0} {$i < 1000} {incr i} { | |
1323 | if {[$r zscore zscoretest $i] != [lindex $aux $i]} { | |
1324 | set err "Expected score was [lindex $aux $i] but got [$r zscore zscoretest $i] for element $i" | |
1325 | break | |
1326 | } | |
1327 | } | |
1328 | set _ $err | |
1329 | } {} | |
1330 | ||
1331 | test {ZRANGE and ZREVRANGE basics} { | |
1332 | list [$r zrange ztmp 0 -1] [$r zrevrange ztmp 0 -1] \ | |
1333 | [$r zrange ztmp 1 -1] [$r zrevrange ztmp 1 -1] | |
1334 | } {{y x z} {z x y} {x z} {x y}} | |
1335 | ||
1336 | test {ZRANGE WITHSCORES} { | |
1337 | $r zrange ztmp 0 -1 withscores | |
1338 | } {y 1 x 10 z 30} | |
1339 | ||
1340 | test {ZSETs stress tester - sorting is working well?} { | |
1341 | set delta 0 | |
1342 | for {set test 0} {$test < 2} {incr test} { | |
1343 | unset -nocomplain auxarray | |
1344 | array set auxarray {} | |
1345 | set auxlist {} | |
1346 | $r del myzset | |
1347 | for {set i 0} {$i < 1000} {incr i} { | |
1348 | if {$test == 0} { | |
1349 | set score [expr rand()] | |
1350 | } else { | |
1351 | set score [expr int(rand()*10)] | |
1352 | } | |
1353 | set auxarray($i) $score | |
1354 | $r zadd myzset $score $i | |
1355 | # Random update | |
1356 | if {[expr rand()] < .2} { | |
1357 | set j [expr int(rand()*1000)] | |
1358 | if {$test == 0} { | |
1359 | set score [expr rand()] | |
1360 | } else { | |
1361 | set score [expr int(rand()*10)] | |
1362 | } | |
1363 | set auxarray($j) $score | |
1364 | $r zadd myzset $score $j | |
1365 | } | |
1366 | } | |
1367 | foreach {item score} [array get auxarray] { | |
1368 | lappend auxlist [list $score $item] | |
1369 | } | |
1370 | set sorted [lsort -command zlistAlikeSort $auxlist] | |
1371 | set auxlist {} | |
1372 | foreach x $sorted { | |
1373 | lappend auxlist [lindex $x 1] | |
1374 | } | |
1375 | set fromredis [$r zrange myzset 0 -1] | |
1376 | set delta 0 | |
1377 | for {set i 0} {$i < [llength $fromredis]} {incr i} { | |
1378 | if {[lindex $fromredis $i] != [lindex $auxlist $i]} { | |
1379 | incr delta | |
1380 | } | |
1381 | } | |
1382 | } | |
1383 | format $delta | |
1384 | } {0} | |
1385 | ||
1386 | test {ZINCRBY - can create a new sorted set} { | |
1387 | $r del zset | |
1388 | $r zincrby zset 1 foo | |
1389 | list [$r zrange zset 0 -1] [$r zscore zset foo] | |
1390 | } {foo 1} | |
1391 | ||
1392 | test {ZINCRBY - increment and decrement} { | |
1393 | $r zincrby zset 2 foo | |
1394 | $r zincrby zset 1 bar | |
1395 | set v1 [$r zrange zset 0 -1] | |
1396 | $r zincrby zset 10 bar | |
1397 | $r zincrby zset -5 foo | |
1398 | $r zincrby zset -5 bar | |
1399 | set v2 [$r zrange zset 0 -1] | |
1400 | list $v1 $v2 [$r zscore zset foo] [$r zscore zset bar] | |
1401 | } {{bar foo} {foo bar} -2 6} | |
1402 | ||
1403 | test {ZRANGEBYSCORE and ZCOUNT basics} { | |
1404 | $r del zset | |
1405 | $r zadd zset 1 a | |
1406 | $r zadd zset 2 b | |
1407 | $r zadd zset 3 c | |
1408 | $r zadd zset 4 d | |
1409 | $r zadd zset 5 e | |
1410 | list [$r zrangebyscore zset 2 4] [$r zrangebyscore zset (2 (4] \ | |
1411 | [$r zcount zset 2 4] [$r zcount zset (2 (4] | |
1412 | } {{b c d} c 3 1} | |
1413 | ||
1414 | test {ZRANGEBYSCORE withscores} { | |
1415 | $r del zset | |
1416 | $r zadd zset 1 a | |
1417 | $r zadd zset 2 b | |
1418 | $r zadd zset 3 c | |
1419 | $r zadd zset 4 d | |
1420 | $r zadd zset 5 e | |
1421 | $r zrangebyscore zset 2 4 withscores | |
1422 | } {b 2 c 3 d 4} | |
1423 | ||
1424 | test {ZRANGEBYSCORE fuzzy test, 100 ranges in 1000 elements sorted set} { | |
1425 | set err {} | |
1426 | $r del zset | |
1427 | for {set i 0} {$i < 1000} {incr i} { | |
1428 | $r zadd zset [expr rand()] $i | |
1429 | } | |
1430 | for {set i 0} {$i < 100} {incr i} { | |
1431 | set min [expr rand()] | |
1432 | set max [expr rand()] | |
1433 | if {$min > $max} { | |
1434 | set aux $min | |
1435 | set min $max | |
1436 | set max $aux | |
1437 | } | |
1438 | set low [$r zrangebyscore zset -inf $min] | |
1439 | set ok [$r zrangebyscore zset $min $max] | |
1440 | set high [$r zrangebyscore zset $max +inf] | |
1441 | set lowx [$r zrangebyscore zset -inf ($min] | |
1442 | set okx [$r zrangebyscore zset ($min ($max] | |
1443 | set highx [$r zrangebyscore zset ($max +inf] | |
1444 | ||
1445 | if {[$r zcount zset -inf $min] != [llength $low]} { | |
1446 | append err "Error, len does not match zcount\n" | |
1447 | } | |
1448 | if {[$r zcount zset $min $max] != [llength $ok]} { | |
1449 | append err "Error, len does not match zcount\n" | |
1450 | } | |
1451 | if {[$r zcount zset $max +inf] != [llength $high]} { | |
1452 | append err "Error, len does not match zcount\n" | |
1453 | } | |
1454 | if {[$r zcount zset -inf ($min] != [llength $lowx]} { | |
1455 | append err "Error, len does not match zcount\n" | |
1456 | } | |
1457 | if {[$r zcount zset ($min ($max] != [llength $okx]} { | |
1458 | append err "Error, len does not match zcount\n" | |
1459 | } | |
1460 | if {[$r zcount zset ($max +inf] != [llength $highx]} { | |
1461 | append err "Error, len does not match zcount\n" | |
1462 | } | |
1463 | ||
1464 | foreach x $low { | |
1465 | set score [$r zscore zset $x] | |
1466 | if {$score > $min} { | |
1467 | append err "Error, score for $x is $score > $min\n" | |
1468 | } | |
1469 | } | |
1470 | foreach x $lowx { | |
1471 | set score [$r zscore zset $x] | |
1472 | if {$score >= $min} { | |
1473 | append err "Error, score for $x is $score >= $min\n" | |
1474 | } | |
1475 | } | |
1476 | foreach x $ok { | |
1477 | set score [$r zscore zset $x] | |
1478 | if {$score < $min || $score > $max} { | |
1479 | append err "Error, score for $x is $score outside $min-$max range\n" | |
1480 | } | |
1481 | } | |
1482 | foreach x $okx { | |
1483 | set score [$r zscore zset $x] | |
1484 | if {$score <= $min || $score >= $max} { | |
1485 | append err "Error, score for $x is $score outside $min-$max open range\n" | |
1486 | } | |
1487 | } | |
1488 | foreach x $high { | |
1489 | set score [$r zscore zset $x] | |
1490 | if {$score < $max} { | |
1491 | append err "Error, score for $x is $score < $max\n" | |
1492 | } | |
1493 | } | |
1494 | foreach x $highx { | |
1495 | set score [$r zscore zset $x] | |
1496 | if {$score <= $max} { | |
1497 | append err "Error, score for $x is $score <= $max\n" | |
1498 | } | |
1499 | } | |
1500 | } | |
1501 | set _ $err | |
1502 | } {} | |
1503 | ||
1504 | test {ZRANGEBYSCORE with LIMIT} { | |
1505 | $r del zset | |
1506 | $r zadd zset 1 a | |
1507 | $r zadd zset 2 b | |
1508 | $r zadd zset 3 c | |
1509 | $r zadd zset 4 d | |
1510 | $r zadd zset 5 e | |
1511 | list \ | |
1512 | [$r zrangebyscore zset 0 10 LIMIT 0 2] \ | |
1513 | [$r zrangebyscore zset 0 10 LIMIT 2 3] \ | |
1514 | [$r zrangebyscore zset 0 10 LIMIT 2 10] \ | |
1515 | [$r zrangebyscore zset 0 10 LIMIT 20 10] | |
1516 | } {{a b} {c d e} {c d e} {}} | |
1517 | ||
1518 | test {ZRANGEBYSCORE with LIMIT and withscores} { | |
1519 | $r del zset | |
1520 | $r zadd zset 10 a | |
1521 | $r zadd zset 20 b | |
1522 | $r zadd zset 30 c | |
1523 | $r zadd zset 40 d | |
1524 | $r zadd zset 50 e | |
1525 | $r zrangebyscore zset 20 50 LIMIT 2 3 withscores | |
1526 | } {d 40 e 50} | |
1527 | ||
1528 | test {ZREMRANGEBYSCORE basics} { | |
1529 | $r del zset | |
1530 | $r zadd zset 1 a | |
1531 | $r zadd zset 2 b | |
1532 | $r zadd zset 3 c | |
1533 | $r zadd zset 4 d | |
1534 | $r zadd zset 5 e | |
1535 | list [$r zremrangebyscore zset 2 4] [$r zrange zset 0 -1] | |
1536 | } {3 {a e}} | |
1537 | ||
1538 | test {ZREMRANGEBYSCORE from -inf to +inf} { | |
1539 | $r del zset | |
1540 | $r zadd zset 1 a | |
1541 | $r zadd zset 2 b | |
1542 | $r zadd zset 3 c | |
1543 | $r zadd zset 4 d | |
1544 | $r zadd zset 5 e | |
1545 | list [$r zremrangebyscore zset -inf +inf] [$r zrange zset 0 -1] | |
1546 | } {5 {}} | |
1547 | ||
1548 | test {ZREMRANGEBYRANK basics} { | |
1549 | $r del zset | |
1550 | $r zadd zset 1 a | |
1551 | $r zadd zset 2 b | |
1552 | $r zadd zset 3 c | |
1553 | $r zadd zset 4 d | |
1554 | $r zadd zset 5 e | |
1555 | list [$r zremrangebyrank zset 1 3] [$r zrange zset 0 -1] | |
1556 | } {3 {a e}} | |
1557 | ||
1558 | test {ZUNION against non-existing key doesn't set destination} { | |
1559 | $r del zseta | |
1560 | list [$r zunion dst_key 1 zseta] [$r exists dst_key] | |
1561 | } {0 0} | |
1562 | ||
1563 | test {ZUNION basics} { | |
1564 | $r del zseta zsetb zsetc | |
1565 | $r zadd zseta 1 a | |
1566 | $r zadd zseta 2 b | |
1567 | $r zadd zseta 3 c | |
1568 | $r zadd zsetb 1 b | |
1569 | $r zadd zsetb 2 c | |
1570 | $r zadd zsetb 3 d | |
1571 | list [$r zunion zsetc 2 zseta zsetb] [$r zrange zsetc 0 -1 withscores] | |
1572 | } {4 {a 1 b 3 d 3 c 5}} | |
1573 | ||
1574 | test {ZUNION with weights} { | |
1575 | list [$r zunion zsetc 2 zseta zsetb weights 2 3] [$r zrange zsetc 0 -1 withscores] | |
1576 | } {4 {a 2 b 7 d 9 c 12}} | |
1577 | ||
1578 | test {ZUNION with AGGREGATE MIN} { | |
1579 | list [$r zunion zsetc 2 zseta zsetb aggregate min] [$r zrange zsetc 0 -1 withscores] | |
1580 | } {4 {a 1 b 1 c 2 d 3}} | |
1581 | ||
1582 | test {ZUNION with AGGREGATE MAX} { | |
1583 | list [$r zunion zsetc 2 zseta zsetb aggregate max] [$r zrange zsetc 0 -1 withscores] | |
1584 | } {4 {a 1 b 2 c 3 d 3}} | |
1585 | ||
1586 | test {ZINTER basics} { | |
1587 | list [$r zinter zsetc 2 zseta zsetb] [$r zrange zsetc 0 -1 withscores] | |
1588 | } {2 {b 3 c 5}} | |
1589 | ||
1590 | test {ZINTER with weights} { | |
1591 | list [$r zinter zsetc 2 zseta zsetb weights 2 3] [$r zrange zsetc 0 -1 withscores] | |
1592 | } {2 {b 7 c 12}} | |
1593 | ||
1594 | test {ZINTER with AGGREGATE MIN} { | |
1595 | list [$r zinter zsetc 2 zseta zsetb aggregate min] [$r zrange zsetc 0 -1 withscores] | |
1596 | } {2 {b 1 c 2}} | |
1597 | ||
1598 | test {ZINTER with AGGREGATE MAX} { | |
1599 | list [$r zinter zsetc 2 zseta zsetb aggregate max] [$r zrange zsetc 0 -1 withscores] | |
1600 | } {2 {b 2 c 3}} | |
1601 | ||
1602 | test {SORT against sorted sets} { | |
1603 | $r del zset | |
1604 | $r zadd zset 1 a | |
1605 | $r zadd zset 5 b | |
1606 | $r zadd zset 2 c | |
1607 | $r zadd zset 10 d | |
1608 | $r zadd zset 3 e | |
1609 | $r sort zset alpha desc | |
1610 | } {e d c b a} | |
1611 | ||
1612 | test {Sorted sets +inf and -inf handling} { | |
1613 | $r del zset | |
1614 | $r zadd zset -100 a | |
1615 | $r zadd zset 200 b | |
1616 | $r zadd zset -300 c | |
1617 | $r zadd zset 1000000 d | |
1618 | $r zadd zset +inf max | |
1619 | $r zadd zset -inf min | |
1620 | $r zrange zset 0 -1 | |
1621 | } {min c a b d max} | |
1622 | ||
1623 | test {HSET/HLEN - Small hash creation} { | |
1624 | array set smallhash {} | |
1625 | for {set i 0} {$i < 8} {incr i} { | |
1626 | set key [randstring 0 8 alpha] | |
1627 | set val [randstring 0 8 alpha] | |
1628 | if {[info exists smallhash($key)]} { | |
1629 | incr i -1 | |
1630 | continue | |
1631 | } | |
1632 | $r hset smallhash $key $val | |
1633 | set smallhash($key) $val | |
1634 | } | |
1635 | list [$r hlen smallhash] | |
1636 | } {8} | |
1637 | ||
1638 | test {Is the small hash encoded with a zipmap?} { | |
1639 | $r debug object smallhash | |
1640 | } {*zipmap*} | |
1641 | ||
1642 | test {HSET/HLEN - Big hash creation} { | |
1643 | array set bighash {} | |
1644 | for {set i 0} {$i < 1024} {incr i} { | |
1645 | set key [randstring 0 8 alpha] | |
1646 | set val [randstring 0 8 alpha] | |
1647 | if {[info exists bighash($key)]} { | |
1648 | incr i -1 | |
1649 | continue | |
1650 | } | |
1651 | $r hset bighash $key $val | |
1652 | set bighash($key) $val | |
1653 | } | |
1654 | list [$r hlen bighash] | |
1655 | } {1024} | |
1656 | ||
1657 | test {Is the big hash encoded with a zipmap?} { | |
1658 | $r debug object bighash | |
1659 | } {*hashtable*} | |
1660 | ||
1661 | test {HGET against the small hash} { | |
1662 | set err {} | |
1663 | foreach k [array names smallhash *] { | |
1664 | if {$smallhash($k) ne [$r hget smallhash $k]} { | |
1665 | set err "$smallhash($k) != [$r hget smallhash $k]" | |
1666 | break | |
1667 | } | |
1668 | } | |
1669 | set _ $err | |
1670 | } {} | |
1671 | ||
1672 | test {HGET against the big hash} { | |
1673 | set err {} | |
1674 | foreach k [array names bighash *] { | |
1675 | if {$bighash($k) ne [$r hget bighash $k]} { | |
1676 | set err "$bighash($k) != [$r hget bighash $k]" | |
1677 | break | |
1678 | } | |
1679 | } | |
1680 | set _ $err | |
1681 | } {} | |
1682 | ||
1683 | test {HGET against non existing key} { | |
1684 | set rv {} | |
1685 | lappend rv [$r hget smallhash __123123123__] | |
1686 | lappend rv [$r hget bighash __123123123__] | |
1687 | set _ $rv | |
1688 | } {{} {}} | |
1689 | ||
1690 | test {HSET in update and insert mode} { | |
1691 | set rv {} | |
1692 | set k [lindex [array names smallhash *] 0] | |
1693 | lappend rv [$r hset smallhash $k newval1] | |
1694 | set smallhash($k) newval1 | |
1695 | lappend rv [$r hget smallhash $k] | |
1696 | lappend rv [$r hset smallhash __foobar123__ newval] | |
1697 | set k [lindex [array names bighash *] 0] | |
1698 | lappend rv [$r hset bighash $k newval2] | |
1699 | set bighash($k) newval2 | |
1700 | lappend rv [$r hget bighash $k] | |
1701 | lappend rv [$r hset bighash __foobar123__ newval] | |
1702 | lappend rv [$r hdel smallhash __foobar123__] | |
1703 | lappend rv [$r hdel bighash __foobar123__] | |
1704 | set _ $rv | |
1705 | } {0 newval1 1 0 newval2 1 1 1} | |
1706 | ||
1707 | test {HSETNX target key missing - small hash} { | |
1708 | $r hsetnx smallhash __123123123__ foo | |
1709 | $r hget smallhash __123123123__ | |
1710 | } {foo} | |
1711 | ||
1712 | test {HSETNX target key exists - small hash} { | |
1713 | $r hsetnx smallhash __123123123__ bar | |
1714 | set result [$r hget smallhash __123123123__] | |
1715 | $r hdel smallhash __123123123__ | |
1716 | set _ $result | |
1717 | } {foo} | |
1718 | ||
1719 | test {HSETNX target key missing - big hash} { | |
1720 | $r hsetnx bighash __123123123__ foo | |
1721 | $r hget bighash __123123123__ | |
1722 | } {foo} | |
1723 | ||
1724 | test {HSETNX target key exists - big hash} { | |
1725 | $r hsetnx bighash __123123123__ bar | |
1726 | set result [$r hget bighash __123123123__] | |
1727 | $r hdel bighash __123123123__ | |
1728 | set _ $result | |
1729 | } {foo} | |
1730 | ||
1731 | test {HMSET wrong number of args} { | |
1732 | catch {$r hmset smallhash key1 val1 key2} err | |
1733 | format $err | |
1734 | } {*wrong number*} | |
1735 | ||
1736 | test {HMSET - small hash} { | |
1737 | set args {} | |
1738 | foreach {k v} [array get smallhash] { | |
1739 | set newval [randstring 0 8 alpha] | |
1740 | set smallhash($k) $newval | |
1741 | lappend args $k $newval | |
1742 | } | |
1743 | $r hmset smallhash {*}$args | |
1744 | } {OK} | |
1745 | ||
1746 | test {HMSET - big hash} { | |
1747 | set args {} | |
1748 | foreach {k v} [array get bighash] { | |
1749 | set newval [randstring 0 8 alpha] | |
1750 | set bighash($k) $newval | |
1751 | lappend args $k $newval | |
1752 | } | |
1753 | $r hmset bighash {*}$args | |
1754 | } {OK} | |
1755 | ||
1756 | test {HMGET against non existing key and fields} { | |
1757 | set rv {} | |
1758 | lappend rv [$r hmget doesntexist __123123123__ __456456456__] | |
1759 | lappend rv [$r hmget smallhash __123123123__ __456456456__] | |
1760 | lappend rv [$r hmget bighash __123123123__ __456456456__] | |
1761 | set _ $rv | |
1762 | } {{{} {}} {{} {}} {{} {}}} | |
1763 | ||
1764 | test {HMGET - small hash} { | |
1765 | set keys {} | |
1766 | set vals {} | |
1767 | foreach {k v} [array get smallhash] { | |
1768 | lappend keys $k | |
1769 | lappend vals $v | |
1770 | } | |
1771 | set err {} | |
1772 | set result [$r hmget smallhash {*}$keys] | |
1773 | if {$vals ne $result} { | |
1774 | set err "$vals != $result" | |
1775 | break | |
1776 | } | |
1777 | set _ $err | |
1778 | } {} | |
1779 | ||
1780 | test {HMGET - big hash} { | |
1781 | set keys {} | |
1782 | set vals {} | |
1783 | foreach {k v} [array get bighash] { | |
1784 | lappend keys $k | |
1785 | lappend vals $v | |
1786 | } | |
1787 | set err {} | |
1788 | set result [$r hmget bighash {*}$keys] | |
1789 | if {$vals ne $result} { | |
1790 | set err "$vals != $result" | |
1791 | break | |
1792 | } | |
1793 | set _ $err | |
1794 | } {} | |
1795 | ||
1796 | test {HKEYS - small hash} { | |
1797 | lsort [$r hkeys smallhash] | |
1798 | } [lsort [array names smallhash *]] | |
1799 | ||
1800 | test {HKEYS - big hash} { | |
1801 | lsort [$r hkeys bighash] | |
1802 | } [lsort [array names bighash *]] | |
1803 | ||
1804 | test {HVALS - small hash} { | |
1805 | set vals {} | |
1806 | foreach {k v} [array get smallhash] { | |
1807 | lappend vals $v | |
1808 | } | |
1809 | set _ [lsort $vals] | |
1810 | } [lsort [$r hvals smallhash]] | |
1811 | ||
1812 | test {HVALS - big hash} { | |
1813 | set vals {} | |
1814 | foreach {k v} [array get bighash] { | |
1815 | lappend vals $v | |
1816 | } | |
1817 | set _ [lsort $vals] | |
1818 | } [lsort [$r hvals bighash]] | |
1819 | ||
1820 | test {HGETALL - small hash} { | |
1821 | lsort [$r hgetall smallhash] | |
1822 | } [lsort [array get smallhash]] | |
1823 | ||
1824 | test {HGETALL - big hash} { | |
1825 | lsort [$r hgetall bighash] | |
1826 | } [lsort [array get bighash]] | |
1827 | ||
1828 | test {HDEL and return value} { | |
1829 | set rv {} | |
1830 | lappend rv [$r hdel smallhash nokey] | |
1831 | lappend rv [$r hdel bighash nokey] | |
1832 | set k [lindex [array names smallhash *] 0] | |
1833 | lappend rv [$r hdel smallhash $k] | |
1834 | lappend rv [$r hdel smallhash $k] | |
1835 | lappend rv [$r hget smallhash $k] | |
1836 | unset smallhash($k) | |
1837 | set k [lindex [array names bighash *] 0] | |
1838 | lappend rv [$r hdel bighash $k] | |
1839 | lappend rv [$r hdel bighash $k] | |
1840 | lappend rv [$r hget bighash $k] | |
1841 | unset bighash($k) | |
1842 | set _ $rv | |
1843 | } {0 0 1 0 {} 1 0 {}} | |
1844 | ||
1845 | test {HEXISTS} { | |
1846 | set rv {} | |
1847 | set k [lindex [array names smallhash *] 0] | |
1848 | lappend rv [$r hexists smallhash $k] | |
1849 | lappend rv [$r hexists smallhash nokey] | |
1850 | set k [lindex [array names bighash *] 0] | |
1851 | lappend rv [$r hexists bighash $k] | |
1852 | lappend rv [$r hexists bighash nokey] | |
1853 | } {1 0 1 0} | |
1854 | ||
1855 | test {Is a zipmap encoded Hash promoted on big payload?} { | |
1856 | $r hset smallhash foo [string repeat a 1024] | |
1857 | $r debug object smallhash | |
1858 | } {*hashtable*} | |
1859 | ||
1860 | test {HINCRBY against non existing database key} { | |
1861 | $r del htest | |
1862 | list [$r hincrby htest foo 2] | |
1863 | } {2} | |
1864 | ||
1865 | test {HINCRBY against non existing hash key} { | |
1866 | set rv {} | |
1867 | $r hdel smallhash tmp | |
1868 | $r hdel bighash tmp | |
1869 | lappend rv [$r hincrby smallhash tmp 2] | |
1870 | lappend rv [$r hget smallhash tmp] | |
1871 | lappend rv [$r hincrby bighash tmp 2] | |
1872 | lappend rv [$r hget bighash tmp] | |
1873 | } {2 2 2 2} | |
1874 | ||
1875 | test {HINCRBY against hash key created by hincrby itself} { | |
1876 | set rv {} | |
1877 | lappend rv [$r hincrby smallhash tmp 3] | |
1878 | lappend rv [$r hget smallhash tmp] | |
1879 | lappend rv [$r hincrby bighash tmp 3] | |
1880 | lappend rv [$r hget bighash tmp] | |
1881 | } {5 5 5 5} | |
1882 | ||
1883 | test {HINCRBY against hash key originally set with HSET} { | |
1884 | $r hset smallhash tmp 100 | |
1885 | $r hset bighash tmp 100 | |
1886 | list [$r hincrby smallhash tmp 2] [$r hincrby bighash tmp 2] | |
1887 | } {102 102} | |
1888 | ||
1889 | test {HINCRBY over 32bit value} { | |
1890 | $r hset smallhash tmp 17179869184 | |
1891 | $r hset bighash tmp 17179869184 | |
1892 | list [$r hincrby smallhash tmp 1] [$r hincrby bighash tmp 1] | |
1893 | } {17179869185 17179869185} | |
1894 | ||
1895 | test {HINCRBY over 32bit value with over 32bit increment} { | |
1896 | $r hset smallhash tmp 17179869184 | |
1897 | $r hset bighash tmp 17179869184 | |
1898 | list [$r hincrby smallhash tmp 17179869184] [$r hincrby bighash tmp 17179869184] | |
1899 | } {34359738368 34359738368} | |
1900 | ||
1901 | test {HINCRBY against key with spaces (no integer encoded)} { | |
1902 | $r hset smallhash tmp " 11 " | |
1903 | $r hset bighash tmp " 11 " | |
1904 | list [$r hincrby smallhash tmp 1] [$r hincrby bighash tmp 1] | |
1905 | } {12 12} | |
1906 | ||
1907 | # TODO: | |
1908 | # Randomized test, small and big | |
1909 | # .rdb / AOF consistency test should include hashes | |
1910 | ||
1911 | test {EXPIRE - don't set timeouts multiple times} { | |
1912 | $r set x foobar | |
1913 | set v1 [$r expire x 5] | |
1914 | set v2 [$r ttl x] | |
1915 | set v3 [$r expire x 10] | |
1916 | set v4 [$r ttl x] | |
1917 | list $v1 $v2 $v3 $v4 | |
1918 | } {1 5 0 5} | |
1919 | ||
1920 | test {EXPIRE - It should be still possible to read 'x'} { | |
1921 | $r get x | |
1922 | } {foobar} | |
1923 | ||
1924 | test {EXPIRE - After 6 seconds the key should no longer be here} { | |
1925 | after 6000 | |
1926 | list [$r get x] [$r exists x] | |
1927 | } {{} 0} | |
1928 | ||
1929 | test {EXPIRE - Delete on write policy} { | |
1930 | $r del x | |
1931 | $r lpush x foo | |
1932 | $r expire x 1000 | |
1933 | $r lpush x bar | |
1934 | $r lrange x 0 -1 | |
1935 | } {bar} | |
1936 | ||
1937 | test {EXPIREAT - Check for EXPIRE alike behavior} { | |
1938 | $r del x | |
1939 | $r set x foo | |
1940 | $r expireat x [expr [clock seconds]+15] | |
1941 | $r ttl x | |
1942 | } {1[345]} | |
1943 | ||
1944 | test {ZSETs skiplist implementation backlink consistency test} { | |
1945 | set diff 0 | |
1946 | set elements 10000 | |
1947 | for {set j 0} {$j < $elements} {incr j} { | |
1948 | $r zadd myzset [expr rand()] "Element-$j" | |
1949 | $r zrem myzset "Element-[expr int(rand()*$elements)]" | |
1950 | } | |
1951 | set l1 [$r zrange myzset 0 -1] | |
1952 | set l2 [$r zrevrange myzset 0 -1] | |
1953 | for {set j 0} {$j < [llength $l1]} {incr j} { | |
1954 | if {[lindex $l1 $j] ne [lindex $l2 end-$j]} { | |
1955 | incr diff | |
1956 | } | |
1957 | } | |
1958 | format $diff | |
1959 | } {0} | |
1960 | ||
1961 | test {ZSETs ZRANK augmented skip list stress testing} { | |
1962 | set err {} | |
1963 | $r del myzset | |
1964 | for {set k 0} {$k < 10000} {incr k} { | |
1965 | set i [expr {$k%1000}] | |
1966 | if {[expr rand()] < .2} { | |
1967 | $r zrem myzset $i | |
1968 | } else { | |
1969 | set score [expr rand()] | |
1970 | $r zadd myzset $score $i | |
1971 | } | |
1972 | set card [$r zcard myzset] | |
1973 | if {$card > 0} { | |
1974 | set index [randomInt $card] | |
1975 | set ele [lindex [$r zrange myzset $index $index] 0] | |
1976 | set rank [$r zrank myzset $ele] | |
1977 | if {$rank != $index} { | |
1978 | set err "$ele RANK is wrong! ($rank != $index)" | |
1979 | break | |
1980 | } | |
1981 | } | |
1982 | } | |
1983 | set _ $err | |
1984 | } {} | |
1985 | ||
1986 | foreach fuzztype {binary alpha compr} { | |
1987 | test "FUZZ stresser with data model $fuzztype" { | |
1988 | set err 0 | |
1989 | for {set i 0} {$i < 10000} {incr i} { | |
1990 | set fuzz [randstring 0 512 $fuzztype] | |
1991 | $r set foo $fuzz | |
1992 | set got [$r get foo] | |
1993 | if {$got ne $fuzz} { | |
1994 | set err [list $fuzz $got] | |
1995 | break | |
1996 | } | |
1997 | } | |
1998 | set _ $err | |
1999 | } {0} | |
2000 | } | |
2001 | ||
2002 | test {BGSAVE} { | |
2003 | waitForBgsave $r | |
2004 | $r flushdb | |
2005 | $r save | |
2006 | $r set x 10 | |
2007 | $r bgsave | |
2008 | waitForBgsave $r | |
2009 | $r debug reload | |
2010 | $r get x | |
2011 | } {10} | |
2012 | ||
2013 | test {Handle an empty query well} { | |
2014 | set fd [$r channel] | |
2015 | puts -nonewline $fd "\r\n" | |
2016 | flush $fd | |
2017 | $r ping | |
2018 | } {PONG} | |
2019 | ||
2020 | test {Negative multi bulk command does not create problems} { | |
2021 | set fd [$r channel] | |
2022 | puts -nonewline $fd "*-10\r\n" | |
2023 | flush $fd | |
2024 | $r ping | |
2025 | } {PONG} | |
2026 | ||
2027 | test {Negative multi bulk payload} { | |
2028 | set fd [$r channel] | |
2029 | puts -nonewline $fd "SET x -10\r\n" | |
2030 | flush $fd | |
2031 | gets $fd | |
2032 | } {*invalid bulk*} | |
2033 | ||
2034 | test {Too big bulk payload} { | |
2035 | set fd [$r channel] | |
2036 | puts -nonewline $fd "SET x 2000000000\r\n" | |
2037 | flush $fd | |
2038 | gets $fd | |
2039 | } {*invalid bulk*count*} | |
2040 | ||
2041 | test {Multi bulk request not followed by bulk args} { | |
2042 | set fd [$r channel] | |
2043 | puts -nonewline $fd "*1\r\nfoo\r\n" | |
2044 | flush $fd | |
2045 | gets $fd | |
2046 | } {*protocol error*} | |
2047 | ||
2048 | test {Generic wrong number of args} { | |
2049 | catch {$r ping x y z} err | |
2050 | set _ $err | |
2051 | } {*wrong*arguments*ping*} | |
2052 | ||
2053 | test {SELECT an out of range DB} { | |
2054 | catch {$r select 1000000} err | |
2055 | set _ $err | |
2056 | } {*invalid*} | |
2057 | ||
2058 | if {![catch {package require sha1}]} { | |
2059 | test {Check consistency of different data types after a reload} { | |
2060 | $r flushdb | |
2061 | createComplexDataset $r 10000 | |
2062 | set sha1 [datasetDigest $r] | |
2063 | $r debug reload | |
2064 | set sha1_after [datasetDigest $r] | |
2065 | expr {$sha1 eq $sha1_after} | |
2066 | } {1} | |
2067 | ||
2068 | test {Same dataset digest if saving/reloading as AOF?} { | |
2069 | $r bgrewriteaof | |
2070 | waitForBgrewriteaof $r | |
2071 | $r debug loadaof | |
2072 | set sha1_after [datasetDigest $r] | |
2073 | expr {$sha1 eq $sha1_after} | |
2074 | } {1} | |
2075 | } | |
2076 | ||
2077 | test {EXPIRES after a reload (snapshot + append only file)} { | |
2078 | $r flushdb | |
2079 | $r set x 10 | |
2080 | $r expire x 1000 | |
2081 | $r save | |
2082 | $r debug reload | |
2083 | set ttl [$r ttl x] | |
2084 | set e1 [expr {$ttl > 900 && $ttl <= 1000}] | |
2085 | $r bgrewriteaof | |
2086 | waitForBgrewriteaof $r | |
2087 | set ttl [$r ttl x] | |
2088 | set e2 [expr {$ttl > 900 && $ttl <= 1000}] | |
2089 | list $e1 $e2 | |
2090 | } {1 1} | |
2091 | ||
2092 | test {PIPELINING stresser (also a regression for the old epoll bug)} { | |
2093 | set fd2 [socket $::host $::port] | |
2094 | fconfigure $fd2 -encoding binary -translation binary | |
2095 | puts -nonewline $fd2 "SELECT 9\r\n" | |
2096 | flush $fd2 | |
2097 | gets $fd2 | |
2098 | ||
2099 | for {set i 0} {$i < 100000} {incr i} { | |
2100 | set q {} | |
2101 | set val "0000${i}0000" | |
2102 | append q "SET key:$i [string length $val]\r\n$val\r\n" | |
2103 | puts -nonewline $fd2 $q | |
2104 | set q {} | |
2105 | append q "GET key:$i\r\n" | |
2106 | puts -nonewline $fd2 $q | |
2107 | } | |
2108 | flush $fd2 | |
2109 | ||
2110 | for {set i 0} {$i < 100000} {incr i} { | |
2111 | gets $fd2 line | |
2112 | gets $fd2 count | |
2113 | set count [string range $count 1 end] | |
2114 | set val [read $fd2 $count] | |
2115 | read $fd2 2 | |
2116 | } | |
2117 | close $fd2 | |
2118 | set _ 1 | |
2119 | } {1} | |
2120 | ||
2121 | test {MUTLI / EXEC basics} { | |
2122 | $r del mylist | |
2123 | $r rpush mylist a | |
2124 | $r rpush mylist b | |
2125 | $r rpush mylist c | |
2126 | $r multi | |
2127 | set v1 [$r lrange mylist 0 -1] | |
2128 | set v2 [$r ping] | |
2129 | set v3 [$r exec] | |
2130 | list $v1 $v2 $v3 | |
2131 | } {QUEUED QUEUED {{a b c} PONG}} | |
2132 | ||
2133 | test {DISCARD} { | |
2134 | $r del mylist | |
2135 | $r rpush mylist a | |
2136 | $r rpush mylist b | |
2137 | $r rpush mylist c | |
2138 | $r multi | |
2139 | set v1 [$r del mylist] | |
2140 | set v2 [$r discard] | |
2141 | set v3 [$r lrange mylist 0 -1] | |
2142 | list $v1 $v2 $v3 | |
2143 | } {QUEUED OK {a b c}} | |
2144 | ||
2145 | test {APPEND basics} { | |
2146 | list [$r append foo bar] [$r get foo] \ | |
2147 | [$r append foo 100] [$r get foo] | |
2148 | } {3 bar 6 bar100} | |
2149 | ||
2150 | test {APPEND fuzzing} { | |
2151 | set err {} | |
2152 | foreach type {binary alpha compr} { | |
2153 | set buf {} | |
2154 | $r del x | |
2155 | for {set i 0} {$i < 1000} {incr i} { | |
2156 | set bin [randstring 0 10 $type] | |
2157 | append buf $bin | |
2158 | $r append x $bin | |
2159 | } | |
2160 | if {$buf != [$r get x]} { | |
2161 | set err "Expected '$buf' found '[$r get x]'" | |
2162 | break | |
2163 | } | |
2164 | } | |
2165 | set _ $err | |
2166 | } {} | |
2167 | ||
2168 | # Leave the user with a clean DB before to exit | |
2169 | test {FLUSHDB} { | |
2170 | set aux {} | |
2171 | $r select 9 | |
2172 | $r flushdb | |
2173 | lappend aux [$r dbsize] | |
2174 | $r select 10 | |
2175 | $r flushdb | |
2176 | lappend aux [$r dbsize] | |
2177 | } {0 0} | |
2178 | ||
2179 | test {Perform a final SAVE to leave a clean DB on disk} { | |
2180 | $r save | |
2181 | } {OK} | |
2182 | ||
2183 | catch { | |
2184 | if {[string match {*Darwin*} [exec uname -a]]} { | |
2185 | test {Check for memory leaks} { | |
2186 | exec leaks redis-server | |
2187 | } {*0 leaks*} | |
2188 | } | |
2189 | } | |
2190 | ||
2191 | puts "\n[expr $::passed+$::failed] tests, $::passed passed, $::failed failed" | |
2192 | if {$::failed > 0} { | |
2193 | puts "\n*** WARNING!!! $::failed FAILED TESTS ***\n" | |
2194 | } | |
2195 | } | |
2196 | ||
2197 | proc stress {} { | |
2198 | set r [redis $::host $::port] | |
2199 | $r select 9 | |
2200 | $r flushdb | |
2201 | while 1 { | |
2202 | set randkey [expr int(rand()*10000)] | |
2203 | set randval [expr int(rand()*10000)] | |
2204 | set randidx0 [expr int(rand()*10)] | |
2205 | set randidx1 [expr int(rand()*10)] | |
2206 | set cmd [expr int(rand()*20)] | |
2207 | catch { | |
2208 | if {$cmd == 0} {$r set $randkey $randval} | |
2209 | if {$cmd == 1} {$r get $randkey} | |
2210 | if {$cmd == 2} {$r incr $randkey} | |
2211 | if {$cmd == 3} {$r lpush $randkey $randval} | |
2212 | if {$cmd == 4} {$r rpop $randkey} | |
2213 | if {$cmd == 5} {$r del $randkey} | |
2214 | if {$cmd == 6} {$r llen $randkey} | |
2215 | if {$cmd == 7} {$r lrange $randkey $randidx0 $randidx1} | |
2216 | if {$cmd == 8} {$r ltrim $randkey $randidx0 $randidx1} | |
2217 | if {$cmd == 9} {$r lindex $randkey $randidx0} | |
2218 | if {$cmd == 10} {$r lset $randkey $randidx0 $randval} | |
2219 | if {$cmd == 11} {$r sadd $randkey $randval} | |
2220 | if {$cmd == 12} {$r srem $randkey $randval} | |
2221 | if {$cmd == 13} {$r smove $randkey $randval} | |
2222 | if {$cmd == 14} {$r scard $randkey} | |
2223 | if {$cmd == 15} {$r expire $randkey [expr $randval%60]} | |
2224 | } | |
2225 | flush stdout | |
2226 | } | |
2227 | $r flushdb | |
2228 | $r close | |
2229 | } | |
2230 | ||
2231 | # Set a few configuration defaults | |
2232 | set ::host 127.0.0.1 | |
2233 | set ::port 6379 | |
2234 | set ::stress 0 | |
2235 | set ::traceleaks 0 | |
2236 | set ::flush 0 | |
2237 | set ::first 0 | |
2238 | set ::last 1000000 | |
2239 | ||
2240 | # Parse arguments | |
2241 | for {set j 0} {$j < [llength $argv]} {incr j} { | |
2242 | set opt [lindex $argv $j] | |
2243 | set arg [lindex $argv [expr $j+1]] | |
2244 | set lastarg [expr {$arg eq {}}] | |
2245 | if {$opt eq {-h} && !$lastarg} { | |
2246 | set ::host $arg | |
2247 | incr j | |
2248 | } elseif {$opt eq {-p} && !$lastarg} { | |
2249 | set ::port $arg | |
2250 | incr j | |
2251 | } elseif {$opt eq {--stress}} { | |
2252 | set ::stress 1 | |
2253 | } elseif {$opt eq {--trace-leaks}} { | |
2254 | set ::traceleaks 1 | |
2255 | } elseif {$opt eq {--flush}} { | |
2256 | set ::flush 1 | |
2257 | } elseif {$opt eq {--first} && !$lastarg} { | |
2258 | set ::first $arg | |
2259 | incr j | |
2260 | } elseif {$opt eq {--last} && !$lastarg} { | |
2261 | set ::last $arg | |
2262 | incr j | |
2263 | } else { | |
2264 | puts "Wrong argument: $opt" | |
2265 | exit 1 | |
2266 | } | |
2267 | } | |
2268 | ||
2269 | # Before to run the test check if DB 9 and DB 10 are empty | |
2270 | set r [redis $::host $::port] | |
2271 | ||
2272 | if {$::flush} { | |
2273 | $r flushall | |
2274 | } | |
2275 | ||
2276 | $r select 9 | |
2277 | set db9size [$r dbsize] | |
2278 | $r select 10 | |
2279 | set db10size [$r dbsize] | |
2280 | if {$db9size != 0 || $db10size != 0} { | |
2281 | puts "Can't run the tests against DB 9 and 10: DBs are not empty." | |
2282 | exit 1 | |
2283 | } | |
2284 | $r close | |
2285 | unset r | |
2286 | unset db9size | |
2287 | unset db10size | |
2288 | ||
2289 | puts "Testing Redis, host $::host, port $::port" | |
2290 | if {$::stress} { | |
2291 | stress | |
2292 | } else { | |
2293 | main | |
2294 | } |