postgres/typesense
1
0
Fork 0
mirror of https://github.com/typesense/typesense.git synced 2025-05-18 20:52:50 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

Remove counter list in num_tree.

Browse Source
This commit is contained in:
Kishore Nallan 2023-06-19 15:44:39 +05:30
parent 9c5e553240
commit 35a9b8d502
2 changed files with 0 additions and 58 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
include/num_tree.h
View File

@ -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();

36
src/num_tree.cpp
View File

@ -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) {