Struct HashMapValueTree

pub struct HashMapValueTree<K, V>(/* private field */)
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>

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

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>;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

Auto Trait Implementations

impl<K, V> Freeze for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: Freeze,

impl<K, V> RefUnwindSafe for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: RefUnwindSafe,

impl<K, V> Send for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: Send,

impl<K, V> Sync for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: Sync,

impl<K, V> Unpin for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: Unpin,

impl<K, V> UnsafeUnpin for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: UnsafeUnpin,

impl<K, V> UnwindSafe for HashMapValueTree<K, V> where Filter<Map<VecValueTree<TupleValueTree<(K, V)>>, VecToHashMap>, MinSize>: UnwindSafe,

Blanket Implementations

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for HashMapValueTree<K, V> where ST: ?Sized, DT: ?Sized,

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for HashMapValueTree<K, V> where ST: ?Sized, DT: ?Sized,

impl<T> Any for HashMapValueTree<K, V> where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for HashMapValueTree<K, V> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for HashMapValueTree<K, V> where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for HashMapValueTree<K, V> where T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<T> From<T> for HashMapValueTree<K, V>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> Read<Exclusive, BecauseExclusive> for HashMapValueTree<K, V> where T: ?Sized,

impl<T> ToOwned for HashMapValueTree<K, V> where T: Clone,

type Owned = T;
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)

impl<T, U> Into<U> for HashMapValueTree<K, V> where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

impl<T, U> TryFrom<U> for HashMapValueTree<K, V> where U: Into<T>,

type Error = never;
fn try_from(value: U) -> Result<T, never>

impl<T, U> TryInto<U> for HashMapValueTree<K, V> where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error;
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for HashMapValueTree<K, V> where V: MultiLane<T>,

fn vzip(self) -> V