Map package:hashmap

data Map k v
hashmap Data.HashMap
The abstract type of a Map. Its interface is a suitable subset of IntMap.
map :: (a -> b) -> Map k a -> Map k b
hashmap Data.HashMap
Map a function over all values in the map.
map :: (Hashable b, Ord b) => (a -> b) -> Set a -> Set b
hashmap Data.HashSet
map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y
mapAccum :: (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)
hashmap Data.HashMap
The function mapAccum threads an accumulating argument through the map in unspecified order of keys.
mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)
hashmap Data.HashMap
The function mapAccumWithKey threads an accumulating argument through the map in unspecified order of keys.
mapEither :: Ord k => (a -> Either b c) -> Map k a -> (Map k b, Map k c)
hashmap Data.HashMap
Map values and separate the Left and Right results.
mapEitherWithKey :: Ord k => (k -> a -> Either b c) -> Map k a -> (Map k b, Map k c)
hashmap Data.HashMap
Map keys/values and separate the Left and Right results.
mapMaybe :: Ord k => (a -> Maybe b) -> Map k a -> Map k b
hashmap Data.HashMap
Map values and collect the Just results.
mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> Map k a -> Map k b
hashmap Data.HashMap
Map keys/values and collect the Just results.
mapWithKey :: (k -> a -> b) -> Map k a -> Map k b
hashmap Data.HashMap
Map a function over all values in the map.
package hashmap
Uses
Persistent containers Map and Set based on hashing. An implementation of persistent Map and Set containers based on hashing. The implementation is build on top of Data.IntMap.IntMap and Data.IntSet.IntSet, with very similar API. It uses Hashable class from the hashable package for hashing. This package can be used as a drop-in replacement for Data.Map and Data.Set modules. The Map key value is an Data.IntMap.IntMap indexed by the hash value, containing either one (key, value) or a Data.Map.Map key value for all keys with the same hash value. The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing either one elem or Data.Set.Set elem for all elements with the same hash value.
module Data.HashMap
hashmap
Persistent Map based on hashing, which is defined as 
data Map k v = IntMap (Some k v)
is an IntMap indexed by hash values of keys, containing a value of Some e. That contains either one (k, v) pair or a Map k v with keys of the same hash values. The interface of a Map is a suitable subset of IntMap and can be used as a drop-in replacement of Map. The complexity of operations is determined by the complexities of IntMap and Map operations. See the sources of Map to see which operations from containers package are used.
type HashMap k v = Map k v
hashmap Data.HashMap
Deprecated: HashMap is deprecated. Please use Map instead.
isProperSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool
hashmap Data.HashMap
Is this a proper submap? (ie. a submap but not equal).
isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool
hashmap Data.HashMap
Is this a proper submap? (ie. a submap but not equal). The expression (isProperSubmapOfBy f m1 m2) returns True when m1 and m2 are not equal, all keys in m1 are in m2, and when f returns True when applied to their respective values.
isSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool
hashmap Data.HashMap
Is this a submap?
isSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool
hashmap Data.HashMap
The expression (isSubmapOfBy f m1 m2) returns True if all keys in m1 are in m2, and when f returns True when applied to their respective values.