Skip to content

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

Fixed a LEAF node issue for "amzfing" with threshold of 2.

Kishore Nallaneb1e68620a71
diff --git a/src/art.c b/src/art.c
index 65e54886..2f578a79 100644
--- a/src/art.c
+++ b/src/art.c
@@ -1009,9 +1009,10 @@ static int art_iter_fuzzy_prefix_recurse(art_node *n, const unsigned char *term,
int row_min = 0;
int current_row[term_len+1];
+ copyIntArray(current_row, previous_row, term_len+1);
current_row[0] = previous_row[0] + 1;
- printf("LEAF KEY: %s\n", l->key);
+ printf("LEAF KEY: %s, depth: %d\n", l->key, depth);
for(int idx=depth; idx<l->key_len && depth < term_len && row_min <= max_cost; idx++) {
row_min = levenshtein_score(l->key[idx], term, term_len, previous_row, current_row);
diff --git a/src/main.cpp b/src/main.cpp
index dc4b47eb..27f7a9fa 100644
--- a/src/main.cpp
+++ b/src/main.cpp
@@ -30,8 +30,8 @@ int main() {
num++;
}
- const unsigned char *prefix = (const unsigned char *) "amazin";
- art_iter_fuzzy_prefix(&t, prefix, strlen((const char *) prefix), 0, test_prefix_cb, NULL);
+ const unsigned char *prefix = (const unsigned char *) "amzfing";
+ art_iter_fuzzy_prefix(&t, prefix, strlen((const char *) prefix), 2, test_prefix_cb, NULL);
// art_iter_prefix(&t, prefix, strlen((const char *) prefix), test_prefix_cb, NULL);
// art_iter(&t, test_prefix_cb, NULL);