Struct isize_vec::IsizeVec

pub struct IsizeVec<T> { /* fields omitted */ }

Container for multiple elements sorted by a certain isize order.

Every element T is tagged with an associated isize. The isize value decides the relative ordering of the elements. All manipulations keep the items T ordered according to the isize values from lowest to highest.

use isize_vec::IsizeVec;

let mut vector = IsizeVec::new();

vector.insert(10, 'a');
vector.insert(5, 'b');

println!("{:?}", vector);

for value in vector {
    println!("{}", value);
}

Methods

impl<T> IsizeVec<T>

pub fn new() -> Self

Create a new vector.

pub fn iter(&self) -> Iter<T>

Get an iterator to the values.

pub fn iter_mut(&mut self) -> IterMut<T>

Get an iterator to the values (mutable).

pub fn push(&mut self, item: T) -> usize

Push a value to the end of the vector, with relative: isize::MAX.

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

Remove the last element from this vector.

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

Create a drain iterator.

pub fn len(&self) -> usize

Returns the length of the container

pub fn is_empty(&self) -> bool

Returns whether the container is empty.

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

Get the item at a given index.

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

Get the item at a given index.

pub fn extract(&mut self) -> Vec<T>

Return the backing vector and clear this container.

pub fn first_positive(&self) -> usize

Find the index at which positive elements start.

pub fn insert(&mut self, relative: isize, item: T) -> usize

Insert a value into this vector.

The value relative indicates where the value will be put in the list relative to other values. If two values have the same relative value, then the value will be prepended if it is signed, and appended if unsigned.

Returns the index of insertion.

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

Remove the given index from the vector.

pub fn first_right_of(&self, relative: isize) -> usize

Find the first index to the right of the relative list.

pub fn swap(&mut self, a: usize, b: usize)

Swap two elements in the list. Associated order is swapped.

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

Same as Vec::retain.

Trait Implementations

impl<T: Clone> Clone for IsizeVec<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for IsizeVec<T>

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

Formats the value using the given formatter.

impl<T> Default for IsizeVec<T>

fn default() -> Self

Returns the "default value" for a type.

impl<T, I> Index<I> for IsizeVec<T> where
    I: SliceIndex<[T]>, 

type Output = <I as SliceIndex<[T]>>::Output

The returned type after indexing.

fn index(&self, index: I) -> &<Vec<T> as Index<I>>::Output

Performs the indexing (container[index]) operation.

impl<T, I> IndexMut<I> for IsizeVec<T> where
    I: SliceIndex<[T]>, 

fn index_mut(&mut self, index: I) -> &mut <Vec<T> as Index<I>>::Output

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

impl<T> IntoIterator for IsizeVec<T>

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) -> IntoIter<T>

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a IsizeVec<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut IsizeVec<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IterMut<'a, T>

Creates an iterator from a value.