pred-trie-0.0.10.2: Predicative tries

Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Trie.Pred.Disjoint.Tail

Synopsis

Documentation

data DPTrie p t x where Source

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 Source

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

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

Overwrites when similar, leaves untouched when not

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

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

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

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