Struct PersistentMap 

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

An immutable persistent map based on a binary search tree.

Operations return new map instances sharing structure with the original. Suitable for use in backtracking algorithms where previous states must be preserved.

Implementations

impl<K: Ord + Clone, V: Clone> PersistentMap<K, V>

pub fn empty() -> Self

Create an empty persistent map.

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

Look up a value by key.

pub fn insert(&self, key: K, value: V) -> Self

Insert a key-value pair, returning a new map.

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

Check if the map contains a key.

pub fn len(&self) -> usize

Number of entries.

pub fn is_empty(&self) -> bool

Check if empty.

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

Collect all key-value pairs in sorted order.

Trait Implementations

impl<K: Clone + Ord + Clone, V: Clone + Clone> Clone for PersistentMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<K: Ord + Clone, V: Clone> Default for PersistentMap<K, V>

fn default() -> Self

Returns the “default value” for a type.