-
-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathlevel_reader.rs
272 lines (235 loc) · 9.33 KB
/
level_reader.rs
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
270
271
272
// Copyright (c) 2024-present, fjall-rs
// This source code is licensed under both the Apache 2.0 and MIT License
// (found in the LICENSE-* files in the repository)
use crate::{
level_manifest::level::Level,
segment::{range::Range, value_block::CachePolicy, Segment},
InternalValue, UserKey,
};
use std::{ops::Bound, sync::Arc};
/// Reads through a disjoint level
pub struct LevelReader {
segments: Arc<Level>,
lo: usize,
hi: usize,
lo_reader: Option<Range>,
hi_reader: Option<Range>,
cache_policy: CachePolicy,
prefix_hash: Option<(u64, u64)>,
}
impl LevelReader {
#[must_use]
pub fn new(
level: Arc<Level>,
range: &(Bound<UserKey>, Bound<UserKey>),
cache_policy: CachePolicy,
prefix_hash: Option<(u64, u64)>,
) -> Self {
assert!(!level.is_empty(), "level reader cannot read empty level");
let disjoint_level = level.as_disjoint().expect("level should be disjoint");
let Some((lo, hi)) = disjoint_level.range_indexes(range) else {
// NOTE: We will never emit any item
return Self {
segments: level,
lo: 0,
hi: 0,
lo_reader: None,
hi_reader: None,
cache_policy,
prefix_hash,
};
};
Self::from_indexes(
level,
range,
(Some(lo), Some(hi)),
cache_policy,
prefix_hash,
)
}
#[must_use]
pub fn from_indexes(
level: Arc<Level>,
range: &(Bound<UserKey>, Bound<UserKey>),
(lo, hi): (Option<usize>, Option<usize>),
cache_policy: CachePolicy,
prefix_hash: Option<(u64, u64)>,
) -> Self {
let lo = lo.unwrap_or_default();
let hi = hi.unwrap_or(level.len() - 1);
let lo_segment = level.segments.get(lo).expect("should exist");
let lo_reader = lo_segment.range(range.clone()).cache_policy(cache_policy);
let hi_reader = if hi > lo {
let hi_segment = level.segments.get(hi).expect("should exist");
Some(hi_segment.range(range.clone()).cache_policy(cache_policy))
} else {
None
};
Self {
segments: level,
lo,
hi,
lo_reader: Some(lo_reader),
hi_reader,
cache_policy,
prefix_hash,
}
}
fn may_segment_contain_hash(&self, segment: &Segment) -> bool {
self.prefix_hash
.map_or(true, |hash| segment.may_contain_hash(hash))
}
}
impl Iterator for LevelReader {
type Item = crate::Result<InternalValue>;
fn next(&mut self) -> Option<Self::Item> {
loop {
if let Some(lo_reader) = &mut self.lo_reader {
if let Some(item) = lo_reader.next() {
return Some(item);
}
// NOTE: Lo reader is empty, get next one
self.lo_reader = None;
} else if self.lo == self.hi {
// NOTE: We reached the hi marker, so consume from it instead
//
// If it returns nothing, it is empty, so we are done
return self.hi_reader.as_mut().and_then(|r| r.next());
} else {
self.lo += 1;
if self.lo < self.hi {
let segment = self.segments.get(self.lo).expect("should exist");
if self.may_segment_contain_hash(segment) {
self.lo_reader = Some(segment.iter().cache_policy(self.cache_policy));
}
}
}
}
}
}
impl DoubleEndedIterator for LevelReader {
fn next_back(&mut self) -> Option<Self::Item> {
loop {
if let Some(hi_reader) = &mut self.hi_reader {
if let Some(item) = hi_reader.next_back() {
return Some(item);
}
// NOTE: Hi reader is empty, get the previous one
self.hi_reader = None;
} else if self.lo == self.hi {
// NOTE: We reached the lo marker, so consume from it instead
//
// If it returns nothing, it is empty, so we are done
return self.lo_reader.as_mut().and_then(|r| r.next_back());
} else {
self.hi -= 1;
if self.lo < self.hi {
let segment = self.segments.get(self.hi).expect("should exist");
if self.may_segment_contain_hash(segment) {
self.hi_reader = Some(segment.iter().cache_policy(self.cache_policy));
}
}
}
}
}
}
#[cfg(test)]
#[allow(clippy::expect_used)]
mod tests {
use super::*;
use crate::{AbstractTree, Slice};
use std::ops::Bound::Unbounded;
use test_log::test;
// TODO: same test for prefix & ranges
#[test]
fn level_reader_basic() -> crate::Result<()> {
let tempdir = tempfile::tempdir()?;
let tree = crate::Config::new(&tempdir).open()?;
let ids = [
["a", "b", "c"],
["d", "e", "f"],
["g", "h", "i"],
["j", "k", "l"],
];
for batch in ids {
for id in batch {
tree.insert(id, vec![], 0);
}
tree.flush_active_memtable(0)?;
}
let segments = tree
.levels
.read()
.expect("lock is poisoned")
.iter()
.cloned()
.collect::<Vec<_>>();
let level = Arc::new(Level {
segments,
is_disjoint: true,
});
#[allow(clippy::unwrap_used)]
{
let multi_reader = LevelReader::new(
level.clone(),
&(Unbounded, Unbounded),
CachePolicy::Read,
None,
);
let mut iter = multi_reader.flatten();
assert_eq!(Slice::from(*b"a"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"b"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"c"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"d"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"e"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"f"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"g"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"h"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"i"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"j"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"k"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"l"), iter.next().unwrap().key.user_key);
}
#[allow(clippy::unwrap_used)]
{
let multi_reader = LevelReader::new(
level.clone(),
&(Unbounded, Unbounded),
CachePolicy::Read,
None,
);
let mut iter = multi_reader.rev().flatten();
assert_eq!(Slice::from(*b"l"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"k"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"j"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"i"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"h"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"g"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"f"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"e"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"d"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"c"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"b"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"a"), iter.next().unwrap().key.user_key);
}
#[allow(clippy::unwrap_used)]
{
let multi_reader =
LevelReader::new(level, &(Unbounded, Unbounded), CachePolicy::Read, None);
let mut iter = multi_reader.flatten();
assert_eq!(Slice::from(*b"a"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"l"), iter.next_back().unwrap().key.user_key);
assert_eq!(Slice::from(*b"b"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"k"), iter.next_back().unwrap().key.user_key);
assert_eq!(Slice::from(*b"c"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"j"), iter.next_back().unwrap().key.user_key);
assert_eq!(Slice::from(*b"d"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"i"), iter.next_back().unwrap().key.user_key);
assert_eq!(Slice::from(*b"e"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"h"), iter.next_back().unwrap().key.user_key);
assert_eq!(Slice::from(*b"f"), iter.next().unwrap().key.user_key);
assert_eq!(Slice::from(*b"g"), iter.next_back().unwrap().key.user_key);
}
Ok(())
}
}