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
Use set for batch indexer request restore.
Kishore Nallan11f919c4f8ea
diff --git a/src/batched_indexer.cpp b/src/batched_indexer.cppindex 04e5d1e1..4d25f976 100644--- a/src/batched_indexer.cpp+++ b/src/batched_indexer.cpp@@ -354,7 +354,7 @@ void BatchedIndexer::load_state(const nlohmann::json& state) {queued_writes = state["queued_writes"].get<int64_t>();size_t num_reqs_restored = 0;- std::vector<uint64_t> queue_ids;+ std::set<uint64_t> queue_ids;for(auto& kv: state["req_res_map"].items()) {std::shared_ptr<http_req> req = std::make_shared<http_req>();@@ -382,7 +382,7 @@ void BatchedIndexer::load_state(const nlohmann::json& state) {const std::string& coll_name = get_collection_name(req);uint64_t queue_id = StringUtils::hash_wy(coll_name.c_str(), coll_name.size()) % num_threads;- queue_ids.push_back(queue_id);+ queue_ids.insert(queue_id);std::unique_lock qlk(qmutuxes[queue_id].mcv);queues[queue_id].emplace_back(req->start_ts);}