Home
last modified time | relevance | path

Searched refs:table (Results 1 – 15 of 15) sorted by relevance

/redis-3.2.3/src/
H A Ddict.c161 ht->table = NULL; in _dictReset()
416 int table; in dictGenericDelete() local
422 for (table = 0; table <= 1; table++) { in dictGenericDelete()
424 he = d->ht[table].table[idx]; in dictGenericDelete()
432 d->ht[table].table[idx] = he->next; in dictGenericDelete()
478 zfree(ht->table); in _dictClear()
500 for (table = 0; table <= 1; table++) { in dictFind()
502 he = d->ht[table].table[idx]; in dictFind()
563 iter->table = 0; in dictGetIterator()
976 for (table = 0; table <= 1; table++) { in _dictKeyIndex()
[all …]
H A Ddict.h70 dictEntry **table; member
91 int table, safe; member
H A Dredis-trib.rb903 def show_reshard_table(table) argument
904 table.each{|e|
H A Dsentinel.c1148 dict *table = NULL; in createSentinelRedisInstance() local
1168 if (flags & SRI_MASTER) table = sentinel.masters; in createSentinelRedisInstance()
1169 else if (flags & SRI_SLAVE) table = master->slaves; in createSentinelRedisInstance()
1170 else if (flags & SRI_SENTINEL) table = master->sentinels; in createSentinelRedisInstance()
1172 if (dictFind(table,sdsname)) { in createSentinelRedisInstance()
1231 dictAdd(table, ri->name, ri); in createSentinelRedisInstance()
/redis-3.2.3/deps/hiredis/
H A Ddict.c66 ht->table = NULL; in _dictReset()
112 he = ht->table[i]; in dictExpand()
119 he->next = n.table[h]; in dictExpand()
120 n.table[h] = he; in dictExpand()
127 free(ht->table); in dictExpand()
146 entry->next = ht->table[index]; in dictAdd()
147 ht->table[index] = entry; in dictAdd()
189 de = ht->table[h]; in dictDelete()
231 free(ht->table); in _dictClear()
249 he = ht->table[h]; in dictFind()
[all …]
H A Ddict.h61 dictEntry **table; member
/redis-3.2.3/deps/lua/test/
H A DREADME8 cf.lua temperature conversion table (celsius to farenheit)
22 table.lua make table, grouping all data for the same item
H A Decho.lua3 for i=0,table.getn(arg) do
/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Dsize_classes.sh203 * SIZE_CLASSES: Complete table of
211 * lg_delta_lookup: Same as lg_delta if a lookup table size class, 'no'
214 * NLBINS: Number of bins supported by the lookup table.
218 * LOOKUP_MAXCLASS: Maximum size class included in lookup table.
260 * The size2index_tab lookup table uses uint8_t to encode each bin index, so we
H A Djemalloc_internal.h.in438 * size2index_tab is a compact lookup table that rounds request sizes up to
439 * size classes. In order to reduce cache footprint, the table is compressed,
/redis-3.2.3/utils/hashtable/
H A Drehashing.c37 if (ht.table == NULL) { in showBuckets()
42 printf("%c", ht.table[j] ? '1' : '0'); in showBuckets()
H A DREADME1 Hash table implementation related utilities.
/redis-3.2.3/deps/lua/
H A DHISTORY36 + each function can have its own global table, which can be shared.
37 + new __newindex metamethod, called when we insert a new key into a table.
44 + {f()} fills a table with all values returned by f.
79 + uniform treatment of globals: globals are now stored in a Lua table.
111 + new table functions "foreachi", "sort", "tinsert", "tremove", "getn".
/redis-3.2.3/deps/lua/doc/
H A Dlua.css30 table h3 {
/redis-3.2.3/tests/unit/
H A Dscripting.tcl33 test {EVAL - Lua table -> Redis protocol type conversion} {
89 } {table a b c 3}
96 } {table OK}
104 } {table {ERR value is not an integer or out of range}}