Struct sorted_vec::ReverseSortedSet

pub struct ReverseSortedSet<T: Ord> { /* fields omitted */ }

Reverse sorted set

Implementations

impl<T: Ord> ReverseSortedSet<T>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn from_unsorted(vec: Vec<T>) -> Self

Uses sort_unstable() to sort in place and dedup() to remove duplicates.

pub fn insert(&mut self, element: T) -> usize

Insert an element into sorted position, returning the order index at which it was placed.

pub fn find_or_insert(&mut self, element: T) -> Result<usize, usize>

Find the element and return the index with Ok, otherwise insert the element and return the new element index with Err.

pub fn remove_item(&mut self, item: &T) -> Option<T>

pub fn remove_index(&mut self, index: usize) -> T

Panics if index is out of bounds

pub fn pop(&mut self) -> Option<T>

pub fn clear(&mut self)

pub fn drain<R>(&mut self, range: R) -> Drain<'_, T> where
    R: RangeBounds<usize>, 

pub fn retain<F>(&mut self, f: F) where
    F: FnMut(&T) -> bool, 

pub fn into_vec(self) -> Vec<T>

NOTE: to_vec() is a slice method that is accessible through deref, use this instead to avoid cloning

pub fn mutate_vec<F, O>(&mut self, f: F) -> O where
    F: FnOnce(&mut Vec<T>) -> O, 

Apply a closure mutating the sorted vector and use sort_unstable() to re-sort the mutated vector and dedup() to remove any duplicate values

Methods from Deref<Target = ReverseSortedVec<T>>

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

Trait Implementations

impl<T: Clone + Ord> Clone for ReverseSortedSet<T>

pub fn clone(&self) -> ReverseSortedSet<T>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Ord> Debug for ReverseSortedSet<T>

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

Formats the value using the given formatter.

impl<T: Ord> Default for ReverseSortedSet<T>

pub fn default() -> Self

Returns the "default value" for a type.

impl<T: Ord> Deref for ReverseSortedSet<T>

type Target = ReverseSortedVec<T>

The resulting type after dereferencing.

pub fn deref(&self) -> &ReverseSortedVec<T>

Dereferences the value.

impl<T: Eq + Ord> Eq for ReverseSortedSet<T>

impl<T: Ord> Extend<T> for ReverseSortedSet<T>

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

Extends a collection with the contents of an iterator.

pub fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

pub 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.

impl<T: Ord> From<Vec<T, Global>> for ReverseSortedSet<T>

pub fn from(unsorted: Vec<T>) -> Self

Performs the conversion.

impl<T: Ord + Hash> Hash for ReverseSortedSet<T>

pub fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<T: Ord> Ord for ReverseSortedSet<T>

pub fn cmp(&self, other: &ReverseSortedSet<T>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<T: PartialEq + Ord> PartialEq<ReverseSortedSet<T>> for ReverseSortedSet<T>

pub fn eq(&self, other: &ReverseSortedSet<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &ReverseSortedSet<T>) -> bool

This method tests for !=.

impl<T: PartialOrd + Ord> PartialOrd<ReverseSortedSet<T>> for ReverseSortedSet<T>

pub fn partial_cmp(&self, other: &ReverseSortedSet<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

pub fn lt(&self, other: &ReverseSortedSet<T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

pub fn le(&self, other: &ReverseSortedSet<T>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

pub fn gt(&self, other: &ReverseSortedSet<T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

pub fn ge(&self, other: &ReverseSortedSet<T>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Ord> StructuralEq for ReverseSortedSet<T>

impl<T: Ord> StructuralPartialEq for ReverseSortedSet<T>