pred-trie-0.2.0: Predicative tries

Safe HaskellSafe
LanguageHaskell2010

Data.Trie.Pred.Unified

Documentation

data RUPTrie t x Source

Constructors

Rooted 

Fields

root :: Maybe x
 
children :: [UPTrie t x]
 

Instances

Show t => Show (RUPTrie t x) Source 
Eq t => Monoid (RUPTrie t x) Source 

assignLit :: Eq t => [t] -> Maybe x -> RUPTrie t x -> RUPTrie t x Source

showTrie :: Show t => RUPTrie t x -> String Source

merge :: Eq t => RUPTrie t x -> RUPTrie t x -> RUPTrie t x Source

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

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

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

litSingleton :: [t] -> x -> RUPTrie t x Source

litExtrude :: [t] -> RUPTrie t x -> RUPTrie t x Source

module Data.Trie.Pred.Unified.Tail