Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use unique_ptr to manage visited_list_pool_ #474

Merged
merged 2 commits into from
Jul 4, 2023
Merged

Use unique_ptr to manage visited_list_pool_ #474

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
013def5
[bruteforce] Fix bruteforce removePoint.
ttsugriy Jun 19, 2023
1ee95db
Use unique_ptr to manage visited_list_pool_.
ttsugriy Jun 19, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
[bruteforce] Fix bruteforce removePoint.
  • Loading branch information
@ttsugriy
ttsugriy committed Jun 19, 2023
commit 013def5142e515696e1f41b36c42486dfa4a1a38
10 changes: 8 additions & 2 deletions hnswlib/bruteforce.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -84,10 +84,16 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {


void removePoint(labeltype cur_external) {
size_t cur_c = dict_external_to_internal[cur_external];
std::unique_lock<std::mutex> lock(index_lock);

dict_external_to_internal.erase(cur_external);
auto found = dict_external_to_internal.find(cur_external);
if (found == dict_external_to_internal.end()) {
return;
}

dict_external_to_internal.erase(found);

size_t cur_c = found->second;
labeltype label = *((labeltype*)(data_ + size_per_element_ * (cur_element_count-1) + data_size_));
dict_external_to_internal[label] = cur_c;
memcpy(data_ + size_per_element_ * cur_c,
Expand Down