Struct LazyEntriesV3 

pub struct LazyEntriesV3 { /* private fields */ }

Lazy-loading entry store backed by an MKE3 memory-mapped file.

Implementations

impl LazyEntriesV3

pub fn from_file<P>(path: P) -> Result<LazyEntriesV3, DictError>

where P: AsRef<Path>,

Open an MKE3 file and memory-map it.

Errors

Returns DictError::Format for invalid headers and DictError::Io for I/O failures.

pub const fn len(&self) -> usize

Total number of entries in the file.

pub const fn is_empty(&self) -> bool

Returns true if there are no entries.

pub fn cached_count(&self) -> usize

Number of entries currently held in the LRU cache.

pub fn set_cache_size(&self, size: usize)

Resize the LRU cache (minimum 1).

pub fn clear_cache(&self)

Evict all cached entries.

pub const fn flags(&self) -> u16

Flags field from the header.

pub fn get(&self, index: u32) -> Result<Arc<DictEntry>, DictError>

Look up entry index, returning a shared Arc.

Cache check uses peek (no LRU promotion) to avoid a write lock on every hit; the write lock is taken only on a miss.

Errors

Returns DictError::Format when index is out of bounds or the on-disk record is corrupt.

pub fn get_entries_at( &self, first_index: u32, surface: &str, ) -> Result<Vec<Arc<DictEntry>>, DictError>

Collect all consecutive entries starting at first_index that share surface.

Iterates forward from first_index until either the end of the file or an entry whose surface differs from surface.

Errors

Returns DictError::Format if any individual entry cannot be loaded.