Home
last modified time | relevance | path

Searched refs:curBucketIdx (Results 1 – 9 of 9) sorted by relevance

/dports/textproc/redisearch16/RediSearch-1.6.16/src/
H A Dforward_index.c281 iter.curBucketIdx = 0; in ForwardIndex_Iterate()
290 while (iter->curEnt == NULL && iter->curBucketIdx < table->numBuckets) { in ForwardIndexIterator_Next()
291 iter->curEnt = table->buckets[iter->curBucketIdx++]; in ForwardIndexIterator_Next()
H A Dindexer.c150 for (uint32_t curBucketIdx = 0; curBucketIdx < ht->numBuckets; curBucketIdx++) { in writeMergedEntries() local
151 for (KHTableEntry *entp = ht->buckets[curBucketIdx]; entp; entp = entp->next) { in writeMergedEntries()
H A Dforward_index.h62 uint32_t curBucketIdx; member
/dports/textproc/redisearch/RediSearch-2.2.5/src/
H A Dforward_index.c282 iter.curBucketIdx = 0; in ForwardIndex_Iterate()
291 while (iter->curEnt == NULL && iter->curBucketIdx < table->numBuckets) { in ForwardIndexIterator_Next()
292 iter->curEnt = table->buckets[iter->curBucketIdx++]; in ForwardIndexIterator_Next()
H A Dindexer.c150 for (uint32_t curBucketIdx = 0; curBucketIdx < ht->numBuckets; curBucketIdx++) { in writeMergedEntries() local
151 for (KHTableEntry *entp = ht->buckets[curBucketIdx]; entp; entp = entp->next) { in writeMergedEntries()
H A Dforward_index.h62 uint32_t curBucketIdx; member
/dports/textproc/redisearch20/RediSearch-2.0.15/src/
H A Dforward_index.c279 iter.curBucketIdx = 0; in ForwardIndex_Iterate()
288 while (iter->curEnt == NULL && iter->curBucketIdx < table->numBuckets) { in ForwardIndexIterator_Next()
289 iter->curEnt = table->buckets[iter->curBucketIdx++]; in ForwardIndexIterator_Next()
H A Dindexer.c150 for (uint32_t curBucketIdx = 0; curBucketIdx < ht->numBuckets; curBucketIdx++) { in writeMergedEntries() local
151 for (KHTableEntry *entp = ht->buckets[curBucketIdx]; entp; entp = entp->next) { in writeMergedEntries()
H A Dforward_index.h62 uint32_t curBucketIdx; member