Salak.Trie

Documentation

data Trie v

Constructors

Trie !(Maybe v) !(HashMap Key (Trie v))

Instances

Functor Trie

Defined in Salak.Trie

Methods

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

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

Foldable Trie

Defined in Salak.Trie

Methods

fold :: Monoid m => Trie m -> m

foldMap :: Monoid m => (a -> m) -> Trie a -> m

foldr :: (a -> b -> b) -> b -> Trie a -> b

foldr' :: (a -> b -> b) -> b -> Trie a -> b

foldl :: (b -> a -> b) -> b -> Trie a -> b

foldl' :: (b -> a -> b) -> b -> Trie a -> b

foldr1 :: (a -> a -> a) -> Trie a -> a

foldl1 :: (a -> a -> a) -> Trie a -> a

toList :: Trie a -> [a]

null :: Trie a -> Bool

length :: Trie a -> Int

elem :: Eq a => a -> Trie a -> Bool

maximum :: Ord a => Trie a -> a

minimum :: Ord a => Trie a -> a

sum :: Num a => Trie a -> a

product :: Num a => Trie a -> a

Eq v => Eq (Trie v)

Defined in Salak.Trie

Methods

(==) :: Trie v -> Trie v -> Bool

(/=) :: Trie v -> Trie v -> Bool

Show v => Show (Trie v)

Defined in Salak.Trie

Methods

showsPrec :: Int -> Trie v -> ShowS

show :: Trie v -> String

showList :: [Trie v] -> ShowS

empty :: Trie v

null :: Eq v => Trie v -> Bool

member :: Eq v => Keys -> Trie v -> Bool

lookup :: Eq v => Keys -> Trie v -> Maybe v

insert :: Eq v => Keys -> v -> Trie v -> Trie v

modify :: Eq v => Key -> (Trie v -> Trie v) -> Trie v -> Trie v

modify' :: Eq v => Keys -> (Trie v -> Trie v) -> Trie v -> Trie v

modifyF :: (Monad m, Eq v) => Key -> (Trie v -> m (Trie v)) -> Trie v -> m (Trie v)

alter :: Eq v => (Maybe v -> Maybe v) -> Keys -> Trie v -> Trie v

alterF :: (Functor f, Eq v) => (Maybe v -> f (Maybe v)) -> Keys -> Trie v -> f (Trie v)

toList :: Trie v -> [(Keys, v)]

fromList :: Eq v => [(Keys, v)] -> Trie v

filter :: Eq v => (v -> Bool) -> Trie v -> Trie v

partition :: Eq v => (v -> Bool) -> Trie v -> (Trie v, Trie v)

unionWith :: Eq v => (Maybe v -> Maybe v -> Maybe v) -> Trie v -> Trie v -> Trie v

merge :: (Maybe v -> Maybe v -> Maybe v3) -> Trie v -> Trie v -> Trie v3