Struct HashMapValueTree

pub struct HashMapValueTree<K, V>(/* private fields */)
where
    K: ValueTree,
    V: ValueTree,
    K::Value: Hash + Eq;

ValueTree corresponding to HashMapStrategy.

Trait Implementations

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

where K: ValueTree + Clone, V: ValueTree + Clone, K::Value: Hash + Eq,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for HashMapValueTree<K, V>

where K: ValueTree + Debug, V: ValueTree + Debug, K::Value: Hash + Eq,

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

Formats the value using the given formatter.

impl<K, V> ValueTree for HashMapValueTree<K, V>

where K: ValueTree, V: ValueTree, K::Value: Hash + Eq,

type Value = HashMap<<K as ValueTree>::Value, <V as ValueTree>::Value>

The type of the value produced by this ValueTree.

fn current(&self) -> Self::Value

Returns the current value.

fn simplify(&mut self) -> bool

Attempts to simplify the current value. Notionally, this sets the “high” value to the current value, and the current value to a “halfway point” between high and low, rounding towards low.

fn complicate(&mut self) -> bool

Attempts to partially undo the last simplification. Notionally, this sets the “low” value to one plus the current value, and the current value to a “halfway point” between high and the new low, rounding towards low.