velarixdb 0.0.17

An LSM Storage Engine focused on reduced IO amplification
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

use crate::consts::{SIZE_OF_U64, SIZE_OF_U8, SIZE_OF_USIZE};
use crate::filter::BloomFilter;
use crate::{bucket::InsertableToBucket, types::*};
use crossbeam_skiplist::SkipMap;
use std::sync::Arc;

#[derive(Debug, Clone)]
pub struct TableInsertor {
    pub(crate) entries: SkipMapEntries<Key>,
    pub(crate) size: usize,
    pub(crate) filter: BloomFilter,
}

impl InsertableToBucket for TableInsertor {
    fn get_entries(&self) -> SkipMapEntries<Key> {
        Arc::clone(&self.entries)
    }
    fn get_filter(&self) -> BloomFilter {
        self.filter.to_owned()
    }
    fn size(&self) -> usize {
        self.size
    }
}

impl TableInsertor {
    pub fn from(entries: SkipMapEntries<Key>, filter: &BloomFilter) -> Self {
        let size = entries
            .iter()
            .map(|e| e.key().len() + SIZE_OF_USIZE + SIZE_OF_U64 + SIZE_OF_U8)
            .sum::<usize>();
        Self {
            entries,
            size,
            filter: filter.to_owned(),
        }
    }

    pub(crate) fn set_entries(&mut self, entries: SkipMapEntries<Key>) {
        self.entries = entries;
        self.set_sst_size_from_entries();
    }
    pub(crate) fn set_sst_size_from_entries(&mut self) {
        self.size = self
            .entries
            .iter()
            .map(|e| e.key().len() + SIZE_OF_USIZE + SIZE_OF_U64 + SIZE_OF_U8)
            .sum::<usize>();
    }
}
impl Default for TableInsertor {
    fn default() -> Self {
        Self {
            entries: Arc::new(SkipMap::new()),
            size: 0,
            filter: BloomFilter::default(),
        }
    }
}