Skip to main content

Cache

Struct Cache 

Source
pub struct Cache<A, K, V, Route>
where A: Address, Route: DeliveryRoute, Route::Protocol: Protocol<Addr = A, Msg = CacheResult<K, V>>,
{ /* private fields */ }
Expand description

Bounded deterministic recency cache behavior.

State is CacheState in least- to most-recent order. Put and successful get move the key to the most-recent position. Replacement returns the old value; capacity eviction returns the complete oldest entry. Miss and absent are factual results, not errors. Every command emits exactly one typed result after committing its state transition. Initialization is empty, no actors are created, and the cache never terminates itself. Recency and eviction are Bombay policy, not durability: Mnesis remains the durable authority. The standard-library vector is intentional for this initial deterministic policy; an lru dependency requires a demonstrated scale need and must remain private. No method has a semantic panic condition.

Implementations§

Source§

impl<A, K, V, Route> Cache<A, K, V, Route>
where A: Address, Route: DeliveryRoute, Route::Protocol: Protocol<Addr = A, Msg = CacheResult<K, V>>,

Source

pub fn new(configuration: CacheConfiguration) -> Self

Bind validated capacity to an empty cache actor.

Source

pub const fn state(&self) -> &CacheState<K, V>

Borrow the complete current recency state.

Trait Implementations§

Source§

impl<A, K, V, Route> Behavior for Cache<A, K, V, Route>
where A: Address, K: Clone + Eq, V: Clone, Route: DeliveryRoute, Route::Protocol: Protocol<Addr = A, Msg = CacheResult<K, V>>, Route::Sends: SendsFor<User<A, CacheMessage<K, V, Route>>>,

Source§

type Protocol = Cache<A, K, V, Route>

Stable public communication identity owned by this actor template. Read more
Source§

type Event = User<A, <<Cache<A, K, V, Route> as Behavior>::Protocol as Protocol>::Msg>

Source§

type Sends = <Route as DeliveryRoute>::Sends

Source§

type Ph = Never

Source§

type Error = Never

Source§

type Birth = NoBirths

Source§

fn transition( &mut self, _: ActiveTurn, event: Self::Event, ) -> BehaviorActed<Self>

Fold exactly one event into explicit actions and the next behavior. Read more
Source§

fn init( &mut self, _turn: InitializationTurn, ) -> Result<Actions<<Self::Protocol as Protocol>::Addr, Self::Ph, Self::Sends, Self::Birth>, Self::Error>
where Self: Sized,

Produce initialization actions before the first event is accepted. Read more
Source§

fn layer<L>(self, layer: L) -> <L as BehaviorLayer<Self>>::Output
where Self: Sized, L: BehaviorLayer<Self>,

Apply one statically dispatched construction layer. Read more
Source§

impl<A, K, V, Route> BehaviorBase for Cache<A, K, V, Route>
where A: Address, Route: DeliveryRoute, Route::Protocol: Protocol<Addr = A, Msg = CacheResult<K, V>>,

Source§

type Base = Cache<A, K, V, Route>

Source§

fn base(&self) -> &Self

Source§

impl<A, K, V, Route> Protocol for Cache<A, K, V, Route>
where A: Address, Route: DeliveryRoute, Route::Protocol: Protocol<Addr = A, Msg = CacheResult<K, V>>,

Source§

type Addr = A

Source§

type Msg = CacheMessage<K, V, Route>

Auto Trait Implementations§

§

impl<A, K, V, Route> Freeze for Cache<A, K, V, Route>

§

impl<A, K, V, Route> RefUnwindSafe for Cache<A, K, V, Route>

§

impl<A, K, V, Route> Send for Cache<A, K, V, Route>
where K: Send, V: Send,

§

impl<A, K, V, Route> Sync for Cache<A, K, V, Route>
where K: Sync, V: Sync,

§

impl<A, K, V, Route> Unpin for Cache<A, K, V, Route>
where K: Unpin, V: Unpin,

§

impl<A, K, V, Route> UnsafeUnpin for Cache<A, K, V, Route>

§

impl<A, K, V, Route> UnwindSafe for Cache<A, K, V, Route>
where K: UnwindSafe, V: UnwindSafe,

Blanket Implementations§

Source§

impl<B> Activate for B
where B: Behavior,

Source§

fn initialize(self) -> Result<Initialized<Self>, Self::Error>

Consume this definition, perform its one initialization fold, and return the active behavior together with the ordered initialization effects. Read more
Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<B> BeginShutdownPhases for B
where B: Behavior, <<B as Behavior>::Birth as BirthMode>::Child: ChildOccurrenceProduct<AvailableChildren>,

Source§

impl<Node> BirthNodeAppend<Never> for Node
where Node: NonEmptyBirthNode,

Source§

type Output = Node

Closed child algebra containing the complete prefix followed by the complete appended tail.
Source§

fn append_prefix(self) -> <Node as BirthNodeAppend<Never>>::Output

Inject one child from the existing prefix without changing its structural occurrence.
Source§

fn append_tail(tail: Never) -> <Node as BirthNodeAppend<Never>>::Output

Inject one child from the appended tail after every prefix occurrence.
Source§

fn append_creations<A>( prefix: Creations<CreateChild<A, Self>>, tail: Creations<CreateChild<A, Tail>>, ) -> Creations<CreateChild<A, Self::Output>>
where A: Address,

Preserve and concatenate two ordered creation batches.
Source§

impl<Child, Tail> BirthNodeAppend<Tail> for Child
where Child: Behavior, Tail: NonEmptyBirthNode,

Source§

type Output = ChildChoice<Child, Tail>

Closed child algebra containing the complete prefix followed by the complete appended tail.
Source§

fn append_prefix(self) -> <Child as BirthNodeAppend<Tail>>::Output

Inject one child from the existing prefix without changing its structural occurrence.
Source§

fn append_tail(tail: Tail) -> <Child as BirthNodeAppend<Tail>>::Output

Inject one child from the appended tail after every prefix occurrence.
Source§

fn append_creations<A>( prefix: Creations<CreateChild<A, Self>>, tail: Creations<CreateChild<A, Tail>>, ) -> Creations<CreateChild<A, Self::Output>>
where A: Address,

Preserve and concatenate two ordered creation batches.
Source§

impl<B> BirthProtocols for B
where B: Behavior, <B as Behavior>::Birth: BirthModeProtocols,

Source§

type Protocols = BirthProtocol<<B as Behavior>::Protocol, <<B as Behavior>::Birth as BirthModeProtocols>::Protocols>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<Node, Shape> ChildOccurrenceProduct<Shape> for Node
where Node: ChildOccurrenceProductAt<ChildHead, Shape>, Shape: ChildOccurrenceShape,

Source§

type Product = <Node as ChildOccurrenceProductAt<ChildHead, Shape>>::Product

Complete shape-owned representation of this closed birth node.
Source§

impl<A, Child, Host> DispatchBirth<A, Host> for Child
where A: Address, Child: CreateSelectedChild<A, ChildHead, Host>,

Source§

fn dispatch_birth( self, id: CreationId, route: <A as Address>::Nonce, kind: CreationKind, host: &mut Host, ) -> impl Future<Output = ItemSettlement<RoutedCreation<A, Child>, <Child as ChildCreationProduct<A, ChildHead>>::Result, CreationRejection, Never>> + Send

Select exactly one concrete child host while preserving creation data in every non-accepted settlement.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.