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
use crate::traits::{ReadBackend, WriteBackend, Construct, RootStatus, Owned, Dangling, Leak, Error, Tree, Sequence};
use crate::raw::Raw;
use crate::index::Index;
const ROOT_INDEX: Index = Index::root();
const EXTEND_INDEX: Index = Index::root().left();
const EMPTY_INDEX: Index = Index::root().right();
pub type OwnedVector<C> = Vector<Owned, C>;
pub type DanglingVector<C> = Vector<Dangling, C>;
pub struct Vector<R: RootStatus, C: Construct> {
raw: Raw<R, C>,
max_len: Option<u64>,
len: usize,
}
impl<R: RootStatus, C: Construct> Vector<R, C> {
fn raw_index(&self, i: usize) -> Option<Index> {
Index::from_one((1 << self.depth()) + i)
}
fn extend<DB: WriteBackend<Construct=C> + ?Sized>(
&mut self,
db: &mut DB
) -> Result<(), Error<DB::Error>> {
let root = self.root();
let mut new_raw = Raw::default();
let empty = C::empty_at(db, self.depth())?;
new_raw.set(db, EXTEND_INDEX, root)?;
new_raw.set(db, EMPTY_INDEX, empty)?;
self.raw.set(db, ROOT_INDEX, Default::default())?;
self.raw = new_raw;
Ok(())
}
fn shrink<DB: WriteBackend<Construct=C> + ?Sized>(
&mut self,
db: &mut DB
) -> Result<(), Error<DB::Error>> {
match self.raw.get(db, EXTEND_INDEX)? {
Some(extended_value) => { self.raw.set(db, ROOT_INDEX, extended_value)?; },
None => { self.raw.set(db, ROOT_INDEX, Default::default())?; },
}
Ok(())
}
pub fn current_max_len(&self) -> u64 {
self.max_len.unwrap_or({
let mut max_len = 1;
while max_len < self.len as u64 {
max_len *= 2;
}
max_len
})
}
pub fn max_len(&self) -> Option<u64> {
self.max_len
}
pub fn depth(&self) -> usize {
let mut max_len = 1;
let mut depth = 0;
while max_len < self.current_max_len() {
max_len *= 2;
depth += 1;
}
depth
}
pub fn get<DB: ReadBackend<Construct=C> + ?Sized>(
&self,
db: &mut DB,
index: usize
) -> Result<C::Value, Error<DB::Error>> {
if index >= self.len() {
return Err(Error::AccessOverflowed)
}
let raw_index = self.raw_index(index).ok_or(Error::InvalidParameter)?;
self.raw.get(db, raw_index)?.ok_or(Error::CorruptedDatabase)
}
pub fn set<DB: WriteBackend<Construct=C> + ?Sized>(
&mut self,
db: &mut DB,
index: usize,
value: C::Value
) -> Result<(), Error<DB::Error>> {
if index >= self.len() {
return Err(Error::AccessOverflowed)
}
let raw_index = self.raw_index(index).ok_or(Error::InvalidParameter)?;
self.raw.set(db, raw_index, value)?;
Ok(())
}
pub fn push<DB: WriteBackend<Construct=C> + ?Sized>(
&mut self,
db: &mut DB,
value: C::Value
) -> Result<(), Error<DB::Error>> {
let old_len = self.len();
if (old_len as u64) == self.current_max_len() {
if self.max_len.is_some() {
return Err(Error::AccessOverflowed)
} else {
self.extend(db)?;
}
}
let len = old_len + 1;
let index = old_len;
self.len = len;
let raw_index = self.raw_index(index).ok_or(Error::InvalidParameter)?;
self.raw.set(db, raw_index, value)?;
Ok(())
}
pub fn pop<DB: WriteBackend<Construct=C> + ?Sized>(
&mut self,
db: &mut DB
) -> Result<Option<C::Value>, Error<DB::Error>> {
let old_len = self.len();
if old_len == 0 {
return Ok(None)
}
let len = old_len - 1;
let index = old_len - 1;
let raw_index = self.raw_index(index).ok_or(Error::InvalidParameter)?;
let value = self.raw.get(db, raw_index)?.ok_or(Error::CorruptedDatabase)?;
let mut empty_depth_to_bottom = 0;
let mut replace_index = raw_index;
loop {
if let Some(parent) = replace_index.parent() {
if parent.left() == replace_index {
replace_index = parent;
empty_depth_to_bottom += 1;
} else {
break
}
} else {
break
}
}
let empty = C::empty_at(db, empty_depth_to_bottom)?;
self.raw.set(db, replace_index, empty)?;
if (len as u64) <= self.current_max_len() / 2 {
if self.max_len.is_none() {
self.shrink(db)?;
}
}
self.len = len;
Ok(Some(value))
}
pub fn len(&self) -> usize {
self.len
}
pub fn from_raw(raw: Raw<R, C>, len: usize, max_len: Option<u64>) -> Self {
Self { raw, len, max_len }
}
}
impl<R: RootStatus, C: Construct> Tree for Vector<R, C> {
type RootStatus = R;
type Construct = C;
fn root(&self) -> C::Value {
self.raw.root()
}
fn drop<DB: WriteBackend<Construct=C> + ?Sized>(
self,
db: &mut DB
) -> Result<(), Error<DB::Error>> {
self.raw.drop(db)?;
Ok(())
}
fn into_raw(self) -> Raw<R, C> {
self.raw
}
}
impl<R: RootStatus, C: Construct> Sequence for Vector<R, C> {
fn len(&self) -> usize {
self.len
}
}
impl<R: RootStatus, C: Construct> Leak for Vector<R, C> {
type Metadata = (C::Value, usize, Option<u64>);
fn metadata(&self) -> Self::Metadata {
let len = self.len();
let max_len = self.max_len;
(self.raw.metadata(), len, max_len)
}
fn from_leaked((raw_root, len, max_len): Self::Metadata) -> Self {
Self {
raw: Raw::from_leaked(raw_root),
len,
max_len,
}
}
}
impl<C: Construct> Vector<Owned, C> {
pub fn create<DB: WriteBackend<Construct=C> + ?Sized>(
db: &mut DB,
len: usize,
max_len: Option<u64>
) -> Result<Self, Error<DB::Error>> {
if let Some(max_len) = max_len {
if (len as u64) < max_len || max_len == 0 {
return Err(Error::InvalidParameter)
}
}
let mut raw = Raw::<Owned, C>::default();
let target_len = max_len.unwrap_or(len as u64);
let mut current_max_len = 1;
let mut depth = 0;
while current_max_len < target_len {
current_max_len *= 2;
depth += 1;
}
let empty = C::empty_at(db, depth)?;
raw.set(db, ROOT_INDEX, empty)?;
Ok(Self {
raw,
len,
max_len,
})
}
}