Struct IdentifiedVec 

pub struct IdentifiedVec<Id, T> { /* private fields */ }

Ordered collection with O(1) id lookup (UDF IdentifiedArray parity).

Implementations

impl<Id, T> IdentifiedVec<Id, T>

where Id: Copy + Eq + Hash, T: Identifiable<Id = Id>,

pub fn new() -> IdentifiedVec<Id, T>

pub fn with_capacity(capacity: usize) -> IdentifiedVec<Id, T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn ids(&self) -> impl Iterator<Item = Id>

pub fn iter(&self) -> impl Iterator<Item = &T>

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut T>

pub fn get(&self, id: Id) -> Option<&T>

pub fn get_mut(&mut self, id: Id) -> Option<&mut T>

pub fn index_of(&self, id: Id) -> Option<usize>

pub fn contains(&self, id: Id) -> bool

pub fn update(&mut self, id: Id, f: impl FnOnce(&mut T)) -> bool

Apply a closure to the element with id. Returns false when the id is missing.

The closure must not change the element’s id; use Self::insert to move an element under a new id.

pub fn is_consistent(&self) -> bool

Returns true when the internal index matches element order and ids.

pub fn insert(&mut self, item: T) -> Option<T>

Inserts at the end, or replaces an existing element with the same id (order preserved).

pub fn remove(&mut self, id: Id) -> Option<T>

pub fn reorder(&mut self, from: usize, to: usize) -> bool

Trait Implementations

impl<Id, T> Clone for IdentifiedVec<Id, T>

where Id: Clone, T: Clone,

fn clone(&self) -> IdentifiedVec<Id, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Id, T> Debug for IdentifiedVec<Id, T>

where Id: Debug, T: Debug,

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

Formats the value using the given formatter.

impl<Id, T> Default for IdentifiedVec<Id, T>

fn default() -> IdentifiedVec<Id, T>

Returns the “default value” for a type.

impl<Id, T> Eq for IdentifiedVec<Id, T>

where T: Eq,

impl<'a, Id, T> IntoIterator for &'a IdentifiedVec<Id, 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) -> <&'a IdentifiedVec<Id, T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, Id, T> IntoIterator for &'a mut IdentifiedVec<Id, 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) -> <&'a mut IdentifiedVec<Id, T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<Id, T> PartialEq for IdentifiedVec<Id, T>

where T: PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.