1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
//! Exhaustive nearest neighbor search.
use crate::distance::Proximity;
use crate::{ExactNeighbors, NearestNeighbors, Neighborhood};
use std::iter::FromIterator;
/// A [`NearestNeighbors`] implementation that does exhaustive search.
#[derive(Debug)]
pub struct ExhaustiveSearch<T>(Vec<T>);
impl<T> ExhaustiveSearch<T> {
/// Create an empty ExhaustiveSearch index.
pub fn new() -> Self {
Self(Vec::new())
}
/// Add a new item to the index.
pub fn push(&mut self, item: T) {
self.0.push(item);
}
/// Get the size of this index.
pub fn len(&self) -> usize {
self.0.len()
}
/// Check if this index is empty.
pub fn is_empty(&self) -> bool {
self.0.is_empty()
}
}
impl<T> Default for ExhaustiveSearch<T> {
fn default() -> Self {
Self::new()
}
}
impl<T> FromIterator<T> for ExhaustiveSearch<T> {
fn from_iter<I: IntoIterator<Item = T>>(items: I) -> Self {
Self(items.into_iter().collect())
}
}
impl<T> IntoIterator for ExhaustiveSearch<T> {
type Item = T;
type IntoIter = std::vec::IntoIter<T>;
fn into_iter(self) -> Self::IntoIter {
self.0.into_iter()
}
}
impl<T> Extend<T> for ExhaustiveSearch<T> {
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
for value in iter {
self.push(value);
}
}
}
impl<K: Proximity<V>, V> NearestNeighbors<K, V> for ExhaustiveSearch<V> {
fn search<'k, 'v, N>(&'v self, mut neighborhood: N) -> N
where
K: 'k,
V: 'v,
N: Neighborhood<&'k K, &'v V>,
{
for e in &self.0 {
neighborhood.consider(e);
}
neighborhood
}
}
impl<K: Proximity<V>, V> ExactNeighbors<K, V> for ExhaustiveSearch<V> {}
#[cfg(test)]
pub mod tests {
use super::*;
use crate::tests::test_nearest_neighbors;
#[test]
fn test_exhaustive_index() {
test_nearest_neighbors(ExhaustiveSearch::from_iter);
}
}
|
