/dports/textproc/redisearch/RediSearch-2.2.5/src/ |
H A D | forward_index.h | 12 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 D | forward_index.c | 11 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 D | indexer.c | 14 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 D | inverted_index.h | 162 ForwardIndexEntry *ent);
|
H A D | inverted_index.c | 473 ForwardIndexEntry *ent) { in InvertedIndex_WriteForwardIndexEntry()
|
/dports/textproc/redisearch16/RediSearch-1.6.16/src/ |
H A D | forward_index.h | 12 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 D | forward_index.c | 12 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 D | indexer.c | 14 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 D | inverted_index.h | 160 ForwardIndexEntry *ent);
|
H A D | inverted_index.c | 455 ForwardIndexEntry *ent) { in InvertedIndex_WriteForwardIndexEntry()
|
/dports/textproc/redisearch20/RediSearch-2.0.15/src/ |
H A D | forward_index.h | 12 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 D | forward_index.c | 11 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 D | indexer.c | 14 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 D | inverted_index.h | 159 ForwardIndexEntry *ent);
|
H A D | inverted_index.c | 462 ForwardIndexEntry *ent) { in InvertedIndex_WriteForwardIndexEntry()
|
/dports/textproc/redisearch/RediSearch-2.2.5/tests/ctests/ |
H A D | bench-decoder.c | 12 ForwardIndexEntry ent = {0}; in writeEntry()
|
/dports/textproc/redisearch20/RediSearch-2.0.15/tests/ctests/ |
H A D | bench-decoder.c | 12 ForwardIndexEntry ent = {0}; in writeEntry()
|
/dports/textproc/redisearch16/RediSearch-1.6.16/src/tests/ |
H A D | bench-decoder.c | 12 ForwardIndexEntry ent = {0}; in writeEntry()
|
/dports/textproc/redisearch20/RediSearch-2.0.15/tests/cpptests/ |
H A D | test_cpp_index.cpp | 144 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 D | t_index.cpp | 144 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 D | test_cpp_index.cpp | 146 ForwardIndexEntry h; in TEST_P() 226 ForwardIndexEntry h; in createIndex() 887 ForwardIndexEntry h; in TEST_F() 1117 ForwardIndexEntry ent = {0}; in TEST_F()
|