Data.Trie.Pred.Unified.Tail

Documentation

data UPTrie t x where

Constructors

UMore :: t -> Maybe x -> [UPTrie t x] -> UPTrie t x

UPred :: t -> (t -> Maybe r) -> Maybe (r -> x) -> [UPTrie t (r -> x)] -> UPTrie t x

showTail :: Show t => UPTrie t x -> String

assignLit :: Eq t => NonEmpty t -> Maybe x -> UPTrie t x -> UPTrie t x

lookup :: Eq t => NonEmpty t -> UPTrie t x -> Maybe x

lookupNearestParent :: Eq t => NonEmpty t -> UPTrie t x -> Maybe x

merge :: Eq t => UPTrie t x -> UPTrie t x -> UPTrie t x

Overwrites when similar, leaves untouched when not

areDisjoint :: Eq t => UPTrie t x -> UPTrie t x -> Bool

litSingletonTail :: NonEmpty t -> x -> UPTrie t x

litExtrudeTail :: [t] -> UPTrie t x -> UPTrie t x

sort :: Eq t => [UPTrie t x] -> [UPTrie t x]