coordinode-lsm-tree 4.3.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

// Copyright (c) 2025-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 byteorder::{LittleEndian, WriteBytesExt};

#[derive(Debug)]
pub struct Builder(Vec<u32>);

impl Builder {
    pub fn new(capacity: usize) -> Self {
        Self(Vec::with_capacity(capacity))
    }

    pub fn insert(&mut self, pos: u32) {
        self.0.push(pos);
    }

    pub fn write<W: std::io::Write>(&self, writer: &mut W) -> crate::Result<(u8, usize)> {
        // NOTE: We check if the pointers may fit in 16-bits
        // If so, we halve the index size by storing u16 instead of u32
        let step_size = {
            #[expect(
                clippy::expect_used,
                reason = "blocks are never empty, so the binary seek index cannot be empty either"
            )]
            if u16::try_from(*self.0.last().expect("should not be empty")).is_ok() {
                2
            } else {
                4
            }
        };

        let len = self.0.len();

        if step_size == 2 {
            // Write u16 index
            for &offset in &self.0 {
                #[expect(
                    clippy::cast_possible_truncation,
                    reason = "above we check that the last (highest) pointer still fits into u16"
                )]
                let offset = offset as u16;
                writer.write_u16::<LittleEndian>(offset)?;
            }
        } else {
            // Write u32 index
            for &offset in &self.0 {
                writer.write_u32::<LittleEndian>(offset)?;
            }
        }

        Ok((step_size, len))
    }
}