Struct ReactiveMapCore 

pub struct ReactiveMapCore<K, V> {
    pub interceptors_any: Arc<Mutex<Vec<(u64, InterceptorAny<K, V>)>>>,
    pub interceptors_key: Arc<DashMap<K, Vec<(u64, InterceptorKey<K, V>)>>>,
    pub subscribers_any: Arc<Mutex<Vec<(u64, SubscriberAny<K, V>, SubscriptionMeta)>>>,
    pub subscribers_key: Arc<DashMap<K, Vec<(u64, SubscriberKey<K, V>, SubscriptionMeta)>>>,
    pub next_id: Arc<AtomicU64>,
    pub intercept_depth: Arc<AtomicUsize>,
    pub cache: Arc<MapCache<K, V>>,
}

Fields

interceptors_any: Arc<Mutex<Vec<(u64, InterceptorAny<K, V>)>>>

interceptors_key: Arc<DashMap<K, Vec<(u64, InterceptorKey<K, V>)>>>

subscribers_any: Arc<Mutex<Vec<(u64, SubscriberAny<K, V>, SubscriptionMeta)>>>

subscribers_key: Arc<DashMap<K, Vec<(u64, SubscriberKey<K, V>, SubscriptionMeta)>>>

next_id: Arc<AtomicU64>

intercept_depth: Arc<AtomicUsize>

cache: Arc<MapCache<K, V>>

Implementations

impl<K: ReactiveMapKey, V: ReactiveMapValue> ReactiveMapCore<K, V>

pub fn new() -> Self

pub fn with_capacity(_entries: usize) -> Self

The same. A tree has nothing to reserve, so entries is ignored; the signature stays because a caller loading a store knows the size and should not have to know that.

pub fn subscribe_any<F>(&self, callback: F) -> SignalSubscription

where F: Fn(&MapChange<K, V>) + Send + Sync + 'static,

pub fn subscribe_key<F>(&self, key: K, callback: F) -> SignalSubscription

where F: Fn(&MapChange<K, V>) + Send + Sync + 'static,

pub fn intercept<F>(&self, path: StorePath, callback: F) -> InterceptDisposer

where F: Fn(MapChange<K, V>) -> Option<MapChange<K, V>> + Send + Sync + 'static,

pub fn intercept_key<F>(&self, key: K, callback: F) -> InterceptDisposer

where F: Fn(MapChange<K, V>) -> Option<MapChange<K, V>> + Send + Sync + 'static,

pub fn run_interceptors( &self, path: StorePath, change: MapChange<K, V>, ) -> Result<MapChange<K, V>, Refusal>

pub fn notify(&self, change: &MapChange<K, V>)

Fires every subscriber interested in change.

The callbacks are collected before any of them runs, and every guard is released first. A subscriber reacting to a change by writing to the same map is ordinary, and neither a Mutex nor a DashMap shard is reentrant, so holding either across the calls deadlocks the thread.

Trait Implementations

impl<K, V> Clone for ReactiveMapCore<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: AsRef<str> + Debug + Hash + Eq, V: Debug> Debug for ReactiveMapCore<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K: ReactiveMapKey, V: ReactiveMapValue> Default for ReactiveMapCore<K, V>

fn default() -> Self

Returns the “default value” for a type.