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
Merge branch 'v0.25-join' into v0.26-filter
Kishore Nalland68c4fb3b356
diff --cc include/index.hindex c01ed672,b9aa57f6..01824c62--- a/include/index.h+++ b/include/index.h@@@ -930,16 -948,17 +930,19 @@@ publicint64_t* scores,int64_t& match_score_index) const;- void- process_curated_ids(const std::vector<std::pair<uint32_t, uint32_t>>& included_ids,- const std::vector<uint32_t>& excluded_ids, const std::vector<std::string>& group_by_fields,- const size_t group_limit, const bool filter_curated_hits, const uint32_t* filter_ids,- uint32_t filter_ids_length, std::set<uint32_t>& curated_ids,- std::map<size_t, std::map<size_t, uint32_t>>& included_ids_map,- std::vector<uint32_t>& included_ids_vec,- std::unordered_set<uint32_t>& excluded_group_ids) const;+ void process_curated_ids(const std::vector<std::pair<uint32_t, uint32_t>>& included_ids,+ const std::vector<uint32_t>& excluded_ids, const std::vector<std::string>& group_by_fields,+ const size_t group_limit, const bool filter_curated_hits,+ filter_result_iterator_t* const filter_result_iterator,+ std::set<uint32_t>& curated_ids,+ std::map<size_t, std::map<size_t, uint32_t>>& included_ids_map,+ std::vector<uint32_t>& included_ids_vec,+ std::unordered_set<uint32_t>& excluded_group_ids) const;+ Option<bool> seq_ids_outside_top_k(const std::string& field_name, size_t k,+ std::vector<uint32_t>& outside_seq_ids);+++ friend class filter_result_iterator_t;};template<class T>