coordinode-lsm-tree 4.3.0

A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs) — CoordiNode fork
Documentation
use crate::{
    HashMap,
    blob_tree::FragmentationMap,
    vlog::{BlobFile, BlobFileId},
};

#[derive(Clone, Default)]
pub struct BlobFileList(HashMap<BlobFileId, BlobFile>);

impl BlobFileList {
    pub fn new(blob_files: HashMap<BlobFileId, BlobFile>) -> Self {
        Self(blob_files)
    }

    /// On-disk size
    pub fn on_disk_size(&self) -> u64 {
        self.iter().map(|bf| bf.0.meta.total_compressed_bytes).sum()
    }

    pub fn len(&self) -> usize {
        self.0.len()
    }

    pub fn extend<I: IntoIterator<Item = (BlobFileId, BlobFile)>>(&mut self, iter: I) {
        self.0.extend(iter);
    }

    pub fn contains_key(&self, key: BlobFileId) -> bool {
        self.0.contains_key(&key)
    }

    pub fn prune_dead(&mut self, gc_stats: &FragmentationMap) -> Vec<BlobFile> {
        self.0
            .extract_if(|_, blob_file| blob_file.is_dead(gc_stats))
            .map(|(_, v)| v)
            .collect()
    }

    pub fn insert(&mut self, key: BlobFileId, value: BlobFile) {
        self.0.insert(key, value);
    }

    pub fn remove(&mut self, key: BlobFileId) -> Option<BlobFile> {
        self.0.remove(&key)
    }

    /// Visits all blob files in no particular order.
    pub fn iter(&self) -> impl Iterator<Item = &BlobFile> {
        self.0.values()
    }

    pub fn list_ids(&self) -> impl Iterator<Item = &BlobFileId> {
        self.0.keys()
    }

    pub fn get(&self, key: BlobFileId) -> Option<&BlobFile> {
        self.0.get(&key)
    }
}