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
Minor cleanup.
Kishore Nallan5b14e4d50c3e
diff --git a/.gitignore b/.gitignoreindex de6f8243..f78debb7 100644--- a/.gitignore+++ b/.gitignore@@ -2,6 +2,7 @@*.imlexternal*build*+cmake-build*cmake-build-debugcmake-build-release*.pemdiff --git a/src/posting.cpp b/src/posting.cppindex 50cbd10c..c71a361b 100644--- a/src/posting.cpp+++ b/src/posting.cpp@@ -141,7 +141,6 @@ compact_posting_list_t* compact_posting_list_t::create(uint32_t num_ids, uint32_pl->length = 0;pl->capacity = length_required;- size_t id_offsets_index = 0;for(size_t i = 0; i < num_ids; i++) {uint32_t start_offset = offset_index[i];uint32_t next_start_offset = (i == num_ids-1) ? num_offsets : offset_index[i+1];diff --git a/src/posting_list.cpp b/src/posting_list.cppindex a5229150..f0211bfb 100644--- a/src/posting_list.cpp+++ b/src/posting_list.cpp@@ -392,7 +392,6 @@ void posting_list_t::upsert(const uint32_t id, const std::vector<uint32_t>& offslast_id_t before_upsert_last_id;if(id_block_map.empty()) {- //id_block_map.emplace(id, &root_block);upsert_block = &root_block;before_upsert_last_id = UINT32_MAX;} else {