|
| 1 | +use codspeed_criterion_compat::{ |
| 2 | + black_box, criterion_group, criterion_main, BenchmarkId, Criterion, Throughput, |
| 3 | +}; |
| 4 | +use kiddo::dist::SquaredEuclidean; |
| 5 | +use kiddo::kd_tree::leaf_strategies::VecOfArenas; |
| 6 | +use kiddo::kd_tree::KdTree; |
| 7 | +use kiddo::stem_strategies::donnelly_2_pf::DonnellyPf; |
| 8 | +use rand::Rng; |
| 9 | +use rand::SeedableRng; |
| 10 | +use rand_chacha::ChaCha8Rng; |
| 11 | +use std::num::NonZeroUsize; |
| 12 | + |
| 13 | +const K: usize = 3; |
| 14 | +const B: usize = 32; |
| 15 | +const DEFAULT_QUERY_COUNT: usize = 1_00; |
| 16 | +const DEFAULT_POINT_COUNT: usize = 1usize << 24; |
| 17 | +const DEFAULT_MAX_QTY: usize = 16; |
| 18 | +const DEFAULT_MAX_DIST: f64 = 0.0025; |
| 19 | +const POINT_SEED: u64 = 0x5eed_0000_0000_0301; |
| 20 | +const QUERY_SEED: u64 = 0x5eed_0000_0000_0302; |
| 21 | + |
| 22 | +type ArenaLeaves = VecOfArenas<f64, u32, K, B>; |
| 23 | +type DonnellyPfTree = KdTree<f64, u32, DonnellyPf<3, 64, 8, K>, ArenaLeaves, K, B>; |
| 24 | + |
| 25 | +fn read_usize_env(var: &str, default: usize) -> usize { |
| 26 | + std::env::var(var) |
| 27 | + .ok() |
| 28 | + .and_then(|value| value.parse::<usize>().ok()) |
| 29 | + .unwrap_or(default) |
| 30 | +} |
| 31 | + |
| 32 | +fn read_f64_env(var: &str, default: f64) -> f64 { |
| 33 | + std::env::var(var) |
| 34 | + .ok() |
| 35 | + .and_then(|value| value.parse::<f64>().ok()) |
| 36 | + .unwrap_or(default) |
| 37 | +} |
| 38 | + |
| 39 | +fn build_points(point_count: usize) -> Vec<[f64; K]> { |
| 40 | + let mut rng = ChaCha8Rng::seed_from_u64(POINT_SEED); |
| 41 | + (0..point_count).map(|_| rng.random::<[f64; K]>()).collect() |
| 42 | +} |
| 43 | + |
| 44 | +fn build_queries(query_count: usize) -> Vec<[f64; K]> { |
| 45 | + let mut rng = ChaCha8Rng::seed_from_u64(QUERY_SEED); |
| 46 | + (0..query_count).map(|_| rng.random::<[f64; K]>()).collect() |
| 47 | +} |
| 48 | + |
| 49 | +fn run_sorted_nearest_n_within_queries( |
| 50 | + tree: &DonnellyPfTree, |
| 51 | + queries: &[[f64; K]], |
| 52 | + max_dist: f64, |
| 53 | + max_qty: NonZeroUsize, |
| 54 | +) -> (usize, u64, f64) { |
| 55 | + let mut checksum_len = 0usize; |
| 56 | + let mut checksum_item = 0u64; |
| 57 | + let mut checksum_dist = 0.0f64; |
| 58 | + |
| 59 | + for query in queries { |
| 60 | + let results = tree.nearest_n_within::<SquaredEuclidean<f64>>( |
| 61 | + black_box(query), |
| 62 | + max_dist, |
| 63 | + max_qty, |
| 64 | + true, |
| 65 | + ); |
| 66 | + checksum_len += results.len(); |
| 67 | + |
| 68 | + for result in results { |
| 69 | + checksum_item = checksum_item.wrapping_add(result.item as u64); |
| 70 | + checksum_dist += result.distance; |
| 71 | + } |
| 72 | + } |
| 73 | + |
| 74 | + (checksum_len, checksum_item, checksum_dist) |
| 75 | +} |
| 76 | + |
| 77 | +fn run_best_n_within_queries( |
| 78 | + tree: &DonnellyPfTree, |
| 79 | + queries: &[[f64; K]], |
| 80 | + max_dist: f64, |
| 81 | + max_qty: NonZeroUsize, |
| 82 | +) -> (usize, u64, f64) { |
| 83 | + let mut checksum_len = 0usize; |
| 84 | + let mut checksum_item = 0u64; |
| 85 | + let mut checksum_dist = 0.0f64; |
| 86 | + |
| 87 | + for query in queries { |
| 88 | + let results = |
| 89 | + tree.best_n_within::<SquaredEuclidean<f64>>(black_box(query), max_dist, max_qty); |
| 90 | + checksum_len += results.len(); |
| 91 | + |
| 92 | + for result in results.into_vec() { |
| 93 | + checksum_item = checksum_item.wrapping_add(result.item as u64); |
| 94 | + checksum_dist += result.distance; |
| 95 | + } |
| 96 | + } |
| 97 | + |
| 98 | + (checksum_len, checksum_item, checksum_dist) |
| 99 | +} |
| 100 | + |
| 101 | +fn v6_result_collection_focus(c: &mut Criterion) { |
| 102 | + let query_count = read_usize_env("KIDDO_BENCH_QUERIES", DEFAULT_QUERY_COUNT); |
| 103 | + let point_count = read_usize_env("KIDDO_BENCH_POINTS", DEFAULT_POINT_COUNT); |
| 104 | + let max_qty = |
| 105 | + NonZeroUsize::new(read_usize_env("KIDDO_BENCH_MAX_QTY", DEFAULT_MAX_QTY)).unwrap(); |
| 106 | + let max_dist = read_f64_env("KIDDO_BENCH_MAX_DIST", DEFAULT_MAX_DIST); |
| 107 | + |
| 108 | + let points = build_points(point_count); |
| 109 | + let queries = build_queries(query_count); |
| 110 | + let tree: DonnellyPfTree = KdTree::new_from_slice(&points); |
| 111 | + |
| 112 | + let mut group = c.benchmark_group("v6 result collection focus"); |
| 113 | + group.throughput(Throughput::Elements(query_count as u64)); |
| 114 | + |
| 115 | + group.bench_function( |
| 116 | + BenchmarkId::new("sorted nearest_n_within / Donnelly PF", point_count), |
| 117 | + |b| { |
| 118 | + b.iter(|| { |
| 119 | + black_box(run_sorted_nearest_n_within_queries( |
| 120 | + &tree, &queries, max_dist, max_qty, |
| 121 | + )) |
| 122 | + }); |
| 123 | + }, |
| 124 | + ); |
| 125 | + |
| 126 | + group.bench_function( |
| 127 | + BenchmarkId::new("best_n_within / Donnelly PF", point_count), |
| 128 | + |b| { |
| 129 | + b.iter(|| { |
| 130 | + black_box(run_best_n_within_queries( |
| 131 | + &tree, &queries, max_dist, max_qty, |
| 132 | + )) |
| 133 | + }); |
| 134 | + }, |
| 135 | + ); |
| 136 | + |
| 137 | + group.finish(); |
| 138 | +} |
| 139 | + |
| 140 | +criterion_group!(benches, v6_result_collection_focus); |
| 141 | +criterion_main!(benches); |
0 commit comments