Home
last modified time | relevance | path

Searched refs:ForwardIndexEntry (Results 1 – 21 of 21) sorted by relevance

/dports/textproc/redisearch/RediSearch-2.2.5/src/
H A Dforward_index.h12 typedef struct ForwardIndexEntry { struct
13 struct ForwardIndexEntry *next; argument
23 } ForwardIndexEntry; argument
72 ForwardIndexEntry *ForwardIndexIterator_Next(ForwardIndexIterator *iter);
75 ForwardIndexEntry *ForwardIndex_Find(ForwardIndex *i, const char *s, size_t n, uint32_t hash);
77 void ForwardIndex_NormalizeFreq(ForwardIndex *, ForwardIndexEntry *);
H A Dforward_index.c11 ForwardIndexEntry ent;
19 ForwardIndexEntry *ent = &ee->ent; in khtCompare()
111 ForwardIndexEntry *fwEnt = &ent->ent; in clearEntry()
173 ForwardIndexEntry *h = NULL; in ForwardIndex_HandleToken()
269 ForwardIndexEntry *ForwardIndex_Find(ForwardIndex *i, const char *s, size_t n, uint32_t hash) { in ForwardIndex_Find()
288 ForwardIndexEntry *ForwardIndexIterator_Next(ForwardIndexIterator *iter) { in ForwardIndexIterator_Next()
H A Dindexer.c14 ForwardIndexEntry *entry) { in writeIndexEntry()
40 ForwardIndexEntry *head; // First document containing the term
41 ForwardIndexEntry *tail; // Last document containing the term
65 for (ForwardIndexEntry *cur = ent->head; cur; cur = cur->next) { in countMerged()
95 ForwardIndexEntry *entry = ForwardIndexIterator_Next(&it); in doMerge()
155 ForwardIndexEntry *fwent = merged->head; in writeMergedEntries()
213 ForwardIndexEntry *entry = ForwardIndexIterator_Next(&it); in writeCurEntries()
H A Dinverted_index.h162 ForwardIndexEntry *ent);
H A Dinverted_index.c473 ForwardIndexEntry *ent) { in InvertedIndex_WriteForwardIndexEntry()
/dports/textproc/redisearch16/RediSearch-1.6.16/src/
H A Dforward_index.h12 typedef struct ForwardIndexEntry { struct
13 struct ForwardIndexEntry *next; argument
23 } ForwardIndexEntry; argument
72 ForwardIndexEntry *ForwardIndexIterator_Next(ForwardIndexIterator *iter);
75 ForwardIndexEntry *ForwardIndex_Find(ForwardIndex *i, const char *s, size_t n, uint32_t hash);
77 void ForwardIndex_NormalizeFreq(ForwardIndex *, ForwardIndexEntry *);
H A Dforward_index.c12 ForwardIndexEntry ent;
20 ForwardIndexEntry *ent = &ee->ent; in khtCompare()
109 ForwardIndexEntry *fwEnt = &ent->ent; in clearEntry()
171 ForwardIndexEntry *h = NULL; in ForwardIndex_HandleToken()
268 ForwardIndexEntry *ForwardIndex_Find(ForwardIndex *i, const char *s, size_t n, uint32_t hash) { in ForwardIndex_Find()
287 ForwardIndexEntry *ForwardIndexIterator_Next(ForwardIndexIterator *iter) { in ForwardIndexIterator_Next()
H A Dindexer.c14 ForwardIndexEntry *entry) { in writeIndexEntry()
40 ForwardIndexEntry *head; // First document containing the term
41 ForwardIndexEntry *tail; // Last document containing the term
65 for (ForwardIndexEntry *cur = ent->head; cur; cur = cur->next) { in countMerged()
95 ForwardIndexEntry *entry = ForwardIndexIterator_Next(&it); in doMerge()
155 ForwardIndexEntry *fwent = merged->head; in writeMergedEntries()
211 ForwardIndexEntry *entry = ForwardIndexIterator_Next(&it); in writeCurEntries()
H A Dinverted_index.h160 ForwardIndexEntry *ent);
H A Dinverted_index.c455 ForwardIndexEntry *ent) { in InvertedIndex_WriteForwardIndexEntry()
/dports/textproc/redisearch20/RediSearch-2.0.15/src/
H A Dforward_index.h12 typedef struct ForwardIndexEntry { struct
13 struct ForwardIndexEntry *next; argument
23 } ForwardIndexEntry; argument
72 ForwardIndexEntry *ForwardIndexIterator_Next(ForwardIndexIterator *iter);
75 ForwardIndexEntry *ForwardIndex_Find(ForwardIndex *i, const char *s, size_t n, uint32_t hash);
77 void ForwardIndex_NormalizeFreq(ForwardIndex *, ForwardIndexEntry *);
H A Dforward_index.c11 ForwardIndexEntry ent;
19 ForwardIndexEntry *ent = &ee->ent; in khtCompare()
108 ForwardIndexEntry *fwEnt = &ent->ent; in clearEntry()
170 ForwardIndexEntry *h = NULL; in ForwardIndex_HandleToken()
266 ForwardIndexEntry *ForwardIndex_Find(ForwardIndex *i, const char *s, size_t n, uint32_t hash) { in ForwardIndex_Find()
285 ForwardIndexEntry *ForwardIndexIterator_Next(ForwardIndexIterator *iter) { in ForwardIndexIterator_Next()
H A Dindexer.c14 ForwardIndexEntry *entry) { in writeIndexEntry()
40 ForwardIndexEntry *head; // First document containing the term
41 ForwardIndexEntry *tail; // Last document containing the term
65 for (ForwardIndexEntry *cur = ent->head; cur; cur = cur->next) { in countMerged()
95 ForwardIndexEntry *entry = ForwardIndexIterator_Next(&it); in doMerge()
155 ForwardIndexEntry *fwent = merged->head; in writeMergedEntries()
213 ForwardIndexEntry *entry = ForwardIndexIterator_Next(&it); in writeCurEntries()
H A Dinverted_index.h159 ForwardIndexEntry *ent);
H A Dinverted_index.c462 ForwardIndexEntry *ent) { in InvertedIndex_WriteForwardIndexEntry()
/dports/textproc/redisearch/RediSearch-2.2.5/tests/ctests/
H A Dbench-decoder.c12 ForwardIndexEntry ent = {0}; in writeEntry()
/dports/textproc/redisearch20/RediSearch-2.0.15/tests/ctests/
H A Dbench-decoder.c12 ForwardIndexEntry ent = {0}; in writeEntry()
/dports/textproc/redisearch16/RediSearch-1.6.16/src/tests/
H A Dbench-decoder.c12 ForwardIndexEntry ent = {0}; in writeEntry()
/dports/textproc/redisearch20/RediSearch-2.0.15/tests/cpptests/
H A Dtest_cpp_index.cpp144 ForwardIndexEntry h; in TEST_P()
220 ForwardIndexEntry h; in createIndex()
881 ForwardIndexEntry h; in TEST_F()
1109 ForwardIndexEntry ent = {0}; in TEST_F()
/dports/textproc/redisearch16/RediSearch-1.6.16/src/cpptests/
H A Dt_index.cpp144 ForwardIndexEntry h; in TEST_P()
220 ForwardIndexEntry h; in createIndex()
883 ForwardIndexEntry h; in TEST_F()
1111 ForwardIndexEntry ent = {0}; in TEST_F()
/dports/textproc/redisearch/RediSearch-2.2.5/tests/cpptests/
H A Dtest_cpp_index.cpp146 ForwardIndexEntry h; in TEST_P()
226 ForwardIndexEntry h; in createIndex()
887 ForwardIndexEntry h; in TEST_F()
1117 ForwardIndexEntry ent = {0}; in TEST_F()