Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences
C++ algoliadatastoreelasticsearchenterprise-searchfacetingfull-text-searchfuzzy-searchgeosearchin-memoryinstantsearchmerchandisingpineconesearchsearch-enginesemantic-searchsimilarity-searchsite-searchsynonymstypo-tolerancevector-search
Positional offsets are unsorted, so should be using unsorted append.
Kishore Nallanbeba88c1daf5
diff --git a/src/art.cpp b/src/art.cppindex 40a9b98c..90ca817c 100644--- a/src/art.cpp+++ b/src/art.cpp@@ -328,14 +328,14 @@ art_leaf* art_maximum(art_tree *t) {return maximum((art_node*)t->root);}-static void add_document_to_leaf(const art_document *document, const art_leaf *l) {- l->values->ids.append_sorted(document->id);- uint32_t curr_index = l->values->offsets.getLength();- l->values->offsets.append_sorted(document->offsets_len);+static void add_document_to_leaf(const art_document *document, const art_leaf *leaf) {+ leaf->values->ids.append_sorted(document->id);+ uint32_t curr_index = leaf->values->offsets.getLength();+ leaf->values->offsets.append_sorted(document->offsets_len);for(uint32_t i=0; i<document->offsets_len; i++) {- l->values->offsets.append_sorted(document->offsets[i]);+ leaf->values->offsets.append_unsorted(document->offsets[i]);}- l->values->offset_index.append_sorted(curr_index);+ leaf->values->offset_index.append_sorted(curr_index);}static art_leaf* make_leaf(const unsigned char *key, uint32_t key_len, art_document *document) {