úÎ/®-ß       Safe-Inferred A Multimap with keys k and values v. /A key can have multiple values (but not zero). 5 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  for accessing the underlying  . O(1).- Check whether the multimap is empty or not. O(1).) The number of elements in the multimap. O(1).% The number of keys in the multimap. 1As this is a multimap, the number of keys is not , necessarily equal to the number of values. O(1).' The number of values in the multimap. 1As this is a multimap, the number of keys is not , necessarily equal to the number of values.  O(log n).& Is the key a member of the multimap?  O(log n).* Is the key not a member of the multimap? As  flip lookup  O(log n).' Lookup the value at a key in the map. CThe function will return the corrsponding values as a List, or the = empty list if no values are associated witht the given key. O(1). The empty multimap.  O(log n).( Insert a new key and value in the map.  O(log n)./ Delete a key and all its values from the map. +Map a function over all values in the map. EmapKeys f s is the multimap obtained by applying f to each key of s. Map a function over all key/value pairs in the map. NFold the values in the map using the given right-associative binary operator. MFold the values in the map using the given left-associative binary operator. O(n).G Fold the keys and values in the map using the given right-associative K binary operator, taking into account not only the value but also the key. O(n).F Fold the keys and values in the map using the given left-associative K binary operator, taking into account not only the value but also the key. O(n)., Return all elements of the multimap in the  ascending order of their keys. 1A list of lists is returned since a key can have  multiple values. Use ! to flatten. O(n).5 Return all keys of the multimap in ascending order. O(n).& The set of all keys of the multimap. O(n). Return all key/value pairs in the multimap  in ascending key order. O(1). Return the map of lists. /5O(k*m*log m) where k is the number of keys and m the 8 maximum number of elements associated with a single key/ Return a flattened list of key/ value pairs.  O(n*log n)% Create a multimap from a list of key/ value pairs. - fromList xs == foldr (uncurry insert) empty &Turns a map of lists into a multimap. O(log n)' Find the minimal key of the multimap. O(log n)' Find the maximal key of the multimap. O(log n)9 Find the minimal key and the values associated with it. O(log n)9 Find the maximal key and the values associated with it. !"      " #      !"#$%&'( multimap-1.1 Data.MultimapMultimapnullsizenumKeys numValuesmember notMember!lookupemptyinsertdeletemapmapKeys mapWithKeyfoldrfoldl foldrWithKey foldlWithKeyelemskeyskeysSetassocstoMap toMapOfSetstoListfromListfromMapfindMinfindMaxfindMinWithValuesfindMaxWithValuescontainers-0.5.0.0 Data.Map.BaseMapbaseGHC.Listconcat