hets -- a heterogenous Specification (CASL) tool setContentsIndex
Common.DFiniteMap
Portability portable
Stability provisional
Maintainer hets@tzi.de
Contents
Map type
Operators
Query
Construction
Insertion
Delete
Combine
Union
Difference
Intersection
Traversal
Map
Fold
Conversion
Lists
Ordered lists
Filter
Description
Synopsis
type Map a b = FiniteMap a b
type EndoMap a = FiniteMap a a
(!) :: Ord k => Map k a -> k -> a
(\\) :: Ord k => Map k a -> Map k a -> Map k a
isEmpty :: Map k a -> Bool
size :: Map k a -> Int
member :: Ord k => k -> Map k a -> Bool
lookup :: Ord k => k -> Map k a -> Maybe a
find :: Ord k => k -> Map k a -> a
findWithDefault :: Ord k => a -> k -> Map k a -> a
empty :: Map k a
single :: k -> a -> Map k a
insert :: Ord k => k -> a -> Map k a -> Map k a
insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a
insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a
insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a)
delete :: Ord k => k -> Map k a -> Map k a
union :: Ord k => Map k a -> Map k a -> Map k a
unionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
unionWithKey :: Ord k => (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a
difference :: Ord k => Map k a -> Map k a -> Map k a
intersection :: Ord k => Map k a -> Map k a -> Map k a
intersectionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
map :: (a -> b) -> Map k a -> Map k b
mapWithKey :: (k -> a -> b) -> Map k a -> Map k b
fold :: (a -> b -> b) -> b -> Map k a -> b
foldWithKey :: (k -> a -> b -> b) -> b -> Map k a -> b
elems :: Map k a -> [a]
keys :: Map k a -> [k]
assocs :: Map k a -> [(k, a)]
toList :: Map k a -> [(k, a)]
fromList :: Ord k => [(k, a)] -> Map k a
toAscList :: Map k a -> [(k, a)]
fromAscList :: Ord k => [(k, a)] -> Map k a
fromDistinctAscList :: Ord k => [(k, a)] -> Map k a
filter :: Ord k => (a -> Bool) -> Map k a -> Map k a
filterWithKey :: Ord k => (k -> a -> Bool) -> Map k a -> Map k a
Map type
type Map a b = FiniteMap a b
type EndoMap a = FiniteMap a a
Operators
(!) :: Ord k => Map k a -> k -> a
(\\) :: Ord k => Map k a -> Map k a -> Map k a
Query
isEmpty :: Map k a -> Bool
size :: Map k a -> Int
member :: Ord k => k -> Map k a -> Bool
lookup :: Ord k => k -> Map k a -> Maybe a
find :: Ord k => k -> Map k a -> a
findWithDefault :: Ord k => a -> k -> Map k a -> a
Construction
empty :: Map k a
single :: k -> a -> Map k a
Insertion
insert :: Ord k => k -> a -> Map k a -> Map k a
insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a
insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a
insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a)
Delete
delete :: Ord k => k -> Map k a -> Map k a
Combine
Union
union :: Ord k => Map k a -> Map k a -> Map k a
unionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
unionWithKey :: Ord k => (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a
Difference
difference :: Ord k => Map k a -> Map k a -> Map k a
Intersection
intersection :: Ord k => Map k a -> Map k a -> Map k a
intersectionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
Traversal
Map
map :: (a -> b) -> Map k a -> Map k b
mapWithKey :: (k -> a -> b) -> Map k a -> Map k b
Fold
fold :: (a -> b -> b) -> b -> Map k a -> b
foldWithKey :: (k -> a -> b -> b) -> b -> Map k a -> b
Conversion
elems :: Map k a -> [a]
keys :: Map k a -> [k]
assocs :: Map k a -> [(k, a)]
Lists
toList :: Map k a -> [(k, a)]
fromList :: Ord k => [(k, a)] -> Map k a
Ordered lists
toAscList :: Map k a -> [(k, a)]
fromAscList :: Ord k => [(k, a)] -> Map k a
fromDistinctAscList :: Ord k => [(k, a)] -> Map k a
Filter
filter :: Ord k => (a -> Bool) -> Map k a -> Map k a
filterWithKey :: Ord k => (k -> a -> Bool) -> Map k a -> Map k a
Produced by Haddock version 0.6