Trait lattices::ght::colt::ColtGetTail

pub trait ColtGetTail<InnerToMerge>: ColtGet {
    // Required method
    fn merge(&mut self, inner_to_merge: InnerToMerge);
}

Expand description

ColtGet without the first (head) trie.

Required Methods§

fn merge(&mut self, inner_to_merge: InnerToMerge)

merge an inner node into the head of this tail of the forest

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

impl<'a, Head, Rest, Schema, ValType, Storage> ColtGetTail<GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>> for (&'a mut GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>, Rest)
where Rest: ColtGet<Head = Head, Schema = Schema, Storage = Storage>, Head: Eq + Hash + Clone, Schema: Eq + Hash + Clone + PartialEqVariadic + 'static + VariadicExt + SplitBySuffix<ValType>, ValType: Eq + Hash + Clone + PartialEqVariadic, Storage: VariadicCollection<Schema = Schema>, (&'a mut GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>, Rest): ColtGet<Head = Head, Schema = Schema, Storage = Storage>, GhtLeaf<Schema, ValType, Storage>: GeneralizedHashTrieNode<Schema = Schema>, <Schema as SplitBySuffix<ValType>>::Prefix: Eq + Hash + Clone, GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>: GeneralizedHashTrieNode<Head = Head, Schema = Schema, Storage = Storage> + GhtGet,

fn merge( &mut self, inner_to_merge: GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>, )

impl<'a, Rest, Schema, SuffixSchema, T, Storage> ColtGetTail<T> for (&'a mut GhtLeaf<Schema, SuffixSchema, Storage>, Rest)
where Rest: ColtGetTail<<GhtLeaf<Schema, SuffixSchema, Storage> as ColtForestNode>::Force, Storage = Storage>, <Rest as ColtGet>::SuffixSchema: 'a, GhtLeaf<Schema, SuffixSchema, Storage>: ColtForestNode, Schema: Clone + Hash + Eq + VariadicExt, SuffixSchema: Clone + Hash + Eq + VariadicExt, Storage: VariadicCollection<Schema = Schema>,

fn merge(&mut self, _inner_to_merge: T)

impl<Head, Schema, ValType, Storage> ColtGetTail<GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>> for (&mut GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>, ())
where GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>: GeneralizedHashTrieNode<Head = Head> + GhtGet, GhtLeaf<Schema, ValType, Storage>: GeneralizedHashTrieNode<Schema = Schema, Storage = Storage>, Head: Clone + Eq + Hash, Schema: Clone + Eq + Hash + VariadicExt, Storage: VariadicCollection<Schema = Schema>,

fn merge( &mut self, inner_to_merge: GhtInner<Head, GhtLeaf<Schema, ValType, Storage>>, )

Implementors§