Struct competitive_programming_rs::data_structure::treap::treap::Treap [−][src]
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> Treap<T>[src]
pub fn new(seed: u32) -> Self[src]
pub fn clear(&mut self)[src]
pub fn is_empty(&self) -> bool[src]
pub fn len(&self) -> usize[src]
pub fn nth(&self, n: usize) -> Option<&T>[src]
impl<T: PartialOrd> Treap<T>[src]
pub fn insert(&mut self, key: T) -> bool[src]
pub fn contains(&self, key: &T) -> bool[src]
pub fn index_of(&self, key: &T) -> Option<usize>[src]
impl<T: PartialOrd> Treap<T>[src]
Trait Implementations
Auto Trait Implementations
impl<T> RefUnwindSafe for Treap<T> where
T: RefUnwindSafe, [src]
T: RefUnwindSafe,
impl<T> Send for Treap<T> where
T: Send, [src]
T: Send,
impl<T> Sync for Treap<T> where
T: Sync, [src]
T: Sync,
impl<T> Unpin for Treap<T>[src]
impl<T> UnwindSafe for Treap<T> where
T: UnwindSafe, [src]
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,