| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Trie.Pred.Disjoint
- data RDPTrie p t x = Rooted (Maybe x) [DPTrie p t x]
- merge :: (Eq p, Eq t) => RDPTrie p t x -> RDPTrie p t x -> RDPTrie p t x
- lookup :: Eq t => [t] -> RDPTrie p t x -> Maybe x
- lookupNearestParent :: Eq t => [t] -> RDPTrie p t x -> Maybe x
- litSingleton :: [t] -> x -> RDPTrie p t x
- litExtrude :: [t] -> RDPTrie p t x -> RDPTrie p t x
- module Data.Trie.Pred.Disjoint.Tail
Documentation
A Rooted, predicate, disjointly indexed trie
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
module Data.Trie.Pred.Disjoint.Tail