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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
use std::fmt::Debug;
use std::ops::*;
pub mod boxes;
#[cfg(test)]
mod test;
pub mod test_util;
pub trait BoundBox: Sized + Clone {
fn split(&self) -> (Self, Self);
fn hits(&self, b: &Self) -> bool;
}
pub trait Located {
type Box: BoundBox;
fn bounds(&self) -> Self::Box;
}
pub struct CollideTree<L: Located + Debug> {
bound: L::Box,
top: Vec<L>,
children: Option<Box<(CollideTree<L>, CollideTree<L>)>>,
}
impl<L: Located + Debug> CollideTree<L> {
pub fn new(bound: L::Box) -> Self {
CollideTree {
bound,
top: Vec::new(),
children: None,
}
}
pub fn add_item<F: FnMut(&L, &L)>(&mut self, item: L, f: &mut F) {
self.grow_children();
let ib = item.bounds();
for t in &self.top {
if t.bounds().hits(&ib) {
f(&t, &item);
}
}
match &mut self.children {
Some(b) => {
let (l, r) = b.deref_mut();
match (l.bound.hits(&ib), r.bound.hits(&ib)) {
(true, false) => l.add_item(item, f),
(false, true) => r.add_item(item, f),
_ => {
l.check_hits(&item, f);
r.check_hits(&item, f);
self.top.push(item);
}
}
}
None => self.top.push(item),
}
}
pub fn check_hits<F: FnMut(&L, &L)>(&self, item: &L, f: &mut F) {
let ib = item.bounds();
for t in &self.top {
if t.bounds().hits(&ib) {
f(&t, &item);
}
}
if let Some(b) = &self.children {
let (l, r) = b.deref();
if l.bound.hits(&ib) {
l.check_hits(item, f);
}
if r.bound.hits(&ib) {
r.check_hits(item, f);
}
}
}
pub fn grow_children(&mut self) {
if let Some(_) = self.children {
return;
}
if self.top.len() < 8 {
return;
}
let (l, r) = self.bound.split();
let (mut l, mut r) = (Self::new(l), Self::new(r));
let mut newtop = Vec::new();
std::mem::swap(&mut newtop, &mut self.top);
for v in newtop {
let ib = v.bounds();
match (l.bound.hits(&ib), r.bound.hits(&ib)) {
(true, false) => l.top.push(v),
(false, true) => r.top.push(v),
_ => self.top.push(v),
}
}
self.children = Some(Box::new((l, r)));
}
pub fn for_each_collision<F: FnMut(&L, &L)>(&self, f: &mut F) {
if self.top.len() > 0 {
for a in 0..self.top.len() - 1 {
for b in (a + 1)..self.top.len() {
if self.top[a].bounds().hits(&self.top[b].bounds()) {
f(&self.top[a], &self.top[b])
}
}
}
}
if let Some(b) = &self.children {
let (l, r) = b.deref();
for a in &self.top {
l.check_hits(a, f);
r.check_hits(a, f);
}
l.for_each_collision(f);
r.for_each_collision(f);
}
}
}
#[cfg(test)]
mod tests {
#[test]
fn it_works() {
assert_eq!(2 + 2, 4);
}
}