Struct sorted_vec::ReverseSortedVec

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

Reverse sorted vector

Implementations

impl<T: Ord> ReverseSortedVec<T>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

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

Uses sort_unstable_by() to sort in place.

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

Insert an element into (reverse) 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 binary_search(&self, x: &T) -> Result<usize, usize>

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

pub fn clear(&mut self)

pub fn dedup(&mut self)

pub fn dedup_by_key<F, K>(&mut self, key: F) where
    F: FnMut(&mut T) -> K,
    K: PartialEq<K>, 

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 reverse-sorted vector and use sort_unstable_by() to re-sort the mutated vector

Methods from Deref<Target = Vec<T>>

pub fn capacity(&self) -> usize

Returns the number of elements the vector can hold without reallocating.

Examples

let vec: Vec<i32> = Vec::with_capacity(10);
assert_eq!(vec.capacity(), 10);

pub fn as_slice(&self) -> &[T]

Extracts a slice containing the entire vector.

Equivalent to &s[..].

Examples

use std::io::{self, Write};
let buffer = vec![1, 2, 3, 5, 8];
io::sink().write(buffer.as_slice()).unwrap();

pub fn as_ptr(&self) -> *const T

Returns a raw pointer to the vector's buffer.

The caller must ensure that the vector outlives the pointer this function returns, or else it will end up pointing to garbage. Modifying the vector may cause its buffer to be reallocated, which would also make any pointers to it invalid.

The caller must also ensure that the memory the pointer (non-transitively) points to is never written to (except inside an UnsafeCell) using this pointer or any pointer derived from it. If you need to mutate the contents of the slice, use as_mut_ptr.

Examples

let x = vec![1, 2, 4];
let x_ptr = x.as_ptr();

unsafe {
    for i in 0..x.len() {
        assert_eq!(*x_ptr.add(i), 1 << i);
    }
}

pub fn allocator(&self) -> &A

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

Returns a reference to the underlying allocator.

pub fn len(&self) -> usize

Returns the number of elements in the vector, also referred to as its 'length'.

Examples

let a = vec![1, 2, 3];
assert_eq!(a.len(), 3);

pub fn is_empty(&self) -> bool

Returns true if the vector contains no elements.

Examples

let mut v = Vec::new();
assert!(v.is_empty());

v.push(1);
assert!(!v.is_empty());

Trait Implementations

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

pub fn clone(&self) -> ReverseSortedVec<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 ReverseSortedVec<T>

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

Formats the value using the given formatter.

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

pub fn default() -> Self

Returns the "default value" for a type.

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

type Target = Vec<T>

The resulting type after dereferencing.

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

Dereferences the value.

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

impl<T: Ord> Extend<T> for ReverseSortedVec<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 ReverseSortedVec<T>

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

Performs the conversion.

impl<T: Ord + Hash> Hash for ReverseSortedVec<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 ReverseSortedVec<T>

pub fn cmp(&self, other: &ReverseSortedVec<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<ReverseSortedVec<T>> for ReverseSortedVec<T>

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

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

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

This method tests for !=.

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

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

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

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

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

pub fn le(&self, other: &ReverseSortedVec<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: &ReverseSortedVec<T>) -> bool

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

pub fn ge(&self, other: &ReverseSortedVec<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 ReverseSortedVec<T>

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