úÎwFpZm      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkl(c) Milan Straka 2011 BSD-style fox@ucw.cz provisionalportableSafe01V³<The HashMap is a type synonym for MapW for backward compatibility. It is deprecated and will be removed in furture releases.The abstract type of a Map). Its interface is a suitable subset of . Find the value at a key. Calls m# when the element can not be found.Same as .Is 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/value pair in the map. If the key is already present in the map, the associated value is replaced with the supplied value, i.e.   is equivalent to   n. #Insert with a combining function.   f key value mp) will insert the pair (key, value) into mpT 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 mpT 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 map2) is a pair where the first element is equal to ( k map$) and the second element equal to ( f k x map).pDelete a key and its value from the map. When the key is not a member of the map, the original map is returned.iAdjust a value at a specific key. When the key is not a member of the map, the original map is returned.iAdjust 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 o%, the element is deleted. If it is (p 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 o%, the element is deleted. If it is (p y ), the key k is bound to the new value y.lLookup and update. The function returns original value, if it is updated. This is different behavior than ?. Returns the original key value if the map entry is deleted.The expression ( f k map) alters the value x at k, or absence thereof. 9 can be used to insert, delete, or update a value in an .The union of a list of maps.8The union of a list of maps, with a combining operation.kThe (left-biased) union of two maps. It prefers the first map when duplicate keys are encountered, i.e. ( ==  n).$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 encountered, the combining function is applied to the key and both values. If it returns oD, the element is discarded (proper set difference). If it returns (p y+), the element is updated with a new value y.;The (left-biased) intersection of two maps (based on keys). +The intersection with a combining function.!+The intersection with a combining function."6Is this a proper submap? (ie. a submap but not equal).#IIs this a proper submap? (ie. a submap but not equal). The expression (# f m1 m2 ) returns q when m1 and m2 are not equal, all keys in m1 are in m2 , and when f returns q* when applied to their respective values.$Is this a submap?%The expression (% f m1 m2 ) returns q if all keys in m1 are in m2 , and when f returns q* 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 (P threads an accumulating argument through the map in unspecified order of keys.) The function )P threads an accumulating argument through the map in unspecified order of keys.*.Filter all values that satisfy some predicate.+3Filter all keys/values that satisfy some predicate.,¡Partition the map according to some predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate.-¡Partition the map according to some predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate..Map values and collect the p results./ Map keys/values and collect the p results.0Map values and separate the r and s results.1!Map keys/values and separate the r and s results.2&Fold the values in the map, such that 2 f z == t f z . 4.3/Fold the keys and values in the map, such that 3 f z == t (u f) z .  toAscList.4@Return all elements of the map in arbitrary order of their keys.5.Return all keys of the map in arbitrary order.6The set of all keys of the map.7=Return all key/value pairs in the map in arbitrary key order.8-Convert the map to a list of key/value pairs.9,Create a map from a list of key/value pairs.:FCreate a map from a list of key/value pairs with a combining function.;EBuild a map from a list of key/value pairs with a combining function.<  !"#$%&'()*+,-./0123456789:;<  !&'()23456789:;*+,-./01$%"#vwxy(c) Milan Straka 2011 BSD-style fox@ucw.cz provisionalportableSafe01o~JThe HashSet is a type synonym for SetW for backward compatibility. It is deprecated and will be removed in furture releases.KThe abstract type of a Set). Its interface is a suitable subset of .LSame as Y.MIs the set empty?NNumber of elements in the set.O#Is the element a member of the set?P'Is the element not a member of the set?QIs this a subset?R6Is this a proper subset? (ie. a subset but not equal).SThe empty set.TA set of one element.UmAdd a value to the set. When the value is already an element of the set, it is replaced by the new one, ie. U is left-biased.VTDelete a value in the set. Returns the original set when the value was not present.WThe union of two sets.XThe union of a list of sets.YDifference between two sets.ZThe intersection of two sets.[0Filter all elements that satisfy some predicate.\¡Partition the set according to some predicate. The first set contains all elements that satisfy the predicate, the second all elements that fail the predicate.]] f s! is the set obtained by applying f to each element of s.KIt's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y^8Fold over the elements of a set in an unspecified order._@The elements of a set. (For sets, this is equivalent to toList).`&Convert the set to a list of elements.a%Create a set from a list of elements.JKLMNOPQRSTUVWXYZ[\]^_`aKJLMNOPQRSTUVWXYZ[\]^_`aKz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRS  TU!$'24.:<@ADVWXYZ[NO\]^_`^ab^ac^adefg^hi^hj^kl^mn opqSopqr$hashmap-1.3.3-GdPaRHDKbJzKq5xifWw6Kp Data.HashMap Data.HashSet Data.IntMapIntMapData.MapupdateLookupWithKey Data.IntSetIntSetHashMapMap!\\nullsizemember notMemberlookupfindWithDefaultempty singletoninsert insertWith insertWithKeyinsertLookupWithKeydeleteadjust adjustWithKeyupdate updateWithKeyalterunions unionsWithunion unionWith unionWithKey differencedifferenceWithdifferenceWithKey intersectionintersectionWithintersectionWithKeyisProperSubmapOfisProperSubmapOfBy isSubmapOf isSubmapOfBymap mapWithKeymapAccummapAccumWithKeyfilter filterWithKey partitionpartitionWithKeymapMaybemapMaybeWithKey mapEithermapEitherWithKeyfold foldWithKeyelemskeyskeysSetassocstoListfromList fromListWithfromListWithKey $fNFDataSome $fDataMap $fReadMap $fShowMap$fTraversableMap $fFoldableMap$fSemigroupMap $fMonoidMap $fFunctorMap $fNFDataMap$fEqSome $fOrdSome$fEqMap$fOrdMapHashSetSet isSubsetOfisProperSubsetOf $fDataSet $fReadSet $fShowSet$fSemigroupSet $fMonoidSet $fNFDataSet$fEqSet$fOrdSetbaseGHC.ErrerrorGHC.BaseconstNothingJustghc-prim GHC.TypesTrue Data.EitherLeftRight Data.Foldablefoldr Data.TupleuncurrySomeOnlyMore