bitstring-trees 0.2.0

Trees based on bitstrings
Documentation 
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

use crate::tree::{
	mut_gen,
	TreeProperties,
	WalkedDirection,
};

/// Iterate over all nodes that are a prefix of target key in a [`WalkMutBorrowed`] stack
///
/// [`WalkMutBorrowed`]: crate::tree::WalkMutBorrowed
pub struct IterWalkMutBorrowedPath<'r, 'w, TP, D = ()>
where
	TP: TreeProperties + 'r,
{
	inner: mut_gen::IterWalkMutPath<'r, 'w, TP, mut_gen::Borrowed, D>,
}

impl<'r, TP, D> Iterator for IterWalkMutBorrowedPath<'r, '_, TP, D>
where
	TP: TreeProperties + 'r,
	D: From<WalkedDirection>,
{
	type Item = (
		&'r TP::Key,
		&'r mut TP::Value,
		Option<&'r mut TP::LeafValue>,
	);

	fn next(&mut self) -> Option<Self::Item> {
		self.inner.next()
	}
}

/// Iterate over keys and mutable values of tree depth-first pre-order
pub struct IterMutBorrowedPreOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	inner: mut_gen::IterMutPreOrder<'r, TP, mut_gen::Borrowed>,
}

impl<'r, TP> From<mut_gen::IterMutPreOrder<'r, TP, mut_gen::Borrowed>>
	for IterMutBorrowedPreOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	fn from(inner: mut_gen::IterMutPreOrder<'r, TP, mut_gen::Borrowed>) -> Self {
		Self { inner }
	}
}

impl<'r, TP> Iterator for IterMutBorrowedPreOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	type Item = (
		&'r TP::Key,
		&'r mut TP::Value,
		Option<&'r mut TP::LeafValue>,
	);

	fn next(&mut self) -> Option<Self::Item> {
		self.inner.next()
	}
}

/// Iterate over keys and mutable values of tree depth-first in-order
pub struct IterMutBorrowedInOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	inner: mut_gen::IterMutInOrder<'r, TP, mut_gen::Borrowed>,
}

impl<'r, TP> From<mut_gen::IterMutInOrder<'r, TP, mut_gen::Borrowed>>
	for IterMutBorrowedInOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	fn from(inner: mut_gen::IterMutInOrder<'r, TP, mut_gen::Borrowed>) -> Self {
		Self { inner }
	}
}

impl<'r, TP> Iterator for IterMutBorrowedInOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	type Item = (
		&'r TP::Key,
		&'r mut TP::Value,
		Option<&'r mut TP::LeafValue>,
	);

	fn next(&mut self) -> Option<Self::Item> {
		self.inner.next()
	}
}

/// Iterate over keys and mutable values of tree depth-first post-order
pub struct IterMutBorrowedPostOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	inner: mut_gen::IterMutPostOrder<'r, TP, mut_gen::Borrowed>,
}

impl<'r, TP> From<mut_gen::IterMutPostOrder<'r, TP, mut_gen::Borrowed>>
	for IterMutBorrowedPostOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	fn from(inner: mut_gen::IterMutPostOrder<'r, TP, mut_gen::Borrowed>) -> Self {
		Self { inner }
	}
}

impl<'r, TP> Iterator for IterMutBorrowedPostOrder<'r, TP>
where
	TP: TreeProperties + 'r,
{
	type Item = (
		&'r TP::Key,
		&'r mut TP::Value,
		Option<&'r mut TP::LeafValue>,
	);

	fn next(&mut self) -> Option<Self::Item> {
		self.inner.next()
	}
}

/// Iterate over keys and mutable leaf values of tree in-order
pub struct IterMutBorrowedLeaf<'r, TP>
where
	TP: TreeProperties + 'r,
{
	inner: mut_gen::IterMutLeaf<'r, TP, mut_gen::Borrowed>,
}

impl<'r, TP> From<mut_gen::IterMutLeaf<'r, TP, mut_gen::Borrowed>> for IterMutBorrowedLeaf<'r, TP>
where
	TP: TreeProperties + 'r,
{
	fn from(inner: mut_gen::IterMutLeaf<'r, TP, mut_gen::Borrowed>) -> Self {
		Self { inner }
	}
}

impl<'r, TP> Iterator for IterMutBorrowedLeaf<'r, TP>
where
	TP: TreeProperties + 'r,
{
	type Item = (&'r TP::Key, &'r mut TP::LeafValue);

	fn next(&mut self) -> Option<Self::Item> {
		self.inner.next()
	}
}

/// Iterate over keys and mutable leaf values and uncovered keys of tree in-order
pub struct IterMutBorrowedLeafFull<'r, TP>
where
	TP: TreeProperties + 'r,
{
	inner: mut_gen::IterMutLeafFull<'r, TP, mut_gen::Borrowed>,
}

impl<'r, TP> From<mut_gen::IterMutLeafFull<'r, TP, mut_gen::Borrowed>>
	for IterMutBorrowedLeafFull<'r, TP>
where
	TP: TreeProperties + 'r,
{
	fn from(inner: mut_gen::IterMutLeafFull<'r, TP, mut_gen::Borrowed>) -> Self {
		Self { inner }
	}
}

impl<'r, TP> Iterator for IterMutBorrowedLeafFull<'r, TP>
where
	TP: TreeProperties + 'r,
{
	type Item = (TP::Key, Option<&'r mut TP::LeafValue>);

	fn next(&mut self) -> Option<Self::Item> {
		self.inner.next()
	}
}