Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

support ACORN-1#673

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.

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

Already on GitHub?Sign in to your account

Open
cpegeric wants to merge9 commits intounum-cloud:main
base:main
Choose a base branch
Loading
fromcpegeric:acorn-1
Open
Changes from1 commit
Commits
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
PrevPrevious commit
NextNext commit
update
  • Loading branch information
@vderic
vderic committedOct 29, 2025
commit5afdae1b64b2d8b170a93b3ab8ccfd38685e46c8
100 changes: 68 additions & 32 deletionsinclude/usearch/index.hpp
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -4213,36 +4213,70 @@ class index_gt {
next.pop();
context.iteration_cycles++;

neighbors_ref_t candidate_neighbors = neighbors_base_(node_at_(candidate.slot));
if (is_dummy<predicate_at>()) {

// Optional prefetching
if (!is_dummy<prefetch_at>()) {
candidates_range_t missing_candidates{*this, candidate_neighbors, visits};
prefetch(missing_candidates.begin(), missing_candidates.end());
}
neighbors_ref_t candidate_neighbors = neighbors_base_(node_at_(candidate.slot));

// Assume the worst-case when reserving memory
if (!visits.reserve(visits.size() + candidate_neighbors.size()))
return false;
// Optional prefetching
if (!is_dummy<prefetch_at>()) {
candidates_range_t missing_candidates{*this, candidate_neighbors, visits};
prefetch(missing_candidates.begin(), missing_candidates.end());
}

for (compressed_slot_t successor_slot : candidate_neighbors) {
if (visits.set(successor_slot))
continue;
// Assume the worst-case when reserving memory
if (!visits.reserve(visits.size() + candidate_neighbors.size()))
return false;

distance_t successor_dist = context.measure(query, citerator_at(successor_slot), metric);
if (top.size() < top_limit || successor_dist < radius) {
// This can substantially grow our priority queue:
next.insert({-successor_dist, successor_slot});
if (is_dummy<predicate_at>() ||
predicate(member_cref_t{node_at_(successor_slot).ckey(), successor_slot})) {
top.insert({successor_dist, successor_slot}, top_limit);
radius = top.top().distance;
for (compressed_slot_t successor_slot : candidate_neighbors) {
if (visits.set(successor_slot))
continue;

distance_t successor_dist = context.measure(query, citerator_at(successor_slot), metric);
if (top.size() < top_limit || successor_dist < radius) {
// This can substantially grow our priority queue:
next.insert({-successor_dist, successor_slot});
if (is_dummy<predicate_at>() ||
predicate(member_cref_t{node_at_(successor_slot).ckey(), successor_slot})) {
top.insert({successor_dist, successor_slot}, top_limit);
radius = top.top().distance;
}
}
}
}

// predicate exists and explore 2-hop neighbors (ACORN-1)
if (!is_dummy<predicate_at>()) {
} else {
// ACORN-1

// explore 1-hop neighbors
neighbors_ref_t candidate_neighbors = neighbors_base_(node_at_(candidate.slot));

// Optional prefetching
if (!is_dummy<prefetch_at>()) {
candidates_range_t missing_candidates{*this, candidate_neighbors, visits};
prefetch(missing_candidates.begin(), missing_candidates.end());
}

// Assume the worst-case when reserving memory
if (!visits.reserve(visits.size() + candidate_neighbors.size()))
return false;

for (compressed_slot_t successor_slot : candidate_neighbors) {
if (visits.set(successor_slot))
continue;

if (predicate(member_cref_t{node_at_(successor_slot).ckey(), successor_slot})) {
distance_t successor_dist = context.measure(query, citerator_at(successor_slot), metric);
if (top.size() < top_limit || successor_dist < radius) {
// This can substantially grow our priority queue:
next.insert({-successor_dist, successor_slot});

top.insert({successor_dist, successor_slot}, top_limit);
radius = top.top().distance;
}
}
}


// explore 2-hop neighbors
for (compressed_slot_t successor_slot : candidate_neighbors) {
neighbors_ref_t hop2_candidate_neighbors = neighbors_base_(node_at_(successor_slot));

Expand All@@ -4261,19 +4295,21 @@ class index_gt {
if (visits.set(hop2_successor_slot))
continue;

distance_t hop2_successor_dist = context.measure(query, citerator_at(hop2_successor_slot), metric);
if (top.size() < top_limit || hop2_successor_dist < radius) {
// This can substantially grow our priority queue:
next.insert({-hop2_successor_dist, hop2_successor_slot});
if (is_dummy<predicate_at>() ||
predicate(member_cref_t{node_at_(hop2_successor_slot).ckey(), hop2_successor_slot})) {
top.insert({hop2_successor_dist, hop2_successor_slot}, top_limit);
radius = top.top().distance;
if (predicate(member_cref_t{node_at_(hop2_successor_slot).ckey(), hop2_successor_slot})) {
distance_t hop2_successor_dist =
context.measure(query, citerator_at(hop2_successor_slot), metric);
if (top.size() < top_limit || hop2_successor_dist < radius) {
// This can substantially grow our priority queue:
next.insert({-hop2_successor_dist, hop2_successor_slot});

top.insert({hop2_successor_dist, hop2_successor_slot}, top_limit);
radius = top.top().distance;
}
}
}
}
}
}

}

return true;
Expand Down
[8]ページ先頭
©2009-2025 Movatter.jp