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
#[cfg(test)]
mod tests {
use asupersync::runtime::RuntimeBuilder;
use crate::cursor::{BtCursor, MemPageStore};
use crate::traits::BtreeCursorOps;
use fsqlite_types::PageNumber;
use fsqlite_types::cx::Cx;
#[test]
fn test_index_seek_bug() {
RuntimeBuilder::current_thread()
.build()
.expect("build index seek test runtime")
.block_on(async {
let cx = Cx::new();
let root = PageNumber::new(2).unwrap();
let store = MemPageStore::with_empty_index(root, 4096);
let mut cursor = BtCursor::new(store, root, 4096, false);
// Insert a middle value
cursor.index_insert(&cx, b"M").await.unwrap();
// Let's force a split? Actually, we can just insert A, Z, etc.
for i in 0..100 {
let key = format!("KEY_{i:03}");
cursor.index_insert(&cx, key.as_bytes()).await.unwrap();
}
// If the bug exists, inserting something that falls off a leaf but has a successor will panic.
// Or we can just insert keys in order to force it.
// Let's try inserting sequentially, then inserting one in the middle that falls at the end of a leaf
// A better way is to do many inserts and see if it fails.
let mut keys = Vec::new();
for i in 0..250 {
keys.push(format!("K{i:03}"));
}
for k in &keys {
cursor.index_insert(&cx, k.as_bytes()).await.unwrap();
}
});
}
}