Struct vertreap::VertreapMap

pub struct VertreapMap<K, V, P = u64> { /* fields omitted */ }

An ordered associative map backed by a persistent treap.

Methods

impl<K, V, P> VertreapMap<K, V, P> where
    Standard: Distribution<P>, 

pub fn new() -> VertreapMap<K, V, P>

Equivalent to new_with_thread_rng.

pub fn new_with_thread_rng() -> VertreapMap<K, V, P>

Create a new persistent treap-backed map, where priorities are generated by ThreadRng.

pub fn new_with_rng<R: Rng + 'static>(rng: R) -> VertreapMap<K, V, P>

Create a new persistent treap-backed map, where priorities are generated by a provided Rng.

impl<K, V> VertreapMap<K, V, u64> where
    K: Hash, 

pub fn new_with_random_hasher() -> VertreapMap<K, V, u64>

Create a new persistent treap-backed map, where priorities are generated by a randomly seeded hasher (the same as used for HashMap).

impl<K, V, P> VertreapMap<K, V, P>

pub fn len(&self) -> usize

Count the number of key-value pairs in the map.

Important traits for VertreapMapIter<K, V, P>

impl<K, V, P> Iterator for VertreapMapIter<K, V, P> type Item = Rc<KV<K, V>>;

pub fn iter(&self) -> VertreapMapIter<K, V, P>

Create an ordered iterator over the key-value pairs in the map.

The iterator performs an in-order depth-first traversal of the backing treap using a stack.

impl<K, V, P> VertreapMap<K, V, P> where
    K: Ord, 

pub fn find(&self, key: &K) -> Option<Rc<KV<K, V>>>

impl<K, V, P> VertreapMap<K, V, P> where
    K: Ord,
    P: Copy + Ord, 

pub fn append(&self, key: K, val: V) -> VertreapMap<K, V, P>

pub fn append_with_priority(
    &self,
    priority: P,
    key: K,
    val: V
) -> VertreapMap<K, V, P>

Trait Implementations

impl<K, V, P> Clone for VertreapMap<K, V, P>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V, P> Default for VertreapMap<K, V, P> where
    Standard: Distribution<P>, 

fn default() -> VertreapMap<K, V, P>

Returns the "default value" for a type.