Struct StaticSortedFile 

pub struct StaticSortedFile { /* private fields */ }

A memory mapped SST file.

Implementations

impl StaticSortedFile

pub fn open(db_path: &Path, meta: StaticSortedFileMetaData) -> Result<Self>

Opens an SST file at the given path. This memory maps the file, but does not read it yet. It’s lazy read on demand.

pub fn open_for_compaction( db_path: &Path, meta: StaticSortedFileMetaData, ) -> Result<Self>

Opens an SST file for compaction. Uses MADV_SEQUENTIAL instead of MADV_RANDOM, since compaction reads blocks sequentially and benefits from OS read-ahead and page reclamation.

pub fn try_into_iter(self) -> Result<StaticSortedFileIter>

Consume this file and return an iterator over all entries in sorted order. The iterator takes ownership of the SST file, so the mmap and its pages are freed when the iterator is dropped.

pub fn lookup<K: QueryKey, const FIND_ALL: bool>( &self, key_hash: u64, key: &K, key_block_cache: &BlockCache, value_block_cache: &BlockCache, ) -> Result<SstLookupResult>

Looks up a key in this file.

If FIND_ALL is false, returns after finding the first match. If FIND_ALL is true, returns all entries with the same key (useful for keyspaces where keys are hashes and collisions are possible).