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
use super::*;
#[derive(Copy, Clone, Debug)]
pub struct NotCompleteTreeSizeErr;
pub struct CompleteTreeContainer<T> {
nodes: Vec<T>,
}
impl<T> CompleteTreeContainer<T> {
#[inline]
pub fn from_vec(vec: Vec<T>) -> Result<CompleteTreeContainer<T>, NotCompleteTreeSizeErr> {
if valid_node_num(vec.len()) {
Ok(CompleteTreeContainer { nodes: vec })
} else {
Err(NotCompleteTreeSizeErr)
}
}
#[inline]
pub fn into_nodes(self) -> Vec<T> {
let CompleteTreeContainer { nodes } = self;
nodes
}
}
impl<T> std::ops::Deref for CompleteTreeContainer<T> {
type Target = CompleteTree<T>;
fn deref(&self) -> &CompleteTree<T> {
unsafe { &*(self.nodes.as_slice() as *const [T] as *const bfs_order::CompleteTree<T>) }
}
}
impl<T> std::ops::DerefMut for CompleteTreeContainer<T> {
fn deref_mut(&mut self) -> &mut CompleteTree<T> {
unsafe { &mut *(self.nodes.as_mut_slice() as *mut [T] as *mut bfs_order::CompleteTree<T>) }
}
}
pub struct CompleteTree<T> {
nodes: [T],
}
impl<T> CompleteTree<T> {
#[inline]
pub fn from_slice(arr: &[T]) -> Result<&CompleteTree<T>, NotCompleteTreeSizeErr> {
if valid_node_num(arr.len()) {
let tree = unsafe { &*(arr as *const [T] as *const bfs_order::CompleteTree<T>) };
Ok(tree)
} else {
Err(NotCompleteTreeSizeErr)
}
}
#[inline]
pub fn from_slice_mut(arr: &mut [T]) -> Result<&mut CompleteTree<T>, NotCompleteTreeSizeErr> {
if valid_node_num(arr.len()) {
let tree = unsafe { &mut *(arr as *mut [T] as *mut bfs_order::CompleteTree<T>) };
Ok(tree)
} else {
Err(NotCompleteTreeSizeErr)
}
}
#[inline]
pub fn get_height(&self) -> usize {
compute_height(self.nodes.len())
}
#[inline]
pub fn vistr(&self) -> Vistr<T> {
Vistr {
current: 0,
arr: &self.nodes,
}
}
#[inline]
pub fn vistr_mut(&mut self) -> VistrMut<T> {
VistrMut {
current: 0,
arr: &mut self.nodes,
}
}
#[inline]
pub fn get_nodes(&self) -> &[T] {
&self.nodes
}
#[inline]
pub fn get_nodes_mut(&mut self) -> &mut [T] {
&mut self.nodes
}
}
#[derive(Copy, Clone, Debug)]
struct NodeIndex(usize);
pub struct VistrMut<'a, T: 'a> {
current: usize,
arr: &'a mut [T],
}
unsafe impl<'a, T: 'a> FixedDepthVisitor for VistrMut<'a, T> {}
impl<'a, T: 'a> Visitor for VistrMut<'a, T> {
type Item = &'a mut T;
#[inline]
fn next(self) -> (Self::Item, Option<[Self; 2]>) {
let arr_left =
unsafe { std::slice::from_raw_parts_mut(self.arr.as_mut_ptr(), self.arr.len()) };
let arr_right =
unsafe { std::slice::from_raw_parts_mut(self.arr.as_mut_ptr(), self.arr.len()) };
let len = self.arr.len();
let curr = &mut self.arr[self.current];
if self.current >= len / 2 {
(curr, None)
} else {
let (left, right) = {
let left = 2 * self.current + 1;
let right = 2 * self.current + 2;
(left, right)
};
let j = [
VistrMut {
current: left,
arr: arr_left,
},
VistrMut {
current: right,
arr: arr_right,
},
];
(curr, Some(j))
}
}
#[inline]
fn level_remaining_hint(&self) -> (usize, Option<usize>) {
let depth = compute_height(self.current);
let height = compute_height(self.arr.len());
let diff = height - depth;
(diff, Some(diff))
}
}
impl<'a, T> std::ops::Deref for VistrMut<'a, T> {
type Target = Vistr<'a, T>;
fn deref(&self) -> &Vistr<'a, T> {
unsafe { &*(self as *const VistrMut<T> as *const Vistr<T>) }
}
}
pub struct Vistr<'a, T: 'a> {
current: usize,
arr: &'a [T],
}
unsafe impl<'a, T: 'a> FixedDepthVisitor for Vistr<'a, T> {}
impl<'a, T: 'a> Visitor for Vistr<'a, T> {
type Item = &'a T;
#[inline]
fn next(self) -> (Self::Item, Option<[Self; 2]>) {
let len = self.arr.len();
let curr = &self.arr[self.current];
if self.current >= len / 2 {
(curr, None)
} else {
let (left, right) = {
let left = 2 * self.current + 1;
let right = 2 * self.current + 2;
(left, right)
};
let j = [
Vistr {
current: left,
arr: self.arr,
},
Vistr {
current: right,
arr: self.arr,
},
];
(curr, Some(j))
}
}
#[inline]
fn level_remaining_hint(&self) -> (usize, Option<usize>) {
let depth = compute_height(self.current);
let height = compute_height(self.arr.len());
let diff = height - depth;
(diff, Some(diff))
}
}