Struct Vector 

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

Tiered vector which maintains a collection of circular deques in order to efficiently support insert and remove from any location within the vector.

Implementations

impl<T> Vector<T>

pub fn new() -> Self

Return an empty vector with zero capacity.

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

Inserts an element at position index within the array, shifting some elements to the right as needed.

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

Appends an element to the back of a collection.

Panics

Panics if a new block is allocated that would exceed isize::MAX bytes.

Time complexity

O(√N) in the worst case.

pub fn push_within_capacity(&mut self, value: T) -> Result<(), T>

Appends an element if there is sufficient spare capacity, otherwise an error is returned with the element.

Time complexity

O(√N) in the worst case.

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

Retrieve a reference to the element at the given offset.

Time complexity

Constant time.

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

Returns a mutable reference to an element.

Time complexity

Constant time.

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

Removes an element from position index within the array, shifting some elements to the left as needed to close the gap.

Time complexity

O(√N) in the worst case.

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

Removes the last element from the vector and returns it, or None if the vector is empty.

Time complexity

O(√N) in the worst case.

pub fn pop_if(&mut self, predicate: impl FnOnce(&mut T) -> bool) -> Option<T>

Removes and returns the last element from a vector if the predicate returns true, or None`` if the predicate returns false`` or the vector is empty (the predicate will not be called in that case).

Time complexity

O(√N) in the worst case.

pub fn iter(&self) -> VectorIter<'_, T>

pub fn len(&self) -> usize

Return the number of elements in the vector.

Time complexity

Constant time.

pub fn capacity(&self) -> usize

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

Time complexity

Constant time.

pub fn is_empty(&self) -> bool

Returns true if the array has a length of 0.

Time complexity

Constant time.

pub fn clear(&mut self)

Clears the vector, removing all values and deallocating all blocks.

Time complexity

O(n) if elements are droppable, otherwise O(√N)

Trait Implementations

impl<T> Default for Vector<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Display for Vector<T>

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

Formats the value using the given formatter.

impl<A> FromIterator<A> for Vector<A>

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

Creates a value from an iterator.

impl<T> Index<usize> for Vector<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for Vector<T>

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<T> IntoIterator for Vector<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = VectorIntoIter<<Vector<T> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.