h$sio      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXY  Safe-InferredZ[\ Safe-Inferred]None^unordered-containersSmart constructor_unordered-containersSmart constructor`unordered-containersCreate a new mutable array of specified size, in the specified state thread, with each element containing the specified initial value.aunordered-containersUnsafely copy the elements of an array. Array bounds are not checked.bunordered-containersUnsafely copy the elements of an array. Array bounds are not checked.cunordered-containersCreate a new array of the n first elements of mary.dunordered-containersO(n) Insert an element at the given position in this array, increasing its size by one.eunordered-containersO(n) Insert an element at the given position in this array, increasing its size by one.funordered-containersO(n)8 Update the element at the given position in this array.gunordered-containersO(n)8 Update the element at the given position in this array.hunordered-containersO(n) Update the element at the given positio in this array, by applying a function to it. Evaluates the element to WHNF before inserting it into the array.iunordered-containersO(1) Update the element at the given position in this array, without copying.junordered-containersO(n) Delete an element at the given position in this array, decreasing its size by one.kunordered-containersO(n) Delete an element at the given position in this array, decreasing its size by one.lunordered-containersStrict version of m.)nopqrs`tuvwxyz{|}~abcdefhijmlNoneVNone./3Bunordered-containersA map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.unordered-containers8A set of values. A set cannot contain duplicate values.Convenience function. Compute a hash value for the given value.unordered-containersO(1) Construct an empty map.unordered-containersO(1)' Construct a map with a single element.unordered-containersO(1) Return  if this map is empty,  otherwise.unordered-containersO(n)5 Return the number of key-value mappings in this map.unordered-containersO(log n) Return . if the specified key is present in the map,  otherwise.unordered-containersO(log n)< Return the value to which the specified key is mapped, or - if this map contains no mapping for the key.unordered-containerslookup' is a version of lookup that takes the hash separately. It is used to implement alterF. unordered-containersO(log n)< Return the value to which the specified key is mapped, or - if this map contains no mapping for the key.This is a flipped version of . unordered-containersO(log n) Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key. unordered-containersO(log n) Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key.DEPRECATED: lookupDefault is deprecated as of version 0.2.10, replaced by . unordered-containersO(log n)? Return the value to which the specified key is mapped. Calls - if this map contains no mapping for the key.unordered-containers Create a  value with two  values.unordered-containers Create a  or  node. unordered-containersO(log n) Associate the specified value with the specified key in this map. If this map previously contained a mapping for the key, the old value is replaced.unordered-containers!In-place update version of insertunordered-containersCreate a map from two key-value pairs which hashes don't collide. To enhance sharing, the second key-value pair is represented by the hash of its key and a singleton HashMap pairing its key with its value.Note: to avoid silly thunks, this function must be strict in the key. See issue #232. We don't need to force the HashMap argument because it's already in WHNF (having just been matched) and we just put it directly in an array. unordered-containersO(log n) Associate the value with the key in this map. If this map previously contained a mapping for the key, the old value is replaced by the result of applying the given function to the new and old value. Example: 2insertWith f k v map where f new old = new + oldunordered-containersinsertModifying is a lot like insertWith; we use it to implement alterF. It takes a value to insert when the key is absent and a function to apply to calculate a new value when the key is present. Thanks to the unboxed unary tuple, we avoid introducing any unnecessary thunks in the tree.unordered-containers%In-place update version of insertWith unordered-containersO(log n) Remove the mapping for the specified key from this map if present.unordered-containersDelete optimized for the case when we know the key is in the map.It is only valid to call this when the key exists in the map and you know the hash collision position if there was one. This information can be obtained from 0. If there is no collision pass (-1) as collPos.We can skip: - the key equality check on the leaf, if we reach a leaf it must be the keyunordered-containersO(log n) Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.unordered-containers Much like , but not inherently leaky.unordered-containersO(log n) The expression ( f k map) updates the value x at k (if it is in the map). If (f x) is $, the element is deleted. If it is ( y) , the key k is bound to the new value y.unordered-containersO(log n) The expression ( f k map) alters the value x at k, or absence thereof. alter can be used to insert, delete, or update a value in a map. In short :  k ( f k m) = f ( k m). unordered-containersO(log n) The expression ( f k map) alters the value x at k, or absence thereof. alterF< can be used to insert, delete, or update a value in a map.Note:  is a flipped version of the at combinator from  https://hackage.haskell.org/package/lens-4.15.4/docs/Control-Lens-At.html#v:atControl.Lens.At.unordered-containersThis is the default version of alterF that we use in most non-trivial cases. It's called "eager" because it looks up the given key in the map eagerly, whether or not the given function requires that information.unordered-containersO(n+m) The union of two maps. If a key occurs in both maps, the mapping from the first will be the mapping in the result.Examples?union (fromList [(1,'a'),(2,'b')]) (fromList [(2,'c'),(3,'d')])"fromList [(1,'a'),(2,'b'),(3,'d')]unordered-containersO(n+m) The union of two maps. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.unordered-containersO(n+m) The union of two maps. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.unordered-containersStrict in the result of f.unordered-containers Look up the value associated with the given key in an array.unordered-containersO(n) Lookup the value associated with the given key in this array. Returns  if the key wasn't found.unordered-containersO(n)8 Update the element at the given position in this array.unordered-containersO(n)8 Update the element at the given position in this array.unordered-containersO(n) Update the element at the given position in this array, by applying a function to it.unordered-containersUnsafely clone an array of 16 elements. The length of the input array is not checked.unordered-containers Mask out the 3 bits used for indexing at this level of the tree.unordered-containersA bitmask with the  least significant bits set.unordered-containersCheck if two the two arguments are the same value. N.B. This function might give false negatives (due to GC moving objects.)unordered-containers.The ordering is total and consistent with the  instance. However, nothing else about the ordering is specified, and it may change from version to version of either this package or of hashable.unordered-containers5Note that, in the presence of hash collisions, equal HashMap?s may behave differently, i.e. substitutivity may be violated:"data D = A | B deriving (Eq, Show)5instance Hashable D where hashWithSalt salt _d = saltx = fromList [(A,1), (B,2)]y = fromList [(B,2), (A,1)]x == yTruetoList x [(A,1),(B,2)]toList y [(B,2),(A,1)]In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals.unordered-containers =  = If a key occurs in both maps, the mapping from the first will be the mapping in the result.Examplesmappend (fromList [(1,'a'),(2,'b')]) (fromList [(2,'c'),(3,'d')])"fromList [(1,'a'),(2,'b'),(3,'d')]unordered-containers = If a key occurs in both maps, the mapping from the first will be the mapping in the result.Examples8fromList [(1,'a'),(2,'b')] <> fromList [(2,'c'),(3,'d')]"fromList [(1,'a'),(2,'b'),(3,'d')] unordered-containersunordered-containersDefault value to return. unordered-containersDefault value to return.     !"#$%&'()*+,-./0 9 2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthy\1unordered-containersO(1)' Construct a map with a single element.2unordered-containersO(log n) Associate the specified value with the specified key in this map. If this map previously contained a mapping for the key, the old value is replaced.3unordered-containersO(log n) Associate the value with the key in this map. If this map previously contained a mapping for the key, the old value is replaced by the result of applying the given function to the new and old value. Example: 2insertWith f k v map where f new old = new + oldunordered-containers%In-place update version of insertWith4unordered-containersO(log n) Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.5unordered-containersO(log n) The expression (5 f k map) updates the value x at k (if it is in the map). If (f x) is $, the element is deleted. If it is ( y) , the key k is bound to the new value y.6unordered-containersO(log n) The expression (6 f k map) alters the value x at k, or absence thereof. alter can be used to insert, delete, or update a value in a map. In short :  k (6 f k m) = f ( k m).7 unordered-containersO(log n) The expression (7 f k map) alters the value x at k, or absence thereof. alterF< can be used to insert, delete, or update a value in a map.Note: 7 is a flipped version of the at combinator from  https://hackage.haskell.org/package/lens-4.15.4/docs/Control-Lens-At.html#v:atControl.Lens.At.unordered-containersThis is the default version of alterF that we use in most non-trivial cases. It's called "eager" because it looks up the given key in the map eagerly, whether or not the given function requires that information.8unordered-containersO(n+m) The union of two maps. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.9unordered-containersO(n+m) The union of two maps. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.:unordered-containersO(n): Transform this map by applying a function to every value.;unordered-containersO(n): Transform this map by applying a function to every value.<unordered-containersO(n) Transform this map by applying a function to every value and retaining only some of them.=unordered-containersO(n) Transform this map by applying a function to every value and retaining only some of them.>unordered-containersO(n) Perform an & action for each key-value pair in a  and produce a  of all the results. Each # will be strict in all its values. traverseWithKey f = fmap (; id) . Data.HashMap.Lazy.  f Note: the order in which the actions occur is unspecified. In particular, when the map contains hash collisions, the order in which the actions associated with the keys involved will depend in an unspecified way on their insertion order.?unordered-containers O(n*log m) Difference with a combining function. When two equal keys are encountered, the combining function is applied to the values of these keys. If it returns , the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y.@unordered-containersO(n+m) Intersection of two maps. If a key occurs in both maps the provided function is used to combine the values from the two maps.Aunordered-containersO(n+m) Intersection of two maps. If a key occurs in both maps the provided function is used to combine the values from the two maps.Bunordered-containers O(n*log n) Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.Cunordered-containers O(n*log n) Construct a map from a list of elements. Uses the provided function f" to merge duplicate entries with (f newVal oldVal).Examples Given a list xs, create a map with the number of occurrences of each element in xs: let xs = ['a', 'b', 'a'] in fromListWith (+) [ (x, 1) | x <- xs ] = fromList [('a', 2), ('b', 1)] Given a list of key-value pairs xs :: [(k, v)]/, group all values by their keys and return a  HashMap k [v]. let xs = ('a', 1), ('b', 2), ('a', 3)] in fromListWith (++) [ (k, [v]) | (k, v) <- xs ] = fromList [('a', [3, 1]), ('b', [2])]Note that the lists in the resulting map contain elements in reverse order from their occurences in the original list.More generally, duplicate entries are accumulated as follows; this matters when f' is not commutative or not associative. fromListWith f [(k, a), (k, b), (k, c), (k, d)] = fromList [(k, f d (f c (f b a)))]D unordered-containers O(n*log n) Construct a map from a list of elements. Uses the provided function to merge duplicate entries.ExamplesGiven a list of key-value pairs where the keys are of different flavours, e.g: data Key = Div | Suband the values need to be combined differently when there are duplicates, depending on the key: #combine Div = div combine Sub = (-)then fromListWithKey can be used as follows: fromListWithKey combine [(Div, 2), (Div, 6), (Sub, 2), (Sub, 3)] = fromList [(Div, 3), (Sub, 1)]=More generally, duplicate entries are accumulated as follows; fromListWith f [(k, a), (k, b), (k, c), (k, d)] = fromList [(k, f k d (f k c (f k b a)))]unordered-containersAppend the given key and value to the array. If the key is already present, instead update the value of the key by applying the given function to the new and old value (in that order). The value is always evaluated to WHNF before being inserted into the array.unordered-containersAppend the given key and value to the array. If the key is already present, instead update the value of the key by applying the given function to the new and old value (in that order). The value is always evaluated to WHNF before being inserted into the array.1  !"#$%&)*+,-123456789:;<=>?@ABCD 2011 Bryan O'Sullivan BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthy3lEunordered-containers8A set of values. A set cannot contain duplicate values.Funordered-containersO(1) Construct an empty set.Gunordered-containersO(1)' Construct a set with a single element.Hunordered-containersO(1) Convert to the equivalent .Iunordered-containersO(1) Convert from the equivalent .J unordered-containersO(n) Produce a E of all the keys in the given .Kunordered-containersO(n+m)8 Construct a set containing all elements from both sets.To obtain good performance, the smaller set must be presented as the first argument.Examples'union (fromList [1,2]) (fromList [2,3])fromList [1,2,3]Lunordered-containers fromList [2,3]fromList [1,2,3]unordered-containers5Note that, in the presence of hash collisions, equal HashSet?s may behave differently, i.e. substitutivity may be violated:"data D = A | B deriving (Eq, Show)5instance Hashable D where hashWithSalt salt _d = saltx = fromList [A, B]y = fromList [B, A]x == yTruetoList x[A,B]toList y[B,A]In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals.EFGHIJKLMNOPQRSTUVWXY2011 Bryan O'Sullivan BSD-stylejohan.tibell@gmail.com provisionalportableSafemDEFGHIKLMNOPQRSTUVWXYEFGKLMNOPQRSTUVWXYHI2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportableSafem2  !"#$%&)*+,-123456789:;<=>?@ABCDJ21 23 456789;:>?@A&"#! $%*)=<+,-BCDJ2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthyn2  !"#$%&'()*+,-./0J2 &"#! $%*)('+,-./0J   !"# $%&'()*+,-./0123456789:;         " # 2 3 % ' ( 9 : ; <  = > ?  !      # $ & ) - 5 8 9@ABCDEFGHIJKLMNOPQ#RSTUVWXYZ[\]^_`abc)*-.de98fghijklmklnCopqCrstuvwxyz{|}~CoC]kCCCv }    * .   %unordered-containers-0.2.11.0-inplaceData.HashMap.StrictData.HashMap.Lazy Data.HashSetData.HashMap.ListData.HashMap.UnsafeData.HashMap.ArrayData.HashMap.UnsafeShiftData.HashMap.BaseData.HashMap.Strict.BasetraverseWithKeyData.HashSet.BaseHashMapempty singletonnullsizememberlookup!?findWithDefault lookupDefault!insert insertWithdeleteadjustupdatealteralterFunion unionWith unionWithKeyunions mapWithKeymap differencedifferenceWith intersectionintersectionWithintersectionWithKeyfoldl'foldr' foldlWithKey' foldrWithKey'foldrfoldl foldrWithKey foldlWithKeyfoldMapWithKeymapMaybeWithKeymapMaybe filterWithKeyfilterkeyselemstoListfromList fromListWithfromListWithKeyHashSettoMapfromMapkeysSetisPermutationByunorderedComparedeleteBybaseGHC.STrunSTarraymarraynewcopycopyMtriminsertMupdateM updateWith' unsafeUpdateMdeleteMmap'MArrayArrayunsafeSameArray sameArray1lengthlengthMnew_ singletonMpairreadwriteindexindex#indexM unsafeFreeze unsafeThawrunrun2foldMapthawtraverse traverse' unsafeShiftL unsafeShiftRhashghc-prim GHC.TypesTrueFalse GHC.MaybeNothinglookup'GHC.Errerror collision CollisionLeafbitmapIndexedOrFull BitmapIndexedFull unsafeInserttwoinsertModifyingunsafeInsertWithdeleteKeyExistslookupRecordCollisionadjust#Just alterFEager unionArrayByGHC.Base Applicative filterMapAuxlookupInArrayContindexOfupdate16 update16M update16With'clone16 bitsPerSubkey fullNodeMaskptrEq $fOrdHashMap GHC.ClassesEq $fEqHashMap$fMonoidHashMapmemptymappend$fSemigroupHashMap<>$fBifoldableHashMap LookupResPresentAbsentBitmapHashEmptyL equalKeys1 equalKeysinsert' insertNewKeyinsertKeyExistsdelete'updateOrConcatWithupdateOrConcatWithKey sparseIndexmaskupdateOrSnocWithupdateOrSnocWithKey$fMonoidHashSet$fSemigroupHashSet $fEqHashSet