Struct AWMap 

pub struct AWMap<K: Ord + Clone, V: Clone + Eq> { /* private fields */ }

An add-wins map (AW-Map).

A key-value map where each key is tracked with OR-Set semantics: concurrent add and remove of the same key resolves in favor of add. Values are updated using a causal version vector per key.

Example

use crdt_kit::prelude::*;

let mut m1 = AWMap::new(1);
m1.insert("color", "red");

let mut m2 = AWMap::new(2);
m2.insert("color", "blue");

m1.merge(&m2);
// Both adds are concurrent — the latest by tag ordering wins
assert!(m1.contains_key(&"color"));

Implementations

impl<K: Ord + Clone, V: Clone + Eq> AWMap<K, V>

pub fn new(actor: NodeId) -> Self

Create a new empty AW-Map for the given node.

pub fn insert(&mut self, key: K, value: V)

Insert or update a key-value pair.

Generates a unique tag for this write. If the key already exists, the old tags are kept (they accumulate until a remove clears them). The value is updated to the new value.

pub fn remove(&mut self, key: &K) -> bool

Remove a key from the map.

Only removes the tags that this replica has observed. Concurrent inserts on other replicas will survive the merge (add wins).

Returns true if the key was present and removed.

pub fn get(&self, key: &K) -> Option<&V>

Get the value associated with a key, if present.

pub fn contains_key(&self, key: &K) -> bool

Check if a key is present in the map.

pub fn len(&self) -> usize

Get the number of keys in the map.

pub fn is_empty(&self) -> bool

Check if the map is empty.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Iterate over key-value pairs.

pub fn keys(&self) -> impl Iterator<Item = &K>

Get all keys.

pub fn values(&self) -> impl Iterator<Item = &V>

Get all values.

pub fn actor(&self) -> NodeId

Get this replica’s node ID.

Trait Implementations

impl<K: Clone + Ord + Clone, V: Clone + Clone + Eq> Clone for AWMap<K, V>

fn clone(&self) -> AWMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Ord + Clone, V: Clone + Eq> Crdt for AWMap<K, V>

fn merge(&mut self, other: &Self)

Merge another replica’s state into this one.

impl<K: Debug + Ord + Clone, V: Debug + Clone + Eq> Debug for AWMap<K, V>

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

Formats the value using the given formatter.

impl<K: Ord + Clone, V: Clone + Eq> DeltaCrdt for AWMap<K, V>

type Delta = AWMapDelta<K, V>

The type of delta produced by this CRDT.

fn delta(&self, other: &Self) -> AWMapDelta<K, V>

Generate a delta containing changes in self that other does not have.

fn apply_delta(&mut self, delta: &AWMapDelta<K, V>)

Apply a delta to this replica’s state.

impl<K: Ord + Clone, V: Clone + Eq> IntoIterator for AWMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<(K, V)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: PartialEq + Ord + Clone, V: PartialEq + Clone + Eq> PartialEq for AWMap<K, V>

fn eq(&self, other: &AWMap<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Ord + Clone, V: Clone + Eq> Versioned for AWMap<K, V>

const CURRENT_VERSION: u8 = 1

Current schema version for this CRDT type’s serialization format.

const CRDT_TYPE: CrdtType = CrdtType::AWMap

The CRDT type identifier for the envelope.

impl<K: Eq + Ord + Clone, V: Eq + Clone + Eq> Eq for AWMap<K, V>

impl<K: Ord + Clone, V: Clone + Eq> StructuralPartialEq for AWMap<K, V>