Struct KdValueMapImpl 

pub struct KdValueMapImpl<K, V, Node, Balance: TreeHeightBound = Ratio<5, 4>>
where
    V: KdValue,
    Node: KdNode<Value = KdValuePlus<V, K>>,
{ /* private fields */ }

Implementations

impl<K, V, Node, Balance> KdValueMapImpl<K, V, Node, Balance>

where K: Clone + Eq + Hash, V: KdValue, Node: KdNode<Value = KdValuePlus<V, K>>, Balance: TreeHeightBound,

pub fn new() -> Self

where Balance: Default,

pub fn with_balance(balance: Balance) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

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

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

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

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

impl<K, V, Node, Balance> KdValueMapImpl<K, V, Node, Balance>

where K: Clone + Eq + Hash, V: KdValue, Node: KdNode<Value = KdValuePlus<V, K>>, Node::Ownership: Consumable<Value = KdValuePlus<V, K>>, Balance: TreeHeightBound,

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

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

impl<K, V, Stat, Node, Balance> KdValueMapImpl<K, V, Node, Balance>

where K: Clone + Eq + Hash, V: KdValue, Stat: Height, Node: ScapegoatKdNode<Value = KdValuePlus<V, K>> + Parent + Statistic<Stat = Stat>, <Node as Ownable>::Ownership: KdInsertable<Node> + Consumable<Value = KdValuePlus<V, K>>, Balance: TreeHeightBound,

pub fn insert(&mut self, key: K, value: V) -> Option<V>

pub fn try_insert(&mut self, key: K, value: V) -> Result<(), &V>

pub fn remove<BK: Borrow<K>>(&mut self, key: BK) -> Option<V>

impl<K, V, Stat, Node, Balance> KdValueMapImpl<K, V, Node, Balance>

where V: KdValue, Stat: Default, Node: KdSearchable<KdValuePlus<V, K>, WithHeight<Stat>> + KdNode<Value = KdValuePlus<V, K>> + Statistic<Stat = WithHeight<Stat>>, Balance: TreeHeightBound,

pub fn search_values_with<S>(&self, searcher: &mut S)

where S: KdSearcher<KdValuePlus<V, K>, Stat>,

pub fn search_values<S>(&self, searcher: S) -> S

where S: KdSearcher<KdValuePlus<V, K>, Stat>,

Trait Implementations

impl<K, V, Node, Balance> Default for KdValueMapImpl<K, V, Node, Balance>

where V: KdValue, Node: KdNode<Value = KdValuePlus<V, K>>, Balance: TreeHeightBound + Default,

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, Node, Balance> FromIterator<(K, V)> for KdValueMapImpl<K, V, Node, Balance>

where K: Clone + Eq + Hash, V: KdValue, Node: KdBuildableNode<Value = KdValuePlus<V, K>>, <Node as Ownable>::Ownership: KdInsertable<Node>, Balance: TreeHeightBound,

fn from_iter<Is>(items: Is) -> Self

where Is: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<'a, K, V, Node, Balance> IntoIterator for &'a KdValueMapImpl<K, V, Node, Balance>

where K: 'a + Clone + Eq + Hash, V: 'a + KdValue, Node: KdNode<Value = KdValuePlus<V, K>>, Balance: TreeHeightBound,

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = KdValueIterator<'a, K, V, Node>

Which kind of iterator are we turning this into?

fn into_iter(self) -> KdValueIterator<'a, K, V, Node>

Creates an iterator from a value.