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
use kdtree::distance::squared_euclidean;
use kdtree::KdTree as KdTreeCore;
use specs::Entity;
use crate::Vec3;
#[derive(Debug)]
pub struct Search {
all: KdTreeCore<f32, Entity, Vec<f32>>,
clients: KdTreeCore<f32, Entity, Vec<f32>>,
entities: KdTreeCore<f32, Entity, Vec<f32>>,
}
impl Default for Search {
fn default() -> Self {
Self::new()
}
}
impl Search {
pub fn new() -> Self {
Self {
all: KdTreeCore::new(3),
clients: KdTreeCore::new(3),
entities: KdTreeCore::new(3),
}
}
pub fn reset(&mut self) {
self.all = KdTreeCore::new(3);
self.clients = KdTreeCore::new(3);
self.entities = KdTreeCore::new(3);
}
pub fn add_client(&mut self, ent: Entity, point: Vec3<f32>) {
self.clients
.add(vec![point.0, point.1, point.2], ent)
.expect("Unable to construct KdTree.");
self.all
.add(vec![point.0, point.1, point.2], ent)
.expect("Unable to construct KdTree.");
}
pub fn add_entity(&mut self, ent: Entity, point: Vec3<f32>) {
self.entities
.add(vec![point.0, point.1, point.2], ent)
.expect("Unable to construct tree.");
self.all
.add(vec![point.0, point.1, point.2], ent)
.expect("Unable to construct tree.");
}
pub fn within(&self, point: &Vec3<f32>, radius: f32) -> Vec<(f32, &Entity)> {
self.all
.within(&[point.0, point.1, point.2], radius, &squared_euclidean)
.expect("Unable to search tree.")
.into_iter()
.collect::<Vec<_>>()
}
pub fn within_entity(
&self,
point: &Vec3<f32>,
from: &Entity,
radius: f32,
) -> Vec<(f32, &Entity)> {
self.all
.within(&[point.0, point.1, point.2], radius, &squared_euclidean)
.expect("Unable to search tree.")
.into_iter()
.filter(|(_, &ent)| ent.id() != from.id())
.collect::<Vec<_>>()
}
pub fn search(&self, point: &Vec3<f32>, count: usize) -> Vec<(f32, &Entity)> {
self.all
.nearest(&[point.0, point.1, point.2], count + 1, &squared_euclidean)
.expect("Unable to search tree.")
}
}