pred-trie-0.2.4: Predicative tries

Safe HaskellSafe
LanguageHaskell2010

Data.Trie.Pred.Disjoint

Synopsis

Documentation

data RDPTrie p t x Source

A Rooted, predicate, disjointly indexed trie

Constructors

Rooted (Maybe x) [DPTrie p t x] 

Instances

(Eq p, Eq t) => Monoid (RDPTrie p t x) Source 

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

lookup :: Eq t => [t] -> RDPTrie p t x -> Maybe x Source

lookupWithL :: Eq t => (t -> t) -> [t] -> RDPTrie p t x -> Maybe x Source

lookupNearestParent :: Eq t => [t] -> RDPTrie p t x -> Maybe x Source

litSingleton :: [t] -> x -> RDPTrie p t x Source

litExtrude :: [t] -> RDPTrie p t x -> RDPTrie p t x Source