graphmod-plugin-0.1.0.0: A reimplementation of graphmod as a source plugin

Safe HaskellSafe
LanguageHaskell2010

GraphMod.Trie

Documentation

data Trie a b Source #

Constructors

Sub (Map a (Trie a b)) (Maybe b) 
Instances
Functor (Trie a) Source # 
Instance details

Defined in GraphMod.Trie

Methods

fmap :: (a0 -> b) -> Trie a a0 -> Trie a b #

(<$) :: a0 -> Trie a b -> Trie a a0 #

(Eq a, Eq b) => Eq (Trie a b) Source # 
Instance details

Defined in GraphMod.Trie

Methods

(==) :: Trie a b -> Trie a b -> Bool #

(/=) :: Trie a b -> Trie a b -> Bool #

(Ord a, Ord b) => Ord (Trie a b) Source # 
Instance details

Defined in GraphMod.Trie

Methods

compare :: Trie a b -> Trie a b -> Ordering #

(<) :: Trie a b -> Trie a b -> Bool #

(<=) :: Trie a b -> Trie a b -> Bool #

(>) :: Trie a b -> Trie a b -> Bool #

(>=) :: Trie a b -> Trie a b -> Bool #

max :: Trie a b -> Trie a b -> Trie a b #

min :: Trie a b -> Trie a b -> Trie a b #

(Show a, Show b) => Show (Trie a b) Source # 
Instance details

Defined in GraphMod.Trie

Methods

showsPrec :: Int -> Trie a b -> ShowS #

show :: Trie a b -> String #

showList :: [Trie a b] -> ShowS #

lookup :: Ord a => [a] -> Trie a b -> Maybe b Source #

insert :: Ord a => [a] -> (Maybe b -> b) -> Trie a b -> Trie a b Source #