Skip to content

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

Don't consider failed imports for progress calculation.

Kishore Nallan6621280ffc40
diff --git a/src/batched_indexer.cpp b/src/batched_indexer.cpp
index 0ab631bc..9593e765 100644
--- a/src/batched_indexer.cpp
+++ b/src/batched_indexer.cpp
@@ -44,7 +44,6 @@ void BatchedIndexer::enqueue(const std::shared_ptr<http_req>& req, const std::sh
//LOG(INFO) << "req_id: " << req->start_ts << ", chunk_sequence: " << chunk_sequence;
store->insert(request_chunk_key, req->serialize());
- queued_writes++;
req->body = "";
{
@@ -62,6 +61,8 @@ void BatchedIndexer::enqueue(const std::shared_ptr<http_req>& req, const std::sh
if(req->last_chunk_aggregate) {
//LOG(INFO) << "Last chunk for req_id: " << req->start_ts << ", queue_id: " << queue_id;
+ queued_writes += (chunk_sequence + 1);
+
{
std::unique_lock lk(qmutuxes[queue_id]);
queues[queue_id].emplace_back(req->start_ts);