Struct sortedvec::example::ExampleSortedVec

pub struct ExampleSortedVec { /* fields omitted */ }

Sorted vector type that provides quick access to Ts through Ks.

Methods

impl ExampleSortedVec

pub fn find(&self, key: &K) -> Option<&T>

Tries to find an element in the collection with the given key. It has logarithmic worst case time complexity.

pub fn contains(&self, key: &K) -> bool

Checks whether there is a value with that key in the collection. This is done in O(log(n)) time.

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

Removes and returns a single value from the collection with the given key, if it exists. This operation has linear worst-case time complexity.

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

Inserts a new value into the collection, maintaining the internal order invariant. This is an O(n) operation.

pub fn split_off(&mut self, at: usize) -> Self

Splits the collection into two at the given index.

Returns a newly allocated Self. self contains elements [0, at), and the returned Self contains elements [at, len).

Note that the capacity of self does not change.

Panics

Panics if at > len.

pub fn dedup(&mut self)

Removes all elements but one that resolve to the same key.

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

Removes and returns the greatest element with the respect to the generated keys. An O(1) operation.

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 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 From<Vec<T>> for ExampleSortedVec

fn from(vec: Vec<T>) -> Self

Performs the conversion.

impl IntoIterator for ExampleSortedVec

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Into<Vec<T>> for ExampleSortedVec

fn into(self) -> Vec<T>

Performs the conversion.

impl Extend<T> for ExampleSortedVec

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

Extends a collection with the contents of an iterator.

impl Default for ExampleSortedVec

fn default() -> Self

Returns the "default value" for a type.

impl AsRef<[T]> for ExampleSortedVec

fn as_ref(&self) -> &[T]

Performs the conversion.

impl AsRef<Vec<T>> for ExampleSortedVec

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

Performs the conversion.

impl Clone for ExampleSortedVec

fn clone(&self) -> ExampleSortedVec

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ExampleSortedVec

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

Formats the value using the given formatter.

impl Deref for ExampleSortedVec

type Target = Vec<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl FromIterator<T> for ExampleSortedVec

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl Borrow<[T]> for ExampleSortedVec

fn borrow(&self) -> &[T]

Immutably borrows from an owned value.