Struct FsBlobStore 

pub struct FsBlobStore { /* private fields */ }

Filesystem-backed blob store implementing hashtree’s Store trait.

Stores blobs in a two-level sharded directory structure using the first 4 hex characters of the hash as directory prefixes. Legacy single-level shard paths remain readable. Supports storage limits with mtime-based FIFO eviction and pinning.

Implementations

impl FsBlobStore

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

Create a new filesystem blob store at the given path.

Creates the directory if it doesn’t exist.

pub fn with_max_bytes<P: AsRef<Path>>( path: P, max_bytes: u64, ) -> Result<Self, StoreError>

Create a new store with a maximum size limit

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

Sync put operation.

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

Sync get operation.

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

Check if a hash exists.

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

Sync delete operation.

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

List all hashes in the store.

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

Get storage statistics.

Trait Implementations

impl Store for FsBlobStore

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 Self: 'async_trait, 'life0: '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 Self: 'async_trait, 'life0: 'async_trait,

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

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

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

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

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

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

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

fn pin_count(&self, hash: &Hash) -> u32

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

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

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

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

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

Check if hash is pinned (pin count > 0)