Struct IntIndex

pub struct IntIndex<K = i32, X = usize> { /* private fields */ }

Key is from type Into: i32.

Trait Implementations

impl<K: Debug, X: Debug> Debug for IntIndex<K, X>

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

Formats the value using the given formatter.

impl<K, X> Filterable for IntIndex<K, X>

where K: Into<i32> + TryInto<usize> + Copy,

type Key = K

type Index = X

fn get(&self, key: &Self::Key) -> &[X]

Get all indices for a given Key. If the Key not exist, than this method returns empty array.

fn contains(&self, key: &Self::Key) -> bool

Checks whether the Key exists.

fn get_with_check<F>(&self, key: &Self::Key, check: F) -> &[Self::Index]

where F: Fn(&Self::Key) -> bool,

Get all indices for a given Key, if the check functions returns true. If the Key not exist, than this method returns empty array.

fn get_many<'k, K>( &'k self, keys: K, ) -> Many<'k, Self, <K as IntoIterator>::IntoIter>

where K: IntoIterator<Item = Self::Key> + 'k, Self: Sized,

Combined all given keys with an logical OR.

impl<K> Keys for IntIndex<K>

where K: Into<i32> + TryInto<usize> + Ord + Default + Copy,

type Key = K

fn exist(&self, key: &K) -> bool

Checks if the Keyexist.

fn iter<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Self::Key> + 'a>

Return all known Keys.

fn from_iter<I>(it: I) -> Self

where I: IntoIterator<Item = K>,

Create a new Key-Store from a given List of Keys.

impl<K, X> MetaData for IntIndex<K, X>

type Meta<'m> = IntMeta<'m, K, X> where K: 'm, X: 'm

fn meta(&self) -> Self::Meta<'_>

Return meta data from the Store.

impl<K, X> Store for IntIndex<K, X>

where K: Into<i32> + TryInto<usize> + Ord + Default + Copy, X: Ord + Clone,

fn insert(&mut self, key: K, x: X)

Insert an Key for a given Index.

fn delete(&mut self, key: K, x: &X)

Delete means: if an Key has more than one Index, then remove only this Index:

fn with_capacity(capacity: usize) -> Self

To reduce memory allocations can create an Index-store with capacity.

fn update(&mut self, old_key: Self::Key, idx: Self::Index, new_key: Self::Key)

Update means: Key changed, but Index stays the same

fn from_list<I>(it: I) -> Self

where I: IntoIterator<Item = Self::Key>, <I as IntoIterator>::IntoIter: ExactSizeIterator, Self: Store<Index = usize> + Sized,

Create a new Store from a given List (array, slice, Vec, …) with a given Key. The Index-Type is usize.

fn from_map<I>(it: I) -> Self

where I: IntoIterator<Item = (Self::Key, Self::Index)> + ExactSizeIterator, Self: Sized,

Create a new Store from a given Map (Key-Index-Pair).