h$3y      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None  unordered-containersCreate a new mutable array of specified size, in the specified state thread, with each element containing the specified initial value.unordered-containersUnsafely copy the elements of an array. Array bounds are not checked.unordered-containersUnsafely copy the elements of an array. Array bounds are not checked.unordered-containersCreate a new array of the n first elements of mary.unordered-containersO(n) Insert an element at the given position in this array, increasing its size by one.unordered-containersO(n) Insert an element at the given position in this array, increasing its size by one.unordered-containersO(n)8 Update the element at the given position in this array.unordered-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.unordered-containersO(1) Update the element at the given position in this array, without copying.$unordered-containers=Verifies that a predicate holds for all elements of an array.&unordered-containersO(n) Delete an element at the given position in this array, decreasing its size by one.(unordered-containersStrict version of '..unordered-containers/unordered-containers.  !"#$%&'()*+,-.  &"! #$%'(,-+)* Safe-Inferred e234243None./2;J:unordered-containersA map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.Bunordered-containers8A set of values. A set cannot contain duplicate values.Convenience function. Compute a hash value for the given value.Eunordered-containersO(1) Construct an empty map.Funordered-containersO(1)' Construct a map with a single element.Gunordered-containersO(1) Return  if this map is empty,  otherwise.Hunordered-containersO(n)5 Return the number of key-value mappings in this map.Iunordered-containersO(log n) Return . if the specified key is present in the map,  otherwise.Junordered-containersO(log n)< Return the value to which the specified key is mapped, or - if this map contains no mapping for the key.Kunordered-containerslookup' is a version of lookup that takes the hash separately. It is used to implement alterF.M 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 J.N 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.Ounordered-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.11, replaced by N.Punordered-containersO(log n)? Return the value to which the specified key is mapped. Calls - if this map contains no mapping for the key.Qunordered-containers Create a ? value with two @ values.Runordered-containers Create a < or > node.Sunordered-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.Wunordered-containers!In-place update version of insertXunordered-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.Yunordered-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 + oldZunordered-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-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 L0. 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 key^unordered-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.aunordered-containersO(log n) The expression (a f k map) alters the value x at k, or absence thereof.a can be used to insert, delete, or update a value in a map. In short: J k (a f k m) = f (J k m) b unordered-containersO(log n) The expression (b f k map) alters the value x at k, or absence thereof.b; can be used to insert, delete, or update a value in a map.Note: b is a flipped version of the at combinator from  https://hackage.haskell.org/package/lens/docs/Control-Lens-At.html#v:atControl.Lens.At.c unordered-containers O(n*log m) Inclusion of maps. A map is included in another map if the keys are subsets and the corresponding values are equal: isSubmapOf m1 m2 = keys m1 `isSubsetOf` keys m2 && and [ v1 == v2 | (k1,v1) <- toList m1; let v2 = m2 ! k1 ]Examples:fromList [(1,'a')] `isSubmapOf` fromList [(1,'a'),(2,'b')]True:fromList [(1,'a'),(2,'b')] `isSubmapOf` fromList [(1,'a')]Falsed unordered-containers O(n*log m) Inclusion of maps with value comparison. A map is included in another map if the keys are subsets and if the comparison function is true for the corresponding values: isSubmapOfBy cmpV m1 m2 = keys m1 `isSubsetOf` keys m2 && and [ v1 `cmpV` v2 | (k1,v1) <- toList m1; let v2 = m2 ! k1 ]ExamplesisSubmapOfBy (<=) (fromList [(1,'a')]) (fromList [(1,'b'),(2,'c')])TrueisSubmapOfBy (<=) (fromList [(1,'b')]) (fromList [(1,'a'),(2,'c')])Falseeunordered-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')]funordered-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.gunordered-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.hunordered-containersStrict in the result of f.iunordered-containers 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")])fromList [(1,"c")]mapKeys (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")])fromList [(3,"c")]ounordered-containers O(n*log m) Difference of two maps. Return elements of the first map not existing in the second.punordered-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.qunordered-containers O(n*log m) Intersection of two maps. Return elements of the first map for keys existing in the second.runordered-containers O(n*log 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.sunordered-containers O(n*log 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.tunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.uunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.vunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.wunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.xunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).yunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).zunordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).{unordered-containersO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).|unordered-containersO(n) Reduce the map by applying a function to each element and combining the results with a monoid operation.}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) Filter this map by retaining only elements satisfying a predicate.unordered-containersCommon implementation for  and }2, allowing the former to former to reuse terms.unordered-containersO(n) Filter this map by retaining only elements which values satisfy a predicate.unordered-containersO(n) Return a list of this map's keys. The list is produced lazily.unordered-containersO(n) Return a list of this map's values. The list is produced lazily.unordered-containersO(n) Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified.unordered-containersO(n) Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.unordered-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)))] 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-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-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-containersunordered-containersunordered-containersunordered-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 = E = eIf 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 = eIf 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-containersunordered-containersunordered-containersNunordered-containersDefault value to return.Ounordered-containersDefault value to return.57689:;=<>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~:;=<>?@AEFGHIJMNOPSYW[^`abcdefgijlkmnopqrsutwvxyz{|~}98RQBXhDCL576T\KUV]Z_P9 2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.comportable Trustworthyaunordered-containersO(1)' Construct a map with a single element.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-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-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-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. can be used to insert, delete, or update a value in a map. In short: lookup k ( f k m) = f (lookup k m)  unordered-containersO(log n) The expression ( f k map) alters the value x at k, or absence thereof.; 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/docs/Control-Lens-At.html#v:atControl.Lens.At.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-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.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.unordered-containers O(n*log n) Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.unordered-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)))] 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)))]5:EGHIJMNOP[cdeijnoqtuvwxyz{|5:EGHIJMNOP[cdeijnoq|utwvxyz{2011 Bryan O'Sullivan BSD-stylejohan.tibell@gmail.comportable Trustworthy2;vunordered-containers8A set of values. A set cannot contain duplicate values.unordered-containersO(1) Construct an empty set. HashSet.empty fromList []unordered-containersO(1)' Construct a set with a single element.HashSet.singleton 1 fromList [1]unordered-containersO(1)" Convert to set to the equivalent : with () values.#HashSet.toMap (HashSet.singleton 1)fromList [(1,())]unordered-containersO(1) Convert from the equivalent : with () values.(HashSet.fromMap (HashMap.singleton 1 ()) fromList [1] unordered-containersO(n) Produce a  of all the keys in the given :.6HashSet.keysSet (HashMap.fromList [(1, "a"), (2, "b")]fromList [1,2] unordered-containers O(n*log m) Inclusion of sets.Examples,fromList [1,3] `isSubsetOf` fromList [1,2,3]True*fromList [1,2] `isSubsetOf` fromList [1,3]Falseunordered-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.'union (fromList [1,2]) (fromList [2,3])fromList [1,2,3]unordered-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.unordered-containersunordered-containers2011 Bryan O'Sullivan BSD-stylejohan.tibell@gmail.com provisionalportableSafew2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportableSafex\6:EGHIJMNOP[cdeijnoqtuvwxyz{|6:EGHIJMNOP[cdeijnoq|xyutwvz{2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthyyl6:EFGHIJMNOPSY[^`abcdefgijklmnopqrstuvwxyz{|}~6:EFGHIJMNOPSY[^`abcdefgijlkmnopqrs|xyutwvz{~}       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGEHIJKLMNOPQRSTUVWX"YZ[\]^_.`abc$defghijklmn/ opqrst'(uv)*wxyz{|}~31"^b$deijn/z{ qst1LhlMNO"./pr'()*~314unordered-containers-0.2.18.0-EkyS30fQpFjIrPy8oIoJt0Data.HashMap.Internal.ArrayData.HashMap.Internal.ListData.HashMap.InternalData.HashMap.StrictData.HashMap.Lazy Data.HashSetData.HashSet.InternalData.HashMap.Internal.StricttraverseWithKeyMArrayunMArrayArrayunArrayunsafeSameArray sameArray1lengthlengthMnewnew_ singleton singletonMpairreadwriteindexindex#indexM unsafeFreeze unsafeThawruncopycopyMtriminsertinsertMupdate updateWith' unsafeUpdateMfoldl'foldr'foldrfoldlfoldMapallthawdeletemapmap'fromList fromList'toListtraverse traverse'$fLiftLiftedRepArray$fNFData1Array $fNFDataArray $fShowArrayisPermutationByunorderedComparedeleteBy LookupResAbsentPresentBitmapHashHashMapEmpty BitmapIndexedLeafFull CollisionLhash equalKeys1 equalKeysemptynullsizememberlookuplookup'lookupRecordCollision!?findWithDefault lookupDefault! collisionbitmapIndexedOrFullinsert' insertNewKeyinsertKeyExists unsafeInserttwo insertWithinsertModifyingdelete'deleteKeyExistsadjustadjust#alteralterF isSubmapOf isSubmapOfByunion unionWith unionWithKey unionArrayByunionscompose mapWithKeymapKeys differencedifferenceWith intersectionintersectionWithintersectionWithKey foldlWithKey' foldrWithKey' foldrWithKey foldlWithKeyfoldMapWithKeymapMaybeWithKeymapMaybe filterWithKey filterMapAuxfilterkeyselems fromListWithfromListWithKeyupdateOrConcatWithKeyupdate32 update32M update32With' bitsPerSubkey sparseIndexmask fullNodeMaskptrEq $fNFData2Leaf $fNFData1Leaf$fLiftLiftedRepLeaf $fNFDataLeaf$fIsListHashMap$fHashableHashMap$fHashable1HashMap$fHashable2HashMap $fOrdHashMap $fOrd1HashMap $fOrd2HashMap $fEqHashMap $fEq1HashMap $fEq2HashMap$fTraversableHashMap $fShowHashMap $fReadHashMap$fRead1HashMap$fShow1HashMap$fShow2HashMap $fDataHashMap$fMonoidHashMap$fSemigroupHashMap$fBifoldableHashMap$fFoldableHashMap$fFunctorHashMap$fNFData2HashMap$fNFData1HashMap$fNFDataHashMap$fEqLeaf$fLiftLiftedRepHashMapHashSetasMaptoMapfromMapkeysSet isSubsetOf$fIsListHashSet$fHashableHashSet$fHashable1HashSet $fDataHashSet $fShowHashSet$fShow1HashSet $fReadHashSet$fMonoidHashSet$fSemigroupHashSet$fFoldableHashSet $fOrd1HashSet $fOrdHashSet $fEq1HashSet $fEqHashSet$fNFData1HashSet$fNFDataHashSet$fLiftLiftedRepHashSetghc-prim GHC.TypesTrueFalsebase GHC.MaybeNothingGHC.ErrerrorJustGHC.Base Applicative GHC.ClassesEqmemptymappend<>