66 lines
2.0 KiB
Rust
66 lines
2.0 KiB
Rust
use std::collections::HashSet;
|
|
|
|
use ordered_float::OrderedFloat;
|
|
use rand::rngs::{StdRng, ThreadRng};
|
|
use rand::{Rng, SeedableRng};
|
|
|
|
use instant_distance::{Builder, Point as _, PointId, Search};
|
|
|
|
#[test]
|
|
fn random_heuristic() {
|
|
let (seed, recall) = randomized(Builder::default());
|
|
println!("heuristic (seed = {}) recall = {}", seed, recall);
|
|
assert!(recall > 97, "expected at least 98, got {}", recall);
|
|
}
|
|
|
|
#[test]
|
|
fn random_simple() {
|
|
let (seed, recall) = randomized(Builder::default().select_heuristic(None));
|
|
println!("simple (seed = {}) recall = {}", seed, recall);
|
|
assert!(recall > 90, "expected at least 90, got {}", recall);
|
|
}
|
|
|
|
fn randomized(builder: Builder) -> (u64, usize) {
|
|
let seed = ThreadRng::default().gen::<u64>();
|
|
let mut rng = StdRng::seed_from_u64(seed);
|
|
let points = (0..1024)
|
|
.into_iter()
|
|
.map(|_| Point(rng.gen(), rng.gen()))
|
|
.collect::<Vec<_>>();
|
|
|
|
let query = Point(rng.gen(), rng.gen());
|
|
let mut nearest = Vec::with_capacity(256);
|
|
for (i, p) in points.iter().enumerate() {
|
|
nearest.push((OrderedFloat::from(query.distance(p)), i));
|
|
if nearest.len() >= 200 {
|
|
nearest.sort_unstable();
|
|
nearest.truncate(100);
|
|
}
|
|
}
|
|
|
|
let (hnsw, pids) = builder.seed(seed).build(&points);
|
|
let mut search = Search::default();
|
|
let mut results = vec![PointId::default(); 100];
|
|
let found = hnsw.search(&query, &mut results, &mut search);
|
|
assert_eq!(found, 100);
|
|
|
|
nearest.sort_unstable();
|
|
nearest.truncate(100);
|
|
let forced = nearest
|
|
.iter()
|
|
.map(|(_, i)| pids[*i])
|
|
.collect::<HashSet<_>>();
|
|
let found = results.into_iter().take(found).collect::<HashSet<_>>();
|
|
(seed, forced.intersection(&found).count())
|
|
}
|
|
|
|
#[derive(Clone, Copy, Debug)]
|
|
struct Point(f32, f32);
|
|
|
|
impl instant_distance::Point for Point {
|
|
fn distance(&self, other: &Self) -> f32 {
|
|
// Euclidean distance metric
|
|
((self.0 - other.0).powi(2) + (self.1 - other.1).powi(2)).sqrt()
|
|
}
|
|
}
|