Struct auto_diff::collection::generational_index::GenIndex

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

A simple generational index implementation. The data is stored in a read-only manner, Use RefCell to get mutability. Not secure, no index validity check.

Implementations

impl<T> GenIndex<T>

pub fn new() -> GenIndex<T>

Create an empty GenIndex

pub fn clear(&mut self)

Clear the GenIndex

pub fn contains(&self, index: &NetIndex) -> bool

Check if a key is in the collection

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

Return the registered item

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

Return a mut reference.

pub fn len(&self) -> usize

Number of item in the list.

pub fn is_empty(self) -> bool

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

Add a new item to the list.

pub fn remove(&mut self, index: &NetIndex) -> Result<(), ()>

Remove an item from the list.

pub fn replace(&mut self, index: &NetIndex, val: T) -> Result<(), ()>

Replace the item of the index with a new one.

pub fn iter_key(&self) -> GenIndexIter<'_, T>

pub fn append(&mut self, other: &mut GenIndex<T>)