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
use crate::covertree::node::CoverNode;
use crate::covertree::CoverTreeReader;
use crate::*;
use std::fmt::Debug;
use type_map::concurrent::TypeMap;
pub mod distributions;
pub mod labels;
pub trait NodePlugin<D: PointCloud>: Send + Sync + Debug {
fn update(&mut self, my_node: &CoverNode<D>, my_tree: &CoverTreeReader<D>);
}
pub trait TreePlugin<D: PointCloud>: Send + Sync + Debug {
fn update(&mut self, my_tree: &CoverTreeReader<D>);
}
pub trait GokoPlugin<D: PointCloud> {
type NodeComponent: NodePlugin<D> + Clone + 'static;
type TreeComponent: TreePlugin<D> + Clone + 'static;
fn node_component(
parameters: &Self::TreeComponent,
my_node: &CoverNode<D>,
my_tree: &CoverTreeReader<D>,
) -> Self::NodeComponent;
}
pub(crate) type NodePluginSet = TypeMap;
pub(crate) type TreePluginSet = TypeMap;
#[cfg(test)]
pub(crate) mod tests {
use super::*;
use crate::covertree::tests::build_basic_tree;
#[derive(Debug, Clone)]
struct DumbNode1 {
id: u32,
pi: PointIndex,
cover_count: usize,
}
impl<D: PointCloud> NodePlugin<D> for DumbNode1 {
fn update(&mut self, _my_node: &CoverNode<D>, _my_tree: &CoverTreeReader<D>) {
self.id += 1;
}
}
#[derive(Debug, Clone)]
struct DumbTree1 {
id: u32,
}
impl<D: PointCloud> TreePlugin<D> for DumbTree1 {
fn update(&mut self, _my_tree: &CoverTreeReader<D>) {
self.id += 1;
}
}
#[derive(Debug)]
struct DumbGoko1 {}
impl<D: PointCloud> GokoPlugin<D> for DumbGoko1 {
type NodeComponent = DumbNode1;
type TreeComponent = DumbTree1;
fn node_component(
parameters: &Self::TreeComponent,
my_node: &CoverNode<D>,
my_tree: &CoverTreeReader<D>,
) -> Self::NodeComponent {
println!(
"Building Dumb Plugin for {:?}",
(my_node.scale_index(), my_node.center_index())
);
let cover_count = match my_node.children() {
None => my_node.singletons_len(),
Some((nested_scale, child_addresses)) => {
println!(
"trying to get at the nodes at {:?}",
(nested_scale, child_addresses)
);
let mut cover_count = my_tree
.get_node_plugin_and::<Self::NodeComponent, _, _>(
(nested_scale, *my_node.center_index()),
|p| p.cover_count,
)
.unwrap();
for ca in child_addresses {
cover_count += my_tree
.get_node_plugin_and::<Self::NodeComponent, _, _>(*ca, |p| {
p.cover_count
})
.unwrap();
}
cover_count
}
};
DumbNode1 {
id: parameters.id,
pi: *my_node.center_index(),
cover_count,
}
}
}
#[test]
fn dumb_plugins() {
let d = DumbTree1 { id: 1 };
let mut tree = build_basic_tree();
tree.add_plugin::<DumbGoko1>(d);
println!("{:?}", tree.reader().len());
for (si, layer) in tree.reader().layers() {
println!("Scale Index: {:?}", si);
layer.for_each_node(|pi, n| {
println!("Node: {:?}", n);
n.get_plugin_and::<DumbNode1, _, _>(|dp| {
println!("DumbNodes: {:?}", dp);
assert_eq!(*pi, dp.pi);
});
});
}
}
}