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
Fixed a bug with NODE48 traversal for exact search of "amazing".
Kishore Nallanf836443ad9a9
diff --git a/src/art.c b/src/art.cindex 614325cb..685c72ce 100644--- a/src/art.c+++ b/src/art.c@@ -907,7 +907,7 @@ int art_iter_prefix(art_tree *t, const unsigned char *key, int key_len, art_call}printf("IS_INTERNAL\n");- printf("Prefix len: %d, children: %d, value: %s\n", n->partial_len, n->num_children, n->partial);+ printf("Prefix len: %d, children: %d, depth: %d, partial: %s\n", n->partial_len, n->num_children, depth, n->partial);// If the depth matches the prefix, we need to handle this nodeif (depth == key_len) {@@ -949,7 +949,8 @@ int art_iter_prefix(art_tree *t, const unsigned char *key, int key_len, art_callnew_current_row[0] = previous_row[0] + 1;\row_min = levenshtein_score(child_char, term, term_len, previous_row, new_current_row);\\- printf("child char: %c, cost: %d, depth: %d, term_len: %d \n", child_char, new_current_row[term_len], depth, term_len);\+ printf("fuzzy_recurse - child char: %c, cost: %d, max_cost: %d, row_min: %d, depth: %d, term_len: %d \n",\+ child_char, new_current_row[term_len], max_cost, row_min, depth, term_len);\\if(depth == term_len-1) {\/* if reach end of term, and cost is below threshold, print children of this node as matches*/\@@ -1037,7 +1038,7 @@ static int art_iter_fuzzy_prefix_recurse(art_node *n, const unsigned char *term,return 0;}- printf("START PARTIAL: %s\n", n->partial);+ printf("START PARTIAL: partial_len: %d, partial: %s, term_len: %d, depth: %d\n", n->partial_len, n->partial, term_len, depth);// internal node - first we check partial (via path compression) and then child indexint partial_len = min(MAX_PREFIX_LEN, n->partial_len);@@ -1094,12 +1095,12 @@ static int art_iter_fuzzy_prefix_recurse(art_node *n, const unsigned char *term,case NODE48:printf("NODE48\n");- for (int i=0; i < n->num_children; i++) {- char ix = ((art_node48*)n)->keys[i];+ for (int i=0; i < 256; i++) {+ int ix = ((art_node48*)n)->keys[i];if (!ix) continue;- char child_char = ((art_node48*)n)->keys[ix - 1];- printf("!child_char: %c, depth: %d", child_char, depth);art_node* child = ((art_node48*)n)->children[ix - 1];+ char child_char = (char)i;+ printf("!child_char: %c, depth: %d, ix: %d", child_char, depth, ix);fuzzy_recurse(child_char, term, term_len, depth, previous_row);}break;diff --git a/src/main.cpp b/src/main.cppindex 9eca88e9..c7392363 100644--- a/src/main.cpp+++ b/src/main.cpp@@ -30,8 +30,8 @@ int main() {num++;}- const unsigned char *prefix = (const unsigned char *) "amzsign";- art_iter_fuzzy_prefix(&t, prefix, strlen((const char *) prefix), 2, test_prefix_cb, NULL);+ const unsigned char *prefix = (const unsigned char *) "amazing";+ art_iter_fuzzy_prefix(&t, prefix, strlen((const char *) prefix), 0, test_prefix_cb, NULL);// art_iter_prefix(&t, prefix, strlen((const char *) prefix), test_prefix_cb, NULL);// art_iter(&t, test_prefix_cb, NULL);