Struct StorageRouter 

pub struct StorageRouter { /* private fields */ }

Storage router - local store primary with optional S3 backup

Write path: local first (fast), then queue S3 upload (non-blocking) Read path: local first, fall back to S3 if miss

Implementations

impl StorageRouter

pub fn new(local: Arc<LocalStore>) -> Self

Create router with local storage only

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

Store data - writes to LMDB, queues S3 upload in background

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

Get data - tries LMDB first, falls back to S3

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

Check if hash exists

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

Delete data from both local and S3 stores

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

Delete data from local store only (don’t propagate to S3) Used for eviction where we want to keep S3 as archive

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

Get stats from local store

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

List all hashes from local store

pub fn local_store(&self) -> Arc<LocalStore>

Get the underlying local store for HashTree operations

Trait Implementations

impl Store for StorageRouter

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 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 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)