úÎ`Î\Ð>      !"#$%&'()*+,-./0123456789:;<=portable provisional fox@ucw.cz> The class containing a function # which computes the hash values of  given value.  The computed 4 value should be as collision-free as possible, the  probability of  a ==  b should ideally be 1 over the & number of representable values in an ?.  Combines two given hash values. @portable provisional fox@ucw.cz?The abstract type of a HashMap. Its interface is a suitable  subset of Data.IntMap.IntMap. AFind the value at a key.  Calls B$ when the element can not be found. Same as . CIs the map empty? Number of elements in the map.  Is the key a member of the map? $Is the key not a member of the map? &Lookup the value at a key in the map. The expression (  def k map) returns the value at key  k or returns def, when the key is not an element of the map. The empty map. A map of one element. Insert a new key/9value pair in the map. If the key is already present in I the map, the associated value is replaced with the supplied value, i.e.   is equivalent to  D. #Insert with a combining function.  f key value mp will # insert the pair (key, value) into mp& if key does not exist in the map. If . the key does exist, the function will insert f new_value old_value. #Insert with a combining function.  f key value mp will # insert the pair (key, value) into mp& if key does not exist in the map. If . the key does exist, the function will insert f key new_value old_value. The expression ( f k x map) is a pair where the  first element is equal to (  k map") and the second element equal to  ( f k x map). E=Delete a key and its value from the map. When the key is not 4 a member of the map, the original map is returned. KAdjust a value at a specific key. When the key is not a member of the map,  the original map is returned. KAdjust a value at a specific key. When the key is not a member of the map,  the original map is returned. The expression ( f k map) updates the value x at k (if it is  in the map). If (f x) is F#, the element is deleted. If it is  (G y ), the key k is bound to the new value y. The expression ( f k map) updates the value x at k (if it is  in the map). If (f k x) is F#, the element is deleted. If it is  (G y ), the key k is bound to the new value y. KLookup and update. The function returns original value, if it is updated. ! This is different behavior than Data.Map.updateLookupWithKey. Returns the 1 original key value if the map entry is deleted. The expression ( f k map) alters the value x at k , or absence  thereof. 8 can be used to insert, delete, or update a value in an  . The union of a list of maps. 9The union of a list of maps, with a combining operation. %The (left-biased) union of two maps. ? It prefers the first map when duplicate keys are encountered,  i.e. ( ==  D). %The union with a combining function. %The union with a combining function. -Difference between two maps (based on keys). &Difference with a combining function. >Difference with a combining function. When two equal keys are L encountered, the combining function is applied to the key and both values.  If it returns F4, the element is discarded (proper set difference).  If it returns (G y+), the element is updated with a new value y. H!<The (left-biased) intersection of two maps (based on keys). ",The intersection with a combining function. #,The intersection with a combining function. $7Is this a proper submap? (ie. a submap but not equal). %GIs this a proper submap? (ie. a submap but not equal). The expression  (% f m1 m2 ) returns I when m1 and m2 are not  equal, all keys in m1 are in m2 , and when f returns I when % applied to their respective values. &Is this a submap? 'The expression (' f m1 m2 ) returns I if all keys in  m1 are in m2 , and when f returns I when applied to their  respective values. (+Map a function over all values in the map. )+Map a function over all values in the map. * The function *2 threads an accumulating argument through the map  in unspecified order of keys. + The function +* threads an accumulating argument through ' the map in unspecified order of keys. ,/Filter all values that satisfy some predicate. -Filter all keys/$values that satisfy some predicate. .JPartition the map according to some predicate. The first map contains all L elements that satisfy the predicate, the second all elements that fail the  predicate. See also split. /JPartition the map according to some predicate. The first map contains all L elements that satisfy the predicate, the second all elements that fail the  predicate. 0Map values and collect the G results. 1Map keys/values and collect the G results. 2Map values and separate the J and K results. 3Map keys/values and separate the J and K results. 4&Fold the values in the map, such that 4 f z == L  f z . 6. 5/Fold the keys and values in the map, such that 5 f z ==  L (M f) z .  toAscList. 6AReturn all elements of the map in arbitrary order of their keys. 7/Return all keys of the map in arbitrary order. 8 The set of all keys of the map. 9Return all key//value pairs in the map in arbitrary key order. : Convert the map to a list of key/ value pairs. ;Create a map from a list of key/ value pairs. <Create a map from a list of key/'value pairs with a combining function. =Build a map from a list of key/'value pairs with a combining function. ;  !"#$%&'()*+,-./0123456789:;<=;  !"#()*+456789:;<=,-./0123&'$%;  !"#$%&'()*+,-./0123456789:;<=N      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIFJKLFMNFMOPBQRFSTFSUFJVFWXY hashmap-0.9.0 Data.Hashable Data.HashMapHashablehashcombineHashMap!\\nullsizemember notMemberlookupfindWithDefaultempty singletoninsert insertWith insertWithKeyinsertLookupWithKeydeleteadjust adjustWithKeyupdate updateWithKeyupdateLookupWithKeyalterunions unionsWithunion unionWith unionWithKey differencedifferenceWithdifferenceWithKey intersectionintersectionWithintersectionWithKeyisProperSubmapOfisProperSubmapOfBy isSubmapOf isSubmapOfBymap mapWithKeymapAccummapAccumWithKeyfilter filterWithKey partitionpartitionWithKeymapMaybemapMaybeWithKey mapEithermapEitherWithKeyfold foldWithKeyelemskeyskeysSetassocstoListfromList fromListWithfromListWithKeyhashByteStringghc-prim GHC.TypesInthashAndCombinebaseGHC.Errerror hashMapTcGHC.Baseconstnonempty Data.MaybeNothingJust delete_emptyGHC.BoolTrue Data.EitherLeftRightfoldr Data.Tupleuncurry