coordinode-lsm-tree 5.2.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
41
42
43
44
45
46
47
48

// 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 crate::sfa::Checksum;

pub struct ChecksummedWriter<W: std::io::Write> {
    inner: W,
    hasher: xxhash_rust::xxh3::Xxh3Default,
}

impl<W: std::io::Write> ChecksummedWriter<W> {
    pub fn new(writer: W) -> Self {
        Self {
            inner: writer,
            hasher: xxhash_rust::xxh3::Xxh3Default::new(),
        }
    }

    pub fn checksum(&self) -> Checksum {
        Checksum::from_raw(self.hasher.digest128())
    }
}

impl<W: std::io::Write> std::io::Write for ChecksummedWriter<W> {
    fn flush(&mut self) -> std::io::Result<()> {
        self.inner.flush()
    }

    fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {
        // Hash only the bytes the inner writer actually accepted.
        // A short write (`n < buf.len()`) followed by a retry would
        // otherwise hash the unwritten tail twice — once on this
        // call (`buf`), once on the retry (`&buf[n..]`) — silently
        // diverging the running digest from the on-disk content.
        // `inner.write` first so a failed write does not corrupt
        // the hasher state.
        let n = self.inner.write(buf)?;
        // Safe slice: `n <= buf.len()` per `std::io::Write::write`
        // contract.
        #[expect(
            clippy::indexing_slicing,
            reason = "n bounded by buf.len() per std::io::Write::write contract"
        )]
        self.hasher.update(&buf[..n]);
        Ok(n)
    }
}