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

Refactor type definition of art node priority queue comparator.

Kishore Nallan5a3482435bd3
diff --git a/src/art.cpp b/src/art.cpp
index 2f099704..fc515ca5 100644
--- a/src/art.cpp
+++ b/src/art.cpp
@@ -905,15 +905,11 @@ int art_topk_iter(const art_node *root, token_ordering token_order, size_t max_r
std::vector<art_leaf *> &results) {
printf("INSIDE art_topk_iter: root->type: %d\n", root->type);
- std::priority_queue<art_node *, std::vector<const art_node *>,
- std::function<bool(const art_node*, const art_node*)>> q;
+ std::priority_queue<art_node *, std::vector<const art_node *>, decltype(&compare_art_node_score_pq)> q;
if(token_order == FREQUENCY) {
q = std::priority_queue<art_node *, std::vector<const art_node *>,
- std::function<bool(const art_node*, const art_node*)>>(compare_art_node_frequency_pq);
- } else {
- q = std::priority_queue<art_node *, std::vector<const art_node *>,
- std::function<bool(const art_node*, const art_node*)>>(compare_art_node_score_pq);
+ decltype(&compare_art_node_frequency_pq)>(compare_art_node_frequency_pq);
}
q.push(root);