Home
last modified time | relevance | path

Searched refs:keys (Results 1 – 25 of 29) sorted by relevance

12

/redis-3.2.3/tests/unit/
H A Dscan.tcl7 set keys {}
16 set keys [lsort -unique $keys]
25 set keys {}
34 set keys [lsort -unique $keys]
43 set keys {}
52 set keys [lsort -unique $keys]
76 set keys {}
85 set keys [lsort -unique $keys]
110 set keys {}
150 set keys {}
[all …]
H A Dkeyspace.tcl20 lsort [r keys foo*]
23 test {KEYS to get all keys} {
24 lsort [r keys *]
31 test {DEL all keys} {
32 foreach key [r keys *] {r del $key}
155 test {DEL all keys again (DB 0)} {
156 foreach key [r keys *] {
162 test {DEL all keys again (DB 1)} {
164 foreach key [r keys *] {
272 r keys *
[all …]
H A Dexpire.tcl70 test {PERSIST returns 0 against non existing or non volatile keys} {
149 test {Redis should actively expire keys incrementally} {
163 test {Redis should lazy expire keys} {
181 test {EXPIRE should not resurrect keys (issue #1026)} {
191 test {5 keys in, 5 keys out} {
199 lsort [r keys *]
H A Ddump.tcl221 test {MIGRATE can migrate multiple keys at once} {
233 set ret [r -1 migrate $second_host $second_port "" 9 5000 keys key1 key2 key3]
244 test {MIGRATE with multiple keys must have empty key arg} {
245 catch {r MIGRATE 127.0.0.1 6379 NotEmpty 9 5000 keys a b c} e
249 test {MIGRATE with mutliple keys migrate just existing ones} {
259 set ret [r -1 migrate $second_host $second_port "" 9 5000 keys nokey-1 nokey-2 nokey-2]
264 …set ret [r -1 migrate $second_host $second_port "" 9 5000 keys nokey-1 key1 nokey-2 key2 nokey-3 k…
284 … set ret [r -1 migrate $second_host $second_port "" 9 5000 keys a b c d e f g h i l m n o p q]
291 test {MIGRATE with multiple keys: delete just ack keys} {
302 … catch {r -1 migrate $second_host $second_port "" 9 5000 keys a b c d e f g h i l m n o p q} e
H A Dmulti.tcl163 test {FLUSHALL is able to touch the watched keys} {
172 test {FLUSHALL does not touch non affected keys} {
181 test {FLUSHDB is able to touch the watched keys} {
190 test {FLUSHDB does not touch non affected keys} {
214 test {WATCH will consider touched keys target of EXPIRE} {
224 test {WATCH will not consider touched expired keys} {
245 test {DISCARD should UNWATCH all the keys} {
H A Dintrospection-2.tcl17 test {TOUCH returns the number of existing keys specified} {
H A Dbitops.tcl157 test {BITOP shorter keys are zero-padded to the key with max length} {
/redis-3.2.3/deps/jemalloc/test/unit/
H A Drtree.c62 uintptr_t keys[] = {0, 1, in TEST_BEGIN() local
71 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
74 assert_ptr_eq(rtree_get(&rtree, keys[k], true), in TEST_BEGIN()
79 j, k, keys[j], keys[k]); in TEST_BEGIN()
85 assert_false(rtree_set(&rtree, keys[j], NULL), in TEST_BEGIN()
103 uintptr_t keys[NSET]; in TEST_BEGIN() local
112 keys[j] = (uintptr_t)gen_rand64(sfmt); in TEST_BEGIN()
113 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
124 assert_false(rtree_set(&rtree, keys[j], NULL), in TEST_BEGIN()
126 assert_ptr_null(rtree_get(&rtree, keys[j], true), in TEST_BEGIN()
[all …]
/redis-3.2.3/src/
H A Ddb.c434 list *keys = pd[0]; in scanCallback() local
665 listRelease(keys); in scanGenericCommand()
1078 keys[i++] = j; in getKeysUsingCommandTable()
1081 return keys; in getKeysUsingCommandTable()
1112 int i, num, *keys; in zunionInterGetKeys() local
1132 keys[num] = 1; in zunionInterGetKeys()
1134 return keys; in zunionInterGetKeys()
1141 int i, num, *keys; in evalGetKeys() local
1158 return keys; in evalGetKeys()
1207 return keys; in sortGetKeys()
[all …]
H A Dredis-trib.rb226 slots = @info[:slots].keys.sort
366 keys = 0
372 keys += n.r.dbsize
376 keys_per_slot = sprintf("%.2f",keys/16384.0)
458 xputs none.keys.join(",")
470 puts single.keys.join(",")
481 xputs multi.keys.join(",")
894 s.slots.keys.sort[(0...n)].each{|slot|
936 break if keys.length == 0
949 print "."*keys.length if o[:dots]
[all …]
H A Dredis-cli.c1380 int j, got_comma, keys; in evalMode() local
1396 keys = 0; in evalMode()
1428 if (!got_comma) keys++; in evalMode()
2004 for(i=0;i<keys->elements;i++) { in getKeyTypes()
2009 for(i=0;i<keys->elements;i++) { in getKeyTypes()
2033 for(i=0;i<keys->elements;i++) { in getKeySizes()
2039 keys->element[i]->str); in getKeySizes()
2043 for(i=0;i<keys->elements;i++) { in getKeySizes()
2076 redisReply *reply, *keys; in findBigKeys() local
2105 keys = reply->element[1]; in findBigKeys()
[all …]
H A Dt_list.c616 void blockForKeys(client *c, robj **keys, int numkeys, mstime_t timeout, robj *target) { in blockForKeys() argument
628 if (dictAdd(c->bpop.keys,keys[j],NULL) != DICT_OK) continue; in blockForKeys()
629 incrRefCount(keys[j]); in blockForKeys()
632 de = dictFind(c->db->blocking_keys,keys[j]); in blockForKeys()
638 retval = dictAdd(c->db->blocking_keys,keys[j],l); in blockForKeys()
639 incrRefCount(keys[j]); in blockForKeys()
640 serverAssertWithInfo(c,keys[j],retval == DICT_OK); in blockForKeys()
656 serverAssertWithInfo(c,NULL,dictSize(c->bpop.keys) != 0); in unblockClientWaitingData()
657 di = dictGetIterator(c->bpop.keys); in unblockClientWaitingData()
673 dictEmpty(c->bpop.keys,NULL); in unblockClientWaitingData()
H A Dredis-check-rdb.c44 unsigned long keys; /* Number of keys processed. */ member
93 printf("[info] %lu keys read\n", rdbstate.keys); in rdbShowGenericInfo()
279 rdbstate.keys++; in redis_check_rdb()
H A Ddebug.c433 long keys, j; in debugCommand() local
437 if (getLongFromObjectOrReply(c, c->argv[2], &keys, NULL) != C_OK) in debugCommand()
439 dictExpand(c->db->dict,keys); in debugCommand()
440 for (j = 0; j < keys; j++) { in debugCommand()
H A Dserver.c2778 int *keys, numkeys, j; in commandCommand() local
2790 keys = getKeysFromCommand(cmd,c->argv+2,c->argc-2,&numkeys); in commandCommand()
2792 for (j = 0; j < numkeys; j++) addReplyBulk(c,c->argv[keys[j]+2]); in commandCommand()
2793 getKeysFreeResult(keys); in commandCommand()
3287 long long keys, vkeys; in genRedisInfoString() local
3289 keys = dictSize(server.db[j].dict); in genRedisInfoString()
3291 if (keys || vkeys) { in genRedisInfoString()
3294 j, keys, vkeys, server.db[j].avg_ttl); in genRedisInfoString()
H A Dcluster.c4160 robj **keys; in clusterCommand() local
4172 keys = zmalloc(sizeof(robj*)*maxkeys); in clusterCommand()
4173 numkeys = getKeysInSlot(slot, keys, maxkeys); in clusterCommand()
4175 for (j = 0; j < numkeys; j++) addReplyBulk(c,keys[j]); in clusterCommand()
4176 zfree(keys); in clusterCommand()
5190 di = dictGetIterator(c->bpop.keys); in clusterRedirectBlockedClientIfNeeded()
/redis-3.2.3/tests/support/
H A Dcluster.tcl168 set keys [::redis_cluster::get_keys_from_command $method $args]
169 if {$keys eq {}} {
174 set slot [::redis_cluster::get_slot_from_keys $keys]
294 proc ::redis_cluster::get_slot_from_keys {keys} { argument
296 foreach k $keys {
H A Dserver.tcl205 foreach directive [dict keys $config] {
H A Dutil.tcl267 foreach k [lsort [{*}$r keys *]] {
/redis-3.2.3/
H A DMANIFESTO9 Commands manipulate a key space where keys are binary-safe strings and
21 predictable performance. Datasets composed of 10k or 40 millions keys will
57 there's no way to make the more complex multi-keys API distributed in an
60 all cases. Instead we'll provide commands to quickly migrate keys from one
/redis-3.2.3/tests/unit/type/
H A Dhash.tcl149 set keys {}
152 lappend keys $k
156 set result [r hmget smallhash {*}$keys]
165 set keys {}
168 lappend keys $k
172 set result [r hmget bighash {*}$keys]
441 test {Hash ziplist regression test for large keys} {
H A Dstring.tcl40 test {SET 10000 numeric keys and access all them in reverse order} {
146 test {MSETNX with not existing keys} {
/redis-3.2.3/utils/
H A Dredis-sha1.rb18 r.keys('*').sort.each{|k|
/redis-3.2.3/tests/integration/
H A Dreplication-3.tcl17 r keys * ;# Force DEL syntesizing to slave
H A Dreplication.tcl143 test {Sync should have transferred keys from master} {

12