pub struct WholeAlphabetTable<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> { /* private fields */ }Trait Implementations§
Source§impl<K: Clone + SmallAlphabet, C: Clone + AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> Clone for WholeAlphabetTable<K, C>
impl<K: Clone + SmallAlphabet, C: Clone + AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> Clone for WholeAlphabetTable<K, C>
Source§fn clone(&self) -> WholeAlphabetTable<K, C>
fn clone(&self) -> WholeAlphabetTable<K, C>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> ConstructiveTransitionTable for WholeAlphabetTable<K, C>
impl<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> ConstructiveTransitionTable for WholeAlphabetTable<K, C>
fn insert(&mut self, key: Self::KeyType, trans: GeneralSamNodeID)
fn from_kv_iter<'b, Iter: IntoIterator<Item = (Self::KeyType, &'b GeneralSamNodeID)>>(
iter: Iter,
) -> Selfwhere
Self::KeyType: 'b,
Source§impl<K: Debug + SmallAlphabet, C: Debug + AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> Debug for WholeAlphabetTable<K, C>
impl<K: Debug + SmallAlphabet, C: Debug + AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> Debug for WholeAlphabetTable<K, C>
Source§impl<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> Default for WholeAlphabetTable<K, C>
impl<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> Default for WholeAlphabetTable<K, C>
Source§impl<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> TransitionTable for WholeAlphabetTable<K, C>
impl<K: SmallAlphabet, C: AsRef<[Option<GeneralSamNodeID>]> + AsMut<[Option<GeneralSamNodeID>]> + FromIterator<Option<GeneralSamNodeID>> + Clone> TransitionTable for WholeAlphabetTable<K, C>
type KeyType = K
type IterType<'a> = WholeAlphabetTableIter<'a, K> where Self: 'a, Self::KeyType: 'a
fn get(&self, key: &Self::KeyType) -> Option<&GeneralSamNodeID>
fn get_mut(&mut self, key: &Self::KeyType) -> Option<&mut GeneralSamNodeID>
fn iter(&self) -> Self::IterType<'_>
fn from_kv_iter<'b, Iter: IntoIterator<Item = (Self::KeyType, &'b GeneralSamNodeID)>>(
iter: Iter,
) -> Selfwhere
Self::KeyType: 'b,
fn contains_key(&self, key: &Self::KeyType) -> bool
fn transitions(&self) -> TransitionIter<'_, Self::KeyType, Self::IterType<'_>> ⓘ
Auto Trait Implementations§
impl<K, C> Freeze for WholeAlphabetTable<K, C>where
C: Freeze,
impl<K, C> RefUnwindSafe for WholeAlphabetTable<K, C>where
C: RefUnwindSafe,
K: RefUnwindSafe,
impl<K, C> Send for WholeAlphabetTable<K, C>
impl<K, C> Sync for WholeAlphabetTable<K, C>
impl<K, C> Unpin for WholeAlphabetTable<K, C>
impl<K, C> UnwindSafe for WholeAlphabetTable<K, C>where
C: UnwindSafe,
K: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more