Enum LocalStore 

pub enum LocalStore {
    Fs(FsBlobStore),
    Lmdb(LmdbBlobStore),
    TieredLmdb {
        primary: Box<LmdbBlobStore>,
        legacy: Box<LmdbBlobStore>,
    },
}

Local blob store - wraps either FsBlobStore or LmdbBlobStore

Variants

Fs(FsBlobStore)

Lmdb(LmdbBlobStore)

TieredLmdb

Fields

primary: Box<LmdbBlobStore>

legacy: Box<LmdbBlobStore>

Implementations

impl LocalStore

pub fn new<P: AsRef<Path>>( path: P, backend: &StorageBackend, ) -> Result<Self, StoreError>

Create a new unbounded local store.

Higher-level stores that need quota enforcement should manage eviction above this layer so tree metadata, pins, and archival policies stay coherent.

pub fn new_with_lmdb_map_size<P: AsRef<Path>>( path: P, backend: &StorageBackend, _map_size_bytes: Option<u64>, ) -> Result<Self, StoreError>

Create a new local store with an explicit LMDB logical size cap when using the LMDB backend.

The requested size is used for both the LMDB map and the store’s built-in byte quota, so standalone blob envs can evict instead of growing forever.

pub fn new_unbounded<P: AsRef<Path>>( path: P, backend: &StorageBackend, ) -> Result<Self, StoreError>

Create a new unbounded local store for a specific backend.

pub fn new_unbounded_with_lmdb_map_size<P: AsRef<Path>>( path: P, backend: &StorageBackend, _map_size_bytes: Option<u64>, ) -> Result<Self, StoreError>

Create a local store with an explicit LMDB map size but without adapter-level eviction.

Higher layers use this when they need a large mmap while enforcing quota with richer retention policy. In tiered LMDB mode, both the hot primary and cold legacy envs are opened without adapter-level eviction so merely enabling the hot tier can never reclaim legacy data on startup.

pub fn backend(&self) -> StorageBackend

pub fn force_sync(&self) -> Result<(), StoreError>

pub fn put_sync(&self, hash: Hash, data: &[u8]) -> Result<bool, StoreError>

Sync put operation

pub fn put_many_report_sync( &self, items: &[(Hash, Vec<u8>)], ) -> Result<PutManyReport, StoreError>

Sync batch put operation.

pub fn put_many_sync( &self, items: &[(Hash, Vec<u8>)], ) -> Result<usize, StoreError>

Sync batch put operation.

pub fn get_sync(&self, hash: &Hash) -> Result<Option<Vec<u8>>, StoreError>

Sync get operation

pub fn get_range_sync( &self, hash: &Hash, start: u64, end_inclusive: u64, ) -> Result<Option<Vec<u8>>, StoreError>

pub fn blob_size_sync(&self, hash: &Hash) -> Result<Option<u64>, StoreError>

pub fn touch_accessed_sync( &self, hash: &Hash, now: u64, ) -> Result<bool, StoreError>

pub fn touch_many_accessed_sync( &self, hashes: &[Hash], now: u64, ) -> Result<usize, StoreError>

pub fn last_accessed_at_sync( &self, hash: &Hash, ) -> Result<Option<u64>, StoreError>

pub fn many_last_accessed_at_sync( &self, hashes: &[Hash], ) -> Result<Vec<(Hash, u64)>, StoreError>

pub fn exists(&self, hash: &Hash) -> Result<bool, StoreError>

Check if hash exists

pub fn existing_hashes_in_sorted_candidates( &self, sorted_hashes: &[Hash], ) -> Result<Vec<bool>, StoreError>

Mark which sorted hashes already exist in local storage.

pub fn delete_sync(&self, hash: &Hash) -> Result<bool, StoreError>

Sync delete operation

pub fn delete_writable_sync(&self, hash: &Hash) -> Result<bool, StoreError>

pub fn stats(&self) -> Result<LocalStoreStats, StoreError>

Get storage statistics

pub fn writable_stats(&self) -> Result<LocalStoreStats, StoreError>

Get storage statistics for the tier that receives new writes.

pub fn list(&self) -> Result<Vec<Hash>, StoreError>

List all hashes in the store

pub fn list_writable(&self) -> Result<Vec<Hash>, StoreError>

List hashes in the tier that receives new writes.

Trait Implementations

impl Store for LocalStore

fn put<'life0, 'async_trait>( &'life0 self, hash: Hash, data: Vec<u8>, ) -> Pin<Box<dyn Future<Output = Result<bool, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store data by its hash Returns true if newly stored, false if already existed

fn put_many<'life0, 'async_trait>( &'life0 self, items: Vec<(Hash, Vec<u8>)>, ) -> Pin<Box<dyn Future<Output = Result<usize, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store multiple blobs. Returns the number of newly stored items.

fn get<'life0, 'life1, 'async_trait>( &'life0 self, hash: &'life1 Hash, ) -> Pin<Box<dyn Future<Output = Result<Option<Vec<u8>>, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Retrieve data by hash Returns data or None if not found

fn get_range<'life0, 'life1, 'async_trait>( &'life0 self, hash: &'life1 Hash, start: u64, end_inclusive: u64, ) -> Pin<Box<dyn Future<Output = Result<Option<Vec<u8>>, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Retrieve a byte range from a blob by hash.

fn blob_size<'life0, 'life1, 'async_trait>( &'life0 self, hash: &'life1 Hash, ) -> Pin<Box<dyn Future<Output = Result<Option<u64>, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Return the stored blob size in bytes.

fn has<'life0, 'life1, 'async_trait>( &'life0 self, hash: &'life1 Hash, ) -> Pin<Box<dyn Future<Output = Result<bool, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Check if hash exists

fn delete<'life0, 'life1, 'async_trait>( &'life0 self, hash: &'life1 Hash, ) -> Pin<Box<dyn Future<Output = Result<bool, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Delete by hash Returns true if deleted, false if didn’t exist

fn set_max_bytes(&self, _max: u64)

Set maximum storage size in bytes. 0 = unlimited.

fn max_bytes(&self) -> Option<u64>

Get maximum storage size. None = unlimited.

fn stats<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = StoreStats> + Send + 'async_trait>>

where 'life0: 'async_trait, Self: 'async_trait,

Get storage statistics

fn evict_if_needed<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<u64, StoreError>> + Send + 'async_trait>>

where 'life0: 'async_trait, Self: 'async_trait,

Evict unpinned items if over storage limit. Returns number of bytes freed.

fn pin<'life0, 'life1, 'async_trait>( &'life0 self, _hash: &'life1 [u8; 32], ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Self: 'async_trait,

Pin a hash (increment ref count). Pinned items are not evicted.

fn unpin<'life0, 'life1, 'async_trait>( &'life0 self, _hash: &'life1 [u8; 32], ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, Self: 'async_trait,

Unpin a hash (decrement ref count). Item can be evicted when count reaches 0.

fn pin_count(&self, _hash: &[u8; 32]) -> u32

Get pin count for a hash. 0 = not pinned.

fn is_pinned(&self, hash: &[u8; 32]) -> bool

Check if hash is pinned (pin count > 0)