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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
use bitvec::vec::BitVec;
use crate::tree::datastore::K2Tree;
#[derive(Copy, Clone, Debug, PartialEq)]
pub struct StemBit {
pub value: bool,
pub layer: usize,
pub stem: usize,
pub bit: usize,
}
#[derive(Copy, Clone, Debug, PartialEq)]
pub struct LeafBit {
pub value: bool,
pub x: usize,
pub y: usize,
pub leaf: usize,
pub bit: usize,
}
#[derive(Debug)]
pub struct Stems<'a> {
tree: &'a K2Tree,
pos: usize,
layer: usize,
stem: usize,
bit: usize,
}
impl<'a> Iterator for Stems<'a> {
type Item = StemBit;
fn next(&mut self) -> Option<Self::Item> {
let stem_len = self.tree.stem_len();
if self.pos >= self.tree.stems.len() {
return None
}
let ret_v = Some(StemBit {
value: self.tree.stems[self.pos],
layer: self.layer,
stem: self.stem,
bit: self.bit,
});
self.pos += 1;
if self.bit == stem_len-1 {
self.bit = 0;
if self.stem == (self.tree.layer_len(self.layer) / stem_len) - 1 {
self.stem = 0;
self.layer += 1;
}
else {
self.stem += 1;
}
}
else {
self.bit += 1;
}
ret_v
}
}
impl<'a> Stems<'a> {
pub fn new(tree: &'a K2Tree) -> Self {
Self {
tree,
pos: 0,
layer: 0,
stem: 0,
bit: 0,
}
}
}
#[derive(Debug)]
pub struct IntoStems {
tree: K2Tree,
pos: usize,
layer: usize,
stem: usize,
bit: usize,
}
impl Iterator for IntoStems {
type Item = StemBit;
fn next(&mut self) -> Option<Self::Item> {
let stem_len = self.tree.stem_len();
if self.pos >= self.tree.stems.len() {
return None
}
let ret_v = Some(StemBit {
value: self.tree.stems[self.pos],
layer: self.layer,
stem: self.stem,
bit: self.bit,
});
self.pos += 1;
if self.bit == stem_len-1 {
self.bit = 0;
if self.stem == (self.tree.layer_len(self.layer) / stem_len) - 1 {
self.stem = 0;
self.layer += 1;
}
else {
self.stem += 1;
}
}
else {
self.bit += 1;
}
ret_v
}
}
impl IntoStems {
pub fn new(tree: K2Tree) -> Self {
Self {
tree,
pos: 0,
layer: 0,
stem: 0,
bit: 0,
}
}
}
#[derive(Debug)]
pub struct Leaves<'a> {
tree: &'a K2Tree,
pos: usize,
}
impl<'a> Iterator for Leaves<'a> {
type Item = LeafBit;
fn next(&mut self) -> Option<Self::Item> {
if self.pos == self.tree.leaves.len() { return None }
let [x, y] = self.tree.get_coords(self.pos);
let value = self.tree.leaves[self.pos];
let leaf = self.pos / self.tree.leaf_len();
let bit = self.pos % self.tree.leaf_len();
self.pos += 1;
Some(LeafBit {
value,
x,
y,
leaf,
bit
})
}
}
impl<'a> Leaves<'a> {
pub fn new(tree: &'a K2Tree) -> Self {
Self {
tree,
pos: 0,
}
}
}
#[derive(Debug)]
pub struct IntoLeaves {
tree: K2Tree,
pos: usize,
}
impl Iterator for IntoLeaves {
type Item = LeafBit;
fn next(&mut self) -> Option<Self::Item> {
if self.pos == self.tree.leaves.len() { return None }
let leaf_len = self.tree.leaf_len();
let [x, y] = self.tree.get_coords(self.pos);
let value = self.tree.leaves[self.pos];
let leaf = self.pos / leaf_len;
let bit = self.pos % leaf_len;
self.pos += 1;
Some(LeafBit {
value,
x,
y,
leaf,
bit
})
}
}
impl IntoLeaves {
pub fn new(tree: K2Tree) -> Self {
Self {
tree,
pos: 0,
}
}
}
#[derive(Debug)]
pub struct StemsRaw<'a> {
stems: &'a BitVec,
pos: usize,
}
impl<'a> Iterator for StemsRaw<'a> {
type Item = bool;
fn next(&mut self) -> Option<Self::Item> {
if self.pos >= self.stems.len() {
return None
}
let ret_v = Some(self.stems[self.pos]);
self.pos += 1;
ret_v
}
}
impl<'a> StemsRaw<'a> {
pub fn new(tree: &'a K2Tree) -> Self {
Self {
stems: &tree.stems,
pos: 0,
}
}
}
#[derive(Debug)]
pub struct LeavesRaw<'a> {
leaves: &'a BitVec,
pos: usize,
}
impl<'a> Iterator for LeavesRaw<'a> {
type Item = bool;
fn next(&mut self) -> Option<Self::Item> {
if self.pos >= self.leaves.len() {
return None
}
let ret_v = Some(self.leaves[self.pos]);
self.pos += 1;
ret_v
}
}
impl<'a> LeavesRaw<'a> {
pub fn new(tree: &'a K2Tree) -> Self {
Self {
leaves: &tree.leaves,
pos: 0,
}
}
}