Struct rs_graph::vec::ItemVec

pub struct ItemVec<I, T> { /* fields omitted */ }

A vector that can be indexed by nodes or edges.

In fact, the vector can be indexed by some arbitrary item that can be mapped to a numeric index using an Indexer.

Methods

impl<I, T> ItemVec<I, T> where
    I: Indexer, 

pub fn from_indexer(indexer: I, value: T) -> Self where
    T: Clone, 

pub fn from_indexer_with<F>(indexer: I, f: F) -> Self where
    F: Fn(I::Idx) -> T, 

pub fn from_indexer_and_vec(indexer: I, values: Vec<T>) -> Self

pub fn new2<G>(g: G, value: T) -> Self where
    I: GraphIndexer<G>,
    T: Clone, 

pub fn new<G>(g: G, value: T) -> Self where
    I: GraphIndexer<G>,
    T: Clone, 

pub fn new_with<G, F>(g: G, f: F) -> Self where
    I: GraphIndexer<G>,
    F: Fn(I::Idx) -> T, 

pub fn new_from_vec<G>(g: G, values: Vec<T>) -> Self where
    I: GraphIndexer<G>, 

pub fn iter(&self) -> Zip<I::Iter, Iter<T>>

pub fn iter_mut(&mut self) -> Zip<I::Iter, IterMut<T>>

pub fn map<F>(&self, f: F) -> Self where
    I: Clone,
    F: Fn((I::Idx, &T)) -> T, 

pub fn reset(&mut self, value: T) where
    T: Clone, 

Trait Implementations

impl<I, T> Index<<I as Indexer>::Idx> for ItemVec<I, T> where
    I: Indexer, 

type Output = T

The returned type after indexing.

fn index(&self, i: I::Idx) -> &T

Performs the indexing (container[index]) operation.

impl<I, T> IndexMut<<I as Indexer>::Idx> for ItemVec<I, T> where
    I: Indexer, 

fn index_mut(&mut self, i: I::Idx) -> &mut T

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