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
Reduce memory foot-print.
Kishore Nallanef105dcbd901
diff --git a/include/art.h b/include/art.hindex c96e072e..a01418a2 100644--- a/include/art.h+++ b/include/art.h@@ -17,7 +17,7 @@ extern "C" {#define NODE48 3#define NODE256 4-#define MAX_PREFIX_LEN 10+#define MAX_PREFIX_LEN 8#define MAX(x, y) (((x) > (y)) ? (x) : (y))@@ -41,10 +41,10 @@ typedef int(*art_callback)(void *data, const unsigned char *key, uint32_t key_letypedef struct {uint8_t type;uint8_t num_children;- uint16_t max_score;- uint32_t max_token_count;- uint32_t partial_len;+ uint8_t partial_len;unsigned char partial[MAX_PREFIX_LEN];+ uint32_t max_score;+ uint32_t max_token_count;} art_node;/**diff --git a/src/collection.cpp b/src/collection.cppindex 634c07e4..7a6bee7e 100644--- a/src/collection.cpp+++ b/src/collection.cpp@@ -255,6 +255,7 @@ void _remove_and_shift_offset_index(forarray &offset_index, const uint32_t* indiuint32_t *curr_array = offset_index.uncompress();uint32_t *new_array = new uint32_t[offset_index.getLength()];+ new_array[0] = 0;uint32_t new_index = 0;uint32_t curr_index = 0;uint32_t indices_counter = 0;