úÎ=e7ƒh      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgNone1345;=>?FKTØA HashMap with monoidal accumulationO(1). A map with a single element.O(1)$. The number of elements in the map.O(log n)+. Is the key a member of the map? See also .O(log n)/. Is the key not a member of the map? See also .O(log n)< Return the value to which the specified key is mapped, or h- if this map contains no mapping for the key.O(log n)o Return the value to which the specified key is mapped, or mempty if this map contains no mapping for the key. O(log n)r. Delete a key and its value from the map. When the key is not a member of the map, the original map is returned. O(n)C. Return a list of this map's values. The list is produced lazily. O(n)I. Return all keys of the map in ascending order. Subject to list fusion.  O(n*log n)Œ. Construct a map with the supplied mappings. If the list contains duplicate mappings, values will be merged using (mappend newVal oldVal).  O(n*log n)p. Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified.O(log n)^. Modify a value on some key with a function, if value under key doesn't exist -- use mempty.O(log n)c. Modify a value on some key with a function, providing a default value if that key doesn't exist.O(n)‚. Map a function to each key of a map, if it will result in duplicated mappings, their values will be merged in unspecified orderO(n)D Filter this map by retaining only elements satisfying a predicate.O(n): Transform this map by applying a function to every value.   None1345;=>?FKT*˜ &A Map with monoidal accumulation)O(1). A map with a single element.*O(1)$. The number of elements in the map.+O(log n)+. Is the key a member of the map? See also ,.,O(log n)/. Is the key not a member of the map? See also +.-O(log n). The expression (- def k map) returns the value at key k or returns default value def! when the key is not in the map.iO(log n)r. Delete a key and its value from the map. When the key is not a member of the map, the original map is returned..O(n)/. Return all elements of the map and their keys/O(n)_. Return all elements of the map in the ascending order of their keys. Subject to list fusion.0O(n)I. Return all keys of the map in ascending order. Subject to list fusion. &'()*+,-./0 &'()*+,-./0&'(None1345;=>?FKT7 GA Map with monoidal accumulationJO(1). A map with a single element.KO(1)$. The number of elements in the map.LO(log n)+. Is the key a member of the map? See also M.MO(log n)/. Is the key not a member of the map? See also L.NO(log n). The expression (N def k map) returns the value at key k or returns default value def! when the key is not in the map.jO(log n)r. Delete a key and its value from the map. When the key is not a member of the map, the original map is returned.OO(n)/. Return all elements of the map and their keysPO(n)_. Return all elements of the map in the ascending order of their keys. Subject to list fusion.QO(n)I. Return all keys of the map in ascending order. Subject to list fusion. GHIJKLMNOPQ GHIJKLMNOPQGHIk      !"#$%&'())* +, -./0123456789:;<=>?@AB))* +, -./0123456789:;<=>?@ABCDE  F2monoidal-containers-0.3.0.2-4lMYGPf8dvgGXagWSjL8UkData.HashMap.MonoidalData.Map.MonoidalData.Map.Monoidal.StrictMonoidalHashMapgetMonoidalHashMap singletonsizemember notMemberlookuplookupMdeleteelemskeysfromListtoListmodify modifyDefmapKeys filterWithKeymap$fIsListMonoidalHashMap$fNewtypeMonoidalHashMapHashMap$fMonoidMonoidalHashMap$fWrappedMonoidalHashMap$fAsEmptyMonoidalHashMap&$fTraversableWithIndexkMonoidalHashMap#$fFoldableWithIndexkMonoidalHashMap"$fFunctorWithIndexkMonoidalHashMap&$fEachMonoidalHashMapMonoidalHashMapab$fAtMonoidalHashMap$fIxedMonoidalHashMap$fShowMonoidalHashMap$fReadMonoidalHashMap$fFunctorMonoidalHashMap$fEqMonoidalHashMap$fNFDataMonoidalHashMap$fFoldableMonoidalHashMap$fTraversableMonoidalHashMap$fDataMonoidalHashMap MonoidalMapgetMonoidalMapfindWithDefaultassocs$fIsListMonoidalMap$fNewtypeMonoidalMapMap$fMonoidMonoidalMap$fWrappedMonoidalMap$fAsEmptyMonoidalMap$fTraverseMaxkMonoidalMap$fTraverseMinkMonoidalMap"$fTraversableWithIndexkMonoidalMap$fFoldableWithIndexkMonoidalMap$fFunctorWithIndexkMonoidalMap$fEachMonoidalMapMonoidalMapab$fAtMonoidalMap$fIxedMonoidalMap$fShowMonoidalMap$fReadMonoidalMap$fFunctorMonoidalMap$fEqMonoidalMap$fOrdMonoidalMap$fNFDataMonoidalMap$fFoldableMonoidalMap$fTraversableMonoidalMap$fDataMonoidalMapbaseGHC.BaseNothing