fixed bug with vector adaptation

cmuparlay · Apr 4, 2024 · 42969b8 · 42969b8
1 parent 9aeff04
commit 42969b8
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/benchmarks/concurrentKNN/octTree/experiments.sh b/benchmarks/concurrentKNN/octTree/experiments.sh
@@ -31,7 +31,7 @@ mkdir -p graphs
 
 ##OVERSUBSCRIPTION
 
-# python3 run_experiments.py [neighbors_bench,neighbors_bench_lockfree,neighbors_bench_path_copy,neighbors_bench_path_copy_lockfree] [144,196,288,432,500] [50] [1] 3 [3DinCube_20M]
+python3 run_experiments.py [neighbors_bench,neighbors_bench_lockfree,neighbors_bench_path_copy,neighbors_bench_path_copy_lockfree] [144,196,288,432,500] [50] [1] 3 [3DinCube_20M]
 python3 run_experiments.py [working_set_bench,working_set_bench_lockfree] [144,196,288,432,500] [50] [1] 3 [3DinCube_WorkingSet_11M]
 
 

diff --git a/benchmarks/concurrentKNN/octTree/k_nearest_neighbors.h b/benchmarks/concurrentKNN/octTree/k_nearest_neighbors.h
@@ -720,7 +720,7 @@ node* find_leaf(node* T){ //takes in a point since interleave_bits() takes in a
             // std::cout << "case 1" << std::endl;
             //we know we are in case 1
             //form leaf
-            parlay::sequence<indexed_point> points = {q};
+            std::vector<indexed_point> points = {q};
             node* R = node::new_leaf(std::move(points), cur_bit-1);
             //new parent node should replace T as G's child
             node* P;