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
Add tests for `filter_result_iterator_t::contains_atleast_one`.
Harpreet Sangar37aec4ba0bc5
diff --git a/src/filter.cpp b/src/filter.cppindex 13069fb7..c152d77f 100644--- a/src/filter.cpp+++ b/src/filter.cpp@@ -755,45 +755,3 @@ Option<bool> filter::parse_filter_query(const std::string& filter_query,return Option<bool>(true);}--bool filter_result_iterator_t::contains_atleast_one(const void *obj) {- if(IS_COMPACT_POSTING(obj)) {- compact_posting_list_t* list = COMPACT_POSTING_PTR(obj);-- size_t i = 0;- while(i < list->length && valid()) {- size_t num_existing_offsets = list->id_offsets[i];- size_t existing_id = list->id_offsets[i + num_existing_offsets + 1];-- if (existing_id == seq_id) {- return true;- }-- // advance smallest value- if (existing_id < seq_id) {- i += num_existing_offsets + 2;- } else {- skip_to(existing_id);- }- }- } else {- auto list = (posting_list_t*)(obj);- posting_list_t::iterator_t it = list->new_iterator();-- while(it.valid() && valid()) {- uint32_t id = it.id();-- if(id == seq_id) {- return true;- }-- if(id < seq_id) {- it.skip_to(seq_id);- } else {- skip_to(id);- }- }- }-- return false;-}