Struct LruCs 

pub struct LruCs { /* private fields */ }

In-memory LRU content store, bounded by total byte capacity.

Maintains two indices:

• cache: LruCache<Arc<Name>, CsEntry> — exact-match lookup in O(1).
• prefix_index: NameTrie<Arc<Name>> — maps each cached name to itself, enabling CanBePrefix lookups via first_descendant.

All insertions and evictions update both indices atomically under the lock.

An atomic entry count (entry_count) allows get() to short-circuit without acquiring the Mutex when the CS is empty — eliminating lock contention on the hot path for workloads that don’t cache (e.g. iperf).

Implementations

impl LruCs

pub fn new(capacity_bytes: usize) -> Self

Create an LRU CS with the given byte capacity.

pub fn is_empty(&self) -> bool

Whether the cache is empty.

Trait Implementations

impl ContentStore for LruCs

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 is_empty(&self) -> bool

Returns true if the content store contains no entries.

fn stats(&self) -> CsStats

Snapshot of hit/miss/insert/eviction counters.