Struct sorted_vec::ReverseSortedVec

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

Reverse sorted vector

Methods

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) -> Result<usize, usize>

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

If the element was already present, the order index is returned as an Err, otherwise it is returned with Ok.

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 drain<R>(&mut self, range: R) -> Drain<T> where
    R: RangeBounds<usize>, 

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

fn default() -> Self

Returns the "default value" for a type.

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

fn clone(&self) -> ReverseSortedVec<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

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

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

This method tests for !=.

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

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

Extends a collection with the contents of an iterator.

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

type Target = Vec<T>

The resulting type after dereferencing.

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

Dereferences the value.

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

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

Formats the value using the given formatter.