Data.Trie.Pred.Disjoint.Tail

Documentation

data DPTrie p t x where

Constructors

DMore :: t -> Maybe x -> [DPTrie p t x] -> DPTrie p t x

DPred :: p -> (t -> Maybe r) -> Maybe (r -> x) -> [DPTrie p t (r -> x)] -> DPTrie p t x

lookup :: Eq t => NonEmpty t -> DPTrie p t x -> Maybe x

lookupWithL :: Eq t => (t -> t) -> NonEmpty t -> DPTrie p t x -> Maybe x

lookupNearestParent :: Eq t => NonEmpty t -> DPTrie p t x -> Maybe x

merge :: (Eq p, Eq t) => DPTrie p t x -> DPTrie p t x -> DPTrie p t x

Overwrites when similar, leaves untouched when not

areDisjoint :: (Eq p, Eq t) => DPTrie p t x -> DPTrie p t x -> Bool

litSingletonTail :: NonEmpty t -> x -> DPTrie p t x

litExtrudeTail :: [t] -> DPTrie p t x -> DPTrie p t x

sort :: (Eq p, Eq t) => [DPTrie p t x] -> [DPTrie p t x]