coordinode-lsm-tree 5.7.0

Embedded LSM-tree storage engine: BuRR filters, zstd dictionary compression, MVCC, range tombstones, merge operators, K/V separation, AES-256-GCM at rest.
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

use super::effective_lower_bound;
use core::ops::Bound;

#[test]
fn effective_lower_bound_raises_to_restriction() {
    let cmp = crate::comparator::default_comparator();
    let cmp = cmp.as_ref();
    let a: &[u8] = b"a";
    let m: &[u8] = b"m";
    let z: &[u8] = b"z";
    // Unbounded lower bound + a restriction: raise to the restriction.
    assert_eq!(
        effective_lower_bound(Bound::Unbounded, Some(m), cmp),
        Bound::Included(m)
    );
    // A lower bound below the restriction is raised to it.
    assert_eq!(
        effective_lower_bound(Bound::Included(a), Some(m), cmp),
        Bound::Included(m)
    );
    assert_eq!(
        effective_lower_bound(Bound::Excluded(a), Some(m), cmp),
        Bound::Included(m)
    );
    // A lower bound at or above the restriction is left unchanged.
    assert_eq!(
        effective_lower_bound(Bound::Included(z), Some(m), cmp),
        Bound::Included(z)
    );
    // No restriction: the lower bound is returned unchanged.
    assert_eq!(
        effective_lower_bound(Bound::Included(a), None, cmp),
        Bound::Included(a)
    );
    let unbounded: Bound<&[u8]> = Bound::Unbounded;
    assert_eq!(
        effective_lower_bound(unbounded, None, cmp),
        Bound::Unbounded
    );
}