Struct pancake_engine_common::sstable::SSTable

pub struct SSTable<K, V> {
    sparse_file_offsets: SparseFileOffsets<K>,
    kv_file_path: PathBuf,
    _phant: PhantomData<V>,
}

An SSTable is an abstraction of a sorted dictionary. An SSTable has these components:

• A file which stores (key, val_or_tombstone) pairs, sorted by key, containing distinct keys.
• An in-memory sorted structure that maps {key: file_offset} on sparsely captured keys. The offsets point to locations within the above file.

Fields

sparse_file_offsets: SparseFileOffsets<K>

kv_file_path: PathBuf

_phant: PhantomData<V>

Implementations

impl<K, V> SSTable<K, V>

where K: Ser + Ord, V: Ser,

pub fn new<'a>( entries: impl Iterator<Item = Entry<'a, K, V>>, kv_file_path: PathBuf ) -> Result<Self>

where K: 'a + Clone, V: 'a,

impl<K, V> SSTable<K, V>

where K: Deser + Ord, V: Deser,

pub fn load<P: AsRef<Path>>(kv_file_path: P) -> Result<Self>

pub fn get_one<Q>(&self, k: &Q) -> Option<Result<(K, V)>>

where K: PartialOrd<Q>,

pub fn get_range<'a, Q>( &'a self, k_lo: Option<&'a Q>, k_hi: Option<&'a Q> ) -> impl 'a + Iterator<Item = Result<(K, V)>>

where K: PartialOrd<Q>,

1. Bisect in the in-memory sparse index, to find the lower-bound file offset.
2. Seek the offset in the file. Then read linearlly in file until either EOF or the last-read key is greater than the sought key.

pub fn get_all_keys(&self) -> impl Iterator<Item = Result<K>>

pub fn remove_file(&self) -> Result<()>