Struct competitive_programming_rs::data_structure::treap::treap::Treap

pub struct Treap<T> { /* private fields */ }

Treap is a binary search tree data structure that maintain a dynamic set of ordered keys and allow binary searches among the keys, https://en.wikipedia.org/wiki/Treap

Implementations

impl<T: PartialOrd> Treap<T>where
    T: Clone,

pub fn new(seed: u32) -> Self

pub fn clear(&mut self)

pub fn is_empty(&self) -> bool

pub fn insert(&mut self, key: T)

pub fn contains(&self, key: &T) -> bool

pub fn erase(&mut self, key: &T)

pub fn nth(&self, n: usize) -> &T

Trait Implementations

impl<T: Debug> Debug for Treap<T>

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

Formats the value using the given formatter.