Struct SimpleDataStore 

pub struct SimpleDataStore { /* private fields */ }

A simple hashmap-backed DataStore. Clone to share the same storage.

Implementations

impl SimpleDataStore

pub fn new() -> Self

Trait Implementations

impl Clone for SimpleDataStore

fn clone(&self) -> SimpleDataStore

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl DataStore for SimpleDataStore

fn read(&self, keys: &[Key]) -> Vec<Option<Value>>

Read several keys at once. Each entry is the key’s current value, or None if the key is unset/absent.

fn write(&self, changes: StateChange) -> Result<(), DataError>

Apply a batch of changes. Observers receive the same StateChange.

fn snapshot(&self) -> State

A snapshot of the entire store.

fn slot(&self, key: &Key) -> Box<dyn Slot>

Resolve a key to a direct Slot handle (read + write the same cell without repeating the lookup).

fn clone_box(&self) -> Box<dyn DataStore>

A sibling handle onto the same storage: reads and writes through the clone coincide with the original’s. Stores share their storage across clones by design (interior mutability, &self everywhere), and this puts that fact on the trait, so a holder of dyn DataStore can keep an independent live handle — e.g. one kept aside before handing a store to a device that takes it by value.

fn subscribe(&self) -> Subscription

Subscribe to changes. Each call yields an independent Subscription, whose first change is the store’s whole current state: a subscriber starts from the full picture and stays current from the changes that follow, without a separate snapshot read that could race them.

impl Default for SimpleDataStore

fn default() -> SimpleDataStore

Returns the “default value” for a type.