Struct InMemoryCacheRepository 

pub struct InMemoryCacheRepository { /* private fields */ }

Thread-safe in-memory CacheRepository. Mirrors C# InMemoryCacheRepository, with an LRU bound the C# version does not have.

The bound matters because the SDK’s consumers are long-running: the entity cache is written through on every node built, so an unbounded map retains every node the process has ever seen. Entries are evicted least-recently-used once DEFAULT_CACHE_CAPACITY (or the capacity passed to with_capacity) is reached.

Implementations

impl InMemoryCacheRepository

pub fn new() -> Self

Create an empty in-memory cache holding up to DEFAULT_CACHE_CAPACITY entries.

pub fn with_capacity(capacity: usize) -> Self

Create an empty in-memory cache holding up to capacity entries. A capacity of zero is raised to one: a cache that can hold nothing would turn every read into a fetch while still paying the bookkeeping.

pub fn shared() -> Arc<dyn CacheRepository>

Wrap a new in-memory cache in an Arc behind the trait object.

pub fn shared_with_capacity(capacity: usize) -> Arc<dyn CacheRepository>

Wrap a new capacity-bounded in-memory cache behind the trait object.

pub fn len(&self) -> usize

Number of entries currently held. Diagnostic — and what the bound test asserts on.

pub fn is_empty(&self) -> bool

Whether the cache holds nothing.

pub fn tag_index_len(&self) -> usize

Number of keys the tag index knows about. Should track len; a divergence is the leak this bound exists to prevent.

Trait Implementations

impl CacheRepository for InMemoryCacheRepository

fn set<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, key: &'life1 str, value: &'life2 str, tags: &'life3 [String], ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Store value under key, replacing any existing entry and its tags.

fn get<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<Option<String>>> + Send + 'async_trait>>

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

Fetch the value stored under key, or None if absent.

fn remove<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Remove the entry stored under key (no-op if absent).

fn remove_by_tag<'life0, 'life1, 'async_trait>( &'life0 self, tag: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Remove every entry carrying tag.

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

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

Remove every entry.

fn get_by_tags<'life0, 'life1, 'async_trait>( &'life0 self, tags: &'life1 [String], ) -> Pin<Box<dyn Future<Output = Result<Vec<(String, String)>>> + Send + 'async_trait>>

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

Return every (key, value) whose entry carries all of tags (set intersection, matching C# GetByTags). An empty tags slice returns nothing.

impl Default for InMemoryCacheRepository

fn default() -> Self

Returns the “default value” for a type.