coordinode-lsm-tree 4.2.0

A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs) — CoordiNode fork
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

// 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)

pub trait GrowingWindowsExt<T> {
    fn growing_windows<'a>(&'a self) -> impl Iterator<Item = &'a [T]>
    where
        T: 'a;
}

impl<T> GrowingWindowsExt<T> for [T] {
    fn growing_windows<'a>(&'a self) -> impl Iterator<Item = &'a [T]>
    where
        T: 'a,
    {
        (1..=self.len()).flat_map(|size| self.windows(size))
    }
}

pub trait ShrinkingWindowsExt<T> {
    fn shrinking_windows<'a>(&'a self) -> impl Iterator<Item = &'a [T]>
    where
        T: 'a;
}

impl<T> ShrinkingWindowsExt<T> for [T] {
    fn shrinking_windows<'a>(&'a self) -> impl Iterator<Item = &'a [T]>
    where
        T: 'a,
    {
        (1..=self.len()).rev().flat_map(|size| self.windows(size))
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    #[expect(clippy::unwrap_used)]
    fn test_growing_windows() {
        let a = [1, 2, 3, 4, 5];

        let mut windows = a.growing_windows();

        assert_eq!(&[1], windows.next().unwrap());
        assert_eq!(&[2], windows.next().unwrap());
        assert_eq!(&[3], windows.next().unwrap());
        assert_eq!(&[4], windows.next().unwrap());
        assert_eq!(&[5], windows.next().unwrap());

        assert_eq!(&[1, 2], windows.next().unwrap());
        assert_eq!(&[2, 3], windows.next().unwrap());
        assert_eq!(&[3, 4], windows.next().unwrap());
        assert_eq!(&[4, 5], windows.next().unwrap());

        assert_eq!(&[1, 2, 3], windows.next().unwrap());
        assert_eq!(&[2, 3, 4], windows.next().unwrap());
        assert_eq!(&[3, 4, 5], windows.next().unwrap());

        assert_eq!(&[1, 2, 3, 4], windows.next().unwrap());
        assert_eq!(&[2, 3, 4, 5], windows.next().unwrap());

        assert_eq!(&[1, 2, 3, 4, 5], windows.next().unwrap());
    }

    #[test]
    #[expect(clippy::unwrap_used)]
    fn test_shrinking_windows() {
        let a = [1, 2, 3, 4, 5];

        let mut windows = a.shrinking_windows();

        assert_eq!(&[1, 2, 3, 4, 5], windows.next().unwrap());

        assert_eq!(&[1, 2, 3, 4], windows.next().unwrap());
        assert_eq!(&[2, 3, 4, 5], windows.next().unwrap());

        assert_eq!(&[1, 2, 3], windows.next().unwrap());
        assert_eq!(&[2, 3, 4], windows.next().unwrap());
        assert_eq!(&[3, 4, 5], windows.next().unwrap());

        assert_eq!(&[1, 2], windows.next().unwrap());
        assert_eq!(&[2, 3], windows.next().unwrap());
        assert_eq!(&[3, 4], windows.next().unwrap());
        assert_eq!(&[4, 5], windows.next().unwrap());

        assert_eq!(&[1], windows.next().unwrap());
        assert_eq!(&[2], windows.next().unwrap());
        assert_eq!(&[3], windows.next().unwrap());
        assert_eq!(&[4], windows.next().unwrap());
        assert_eq!(&[5], windows.next().unwrap());
    }
}