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
Remove counter list in num_tree.
Kishore Nallan35a9b8d50274
diff --git a/include/num_tree.h b/include/num_tree.hindex 26d5bdf4..30b2aaf4 100644--- a/include/num_tree.h+++ b/include/num_tree.h@@ -22,28 +22,6 @@ private:return ids_t::contains(ids, id);}- struct count_list {- count_list() = delete;-- ~count_list () = default;-- count_list(int64_t sv, uint32_t facet_count) {- facet_value = sv;- count = facet_count;- }-- count_list& operator=(count_list& obj) {- facet_value = obj.facet_value;- count = obj.count;- return *this;- }-- int64_t facet_value;- uint32_t count;- };-- std::vector<count_list> counter_list;-public:~num_tree_t();diff --git a/src/num_tree.cpp b/src/num_tree.cppindex 59a5220e..94aa7b97 100644--- a/src/num_tree.cpp+++ b/src/num_tree.cpp@@ -12,42 +12,6 @@ void num_tree_t::insert(int64_t value, uint32_t id, bool is_facet) {int64map[value] = ids;}}-- if(is_facet) {-- const auto facet_count = ids_t::num_ids(int64map.at(value));- //LOG(INFO) << "Facet count in facet " << value << " : " << facet_count;-- if(counter_list.empty()) {- counter_list.emplace_back(value, facet_count);- } else {- count_list node(value, facet_count);-- auto ind = 0;- // FIXME- for(; ind < counter_list.size(); ++ind) {- if(counter_list[ind].facet_value == value) {- counter_list[ind].count = facet_count;-- if(ind > 1) {- auto curr = ind;- while (curr && (counter_list[curr-1].count < counter_list[curr].count)) {- count_list temp = counter_list[curr-1];- counter_list[curr-1] = counter_list[curr];- counter_list[curr] = temp;- --curr;- }- }- break;- }- }- if(ind == counter_list.size()) {- // LOG (INFO) << "inserting at last facet " << node.facet_value- // << " with count " << node.count;- counter_list.emplace_back(node);- }- }- }}void num_tree_t::range_inclusive_search(int64_t start, int64_t end, uint32_t** ids, size_t& ids_len) {