Struct ORMap 

pub struct ORMap<K: Ord, V: Lattice> { /* private fields */ }

An observed-remove map (OR-Map) with put-wins semantics and recursive value merge.

Each key maps to an [Entry] containing a value V: Lattice and an insertion timestamp. Removals record a tombstone timestamp. A key is considered present when its entry timestamp is greater than or equal to its tombstone timestamp (put-wins: concurrent put and remove resolve in favor of put).

When both replicas have a present entry for the same key, the values are merged using the V::merge lattice operation, providing recursive conflict resolution.

The internal clock advances automatically on mutation and is bumped to max(self, other) on merge.

Implementations

impl<K: Ord, V: Lattice> ORMap<K, V>

pub fn new() -> Self

Create an empty OR-Map.

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

Put a key-value pair. Overwrites any existing value for the key.

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

where K: Clone,

Remove a key by recording a tombstone at the current clock.

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

Returns a reference to the value for the key, if present.

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

Returns true if the key is present.

pub fn keys(&self) -> Vec<&K>

Returns a sorted vector of references to all present keys.

pub fn entries(&self) -> Vec<(&K, &V)>

Returns a sorted vector of (key, value) pairs for all present entries.

pub fn len(&self) -> usize

Returns the number of present entries.

pub fn is_empty(&self) -> bool

Returns true if no entries are present.

Trait Implementations

impl<K: Clone + Ord, V: Clone + Lattice> Clone for ORMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord, V: Debug + Lattice> Debug for ORMap<K, V>

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

Formats the value using the given formatter.

impl<K: Ord, V: Lattice> Default for ORMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K, V> Deserialize<'de> for ORMap<K, V>

where K: Ord + DeserializeOwned, V: Lattice + DeserializeOwned,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K: Ord + Clone + PartialEq, V: Lattice> Lattice for ORMap<K, V>

fn merge(&self, other: &Self) -> Self

Compute the least upper bound of self and other.

impl<K: PartialEq + Ord, V: PartialEq + Lattice> PartialEq for ORMap<K, V>

fn eq(&self, other: &ORMap<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, V> Serialize for ORMap<K, V>

where K: Serialize + Ord, V: Serialize + Lattice,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<K: Eq + Ord, V: Eq + Lattice> Eq for ORMap<K, V>

impl<K: Ord, V: Lattice> StructuralPartialEq for ORMap<K, V>