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

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

Implementations

impl<T> Treap<T>

pub fn new(seed: u32) -> Self

pub fn len(&self) -> usize

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

impl<T: PartialOrd> Treap<T>

pub fn insert(&mut self, value: T) -> bool

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

pub fn erase(&mut self, value: &T) -> Option<T>

pub fn binary_search(&self, value: &T) -> Result<usize, usize>