TrieMap-0.5.1: Automatic type inference of generalized tries.Source codeContentsIndex
Data.TrieMap
Contents
Map type
Operators
Query
Construction
Insertion
Delete/Update
Combine
Union
Difference
Intersection
Traversal
Map
Traverse
Fold
Conversion
Lists
Ordered lists
Filter
Submap
Min/Max
Synopsis
class TrieKey (Rep k) (TrieMap (Rep k)) => TKey k
data TMap k a
(!) :: TKey k => TMap k a -> k -> a
(\\) :: TKey k => TMap k a -> TMap k b -> TMap k a
null :: TKey k => TMap k a -> Bool
size :: TKey k => TMap k a -> Int
member :: TKey k => k -> TMap k a -> Bool
notMember :: TKey k => k -> TMap k a -> Bool
lookup :: TKey k => k -> TMap k a -> Maybe a
findWithDefault :: TKey k => a -> k -> TMap k a -> a
empty :: TKey k => TMap k a
showMap :: (TKey k, Show (TrieMap (Rep k) (K0 a) (Rep k))) => TMap k a -> String
singleton :: TKey k => k -> a -> TMap k a
insert :: TKey k => k -> a -> TMap k a -> TMap k a
insertWith :: TKey k => (a -> a -> a) -> k -> a -> TMap k a -> TMap k a
insertWithKey :: TKey k => (k -> a -> a -> a) -> k -> a -> TMap k a -> TMap k a
delete :: TKey k => k -> TMap k a -> TMap k a
adjust :: TKey k => (a -> a) -> k -> TMap k a -> TMap k a
adjustWithKey :: TKey k => (k -> a -> a) -> k -> TMap k a -> TMap k a
update :: TKey k => (a -> Maybe a) -> k -> TMap k a -> TMap k a
updateWithKey :: TKey k => (k -> a -> Maybe a) -> k -> TMap k a -> TMap k a
alter :: TKey k => (Maybe a -> Maybe a) -> k -> TMap k a -> TMap k a
union :: TKey k => TMap k a -> TMap k a -> TMap k a
unionWith :: TKey k => (a -> a -> a) -> TMap k a -> TMap k a -> TMap k a
unionWithKey :: TKey k => (k -> a -> a -> a) -> TMap k a -> TMap k a -> TMap k a
unionMaybeWith :: TKey k => (a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k a
unionMaybeWithKey :: TKey k => (k -> a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k a
difference :: TKey k => TMap k a -> TMap k b -> TMap k a
differenceWith :: TKey k => (a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k a
differenceWithKey :: TKey k => (k -> a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k a
intersection :: TKey k => TMap k a -> TMap k b -> TMap k a
intersectionWith :: TKey k => (a -> b -> c) -> TMap k a -> TMap k b -> TMap k c
intersectionWithKey :: TKey k => (k -> a -> b -> c) -> TMap k a -> TMap k b -> TMap k c
intersectionMaybeWith :: TKey k => (a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k c
intersectionMaybeWithKey :: TKey k => (k -> a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k c
map :: TKey k => (a -> b) -> TMap k a -> TMap k b
mapWithKey :: TKey k => (k -> a -> b) -> TMap k a -> TMap k b
mapKeys :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' a
mapKeysWith :: (TKey k, TKey k') => (a -> a -> a) -> (k -> k') -> TMap k a -> TMap k' a
mapKeysMonotonic :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' a
traverseWithKey :: (TKey k, Applicative f) => (k -> a -> f b) -> TMap k a -> f (TMap k b)
fold :: TKey k => (a -> b -> b) -> b -> TMap k a -> b
foldWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> b
foldrWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> b
foldlWithKey :: TKey k => (b -> k -> a -> b) -> b -> TMap k a -> b
elems :: TKey k => TMap k a -> [a]
keys :: TKey k => TMap k a -> [k]
assocs :: TKey k => TMap k a -> [(k, a)]
fromList :: TKey k => [(k, a)] -> TMap k a
fromListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k a
fromListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k a
fromAscList :: TKey k => [(k, a)] -> TMap k a
fromAscListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k a
fromAscListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k a
fromDistinctAscList :: TKey k => [(k, a)] -> TMap k a
filter :: TKey k => (a -> Bool) -> TMap k a -> TMap k a
filterWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> TMap k a
partition :: TKey k => (a -> Bool) -> TMap k a -> (TMap k a, TMap k a)
partitionWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> (TMap k a, TMap k a)
mapMaybe :: TKey k => (a -> Maybe b) -> TMap k a -> TMap k b
mapMaybeWithKey :: TKey k => (k -> a -> Maybe b) -> TMap k a -> TMap k b
mapEither :: TKey k => (a -> Either b c) -> TMap k a -> (TMap k b, TMap k c)
mapEitherWithKey :: TKey k => (k -> a -> Either b c) -> TMap k a -> (TMap k b, TMap k c)
split :: TKey k => k -> TMap k a -> (TMap k a, TMap k a)
splitLookup :: TKey k => k -> TMap k a -> (TMap k a, Maybe a, TMap k a)
isSubmapOf :: (TKey k, Eq a) => TMap k a -> TMap k a -> Bool
isSubmapOfBy :: TKey k => (a -> b -> Bool) -> TMap k a -> TMap k b -> Bool
findMin :: TKey k => TMap k a -> (k, a)
findMax :: TKey k => TMap k a -> (k, a)
deleteMin :: TKey k => TMap k a -> TMap k a
deleteMax :: TKey k => TMap k a -> TMap k a
deleteFindMin :: TKey k => TMap k a -> ((k, a), TMap k a)
deleteFindMax :: TKey k => TMap k a -> ((k, a), TMap k a)
updateMin :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k a
updateMax :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k a
updateMinWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k a
updateMaxWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k a
minView :: TKey k => TMap k a -> Maybe (a, TMap k a)
maxView :: TKey k => TMap k a -> Maybe (a, TMap k a)
minViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a)
maxViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a)
Map type
class TrieKey (Rep k) (TrieMap (Rep k)) => TKey k Source
show/hide Instances
TKey Bool
TKey Char
TKey Double
TKey Int
TKey Int8
TKey Int16
TKey Int32
TKey Integer
TKey Word
TKey Word8
TKey Word16
TKey Word32
TKey ()
TKey a => TKey ([] a)
TKey a => TKey (Maybe a)
TKey (U0 r)
TKey r => TKey (I0 r)
(TKey a, TKey b) => TKey (Either a b)
(TKey a, TKey b) => TKey ((,) a b)
(TKey a, TrieKeyT f (TrieMapT f), Functor f) => TKey (L f a)
TKey k => TKey (K0 k r)
(TKey k, TKey a) => TKey (TMap k a)
(TKey a, TKey b, TKey c) => TKey ((,,) a b c)
(TKey a, TrieKeyT f (TrieMapT f), TrieKeyT g (TrieMapT g), Functor f, Functor g) => TKey ((f :+: g) a)
(TKey a, TrieKeyT f (TrieMapT f), TrieKeyT g (TrieMapT g), Functor f, Functor g) => TKey ((f :*: g) a)
(TKey a, TKey b, TKey c, TKey d) => TKey ((,,,) a b c d)
(TKey a, TKey b, TKey c, TKey d, TKey e) => TKey ((,,,,) a b c d e)
data TMap k a Source
show/hide Instances
TKey k => Functor (TMap k)
TKey k => Traversable (TMap k)
TKey k => Foldable (TMap k)
(Eq k, TKey k, Eq a) => Eq (TMap k a)
(Ord k, TKey k, Ord a) => Ord (TMap k a)
(Show k, Show a, TKey k) => Show (TMap k a)
(TKey k, TKey a) => TKey (TMap k a)
Operators
(!) :: TKey k => TMap k a -> k -> aSource
(\\) :: TKey k => TMap k a -> TMap k b -> TMap k aSource
Query
null :: TKey k => TMap k a -> BoolSource
size :: TKey k => TMap k a -> IntSource
member :: TKey k => k -> TMap k a -> BoolSource
notMember :: TKey k => k -> TMap k a -> BoolSource
lookup :: TKey k => k -> TMap k a -> Maybe aSource
findWithDefault :: TKey k => a -> k -> TMap k a -> aSource
Construction
empty :: TKey k => TMap k aSource
showMap :: (TKey k, Show (TrieMap (Rep k) (K0 a) (Rep k))) => TMap k a -> StringSource
singleton :: TKey k => k -> a -> TMap k aSource
Insertion
insert :: TKey k => k -> a -> TMap k a -> TMap k aSource
insertWith :: TKey k => (a -> a -> a) -> k -> a -> TMap k a -> TMap k aSource
insertWithKey :: TKey k => (k -> a -> a -> a) -> k -> a -> TMap k a -> TMap k aSource
Delete/Update
delete :: TKey k => k -> TMap k a -> TMap k aSource
adjust :: TKey k => (a -> a) -> k -> TMap k a -> TMap k aSource
adjustWithKey :: TKey k => (k -> a -> a) -> k -> TMap k a -> TMap k aSource
update :: TKey k => (a -> Maybe a) -> k -> TMap k a -> TMap k aSource
updateWithKey :: TKey k => (k -> a -> Maybe a) -> k -> TMap k a -> TMap k aSource
alter :: TKey k => (Maybe a -> Maybe a) -> k -> TMap k a -> TMap k aSource
Combine
Union
union :: TKey k => TMap k a -> TMap k a -> TMap k aSource
unionWith :: TKey k => (a -> a -> a) -> TMap k a -> TMap k a -> TMap k aSource
unionWithKey :: TKey k => (k -> a -> a -> a) -> TMap k a -> TMap k a -> TMap k aSource
unionMaybeWith :: TKey k => (a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k aSource
unionMaybeWithKey :: TKey k => (k -> a -> a -> Maybe a) -> TMap k a -> TMap k a -> TMap k aSource
Difference
difference :: TKey k => TMap k a -> TMap k b -> TMap k aSource
differenceWith :: TKey k => (a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k aSource
differenceWithKey :: TKey k => (k -> a -> b -> Maybe a) -> TMap k a -> TMap k b -> TMap k aSource
Intersection
intersection :: TKey k => TMap k a -> TMap k b -> TMap k aSource
intersectionWith :: TKey k => (a -> b -> c) -> TMap k a -> TMap k b -> TMap k cSource
intersectionWithKey :: TKey k => (k -> a -> b -> c) -> TMap k a -> TMap k b -> TMap k cSource
intersectionMaybeWith :: TKey k => (a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k cSource
intersectionMaybeWithKey :: TKey k => (k -> a -> b -> Maybe c) -> TMap k a -> TMap k b -> TMap k cSource
Traversal
Map
map :: TKey k => (a -> b) -> TMap k a -> TMap k bSource
mapWithKey :: TKey k => (k -> a -> b) -> TMap k a -> TMap k bSource
mapKeys :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' aSource
mapKeysWith :: (TKey k, TKey k') => (a -> a -> a) -> (k -> k') -> TMap k a -> TMap k' aSource
mapKeysMonotonic :: (TKey k, TKey k') => (k -> k') -> TMap k a -> TMap k' aSource
Traverse
traverseWithKey :: (TKey k, Applicative f) => (k -> a -> f b) -> TMap k a -> f (TMap k b)Source
Fold
fold :: TKey k => (a -> b -> b) -> b -> TMap k a -> bSource
foldWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> bSource
foldrWithKey :: TKey k => (k -> a -> b -> b) -> b -> TMap k a -> bSource
foldlWithKey :: TKey k => (b -> k -> a -> b) -> b -> TMap k a -> bSource
Conversion
elems :: TKey k => TMap k a -> [a]Source
keys :: TKey k => TMap k a -> [k]Source
assocs :: TKey k => TMap k a -> [(k, a)]Source
Lists
fromList :: TKey k => [(k, a)] -> TMap k aSource
fromListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k aSource
fromListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k aSource
Ordered lists
fromAscList :: TKey k => [(k, a)] -> TMap k aSource
fromAscListWith :: TKey k => (a -> a -> a) -> [(k, a)] -> TMap k aSource
fromAscListWithKey :: TKey k => (k -> a -> a -> a) -> [(k, a)] -> TMap k aSource
fromDistinctAscList :: TKey k => [(k, a)] -> TMap k aSource
Filter
filter :: TKey k => (a -> Bool) -> TMap k a -> TMap k aSource
filterWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> TMap k aSource
partition :: TKey k => (a -> Bool) -> TMap k a -> (TMap k a, TMap k a)Source
partitionWithKey :: TKey k => (k -> a -> Bool) -> TMap k a -> (TMap k a, TMap k a)Source
mapMaybe :: TKey k => (a -> Maybe b) -> TMap k a -> TMap k bSource
mapMaybeWithKey :: TKey k => (k -> a -> Maybe b) -> TMap k a -> TMap k bSource
mapEither :: TKey k => (a -> Either b c) -> TMap k a -> (TMap k b, TMap k c)Source
mapEitherWithKey :: TKey k => (k -> a -> Either b c) -> TMap k a -> (TMap k b, TMap k c)Source
split :: TKey k => k -> TMap k a -> (TMap k a, TMap k a)Source
splitLookup :: TKey k => k -> TMap k a -> (TMap k a, Maybe a, TMap k a)Source
Submap
isSubmapOf :: (TKey k, Eq a) => TMap k a -> TMap k a -> BoolSource
isSubmapOfBy :: TKey k => (a -> b -> Bool) -> TMap k a -> TMap k b -> BoolSource
Min/Max
findMin :: TKey k => TMap k a -> (k, a)Source
findMax :: TKey k => TMap k a -> (k, a)Source
deleteMin :: TKey k => TMap k a -> TMap k aSource
deleteMax :: TKey k => TMap k a -> TMap k aSource
deleteFindMin :: TKey k => TMap k a -> ((k, a), TMap k a)Source
deleteFindMax :: TKey k => TMap k a -> ((k, a), TMap k a)Source
updateMin :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k aSource
updateMax :: TKey k => (a -> Maybe a) -> TMap k a -> TMap k aSource
updateMinWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k aSource
updateMaxWithKey :: TKey k => (k -> a -> Maybe a) -> TMap k a -> TMap k aSource
minView :: TKey k => TMap k a -> Maybe (a, TMap k a)Source
maxView :: TKey k => TMap k a -> Maybe (a, TMap k a)Source
minViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a)Source
maxViewWithKey :: TKey k => TMap k a -> Maybe ((k, a), TMap k a)Source
Produced by Haddock version 2.4.2