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

Use malloc/free consistently for managing array buffer.

kishorencae6ea0ba6c80
diff --git a/src/array.cpp b/src/array.cpp
index bc901ff7..7a009d2c 100644
--- a/src/array.cpp
+++ b/src/array.cpp
@@ -61,12 +61,12 @@ void array::remove_index(uint32_t start_index, uint32_t end_index) {
}
uint32_t size_required = (uint32_t) (unsorted_append_size_required(max, new_index) * FOR_GROWTH_FACTOR);
- uint8_t *out = new uint8_t[size_required];
+ uint8_t *out = (uint8_t *) malloc(size_required * sizeof *out);
uint32_t actual_size = for_compress_unsorted(new_array, out, new_index);
delete[] curr_array;
delete[] new_array;
- delete[] in;
+ free(in);
in = out;
length = new_index;
diff --git a/src/sorted_array.cpp b/src/sorted_array.cpp
index 228f6ba8..60f0a962 100644
--- a/src/sorted_array.cpp
+++ b/src/sorted_array.cpp
@@ -6,7 +6,7 @@ void sorted_array::load(const uint32_t *sorted_array, const uint32_t array_lengt
max = array_length > 1 ? sorted_array[array_length-1] : min;
uint32_t size_required = (uint32_t) (sorted_append_size_required(max, array_length) * FOR_GROWTH_FACTOR);
- uint8_t *out = new uint8_t[size_required];
+ uint8_t *out = (uint8_t *) malloc(size_required * sizeof *out);
uint32_t actual_size = for_compress_sorted(sorted_array, out, array_length);
free(in);