Struct Treap 

pub struct Treap<K, V> { /* private fields */ }

Implementations

impl<K: Ord, V> Treap<K, V>

pub fn new(seed: u64) -> Self

pub fn with_capacity(seed: u64, capacity: usize) -> Self

Construct with capacity pre-allocated. Use when an upper bound on the working set is known: avoids the doubling-vec growth path during the first burst of inserts.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

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

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

In-order traversal; pushes (key, value) references into a Vec.