lsm-db 0.4.0

Log-structured merge-tree storage engine for Rust. Memtable, leveled SSTables, background compaction, and bloom-filtered point reads over a durable wal-db log. A composable storage engine for embedded databases and Hive DB.
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

//! The value a key maps to within one source.
//!
//! A key's state at any one level — the memtable or a single sorted run — is a
//! [`Record`]: either live data, or a *tombstone* that records a deletion. When
//! several sources disagree, the newest source's record wins; a tombstone there
//! hides any older value, and only the oldest level may drop tombstones during
//! compaction.

/// What a key maps to in one source (the memtable or one run).
///
/// A `Value` is live data. A `Tombstone` records that the key was deleted and
/// must shadow any older value for the same key until the oldest level resolves
/// it away.
#[derive(Debug, Clone, PartialEq, Eq)]
pub(crate) enum Record {
    /// The key maps to this value.
    Value(Vec<u8>),
    /// The key has been deleted; mask any older value.
    Tombstone,
}

impl Record {
    /// The number of value bytes this record holds (zero for a tombstone).
    #[inline]
    pub(crate) fn value_len(&self) -> usize {
        match self {
            Record::Value(v) => v.len(),
            Record::Tombstone => 0,
        }
    }
}