Struct ShardedCs 

pub struct ShardedCs<C: ContentStore> { /* private fields */ }

Shards a ContentStore across N instances to reduce lock contention.

Shard selection is by first name component (not full name hash) so that related content (/video/seg/1, /video/seg/2) lands in the same shard, preserving LRU locality for sequential access.

The shard count is the length of the shards Vec and is fixed at construction time.

Implementations

impl<C: ContentStore> ShardedCs<C>

pub fn new(shards: Vec<C>) -> Self

Create a ShardedCs from pre-constructed inner stores.

Panics

Panics if shards is empty.

pub fn shard_count(&self) -> usize

Number of shards.

Trait Implementations

impl<C: ContentStore> ContentStore for ShardedCs<C>

async fn get(&self, interest: &Interest) -> Option<CsEntry>

Look up a Data packet matching interest. Honours MustBeFresh and CanBePrefix selectors.

async fn insert( &self, data: Bytes, name: Arc<Name>, meta: CsMeta, ) -> InsertResult

Store a Data packet. May evict least-recently-used entries to make room.

async fn evict(&self, name: &Name) -> bool

Explicitly evict the entry for name.

fn capacity(&self) -> CsCapacity

Current capacity configuration.

fn len(&self) -> usize

Number of entries currently cached.

fn current_bytes(&self) -> usize

Total bytes currently used.

fn set_capacity(&self, max_bytes: usize)

Update the maximum byte capacity at runtime.

fn variant_name(&self) -> &str

Human-readable name of this CS implementation (e.g. “lru”, “sharded-lru”).

async fn evict_prefix(&self, prefix: &Name, limit: Option<usize>) -> usize

Evict all entries matching prefix, up to limit entries (None = unlimited). Returns the number of entries evicted.

fn stats(&self) -> CsStats

Snapshot of hit/miss/insert/eviction counters.

fn is_empty(&self) -> bool

Returns true if the content store contains no entries.