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
Add test case.
Harpreet Sangar596f77898e89
diff --git a/src/numeric_range_trie.cpp b/src/numeric_range_trie.cppindex 254bffd5..be0c7f2c 100644--- a/src/numeric_range_trie.cpp+++ b/src/numeric_range_trie.cpp@@ -20,6 +20,10 @@ void NumericTrie::insert(const int32_t& value, const uint32_t& seq_id) {void NumericTrie::search_range(const int32_t& low, const bool& low_inclusive,const int32_t& high, const bool& high_inclusive,uint32_t*& ids, uint32_t& ids_length) {+ if (low >= high) {+ return;+ }+if (low < 0 && high >= 0) {// Have to combine the results of >low from negative_trie and <high from positive_triediff --git a/test/numeric_range_trie_test.cpp b/test/numeric_range_trie_test.cppindex 6b6fa45f..ff297aec 100644--- a/test/numeric_range_trie_test.cpp+++ b/test/numeric_range_trie_test.cpp@@ -30,9 +30,14 @@ TEST_F(NumericRangeTrieTest, SearchRange) {uint32_t* ids = nullptr;uint32_t ids_length = 0;- trie->search_range(-32768, true, 32768, true, ids, ids_length);+ trie->search_range(32768, true, -32768, true, ids, ids_length);std::unique_ptr<uint32_t[]> ids_guard(ids);+ ASSERT_EQ(0, ids_length);++ trie->search_range(-32768, true, 32768, true, ids, ids_length);+ ids_guard.reset(ids);+ASSERT_EQ(pairs.size(), ids_length);for (uint32_t i = 0; i < pairs.size(); i++) {ASSERT_EQ(pairs[i].second, ids[i]);