Struct IndexStore 

pub struct IndexStore<K, P>(/* private fields */);

Key is from type usize and the information are saved in a List (Store).

Methods from Deref<Target = IndexStoreExt<K, P>>

pub fn keys(&self) -> impl Iterator<Item = K> + '_

Returns all stored Keys.

pub fn min_key(&self) -> Option<K>

Returns smallest stored Key.

pub fn max_key(&self) -> Option<K>

Returns greatest stored Key.

Trait Implementations

impl<K: Clone, P: Clone> Clone for IndexStore<K, P>

fn clone(&self) -> IndexStore<K, P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, P: Debug> Debug for IndexStore<K, P>

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

Formats the value using the given formatter.

impl<K, P> Deref for IndexStore<K, P>

type Target = IndexStoreExt<K, P>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<K, P> Lookup<IndexStore<K, P>, P> for IndexLookup<K, P>

where K: Into<usize> + Clone, P: KeyPosition + Clone,

fn new() -> Self

fn with_key<K>() -> Self

where K: KeyPosition, Self: Lookup<S, K> + Sized,

fn with_unique_key() -> Self

where P::Pos: PartialEq, Self: Lookup<S, UniqueKeyPosition<P::Pos>> + Sized,

fn with_multi_keys() -> Self

where P::Pos: Ord, Self: Lookup<S, MultiKeyPosition<P::Pos>> + Sized,

fn new_list_store<'a, F, K, It, I: 'a>(&self, field: &F, it: It) -> S

where It: Iterator<Item = &'a I> + ExactSizeIterator, F: Fn(&I) -> K, S: Store<Key = K, Pos = usize>,

Create a new Store for a collection from type list (e.g. LkupVec). The Pos-Type is always usize.

fn new_map_store<'a, F, K, It, I: 'a>(&self, field: &F, it: It) -> S

where It: Iterator<Item = (&'a P::Pos, &'a I)> + ExactSizeIterator, F: Fn(&I) -> K, S: Store<Key = K, Pos = P::Pos>, P::Pos: Clone + 'a,

Create a new Store for a collection from type map (e.g. LkupHashMap).

impl<'a, K, P> Positions for IndexStore<K, &'a P>

where P: KeyPositionAsSlice,

type Pos = <P as KeyPositionAsSlice>::Pos

fn positions(&self) -> impl Iterator<Item = &P::Pos>

Returns all knwon positions as an iterator.

impl<K, P> Retriever<K> for IndexStore<K, P>

where K: Into<usize>, P: KeyPositionAsSlice,

type Pos = <P as KeyPositionAsSlice>::Pos

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

Check, that the given key exist.

fn pos_by_key(&self, key: K) -> &[Self::Pos]

Returns all known positions for a given Key. If the Key not exist, than is the slice empty.

fn pos_by_many_keys<'a, K>( &'a self, keys: K, ) -> impl Iterator<Item = &'a Self::Pos>

where K: IntoIterator<Item = Q>, Self::Pos: 'a,

Returns all known positions for a given iterator of Keys.

impl<K, P> Store for IndexStore<K, P>

where K: Into<usize> + Clone, P: KeyPosition + Clone,

type Key = K

type Pos = <P as KeyPosition>::Pos

fn insert(&mut self, key: Self::Key, pos: Self::Pos)

Insert an Key with the associated Positions.

fn delete(&mut self, key: Self::Key, pos: &Self::Pos)

Delete means: if an Key has more than one Position, then remove only the given Position: If the Key not exist, then is deleteignored:

fn with_capacity(capacity: usize) -> Self

To reduce memory allocations can create an Store with capacity.

fn update(&mut self, old_key: Self::Key, pos: Self::Pos, new_key: Self::Key)

Update means: Key changed, but Position stays the same.

impl<'a, K, P> ViewCreator<'a> for IndexStore<K, P>

where K: Into<usize> + Clone, P: KeyPositionAsSlice + 'a,

type Key = K

type Retriever = IndexStore<K, &'a P>

fn create_view<It>(&'a self, keys: It) -> View<Self::Retriever>

where It: IntoIterator<Item = Self::Key>,

Create a View by the given Keys.