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
Refactor ```VectorFilterFunctor``` to include ```excluded_ids```
ozanarmagana2c5d24802d2
diff --git a/include/index.h b/include/index.hindex 1d895c02..8020c23f 100644--- a/include/index.h+++ b/include/index.h@@ -269,11 +269,22 @@ class VectorFilterFunctor: public hnswlib::BaseFilterFunctor {const uint32_t* filter_ids = nullptr;const uint32_t filter_ids_length = 0;+ const uint32_t* excluded_ids = nullptr;+ const uint32_t excluded_ids_length = 0;+public:- explicit VectorFilterFunctor(const uint32_t* filter_ids, const uint32_t filter_ids_length) :- filter_ids(filter_ids), filter_ids_length(filter_ids_length) {}+ explicit VectorFilterFunctor(const uint32_t* filter_ids, const uint32_t filter_ids_length, const uint32_t* excluded_ids = nullptr, const uint32_t excluded_ids_length = 0) :+ filter_ids(filter_ids), filter_ids_length(filter_ids_length), excluded_ids(excluded_ids), excluded_ids_length(excluded_ids_length) {}bool operator()(hnswlib::labeltype id) override {+ if(filter_ids_length == 0 && excluded_ids_length == 0) {+ return true;+ }++ if(excluded_ids_length > 0 && excluded_ids && std::binary_search(excluded_ids, excluded_ids + excluded_ids_length, id)) {+ return false;+ }+if(filter_ids_length == 0) {return true;}diff --git a/src/index.cpp b/src/index.cppindex 8be15837..90e7131b 100644--- a/src/index.cpp+++ b/src/index.cpp@@ -2901,7 +2901,7 @@ Option<bool> Index::search(std::vector<query_tokens_t>& field_query_tokens, consk++;}- VectorFilterFunctor filterFunctor(filter_result.docs, filter_result.count);+ VectorFilterFunctor filterFunctor(filter_result.docs, filter_result.count, excluded_result_ids, excluded_result_ids_size);auto& field_vector_index = vector_index.at(vector_query.field_name);std::vector<std::pair<float, size_t>> dist_labels;@@ -3206,20 +3206,8 @@ Option<bool> Index::search(std::vector<query_tokens_t>& field_query_tokens, cons// For hybrid search, we need to give weight to text match and vector searchconst float VECTOR_SEARCH_WEIGHT = vector_query.alpha;const float TEXT_MATCH_WEIGHT = 1.0 - VECTOR_SEARCH_WEIGHT;-- bool no_filters_provided = (filter_tree_root == nullptr && filter_result.count == 0);-- // list of all document ids- if (no_filters_provided) {- filter_result.count = seq_ids->num_ids();- filter_result.docs = seq_ids->uncompress();- }-- curate_filtered_ids(curated_ids, excluded_result_ids,- excluded_result_ids_size, filter_result.docs, filter_result.count, curated_ids_sorted);- collate_included_ids({}, included_ids_map, curated_topster, searched_queries);- VectorFilterFunctor filterFunctor(filter_result.docs, filter_result.count);+ VectorFilterFunctor filterFunctor(filter_result.docs, filter_result.count, excluded_result_ids, excluded_result_ids_size);auto& field_vector_index = vector_index.at(vector_query.field_name);std::vector<std::pair<float, size_t>> dist_labels;// use k as 100 by default for ensuring results stability in pagination