PageRenderTime 52ms CodeModel.GetById 19ms RepoModel.GetById 1ms app.codeStats 0ms

/workers/redis-2.0.0-rc2/test-redis.tcl

https://bitbucket.org/beno/pdfator
TCL | 2331 lines | 2079 code | 222 blank | 30 comment | 201 complexity | 871f60eaf3a9eaf649c2856a60bbb2e3 MD5 | raw file
Possible License(s): BSD-3-Clause

Large files files are truncated, but you can click here to view the full file

  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. set tcl_precision 17
  6. source tests/support/redis.tcl
  7. set ::passed 0
  8. set ::failed 0
  9. set ::testnum 0
  10. proc test {name code okpattern} {
  11. incr ::testnum
  12. if {$::testnum < $::first || $::testnum > $::last} return
  13. puts -nonewline [format "%-70s " "#$::testnum $name"]
  14. flush stdout
  15. set retval [uplevel 1 $code]
  16. if {$okpattern eq $retval || [string match $okpattern $retval]} {
  17. puts "PASSED"
  18. incr ::passed
  19. } else {
  20. puts "!! ERROR expected\n'$okpattern'\nbut got\n'$retval'"
  21. incr ::failed
  22. }
  23. if {$::traceleaks} {
  24. if {![string match {*0 leaks*} [exec leaks redis-server]]} {
  25. puts "--------- Test $::testnum LEAKED! --------"
  26. exit 1
  27. }
  28. }
  29. }
  30. proc randstring {min max {type binary}} {
  31. set len [expr {$min+int(rand()*($max-$min+1))}]
  32. set output {}
  33. if {$type eq {binary}} {
  34. set minval 0
  35. set maxval 255
  36. } elseif {$type eq {alpha}} {
  37. set minval 48
  38. set maxval 122
  39. } elseif {$type eq {compr}} {
  40. set minval 48
  41. set maxval 52
  42. }
  43. while {$len} {
  44. append output [format "%c" [expr {$minval+int(rand()*($maxval-$minval+1))}]]
  45. incr len -1
  46. }
  47. return $output
  48. }
  49. # Useful for some test
  50. proc zlistAlikeSort {a b} {
  51. if {[lindex $a 0] > [lindex $b 0]} {return 1}
  52. if {[lindex $a 0] < [lindex $b 0]} {return -1}
  53. string compare [lindex $a 1] [lindex $b 1]
  54. }
  55. proc waitForBgsave r {
  56. while 1 {
  57. set i [$r info]
  58. if {[string match {*bgsave_in_progress:1*} $i]} {
  59. puts -nonewline "\nWaiting for background save to finish... "
  60. flush stdout
  61. after 1000
  62. } else {
  63. break
  64. }
  65. }
  66. }
  67. proc waitForBgrewriteaof r {
  68. while 1 {
  69. set i [$r info]
  70. if {[string match {*bgrewriteaof_in_progress:1*} $i]} {
  71. puts -nonewline "\nWaiting for background AOF rewrite to finish... "
  72. flush stdout
  73. after 1000
  74. } else {
  75. break
  76. }
  77. }
  78. }
  79. proc randomInt {max} {
  80. expr {int(rand()*$max)}
  81. }
  82. proc randpath args {
  83. set path [expr {int(rand()*[llength $args])}]
  84. uplevel 1 [lindex $args $path]
  85. }
  86. proc randomValue {} {
  87. randpath {
  88. # Small enough to likely collide
  89. randomInt 1000
  90. } {
  91. # 32 bit compressible signed/unsigned
  92. randpath {randomInt 2000000000} {randomInt 4000000000}
  93. } {
  94. # 64 bit
  95. randpath {randomInt 1000000000000}
  96. } {
  97. # Random string
  98. randpath {randstring 0 256 alpha} \
  99. {randstring 0 256 compr} \
  100. {randstring 0 256 binary}
  101. }
  102. }
  103. proc randomKey {} {
  104. randpath {
  105. # Small enough to likely collide
  106. randomInt 1000
  107. } {
  108. # 32 bit compressible signed/unsigned
  109. randpath {randomInt 2000000000} {randomInt 4000000000}
  110. } {
  111. # 64 bit
  112. randpath {randomInt 1000000000000}
  113. } {
  114. # Random string
  115. randpath {randstring 1 256 alpha} \
  116. {randstring 1 256 compr}
  117. }
  118. }
  119. proc createComplexDataset {r ops} {
  120. for {set j 0} {$j < $ops} {incr j} {
  121. set k [randomKey]
  122. set f [randomValue]
  123. set v [randomValue]
  124. randpath {
  125. set d [expr {rand()}]
  126. } {
  127. set d [expr {rand()}]
  128. } {
  129. set d [expr {rand()}]
  130. } {
  131. set d [expr {rand()}]
  132. } {
  133. set d [expr {rand()}]
  134. } {
  135. randpath {set d +inf} {set d -inf}
  136. }
  137. set t [$r type $k]
  138. if {$t eq {none}} {
  139. randpath {
  140. $r set $k $v
  141. } {
  142. $r lpush $k $v
  143. } {
  144. $r sadd $k $v
  145. } {
  146. $r zadd $k $d $v
  147. } {
  148. $r hset $k $f $v
  149. }
  150. set t [$r type $k]
  151. }
  152. switch $t {
  153. {string} {
  154. # Nothing to do
  155. }
  156. {list} {
  157. randpath {$r lpush $k $v} \
  158. {$r rpush $k $v} \
  159. {$r lrem $k 0 $v} \
  160. {$r rpop $k} \
  161. {$r lpop $k}
  162. }
  163. {set} {
  164. randpath {$r sadd $k $v} \
  165. {$r srem $k $v}
  166. }
  167. {zset} {
  168. randpath {$r zadd $k $d $v} \
  169. {$r zrem $k $v}
  170. }
  171. {hash} {
  172. randpath {$r hset $k $f $v} \
  173. {$r hdel $k $f}
  174. }
  175. }
  176. }
  177. }
  178. proc datasetDigest r {
  179. $r debug digest
  180. }
  181. proc main {} {
  182. set r [redis $::host $::port]
  183. $r select 9
  184. set err ""
  185. set res ""
  186. # The following AUTH test should be enabled only when requirepass
  187. # <PASSWORD> is set in redis.conf and redis-server was started with
  188. # redis.conf as the first argument.
  189. #test {AUTH with requirepass in redis.conf} {
  190. # $r auth foobared
  191. #} {OK}
  192. test {DEL all keys to start with a clean DB} {
  193. foreach key [$r keys *] {$r del $key}
  194. $r dbsize
  195. } {0}
  196. test {SET and GET an item} {
  197. $r set x foobar
  198. $r get x
  199. } {foobar}
  200. test {SET and GET an empty item} {
  201. $r set x {}
  202. $r get x
  203. } {}
  204. test {DEL against a single item} {
  205. $r del x
  206. $r get x
  207. } {}
  208. test {Vararg DEL} {
  209. $r set foo1 a
  210. $r set foo2 b
  211. $r set foo3 c
  212. list [$r del foo1 foo2 foo3 foo4] [$r mget foo1 foo2 foo3]
  213. } {3 {{} {} {}}}
  214. test {KEYS with pattern} {
  215. foreach key {key_x key_y key_z foo_a foo_b foo_c} {
  216. $r set $key hello
  217. }
  218. lsort [$r keys foo*]
  219. } {foo_a foo_b foo_c}
  220. test {KEYS to get all keys} {
  221. lsort [$r keys *]
  222. } {foo_a foo_b foo_c key_x key_y key_z}
  223. test {DBSIZE} {
  224. $r dbsize
  225. } {6}
  226. test {DEL all keys} {
  227. foreach key [$r keys *] {$r del $key}
  228. $r dbsize
  229. } {0}
  230. test {Very big payload in GET/SET} {
  231. set buf [string repeat "abcd" 1000000]
  232. $r set foo $buf
  233. $r get foo
  234. } [string repeat "abcd" 1000000]
  235. test {Very big payload random access} {
  236. set err {}
  237. array set payload {}
  238. for {set j 0} {$j < 100} {incr j} {
  239. set size [expr 1+[randomInt 100000]]
  240. set buf [string repeat "pl-$j" $size]
  241. set payload($j) $buf
  242. $r set bigpayload_$j $buf
  243. }
  244. for {set j 0} {$j < 1000} {incr j} {
  245. set index [randomInt 100]
  246. set buf [$r get bigpayload_$index]
  247. if {$buf != $payload($index)} {
  248. set err "Values differ: I set '$payload($index)' but I read back '$buf'"
  249. break
  250. }
  251. }
  252. unset payload
  253. set _ $err
  254. } {}
  255. test {SET 10000 numeric keys and access all them in reverse order} {
  256. set err {}
  257. for {set x 0} {$x < 10000} {incr x} {
  258. $r set $x $x
  259. }
  260. set sum 0
  261. for {set x 9999} {$x >= 0} {incr x -1} {
  262. set val [$r get $x]
  263. if {$val ne $x} {
  264. set err "Eleemnt at position $x is $val instead of $x"
  265. break
  266. }
  267. }
  268. set _ $err
  269. } {}
  270. test {DBSIZE should be 10101 now} {
  271. $r dbsize
  272. } {10101}
  273. test {INCR against non existing key} {
  274. set res {}
  275. append res [$r incr novar]
  276. append res [$r get novar]
  277. } {11}
  278. test {INCR against key created by incr itself} {
  279. $r incr novar
  280. } {2}
  281. test {INCR against key originally set with SET} {
  282. $r set novar 100
  283. $r incr novar
  284. } {101}
  285. test {INCR over 32bit value} {
  286. $r set novar 17179869184
  287. $r incr novar
  288. } {17179869185}
  289. test {INCRBY over 32bit value with over 32bit increment} {
  290. $r set novar 17179869184
  291. $r incrby novar 17179869184
  292. } {34359738368}
  293. test {INCR fails against key with spaces (no integer encoded)} {
  294. $r set novar " 11 "
  295. catch {$r incr novar} err
  296. format $err
  297. } {ERR*}
  298. test {INCR fails against a key holding a list} {
  299. $r rpush mylist 1
  300. catch {$r incr mylist} err
  301. $r rpop mylist
  302. format $err
  303. } {ERR*}
  304. test {DECRBY over 32bit value with over 32bit increment, negative res} {
  305. $r set novar 17179869184
  306. $r decrby novar 17179869185
  307. } {-1}
  308. test {SETNX target key missing} {
  309. $r setnx novar2 foobared
  310. $r get novar2
  311. } {foobared}
  312. test {SETNX target key exists} {
  313. $r setnx novar2 blabla
  314. $r get novar2
  315. } {foobared}
  316. test {SETNX will overwrite EXPIREing key} {
  317. $r set x 10
  318. $r expire x 10000
  319. $r setnx x 20
  320. $r get x
  321. } {20}
  322. test {EXISTS} {
  323. set res {}
  324. $r set newkey test
  325. append res [$r exists newkey]
  326. $r del newkey
  327. append res [$r exists newkey]
  328. } {10}
  329. test {Zero length value in key. SET/GET/EXISTS} {
  330. $r set emptykey {}
  331. set res [$r get emptykey]
  332. append res [$r exists emptykey]
  333. $r del emptykey
  334. append res [$r exists emptykey]
  335. } {10}
  336. test {Commands pipelining} {
  337. set fd [$r channel]
  338. puts -nonewline $fd "SET k1 4\r\nxyzk\r\nGET k1\r\nPING\r\n"
  339. flush $fd
  340. set res {}
  341. append res [string match OK* [::redis::redis_read_reply $fd]]
  342. append res [::redis::redis_read_reply $fd]
  343. append res [string match PONG* [::redis::redis_read_reply $fd]]
  344. format $res
  345. } {1xyzk1}
  346. test {Non existing command} {
  347. catch {$r foobaredcommand} err
  348. string match ERR* $err
  349. } {1}
  350. test {Basic LPUSH, RPUSH, LLENGTH, LINDEX} {
  351. set res [$r lpush mylist a]
  352. append res [$r lpush mylist b]
  353. append res [$r rpush mylist c]
  354. append res [$r llen mylist]
  355. append res [$r rpush anotherlist d]
  356. append res [$r lpush anotherlist e]
  357. append res [$r llen anotherlist]
  358. append res [$r lindex mylist 0]
  359. append res [$r lindex mylist 1]
  360. append res [$r lindex mylist 2]
  361. append res [$r lindex anotherlist 0]
  362. append res [$r lindex anotherlist 1]
  363. list $res [$r lindex mylist 100]
  364. } {1233122baced {}}
  365. test {DEL a list} {
  366. $r del mylist
  367. $r exists mylist
  368. } {0}
  369. test {Create a long list and check every single element with LINDEX} {
  370. set ok 0
  371. for {set i 0} {$i < 1000} {incr i} {
  372. $r rpush mylist $i
  373. }
  374. for {set i 0} {$i < 1000} {incr i} {
  375. if {[$r lindex mylist $i] eq $i} {incr ok}
  376. if {[$r lindex mylist [expr (-$i)-1]] eq [expr 999-$i]} {
  377. incr ok
  378. }
  379. }
  380. format $ok
  381. } {2000}
  382. test {Test elements with LINDEX in random access} {
  383. set ok 0
  384. for {set i 0} {$i < 1000} {incr i} {
  385. set rint [expr int(rand()*1000)]
  386. if {[$r lindex mylist $rint] eq $rint} {incr ok}
  387. if {[$r lindex mylist [expr (-$rint)-1]] eq [expr 999-$rint]} {
  388. incr ok
  389. }
  390. }
  391. format $ok
  392. } {2000}
  393. test {Check if the list is still ok after a DEBUG RELOAD} {
  394. $r debug reload
  395. set ok 0
  396. for {set i 0} {$i < 1000} {incr i} {
  397. set rint [expr int(rand()*1000)]
  398. if {[$r lindex mylist $rint] eq $rint} {incr ok}
  399. if {[$r lindex mylist [expr (-$rint)-1]] eq [expr 999-$rint]} {
  400. incr ok
  401. }
  402. }
  403. format $ok
  404. } {2000}
  405. test {LLEN against non-list value error} {
  406. $r del mylist
  407. $r set mylist foobar
  408. catch {$r llen mylist} err
  409. format $err
  410. } {ERR*}
  411. test {LLEN against non existing key} {
  412. $r llen not-a-key
  413. } {0}
  414. test {LINDEX against non-list value error} {
  415. catch {$r lindex mylist 0} err
  416. format $err
  417. } {ERR*}
  418. test {LINDEX against non existing key} {
  419. $r lindex not-a-key 10
  420. } {}
  421. test {LPUSH against non-list value error} {
  422. catch {$r lpush mylist 0} err
  423. format $err
  424. } {ERR*}
  425. test {RPUSH against non-list value error} {
  426. catch {$r rpush mylist 0} err
  427. format $err
  428. } {ERR*}
  429. test {RPOPLPUSH base case} {
  430. $r del mylist
  431. $r rpush mylist a
  432. $r rpush mylist b
  433. $r rpush mylist c
  434. $r rpush mylist d
  435. set v1 [$r rpoplpush mylist newlist]
  436. set v2 [$r rpoplpush mylist newlist]
  437. set l1 [$r lrange mylist 0 -1]
  438. set l2 [$r lrange newlist 0 -1]
  439. list $v1 $v2 $l1 $l2
  440. } {d c {a b} {c d}}
  441. test {RPOPLPUSH with the same list as src and dst} {
  442. $r del mylist
  443. $r rpush mylist a
  444. $r rpush mylist b
  445. $r rpush mylist c
  446. set l1 [$r lrange mylist 0 -1]
  447. set v [$r rpoplpush mylist mylist]
  448. set l2 [$r lrange mylist 0 -1]
  449. list $l1 $v $l2
  450. } {{a b c} c {c a b}}
  451. test {RPOPLPUSH target list already exists} {
  452. $r del mylist
  453. $r del newlist
  454. $r rpush mylist a
  455. $r rpush mylist b
  456. $r rpush mylist c
  457. $r rpush mylist d
  458. $r rpush newlist x
  459. set v1 [$r rpoplpush mylist newlist]
  460. set v2 [$r rpoplpush mylist newlist]
  461. set l1 [$r lrange mylist 0 -1]
  462. set l2 [$r lrange newlist 0 -1]
  463. list $v1 $v2 $l1 $l2
  464. } {d c {a b} {c d x}}
  465. test {RPOPLPUSH against non existing key} {
  466. $r del mylist
  467. $r del newlist
  468. set v1 [$r rpoplpush mylist newlist]
  469. list $v1 [$r exists mylist] [$r exists newlist]
  470. } {{} 0 0}
  471. test {RPOPLPUSH against non list src key} {
  472. $r del mylist
  473. $r del newlist
  474. $r set mylist x
  475. catch {$r rpoplpush mylist newlist} err
  476. list [$r type mylist] [$r exists newlist] [string range $err 0 2]
  477. } {string 0 ERR}
  478. test {RPOPLPUSH against non list dst key} {
  479. $r del mylist
  480. $r del newlist
  481. $r rpush mylist a
  482. $r rpush mylist b
  483. $r rpush mylist c
  484. $r rpush mylist d
  485. $r set newlist x
  486. catch {$r rpoplpush mylist newlist} err
  487. list [$r lrange mylist 0 -1] [$r type newlist] [string range $err 0 2]
  488. } {{a b c d} string ERR}
  489. test {RPOPLPUSH against non existing src key} {
  490. $r del mylist
  491. $r del newlist
  492. $r rpoplpush mylist newlist
  493. } {}
  494. test {RENAME basic usage} {
  495. $r set mykey hello
  496. $r rename mykey mykey1
  497. $r rename mykey1 mykey2
  498. $r get mykey2
  499. } {hello}
  500. test {RENAME source key should no longer exist} {
  501. $r exists mykey
  502. } {0}
  503. test {RENAME against already existing key} {
  504. $r set mykey a
  505. $r set mykey2 b
  506. $r rename mykey2 mykey
  507. set res [$r get mykey]
  508. append res [$r exists mykey2]
  509. } {b0}
  510. test {RENAMENX basic usage} {
  511. $r del mykey
  512. $r del mykey2
  513. $r set mykey foobar
  514. $r renamenx mykey mykey2
  515. set res [$r get mykey2]
  516. append res [$r exists mykey]
  517. } {foobar0}
  518. test {RENAMENX against already existing key} {
  519. $r set mykey foo
  520. $r set mykey2 bar
  521. $r renamenx mykey mykey2
  522. } {0}
  523. test {RENAMENX against already existing key (2)} {
  524. set res [$r get mykey]
  525. append res [$r get mykey2]
  526. } {foobar}
  527. test {RENAME against non existing source key} {
  528. catch {$r rename nokey foobar} err
  529. format $err
  530. } {ERR*}
  531. test {RENAME where source and dest key is the same} {
  532. catch {$r rename mykey mykey} err
  533. format $err
  534. } {ERR*}
  535. test {DEL all keys again (DB 0)} {
  536. foreach key [$r keys *] {
  537. $r del $key
  538. }
  539. $r dbsize
  540. } {0}
  541. test {DEL all keys again (DB 1)} {
  542. $r select 10
  543. foreach key [$r keys *] {
  544. $r del $key
  545. }
  546. set res [$r dbsize]
  547. $r select 9
  548. format $res
  549. } {0}
  550. test {MOVE basic usage} {
  551. $r set mykey foobar
  552. $r move mykey 10
  553. set res {}
  554. lappend res [$r exists mykey]
  555. lappend res [$r dbsize]
  556. $r select 10
  557. lappend res [$r get mykey]
  558. lappend res [$r dbsize]
  559. $r select 9
  560. format $res
  561. } [list 0 0 foobar 1]
  562. test {MOVE against key existing in the target DB} {
  563. $r set mykey hello
  564. $r move mykey 10
  565. } {0}
  566. test {SET/GET keys in different DBs} {
  567. $r set a hello
  568. $r set b world
  569. $r select 10
  570. $r set a foo
  571. $r set b bared
  572. $r select 9
  573. set res {}
  574. lappend res [$r get a]
  575. lappend res [$r get b]
  576. $r select 10
  577. lappend res [$r get a]
  578. lappend res [$r get b]
  579. $r select 9
  580. format $res
  581. } {hello world foo bared}
  582. test {Basic LPOP/RPOP} {
  583. $r del mylist
  584. $r rpush mylist 1
  585. $r rpush mylist 2
  586. $r lpush mylist 0
  587. list [$r lpop mylist] [$r rpop mylist] [$r lpop mylist] [$r llen mylist]
  588. } [list 0 2 1 0]
  589. test {LPOP/RPOP against empty list} {
  590. $r lpop mylist
  591. } {}
  592. test {LPOP against non list value} {
  593. $r set notalist foo
  594. catch {$r lpop notalist} err
  595. format $err
  596. } {ERR*kind*}
  597. test {Mass LPUSH/LPOP} {
  598. set sum 0
  599. for {set i 0} {$i < 1000} {incr i} {
  600. $r lpush mylist $i
  601. incr sum $i
  602. }
  603. set sum2 0
  604. for {set i 0} {$i < 500} {incr i} {
  605. incr sum2 [$r lpop mylist]
  606. incr sum2 [$r rpop mylist]
  607. }
  608. expr $sum == $sum2
  609. } {1}
  610. test {LRANGE basics} {
  611. for {set i 0} {$i < 10} {incr i} {
  612. $r rpush mylist $i
  613. }
  614. list [$r lrange mylist 1 -2] \
  615. [$r lrange mylist -3 -1] \
  616. [$r lrange mylist 4 4]
  617. } {{1 2 3 4 5 6 7 8} {7 8 9} 4}
  618. test {LRANGE inverted indexes} {
  619. $r lrange mylist 6 2
  620. } {}
  621. test {LRANGE out of range indexes including the full list} {
  622. $r lrange mylist -1000 1000
  623. } {0 1 2 3 4 5 6 7 8 9}
  624. test {LRANGE against non existing key} {
  625. $r lrange nosuchkey 0 1
  626. } {}
  627. test {LTRIM basics} {
  628. $r del mylist
  629. for {set i 0} {$i < 100} {incr i} {
  630. $r lpush mylist $i
  631. $r ltrim mylist 0 4
  632. }
  633. $r lrange mylist 0 -1
  634. } {99 98 97 96 95}
  635. test {LTRIM stress testing} {
  636. set mylist {}
  637. set err {}
  638. for {set i 0} {$i < 20} {incr i} {
  639. lappend mylist $i
  640. }
  641. for {set j 0} {$j < 100} {incr j} {
  642. # Fill the list
  643. $r del mylist
  644. for {set i 0} {$i < 20} {incr i} {
  645. $r rpush mylist $i
  646. }
  647. # Trim at random
  648. set a [randomInt 20]
  649. set b [randomInt 20]
  650. $r ltrim mylist $a $b
  651. if {[$r lrange mylist 0 -1] ne [lrange $mylist $a $b]} {
  652. set err "[$r lrange mylist 0 -1] != [lrange $mylist $a $b]"
  653. break
  654. }
  655. }
  656. set _ $err
  657. } {}
  658. test {LSET} {
  659. $r del mylist
  660. foreach x {99 98 97 96 95} {
  661. $r rpush mylist $x
  662. }
  663. $r lset mylist 1 foo
  664. $r lset mylist -1 bar
  665. $r lrange mylist 0 -1
  666. } {99 foo 97 96 bar}
  667. test {LSET out of range index} {
  668. catch {$r lset mylist 10 foo} err
  669. format $err
  670. } {ERR*range*}
  671. test {LSET against non existing key} {
  672. catch {$r lset nosuchkey 10 foo} err
  673. format $err
  674. } {ERR*key*}
  675. test {LSET against non list value} {
  676. $r set nolist foobar
  677. catch {$r lset nolist 0 foo} err
  678. format $err
  679. } {ERR*value*}
  680. test {SADD, SCARD, SISMEMBER, SMEMBERS basics} {
  681. $r sadd myset foo
  682. $r sadd myset bar
  683. list [$r scard myset] [$r sismember myset foo] \
  684. [$r sismember myset bar] [$r sismember myset bla] \
  685. [lsort [$r smembers myset]]
  686. } {2 1 1 0 {bar foo}}
  687. test {SADD adding the same element multiple times} {
  688. $r sadd myset foo
  689. $r sadd myset foo
  690. $r sadd myset foo
  691. $r scard myset
  692. } {2}
  693. test {SADD against non set} {
  694. catch {$r sadd mylist foo} err
  695. format $err
  696. } {ERR*kind*}
  697. test {SREM basics} {
  698. $r sadd myset ciao
  699. $r srem myset foo
  700. lsort [$r smembers myset]
  701. } {bar ciao}
  702. test {Mass SADD and SINTER with two sets} {
  703. for {set i 0} {$i < 1000} {incr i} {
  704. $r sadd set1 $i
  705. $r sadd set2 [expr $i+995]
  706. }
  707. lsort [$r sinter set1 set2]
  708. } {995 996 997 998 999}
  709. test {SUNION with two sets} {
  710. lsort [$r sunion set1 set2]
  711. } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
  712. test {SINTERSTORE with two sets} {
  713. $r sinterstore setres set1 set2
  714. lsort [$r smembers setres]
  715. } {995 996 997 998 999}
  716. test {SINTERSTORE with two sets, after a DEBUG RELOAD} {
  717. $r debug reload
  718. $r sinterstore setres set1 set2
  719. lsort [$r smembers setres]
  720. } {995 996 997 998 999}
  721. test {SUNIONSTORE with two sets} {
  722. $r sunionstore setres set1 set2
  723. lsort [$r smembers setres]
  724. } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
  725. test {SUNIONSTORE against non existing keys} {
  726. $r set setres xxx
  727. list [$r sunionstore setres foo111 bar222] [$r exists xxx]
  728. } {0 0}
  729. test {SINTER against three sets} {
  730. $r sadd set3 999
  731. $r sadd set3 995
  732. $r sadd set3 1000
  733. $r sadd set3 2000
  734. lsort [$r sinter set1 set2 set3]
  735. } {995 999}
  736. test {SINTERSTORE with three sets} {
  737. $r sinterstore setres set1 set2 set3
  738. lsort [$r smembers setres]
  739. } {995 999}
  740. test {SUNION with non existing keys} {
  741. lsort [$r sunion nokey1 set1 set2 nokey2]
  742. } [lsort -uniq "[$r smembers set1] [$r smembers set2]"]
  743. test {SDIFF with two sets} {
  744. for {set i 5} {$i < 1000} {incr i} {
  745. $r sadd set4 $i
  746. }
  747. lsort [$r sdiff set1 set4]
  748. } {0 1 2 3 4}
  749. test {SDIFF with three sets} {
  750. $r sadd set5 0
  751. lsort [$r sdiff set1 set4 set5]
  752. } {1 2 3 4}
  753. test {SDIFFSTORE with three sets} {
  754. $r sdiffstore sres set1 set4 set5
  755. lsort [$r smembers sres]
  756. } {1 2 3 4}
  757. test {SPOP basics} {
  758. $r del myset
  759. $r sadd myset 1
  760. $r sadd myset 2
  761. $r sadd myset 3
  762. list [lsort [list [$r spop myset] [$r spop myset] [$r spop myset]]] [$r scard myset]
  763. } {{1 2 3} 0}
  764. test {SAVE - make sure there are all the types as values} {
  765. # Wait for a background saving in progress to terminate
  766. waitForBgsave $r
  767. $r lpush mysavelist hello
  768. $r lpush mysavelist world
  769. $r set myemptykey {}
  770. $r set mynormalkey {blablablba}
  771. $r zadd mytestzset 10 a
  772. $r zadd mytestzset 20 b
  773. $r zadd mytestzset 30 c
  774. $r save
  775. } {OK}
  776. test {SRANDMEMBER} {
  777. $r del myset
  778. $r sadd myset a
  779. $r sadd myset b
  780. $r sadd myset c
  781. unset -nocomplain myset
  782. array set myset {}
  783. for {set i 0} {$i < 100} {incr i} {
  784. set myset([$r srandmember myset]) 1
  785. }
  786. lsort [array names myset]
  787. } {a b c}
  788. test {SORT ALPHA against integer encoded strings} {
  789. $r del mylist
  790. $r lpush mylist 2
  791. $r lpush mylist 1
  792. $r lpush mylist 3
  793. $r lpush mylist 10
  794. $r sort mylist alpha
  795. } {1 10 2 3}
  796. test {Create a random list and a random set} {
  797. set tosort {}
  798. array set seenrand {}
  799. for {set i 0} {$i < 10000} {incr i} {
  800. while 1 {
  801. # Make sure all the weights are different because
  802. # Redis does not use a stable sort but Tcl does.
  803. randpath {
  804. set rint [expr int(rand()*1000000)]
  805. } {
  806. set rint [expr rand()]
  807. }
  808. if {![info exists seenrand($rint)]} break
  809. }
  810. set seenrand($rint) x
  811. $r lpush tosort $i
  812. $r sadd tosort-set $i
  813. $r set weight_$i $rint
  814. $r hset wobj_$i weight $rint
  815. lappend tosort [list $i $rint]
  816. }
  817. set sorted [lsort -index 1 -real $tosort]
  818. set res {}
  819. for {set i 0} {$i < 10000} {incr i} {
  820. lappend res [lindex $sorted $i 0]
  821. }
  822. format {}
  823. } {}
  824. test {SORT with BY against the newly created list} {
  825. $r sort tosort {BY weight_*}
  826. } $res
  827. test {SORT with BY (hash field) against the newly created list} {
  828. $r sort tosort {BY wobj_*->weight}
  829. } $res
  830. test {SORT with GET (key+hash) with sanity check of each element (list)} {
  831. set err {}
  832. set l1 [$r sort tosort GET # GET weight_*]
  833. set l2 [$r sort tosort GET # GET wobj_*->weight]
  834. foreach {id1 w1} $l1 {id2 w2} $l2 {
  835. set realweight [$r get weight_$id1]
  836. if {$id1 != $id2} {
  837. set err "ID mismatch $id1 != $id2"
  838. break
  839. }
  840. if {$realweight != $w1 || $realweight != $w2} {
  841. set err "Weights mismatch! w1: $w1 w2: $w2 real: $realweight"
  842. break
  843. }
  844. }
  845. set _ $err
  846. } {}
  847. test {SORT with BY, but against the newly created set} {
  848. $r sort tosort-set {BY weight_*}
  849. } $res
  850. test {SORT with BY (hash field), but against the newly created set} {
  851. $r sort tosort-set {BY wobj_*->weight}
  852. } $res
  853. test {SORT with BY and STORE against the newly created list} {
  854. $r sort tosort {BY weight_*} store sort-res
  855. $r lrange sort-res 0 -1
  856. } $res
  857. test {SORT with BY (hash field) and STORE against the newly created list} {
  858. $r sort tosort {BY wobj_*->weight} store sort-res
  859. $r lrange sort-res 0 -1
  860. } $res
  861. test {SORT direct, numeric, against the newly created list} {
  862. $r sort tosort
  863. } [lsort -integer $res]
  864. test {SORT decreasing sort} {
  865. $r sort tosort {DESC}
  866. } [lsort -decreasing -integer $res]
  867. test {SORT speed, sorting 10000 elements list using BY, 100 times} {
  868. set start [clock clicks -milliseconds]
  869. for {set i 0} {$i < 100} {incr i} {
  870. set sorted [$r sort tosort {BY weight_* LIMIT 0 10}]
  871. }
  872. set elapsed [expr [clock clicks -milliseconds]-$start]
  873. puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
  874. flush stdout
  875. format {}
  876. } {}
  877. test {SORT speed, as above but against hash field} {
  878. set start [clock clicks -milliseconds]
  879. for {set i 0} {$i < 100} {incr i} {
  880. set sorted [$r sort tosort {BY wobj_*->weight LIMIT 0 10}]
  881. }
  882. set elapsed [expr [clock clicks -milliseconds]-$start]
  883. puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
  884. flush stdout
  885. format {}
  886. } {}
  887. test {SORT speed, sorting 10000 elements list directly, 100 times} {
  888. set start [clock clicks -milliseconds]
  889. for {set i 0} {$i < 100} {incr i} {
  890. set sorted [$r sort tosort {LIMIT 0 10}]
  891. }
  892. set elapsed [expr [clock clicks -milliseconds]-$start]
  893. puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
  894. flush stdout
  895. format {}
  896. } {}
  897. test {SORT speed, pseudo-sorting 10000 elements list, BY <const>, 100 times} {
  898. set start [clock clicks -milliseconds]
  899. for {set i 0} {$i < 100} {incr i} {
  900. set sorted [$r sort tosort {BY nokey LIMIT 0 10}]
  901. }
  902. set elapsed [expr [clock clicks -milliseconds]-$start]
  903. puts -nonewline "\n Average time to sort: [expr double($elapsed)/100] milliseconds "
  904. flush stdout
  905. format {}
  906. } {}
  907. test {SORT regression for issue #19, sorting floats} {
  908. $r flushdb
  909. foreach x {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15} {
  910. $r lpush mylist $x
  911. }
  912. $r sort mylist
  913. } [lsort -real {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15}]
  914. test {SORT with GET #} {
  915. $r del mylist
  916. $r lpush mylist 1
  917. $r lpush mylist 2
  918. $r lpush mylist 3
  919. $r mset weight_1 10 weight_2 5 weight_3 30
  920. $r sort mylist BY weight_* GET #
  921. } {2 1 3}
  922. test {SORT with constant GET} {
  923. $r sort mylist GET foo
  924. } {{} {} {}}
  925. test {LREM, remove all the occurrences} {
  926. $r flushdb
  927. $r rpush mylist foo
  928. $r rpush mylist bar
  929. $r rpush mylist foobar
  930. $r rpush mylist foobared
  931. $r rpush mylist zap
  932. $r rpush mylist bar
  933. $r rpush mylist test
  934. $r rpush mylist foo
  935. set res [$r lrem mylist 0 bar]
  936. list [$r lrange mylist 0 -1] $res
  937. } {{foo foobar foobared zap test foo} 2}
  938. test {LREM, remove the first occurrence} {
  939. set res [$r lrem mylist 1 foo]
  940. list [$r lrange mylist 0 -1] $res
  941. } {{foobar foobared zap test foo} 1}
  942. test {LREM, remove non existing element} {
  943. set res [$r lrem mylist 1 nosuchelement]
  944. list [$r lrange mylist 0 -1] $res
  945. } {{foobar foobared zap test foo} 0}
  946. test {LREM, starting from tail with negative count} {
  947. $r flushdb
  948. $r rpush mylist foo
  949. $r rpush mylist bar
  950. $r rpush mylist foobar
  951. $r rpush mylist foobared
  952. $r rpush mylist zap
  953. $r rpush mylist bar
  954. $r rpush mylist test
  955. $r rpush mylist foo
  956. $r rpush mylist foo
  957. set res [$r lrem mylist -1 bar]
  958. list [$r lrange mylist 0 -1] $res
  959. } {{foo bar foobar foobared zap test foo foo} 1}
  960. test {LREM, starting from tail with negative count (2)} {
  961. set res [$r lrem mylist -2 foo]
  962. list [$r lrange mylist 0 -1] $res
  963. } {{foo bar foobar foobared zap test} 2}
  964. test {LREM, deleting objects that may be encoded as integers} {
  965. $r lpush myotherlist 1
  966. $r lpush myotherlist 2
  967. $r lpush myotherlist 3
  968. $r lrem myotherlist 1 2
  969. $r llen myotherlist
  970. } {2}
  971. test {MGET} {
  972. $r flushdb
  973. $r set foo BAR
  974. $r set bar FOO
  975. $r mget foo bar
  976. } {BAR FOO}
  977. test {MGET against non existing key} {
  978. $r mget foo baazz bar
  979. } {BAR {} FOO}
  980. test {MGET against non-string key} {
  981. $r sadd myset ciao
  982. $r sadd myset bau
  983. $r mget foo baazz bar myset
  984. } {BAR {} FOO {}}
  985. test {RANDOMKEY} {
  986. $r flushdb
  987. $r set foo x
  988. $r set bar y
  989. set foo_seen 0
  990. set bar_seen 0
  991. for {set i 0} {$i < 100} {incr i} {
  992. set rkey [$r randomkey]
  993. if {$rkey eq {foo}} {
  994. set foo_seen 1
  995. }
  996. if {$rkey eq {bar}} {
  997. set bar_seen 1
  998. }
  999. }
  1000. list $foo_seen $bar_seen
  1001. } {1 1}
  1002. test {RANDOMKEY against empty DB} {
  1003. $r flushdb
  1004. $r randomkey
  1005. } {}
  1006. test {RANDOMKEY regression 1} {
  1007. $r flushdb
  1008. $r set x 10
  1009. $r del x
  1010. $r randomkey
  1011. } {}
  1012. test {GETSET (set new value)} {
  1013. list [$r getset foo xyz] [$r get foo]
  1014. } {{} xyz}
  1015. test {GETSET (replace old value)} {
  1016. $r set foo bar
  1017. list [$r getset foo xyz] [$r get foo]
  1018. } {bar xyz}
  1019. test {SMOVE basics} {
  1020. $r sadd myset1 a
  1021. $r sadd myset1 b
  1022. $r sadd myset1 c
  1023. $r sadd myset2 x
  1024. $r sadd myset2 y
  1025. $r sadd myset2 z
  1026. $r smove myset1 myset2 a
  1027. list [lsort [$r smembers myset2]] [lsort [$r smembers myset1]]
  1028. } {{a x y z} {b c}}
  1029. test {SMOVE non existing key} {
  1030. list [$r smove myset1 myset2 foo] [lsort [$r smembers myset2]] [lsort [$r smembers myset1]]
  1031. } {0 {a x y z} {b c}}
  1032. test {SMOVE non existing src set} {
  1033. list [$r smove noset myset2 foo] [lsort [$r smembers myset2]]
  1034. } {0 {a x y z}}
  1035. test {SMOVE non existing dst set} {
  1036. list [$r smove myset2 myset3 y] [lsort [$r smembers myset2]] [lsort [$r smembers myset3]]
  1037. } {1 {a x z} y}
  1038. test {SMOVE wrong src key type} {
  1039. $r set x 10
  1040. catch {$r smove x myset2 foo} err
  1041. format $err
  1042. } {ERR*}
  1043. test {SMOVE wrong dst key type} {
  1044. $r set x 10
  1045. catch {$r smove myset2 x foo} err
  1046. format $err
  1047. } {ERR*}
  1048. test {MSET base case} {
  1049. $r mset x 10 y "foo bar" z "x x x x x x x\n\n\r\n"
  1050. $r mget x y z
  1051. } [list 10 {foo bar} "x x x x x x x\n\n\r\n"]
  1052. test {MSET wrong number of args} {
  1053. catch {$r mset x 10 y "foo bar" z} err
  1054. format $err
  1055. } {*wrong number*}
  1056. test {MSETNX with already existent key} {
  1057. list [$r msetnx x1 xxx y2 yyy x 20] [$r exists x1] [$r exists y2]
  1058. } {0 0 0}
  1059. test {MSETNX with not existing keys} {
  1060. list [$r msetnx x1 xxx y2 yyy] [$r get x1] [$r get y2]
  1061. } {1 xxx yyy}
  1062. test {MSETNX should remove all the volatile keys even on failure} {
  1063. $r mset x 1 y 2 z 3
  1064. $r expire y 10000
  1065. $r expire z 10000
  1066. list [$r msetnx x A y B z C] [$r mget x y z]
  1067. } {0 {1 {} {}}}
  1068. test {ZSET basic ZADD and score update} {
  1069. $r zadd ztmp 10 x
  1070. $r zadd ztmp 20 y
  1071. $r zadd ztmp 30 z
  1072. set aux1 [$r zrange ztmp 0 -1]
  1073. $r zadd ztmp 1 y
  1074. set aux2 [$r zrange ztmp 0 -1]
  1075. list $aux1 $aux2
  1076. } {{x y z} {y x z}}
  1077. test {ZCARD basics} {
  1078. $r zcard ztmp
  1079. } {3}
  1080. test {ZCARD non existing key} {
  1081. $r zcard ztmp-blabla
  1082. } {0}
  1083. test {ZRANK basics} {
  1084. $r zadd zranktmp 10 x
  1085. $r zadd zranktmp 20 y
  1086. $r zadd zranktmp 30 z
  1087. list [$r zrank zranktmp x] [$r zrank zranktmp y] [$r zrank zranktmp z]
  1088. } {0 1 2}
  1089. test {ZREVRANK basics} {
  1090. list [$r zrevrank zranktmp x] [$r zrevrank zranktmp y] [$r zrevrank zranktmp z]
  1091. } {2 1 0}
  1092. test {ZRANK - after deletion} {
  1093. $r zrem zranktmp y
  1094. list [$r zrank zranktmp x] [$r zrank zranktmp z]
  1095. } {0 1}
  1096. test {ZSCORE} {
  1097. set aux {}
  1098. set err {}
  1099. for {set i 0} {$i < 1000} {incr i} {
  1100. set score [expr rand()]
  1101. lappend aux $score
  1102. $r zadd zscoretest $score $i
  1103. }
  1104. for {set i 0} {$i < 1000} {incr i} {
  1105. if {[$r zscore zscoretest $i] != [lindex $aux $i]} {
  1106. set err "Expected score was [lindex $aux $i] but got [$r zscore zscoretest $i] for element $i"
  1107. break
  1108. }
  1109. }
  1110. set _ $err
  1111. } {}
  1112. test {ZSCORE after a DEBUG RELOAD} {
  1113. set aux {}
  1114. set err {}
  1115. $r del zscoretest
  1116. for {set i 0} {$i < 1000} {incr i} {
  1117. set score [expr rand()]
  1118. lappend aux $score
  1119. $r zadd zscoretest $score $i
  1120. }
  1121. $r debug reload
  1122. for {set i 0} {$i < 1000} {incr i} {
  1123. if {[$r zscore zscoretest $i] != [lindex $aux $i]} {
  1124. set err "Expected score was [lindex $aux $i] but got [$r zscore zscoretest $i] for element $i"
  1125. break
  1126. }
  1127. }
  1128. set _ $err
  1129. } {}
  1130. test {ZRANGE and ZREVRANGE basics} {
  1131. list [$r zrange ztmp 0 -1] [$r zrevrange ztmp 0 -1] \
  1132. [$r zrange ztmp 1 -1] [$r zrevrange ztmp 1 -1]
  1133. } {{y x z} {z x y} {x z} {x y}}
  1134. test {ZRANGE WITHSCORES} {
  1135. $r zrange ztmp 0 -1 withscores
  1136. } {y 1 x 10 z 30}
  1137. test {ZSETs stress tester - sorting is working well?} {
  1138. set delta 0
  1139. for {set test 0} {$test < 2} {incr test} {
  1140. unset -nocomplain auxarray
  1141. array set auxarray {}
  1142. set auxlist {}
  1143. $r del myzset
  1144. for {set i 0} {$i < 1000} {incr i} {
  1145. if {$test == 0} {
  1146. set score [expr rand()]
  1147. } else {
  1148. set score [expr int(rand()*10)]
  1149. }
  1150. set auxarray($i) $score
  1151. $r zadd myzset $score $i
  1152. # Random update
  1153. if {[expr rand()] < .2} {
  1154. set j [expr int(rand()*1000)]
  1155. if {$test == 0} {
  1156. set score [expr rand()]
  1157. } else {
  1158. set score [expr int(rand()*10)]
  1159. }
  1160. set auxarray($j) $score
  1161. $r zadd myzset $score $j
  1162. }
  1163. }
  1164. foreach {item score} [array get auxarray] {
  1165. lappend auxlist [list $score $item]
  1166. }
  1167. set sorted [lsort -command zlistAlikeSort $auxlist]
  1168. set auxlist {}
  1169. foreach x $sorted {
  1170. lappend auxlist [lindex $x 1]
  1171. }
  1172. set fromredis [$r zrange myzset 0 -1]
  1173. set delta 0
  1174. for {set i 0} {$i < [llength $fromredis]} {incr i} {
  1175. if {[lindex $fromredis $i] != [lindex $auxlist $i]} {
  1176. incr delta
  1177. }
  1178. }
  1179. }
  1180. format $delta
  1181. } {0}
  1182. test {ZINCRBY - can create a new sorted set} {
  1183. $r del zset
  1184. $r zincrby zset 1 foo
  1185. list [$r zrange zset 0 -1] [$r zscore zset foo]
  1186. } {foo 1}
  1187. test {ZINCRBY - increment and decrement} {
  1188. $r zincrby zset 2 foo
  1189. $r zincrby zset 1 bar
  1190. set v1 [$r zrange zset 0 -1]
  1191. $r zincrby zset 10 bar
  1192. $r zincrby zset -5 foo
  1193. $r zincrby zset -5 bar
  1194. set v2 [$r zrange zset 0 -1]
  1195. list $v1 $v2 [$r zscore zset foo] [$r zscore zset bar]
  1196. } {{bar foo} {foo bar} -2 6}
  1197. test {ZRANGEBYSCORE and ZCOUNT basics} {
  1198. $r del zset
  1199. $r zadd zset 1 a
  1200. $r zadd zset 2 b
  1201. $r zadd zset 3 c
  1202. $r zadd zset 4 d
  1203. $r zadd zset 5 e
  1204. list [$r zrangebyscore zset 2 4] [$r zrangebyscore zset (2 (4] \
  1205. [$r zcount zset 2 4] [$r zcount zset (2 (4]
  1206. } {{b c d} c 3 1}
  1207. test {ZRANGEBYSCORE withscores} {
  1208. $r del zset
  1209. $r zadd zset 1 a
  1210. $r zadd zset 2 b
  1211. $r zadd zset 3 c
  1212. $r zadd zset 4 d
  1213. $r zadd zset 5 e
  1214. $r zrangebyscore zset 2 4 withscores
  1215. } {b 2 c 3 d 4}
  1216. test {ZRANGEBYSCORE fuzzy test, 100 ranges in 1000 elements sorted set} {
  1217. set err {}
  1218. $r del zset
  1219. for {set i 0} {$i < 1000} {incr i} {
  1220. $r zadd zset [expr rand()] $i
  1221. }
  1222. for {set i 0} {$i < 100} {incr i} {
  1223. set min [expr rand()]
  1224. set max [expr rand()]
  1225. if {$min > $max} {
  1226. set aux $min
  1227. set min $max
  1228. set max $aux
  1229. }
  1230. set low [$r zrangebyscore zset -inf $min]
  1231. set ok [$r zrangebyscore zset $min $max]
  1232. set high [$r zrangebyscore zset $max +inf]
  1233. set lowx [$r zrangebyscore zset -inf ($min]
  1234. set okx [$r zrangebyscore zset ($min ($max]
  1235. set highx [$r zrangebyscore zset ($max +inf]
  1236. if {[$r zcount zset -inf $min] != [llength $low]} {
  1237. append err "Error, len does not match zcount\n"
  1238. }
  1239. if {[$r zcount zset $min $max] != [llength $ok]} {
  1240. append err "Error, len does not match zcount\n"
  1241. }
  1242. if {[$r zcount zset $max +inf] != [llength $high]} {
  1243. append err "Error, len does not match zcount\n"
  1244. }
  1245. if {[$r zcount zset -inf ($min] != [llength $lowx]} {
  1246. append err "Error, len does not match zcount\n"
  1247. }
  1248. if {[$r zcount zset ($min ($max] != [llength $okx]} {
  1249. append err "Error, len does not match zcount\n"
  1250. }
  1251. if {[$r zcount zset ($max +inf] != [llength $highx]} {
  1252. append err "Error, len does not match zcount\n"
  1253. }
  1254. foreach x $low {
  1255. set score [$r zscore zset $x]
  1256. if {$score > $min} {
  1257. append err "Error, score for $x is $score > $min\n"
  1258. }
  1259. }
  1260. foreach x $lowx {
  1261. set score [$r zscore zset $x]
  1262. if {$score >= $min} {
  1263. append err "Error, score for $x is $score >= $min\n"
  1264. }
  1265. }
  1266. foreach x $ok {
  1267. set score [$r zscore zset $x]
  1268. if {$score < $min || $score > $max} {
  1269. append err "Error, score for $x is $score outside $min-$max range\n"
  1270. }
  1271. }
  1272. foreach x $okx {
  1273. set score [$r zscore zset $x]
  1274. if {$score <= $min || $score >= $max} {
  1275. append err "Error, score for $x is $score outside $min-$max open range\n"
  1276. }
  1277. }
  1278. foreach x $high {
  1279. set score [$r zscore zset $x]
  1280. if {$score < $max} {
  1281. append err "Error, score for $x is $score < $max\n"
  1282. }
  1283. }
  1284. foreach x $highx {
  1285. set score [$r zscore zset $x]
  1286. if {$score <= $max} {
  1287. append err "Error, score for $x is $score <= $max\n"
  1288. }
  1289. }
  1290. }
  1291. set _ $err
  1292. } {}
  1293. test {ZRANGEBYSCORE with LIMIT} {
  1294. $r del zset
  1295. $r zadd zset 1 a
  1296. $r zadd zset 2 b
  1297. $r zadd zset 3 c
  1298. $r zadd zset 4 d
  1299. $r zadd zset 5 e
  1300. list \
  1301. [$r zrangebyscore zset 0 10 LIMIT 0 2] \
  1302. [$r zrangebyscore zset 0 10 LIMIT 2 3] \
  1303. [$r zrangebyscore zset 0 10 LIMIT 2 10] \
  1304. [$r zrangebyscore zset 0 10 LIMIT 20 10]
  1305. } {{a b} {c d e} {c d e} {}}
  1306. test {ZRANGEBYSCORE with LIMIT and withscores} {
  1307. $r del zset
  1308. $r zadd zset 10 a
  1309. $r zadd zset 20 b
  1310. $r zadd zset 30 c
  1311. $r zadd zset 40 d
  1312. $r zadd zset 50 e
  1313. $r zrangebyscore zset 20 50 LIMIT 2 3 withscores
  1314. } {d 40 e 50}
  1315. test {ZREMRANGEBYSCORE basics} {
  1316. $r del zset
  1317. $r zadd zset 1 a
  1318. $r zadd zset 2 b
  1319. $r zadd zset 3 c
  1320. $r zadd zset 4 d
  1321. $r zadd zset 5 e
  1322. list [$r zremrangebyscore zset 2 4] [$r zrange zset 0 -1]
  1323. } {3 {a e}}
  1324. test {ZREMRANGEBYSCORE from -inf to +inf} {
  1325. $r del zset
  1326. $r zadd zset 1 a
  1327. $r zadd zset 2 b
  1328. $r zadd zset 3 c
  1329. $r zadd zset 4 d
  1330. $r zadd zset 5 e
  1331. list [$r zremrangebyscore zset -inf +inf] [$r zrange zset 0 -1]
  1332. } {5 {}}
  1333. test {ZREMRANGEBYRANK basics} {
  1334. $r del zset
  1335. $r zadd zset 1 a
  1336. $r zadd zset 2 b
  1337. $r zadd zset 3 c
  1338. $r zadd zset 4 d
  1339. $r zadd zset 5 e
  1340. list [$r zremrangebyrank zset 1 3] [$r zrange zset 0 -1]
  1341. } {3 {a e}}
  1342. test {ZUNION against non-existing key doesn't set destination} {
  1343. $r del zseta
  1344. list [$r zunion dst_key 1 zseta] [$r exists dst_key]
  1345. } {0 0}
  1346. test {ZUNION basics} {
  1347. $r del zseta zsetb zsetc
  1348. $r zadd zseta 1 a
  1349. $r zadd zseta 2 b
  1350. $r zadd zseta 3 c
  1351. $r zadd zsetb 1 b
  1352. $r zadd zsetb 2 c
  1353. $r zadd zsetb 3 d
  1354. list [$r zunion zsetc 2 zseta zsetb] [$r zrange zsetc 0 -1 withscores]
  1355. } {4 {a 1 b 3 d 3 c 5}}
  1356. test {ZUNION with weights} {
  1357. list [$r zunion zsetc 2 zseta zsetb weights 2 3] [$r zrange zsetc 0 -1 withscores]
  1358. } {4 {a 2 b 7 d 9 c 12}}
  1359. test {ZUNION with AGGREGATE MIN} {
  1360. list [$r zunion zsetc 2 zseta zsetb aggregate min] [$r zrange zsetc 0 -1 withscores]
  1361. } {4 {a 1 b 1 c 2 d 3}}
  1362. test {ZUNION with AGGREGATE MAX} {
  1363. list [$r zunion zsetc 2 zseta zsetb aggregate max] [$r zrange zsetc 0 -1 withscores]
  1364. } {4 {a 1 b 2 c 3 d 3}}
  1365. test {ZINTER basics} {
  1366. list [$r zinter zsetc 2 zseta zsetb] [$r zrange zsetc 0 -1 withscores]
  1367. } {2 {b 3 c 5}}
  1368. test {ZINTER with weights} {
  1369. list [$r zinter zsetc 2 zseta zsetb weights 2 3] [$r zrange zsetc 0 -1 withscores]
  1370. } {2 {b 7 c 12}}
  1371. test {ZINTER with AGGREGATE MIN} {
  1372. list [$r zinter zsetc 2 zseta zsetb aggregate min] [$r zrange zsetc 0 -1 withscores]
  1373. } {2 {b 1 c 2}}
  1374. test {ZINTER with AGGREGATE MAX} {
  1375. list [$r zinter zsetc 2 zseta zsetb aggregate max] [$r zrange zsetc 0 -1 withscores]
  1376. } {2 {b 2 c 3}}
  1377. test {SORT against sorted sets} {
  1378. $r del zset
  1379. $r zadd zset 1 a
  1380. $r zadd zset 5 b
  1381. $r zadd zset 2 c
  1382. $r zadd zset 10 d
  1383. $r zadd zset 3 e
  1384. $r sort zset alpha desc
  1385. } {e d c b a}
  1386. test {Sorted sets +inf and -inf handling} {
  1387. $r del zset
  1388. $r zadd zset -100 a
  1389. $r zadd zset 200 b
  1390. $r zadd zset -300 c
  1391. $r zadd zset 1000000 d
  1392. $r zadd zset +inf max
  1393. $r zadd zset -inf min
  1394. $r zrange zset 0 -1
  1395. } {min c a b d max}
  1396. test {HSET/HLEN - Small hash creation} {
  1397. array set smallhash {}
  1398. for {set i 0} {$i < 8} {incr i} {
  1399. set key [randstring 0 8 alpha]
  1400. set val [randstring 0 8 alpha]
  1401. if {[info exists smallhash($key)]} {
  1402. incr i -1
  1403. continue
  1404. }
  1405. $r hset smallhash $key $val
  1406. set smallhash($key) $val
  1407. }
  1408. list [$r hlen smallhash]
  1409. } {8}
  1410. test {Is the small hash encoded with a zipmap?} {
  1411. $r debug object smallhash
  1412. } {*zipmap*}
  1413. test {HSET/HLEN - Big hash creation} {
  1414. array set bighash {}
  1415. for {set i 0} {$i < 1024} {incr i} {
  1416. set key [randstring 0 8 alpha]
  1417. set val [randstring 0 8 alpha]
  1418. if {[info exists bighash($key)]} {
  1419. incr i -1
  1420. continue
  1421. }
  1422. $r hset bighash $key $val
  1423. set bighash($key) $val
  1424. }
  1425. list [$r hlen bighash]
  1426. } {1024}
  1427. test {Is the big hash encoded with a zipmap?} {
  1428. $r debug object bighash
  1429. } {*hashtable*}
  1430. test {HGET against the small hash} {
  1431. set err {}
  1432. foreach k [array names smallhash *] {
  1433. if {$smallhash($k) ne [$r hget smallhash $k]} {
  1434. set err "$smallhash($k) != [$r hget smallhash $k]"
  1435. break
  1436. }
  1437. }
  1438. set _ $err
  1439. } {}
  1440. test {HGET against the big hash} {
  1441. set err {}
  1442. foreach k [array names bighash *] {
  1443. if {$bighash($k) ne [$r hget bighash $k]} {
  1444. set err "$bighash($k) != [$r hget bighash $k]"
  1445. break
  1446. }
  1447. }
  1448. set _ $err
  1449. } {}
  1450. test {HGET against non existing key} {
  1451. set rv {}
  1452. lappend rv [$r hget smallhash __123123123__]
  1453. lappend rv [$r hget bighash __123123123__]
  1454. set _ $rv
  1455. } {{} {}}
  1456. test {HSET in update and insert mode} {
  1457. set rv {}
  1458. set k [lindex [array names smallhash *] 0]
  1459. lappend rv [$r hset smallhash $k newval1]
  1460. set smallhash($k) newval1
  1461. lappend rv [$r hget smallhash $k]
  1462. lappend rv [$r hset smallhash __foobar123__ newval]
  1463. set k [lindex [array names bighash *] 0]
  1464. lappend rv [$r hset bighash $k newval2]
  1465. set bighash($k) newval2
  1466. lappend rv [$r hget bighash $k]
  1467. lappend rv [$r hset bighash __foobar123__ newval]
  1468. lappend rv [$r hdel smallhash __foobar123__]
  1469. lappend rv [$r hdel bighash __foobar123__]
  1470. set _ $rv
  1471. } {0 newval1 1 0 newval2 1 1 1}
  1472. test {HSETNX target key missing - small hash} {
  1473. $r hsetnx smallhash __123123123__ foo
  1474. $r hget smallhash __123123123__
  1475. } {foo}
  1476. test {HSETNX target key exists - small hash} {
  1477. $r hsetnx smallhash __123123123__ bar
  1478. set result [$r hget smallhash __123123123__]
  1479. $r hdel smallhash __123123123__
  1480. set _ $result
  1481. } {foo}
  1482. test {HSETNX target key missing - big hash} {
  1483. $r hsetnx bighash __123123123__ foo
  1484. $r hget bighash __123123123__
  1485. } {foo}
  1486. test {HSETNX target key exists - big hash} {
  1487. $r hsetnx bighash __123123123__ bar
  1488. set result [$r hget bighash __123123123__]
  1489. $r hdel bighash __123123123__
  1490. set _ $result
  1491. } {foo}
  1492. test {HMSET wrong number of args} {
  1493. catch {$r hmset smallhash key1 val1 key2} err
  1494. format $err
  1495. } {*wrong number*}
  1496. test {HMSET - small hash} {
  1497. set args {}
  1498. foreach {k v} [array get smallhash] {
  1499. set newval [randstring 0 8 alpha]
  1500. set smallhash($k) $newval
  1501. lappend args $k $newval
  1502. }
  1503. $r hmset smallhash {*}$args
  1504. } {OK}
  1505. test {HMSET - big hash} {
  1506. set args {}
  1507. foreach {k v} [array get bighash] {
  1508. set newval [randstring 0 8 alpha]
  1509. set bighash($k) $newval
  1510. lappend args $k $newval
  1511. }
  1512. $r hmset bighash {*}$args
  1513. } {OK}
  1514. test {HMGET against non existing key and fields} {
  1515. set rv {}
  1516. lappend rv [$r hmget doesntexist __123123123__ __456456456__]
  1517. lappend rv [$r hmget smallhash __123123123__ __456456456__]
  1518. lappend rv [$r hmget bighash __123123123__ __456456456__]
  1519. set _ $rv
  1520. } {{{} {}} {{} {}} {{} {}}}
  1521. test {HMGET - small hash} {
  1522. set keys {}
  1523. set vals {}
  1524. foreach {k v} [array get smallhash] {
  1525. lappend keys $k
  1526. lappend vals $v
  1527. }
  1528. set err {}
  1529. set result [$r hmget smallhash {*}$keys]
  1530. if {$vals ne $result} {
  1531. set err "$vals != $result"
  1532. break

Large files files are truncated, but you can click here to view the full file