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
Allow upto 500 hits to be overridden.
Kishore Nallan2952b0d4613c
diff --git a/include/index.h b/include/index.hindex 39abd0ac..838cae79 100644--- a/include/index.h+++ b/include/index.h@@ -186,7 +186,7 @@ private:void collate_curated_ids(const std::string & query, const std::string & field, const uint8_t field_id,const std::vector<uint32_t> & included_ids,- Topster<32> & curated_topster, std::vector<std::vector<art_leaf*>> & searched_queries);+ Topster<512> & curated_topster, std::vector<std::vector<art_leaf*>> & searched_queries);public:Index() = delete;diff --git a/src/index.cpp b/src/index.cppindex 5418323a..0ed910a4 100644--- a/src/index.cpp+++ b/src/index.cpp@@ -811,7 +811,7 @@ void Index::run_search() {void Index::collate_curated_ids(const std::string & query, const std::string & field, const uint8_t field_id,const std::vector<uint32_t> & included_ids,- Topster<32> & curated_topster,+ Topster<512> & curated_topster,std::vector<std::vector<art_leaf*>> & searched_queries) {if(included_ids.size() == 0) {@@ -903,7 +903,7 @@ void Index::search(Option<uint32_t> & outcome, std::string query, const std::vecuint32_t* all_result_ids = nullptr;Topster<512> topster;- Topster<32> curated_topster;+ Topster<512> curated_topster;if(query == "*") {const uint8_t field_id = (uint8_t)(FIELD_LIMIT_NUM - 0);