Data.Trie.Pred.Hetero.Unified.Tail

Documentation

data HUPTrie t a b where

Constructors

HUMore :: t -> Maybe a -> [HUPTrie t a b] -> HUPTrie t a b

HUPred :: t -> (t -> Maybe r) -> Maybe (r -> b) -> [HUPTrie t (r -> a) (r -> b)] -> HUPTrie t a b

lookup :: Eq t => NonEmpty t -> HUPTrie t a b -> Maybe (Either a b)

merge :: Eq t => HUPTrie t a b -> HUPTrie t a b -> HUPTrie t a b

Overwrites when similar, leaves untouched when not

areDisjoint :: Eq t => HUPTrie t a b -> HUPTrie t a b -> Bool

litSingletonTail :: NonEmpty t -> a -> HUPTrie t a b

litExtrudeTail :: [t] -> HUPTrie t a b -> HUPTrie t a b

sort :: Eq t => [HUPTrie t a b] -> [HUPTrie t a b]