multimap-1.2.1: A multimap.

Copyright(c) Julian Fleischer 2013
LicenseMIT (See LICENSE file in cabal package)
Maintainerjulian.fleischer@fu-berlin.de
Portabilitynon-portable (DeriveDataTypeable)
Safe HaskellSafe
LanguageHaskell2010

Data.MultiMap

Contents

Description

A very simple MultiMap, based on Map from the containers package.

Synopsis

MultiMap type

data MultiMap k v #

A MultiMap with keys k and values v.

A key can have multiple values (but not zero). The same value can be added multiple times (thus no constraints are ever imposed on v).

Internally this is simply a Map k [v]. See toMap for accessing the underlying Map.

Instances

(Ord k, Data v, Data k) => Data (MultiMap k v) # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MultiMap k v -> c (MultiMap k v) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (MultiMap k v) #

toConstr :: MultiMap k v -> Constr #

dataTypeOf :: MultiMap k v -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (MultiMap k v)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MultiMap k v)) #

gmapT :: (forall b. Data b => b -> b) -> MultiMap k v -> MultiMap k v #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MultiMap k v -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MultiMap k v -> r #

gmapQ :: (forall d. Data d => d -> u) -> MultiMap k v -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> MultiMap k v -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> MultiMap k v -> m (MultiMap k v) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiMap k v -> m (MultiMap k v) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiMap k v -> m (MultiMap k v) #

Query

null :: MultiMap k a -> Bool #

O(1). Check whether the multimap is empty or not.

size :: MultiMap k a -> Int #

O(1). The number of elements in the multimap.

numKeys :: MultiMap k a -> Word32 #

O(1). The number of keys in the multimap.

As this is a multimap, the number of keys is not necessarily equal to the number of values.

numValues :: MultiMap k a -> Word32 #

O(1). The number of values in the multimap.

As this is a multimap, the number of keys is not necessarily equal to the number of values.

member :: Ord k => MultiMap k a -> k -> Bool #

O(log n). Is the key a member of the multimap?

notMember :: Ord k => MultiMap k a -> k -> Bool #

O(log n). Is the key not a member of the multimap?

lookup :: Ord k => k -> MultiMap k a -> [a] #

O(log n). Lookup the value at a key in the map.

The function will return the corrsponding values as a List, or the empty list if no values are associated witht the given key.

Operators

(!) :: Ord k => MultiMap k a -> k -> [a] #

As flip lookup

Construction

empty :: MultiMap k a #

O(1). The empty multimap.

Insertion

insert :: Ord k => k -> a -> MultiMap k a -> MultiMap k a #

O(log n). Insert a new key and value in the map.

Delete

delete :: Ord k => k -> MultiMap k a -> MultiMap k a #

O(log n). Delete a key and all its values from the map.

Traversal

map :: (a -> b) -> MultiMap k a -> MultiMap k b #

Map a function over all values in the map.

mapKeys :: Ord k2 => (k1 -> k2) -> MultiMap k1 a -> MultiMap k2 a #

mapKeys f s is the multimap obtained by applying f to each key of s.

mapWithKey :: (k -> a -> b) -> MultiMap k a -> MultiMap k b #

Map a function over all key/value pairs in the map.

Folds

foldr :: (a -> b -> b) -> b -> MultiMap k a -> b #

Fold the values in the map using the given right-associative binary operator.

foldl :: (a -> b -> a) -> a -> MultiMap k b -> a #

Fold the values in the map using the given left-associative binary operator.

foldrWithKey :: (k -> a -> b -> b) -> b -> MultiMap k a -> b #

O(n). Fold the keys and values in the map using the given right-associative binary operator, taking into account not only the value but also the key.

foldlWithKey :: (a -> k -> b -> a) -> a -> MultiMap k b -> a #

O(n). Fold the keys and values in the map using the given left-associative binary operator, taking into account not only the value but also the key.

Conversion

elems :: MultiMap k a -> [[a]] #

O(n). Return all elements of the multimap in the ascending order of their keys.

A list of lists is returned since a key can have multiple values. Use concat to flatten.

keys :: MultiMap k a -> [k] #

O(n). Return all keys of the multimap in ascending order.

keysSet :: MultiMap k a -> Set k #

O(n). The set of all keys of the multimap.

assocs :: MultiMap k a -> [(k, [a])] #

O(n). Return all key/value pairs in the multimap in ascending key order.

toMap :: MultiMap k a -> Map k [a] #

O(1). Return the map of lists.

toMapOfSets :: Ord a => MultiMap k a -> Map k (Set a) #

/O(k*m*log m) where k is the number of keys and m the maximum number of elements associated with a single key/

toList :: MultiMap k a -> [(k, a)] #

Return a flattened list of key/value pairs.

fromList :: Ord k => [(k, a)] -> MultiMap k a #

O(n*log n) Create a multimap from a list of key/value pairs.

fromList xs == foldr (uncurry insert) empty

fromMap :: Map k [a] -> MultiMap k a #

Turns a map of lists into a multimap.

Min/Max

findMin :: MultiMap k a -> Maybe k #

O(log n) Find the minimal key of the multimap.

findMax :: MultiMap k a -> Maybe k #

O(log n) Find the maximal key of the multimap.

findMinWithValues :: MultiMap k a -> Maybe (k, [a]) #

O(log n) Find the minimal key and the values associated with it.

findMaxWithValues :: MultiMap k a -> Maybe (k, [a]) #

O(log n) Find the maximal key and the values associated with it.