| 35 | } |
| 36 | |
| 37 | int DiskAnnAlgorithm::add_node(diskann_id_t id, DiskAnnContext *ctx) { |
| 38 | const void *vec = entity_.get_vector(id); |
| 39 | |
| 40 | ctx->reset_query(vec); |
| 41 | |
| 42 | std::vector<diskann_id_t> pruned_list; |
| 43 | |
| 44 | int ret = search_neighbor_and_prune(id, pruned_list, ctx); |
| 45 | if (ret != 0) { |
| 46 | return ret; |
| 47 | } |
| 48 | |
| 49 | { |
| 50 | auto lock = lock_for(id); |
| 51 | ret = entity_.set_neighbors(id, pruned_list); |
| 52 | if (ret != 0) return ret; |
| 53 | } |
| 54 | |
| 55 | return inter_insert(id, pruned_list, ctx); |
| 56 | } |
| 57 | |
| 58 | int DiskAnnAlgorithm::prune_node(diskann_id_t id, DiskAnnContext *ctx) { |
| 59 | DistCalculator &dc = ctx->dist_calculator(); |
no test coverage detected