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

Fix size calculation for unsorted append.

Kishore Nallan734640cd2a9a
diff --git a/include/forarray.h b/include/forarray.h
index fcacf371..867fc10f 100644
--- a/include/forarray.h
+++ b/include/forarray.h
@@ -59,16 +59,10 @@ public:
}
uint32_t inline unsorted_append_size_required(uint32_t value) {
- if (length == 0) {
- return METADATA_OVERHEAD+FOR_ELE_SIZE;
- }
-
uint32_t m = std::min(min, value);
uint32_t M = std::max(max, value);
-
uint32_t bnew = required_bits(M - m);
-
- return METADATA_OVERHEAD + for_compressed_size_bits(length, bnew);
+ return METADATA_OVERHEAD + for_compressed_size_bits(length+1, bnew);
}
bool append_unsorted(uint32_t value) {