Struct OrderStatisticTree 

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

Implementations

impl<T> OrderStatisticTree<T>

pub fn new(compare: fn(&T, &T) -> Ordering) -> Self

pub fn with_capacity(capacity: usize, compare: fn(&T, &T) -> Ordering) -> Self

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn unique_len(&self) -> usize

pub fn clear(&mut self)

pub fn get(&self, idx: usize) -> Option<&T>

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

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

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

pub fn rank_range(&self, bound: &T) -> Result<RangeInclusive<usize>, usize>

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

pub fn count(&self, value: &T) -> usize

Trait Implementations

impl<T: Debug> Debug for OrderStatisticTree<T>

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

Formats the value using the given formatter.

impl<T> Extend<T> for OrderStatisticTree<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, iterable: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.