úÎÛ0ĐČU      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTNoneBUVUVUVNoneBOTWCReturn the value computed by a state transformer computation. The forall- ensures that the internal state used by the ST9 computation is inaccessible to the rest of the program.WXWWXSafe YNoneBOTZSmart constructor[Smart constructor\ˆCreate a new mutable array of specified size, in the specified state thread, with each element containing the specified initial value.]EUnsafely copy the elements of an array. Array bounds are not checked.^EUnsafely copy the elements of an array. Array bounds are not checked._O(n)T Insert an element at the given position in this array, increasing its size by one.`O(n)T Insert an element at the given position in this array, increasing its size by one.aO(n)8 Update the element at the given position in this array.bO(n)8 Update the element at the given position in this array.cO(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.dO(1)J Update the element at the given position in this array, without copying.eO(n)T Delete an element at the given position in this array, decreasing its size by one.fO(n)T Delete an element at the given position in this array, decreasing its size by one.gStrict version of h..ijklmnoZp[q\rstuvwxyz{|}]^_`abcd~€efhg‚ƒ„…†‡!ilop\rstuvwxyz{|}]^_`acd~ehgƒ„…*ijklmnoZp[q\rstuvwxyz{|}]^_`abcd~€efhg‚ƒ„…†‡None 0BDEMRT9hA map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.ˆ@Convenience function. Compute a hash value for the given value.O(1) Construct an empty map.O(1)' Construct a map with a single element.O(1) Return ‰ if this map is empty, Š otherwise.O(n)5 Return the number of key-value mappings in this map.O(log n) Return ‰. if the specified key is present in the map, Š otherwise.O(log n)< Return the value to which the specified key is mapped, or ‹- if this map contains no mapping for the key.O(log n)z Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key.O(log n)? Return the value to which the specified key is mapped. Calls Œ- if this map contains no mapping for the key. Create a Ž value with two  values. Create a ‘ or ’ node. O(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.“!In-place update version of insert”ACreate a map from two key-value pairs which hashes don't collide. O(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 + old•%In-place update version of insertWith O(log n)D Remove the mapping for the specified key from this map if present. O(log n)i Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone. O(log n) The expression (  f k map) updates the value x at k(, (if it is in the map). If (f k x) is ‹%, the element is deleted. If it is (–+ y), the key k is bound to the new value y.O(log n) The expression ( f k map) alters the value x at k, or absence thereof. alterH can be used to insert, delete, or update a value in a map. In short :  k ( f k m) = f ( k m).O(n+m)t The union of two maps. If a key occurs in both maps, the mapping from the first will be the mapping in the result.O(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.O(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.—Strict in the result of f.<Construct a set containing all elements from a list of sets.O(n): Transform this map by applying a function to every value.O(n): Transform this map by applying a function to every value.O(n)L Transform this map by accumulating an Applicative result from every value. O(n*log m)V Difference of two maps. Return elements of the first map not existing in the second. O(n*log m)] Intersection of two maps. Return elements of the first map for keys existing in the second.O(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.O(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.O(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 before using the result in the next application. This function is strict in the starting value.O(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 before using the result in the next application. This function is strict in the starting value.O(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).O(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).˜Create a new array of the n first elements of mary.O(n)] Transform this map by applying a function to every value and retaining only some of them.O(n)] Transform this map by applying a function to every value and retaining only some of them. O(n)D Filter this map by retaining only elements satisfying a predicate.™Common implementation for   and 2, allowing the former to former to reuse terms.!O(n)N Filter this map by retaining only elements which values satisfy a predicate."O(n)A Return a list of this map's keys. The list is produced lazily.#O(n)C Return a list of this map's values. The list is produced lazily.$O(n)o Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified.%O(n){ Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.& O(n*log n)b Construct a map from a list of elements. Uses the provided function to merge duplicate entries.šO(n)I Lookup the value associated with the given key in this array. Returns ‹ if the key wasn't found.›O(n)I Lookup the value associated with the given key in this array. Returns ‹ if the key wasn't found.œO(n)8 Update the element at the given position in this array.O(n)8 Update the element at the given position in this array.žO(n)V Update the element at the given position in this array, by applying a function to it.ŸWUnsafely clone an array of 16 elements. The length of the input array is not checked.  Mask out the Ą3 bits used for indexing at this level of the tree.ąA bitmask with the Ą least significant bits set.Ł~Check if two the two arguments are the same value. N.B. This function might give false negatives (due to GC moving objects.)_€„Š§‘š’Ž©ˆȘ«Ź­źDefault value to return. “” • —˜ ™!"#$%&š›Ż°±ČłœžŸĄŽ”¶· ąŁžčș»ŒœŸżÀÁÂĂÄA„Š§š‘’Ž©ˆ “” — ™!"#$%&ČłœžĄ¶· ąY€„Š§‘š’Ž©ˆȘ«Ź­ź “” • —˜ ™!"#$%&š›Ż°±ČłœžŸĄŽ”¶· ąŁžčș»ŒœŸżÀÁÂĂÄ9 2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthy'  !"#$%&' ! "#$%&2011 Bryan O'Sullivan BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthy0DER'8A set of values. A set cannot contain duplicate values.(O(1) Construct an empty set.)O(1)' Construct a set with a single element.*O(1) Convert to the equivalent .+O(1) Convert from the equivalent .,O(n+m)8 Construct a set containing all elements from both sets.UTo obtain good performance, the smaller set must be presented as the first argument.-<Construct a set containing all elements from a list of sets..O(1) Return ‰ if this set is empty, Š otherwise./O(n)+ Return the number of elements in this set.0 O(min(n,W)) Return ‰- if the given value is present in this set, Š otherwise.1 O(min(n,W))% Add the specified value to this set.2 O(min(n,W))6 Remove the specified value from this set if present.3O(n)m Transform this set by applying a function to every value. The resulting set may be smaller than the source.4O(n)V Difference of two sets. Return elements of the first set not existing in the second.5O(n)Y Intersection of two sets. Return elements present in both the first set and the second.6O(n)ÿ( Reduce this set 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 before using the result in the next application. This function is strict in the starting value.7O(n) Reduce this set by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).8O(n)D Filter this set by retaining only elements satisfying a predicate.9O(n)E Return a list of this set's elements. The list is produced lazily.:O(n*min(W, n))) Construct a set from a list of elements."'ĆÆÇÈ()*+,-./0123456789:;<=>?@ABCD'()*+,-./0123456789:'(),-./0123456789:*+ 'ĆÆÇÈ()*+,-./0123456789:;<=>?@ABCD2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable TrustworthyMEO(1)' Construct a map with a single element.FO(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.GO(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 + oldÉ%In-place update version of insertWithHO(log n)i Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.IO(log n) The expression (I f k map) updates the value x at k(, (if it is in the map). If (f k x) is ‹%, the element is deleted. If it is (–+ y), the key k is bound to the new value y.JO(log n) The expression (J f k map) alters the value x at k, or absence thereof. alterH can be used to insert, delete, or update a value in a map. In short :  k (J f k m) = f ( k m).KO(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.LO(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.MO(n): Transform this map by applying a function to every value.NO(n): Transform this map by applying a function to every value.OO(n)] Transform this map by applying a function to every value and retaining only some of them.PO(n)] Transform this map by applying a function to every value and retaining only some of them.QO(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.RO(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.S O(n*log n)| Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.T O(n*log n)v Construct a map from a list of elements. Uses the provided function f to merge duplicate entries (f newVal oldVal). For example: %fromListWith (+) [ (x, 1) | x <- xs ]Cwill create a map with number of occurrences of each element in xs. -fromListWith (++) [ (k, [v]) | (k, v) <- xs ]]will group all values by their keys in a list 'xs :: [(k, v)]' and return a 'HashMap k [v]'.ÊÿAppend 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.ËÿAppend 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.EFGÉHIJKLMNOPQRSTÌÊËÍ'  !"#$EFGHIJKLMNOPQRST'EFG HIJKLNMQR! PO"#$STEFGÉHIJKLMNOPQRSTÌÊËÍÎ      !"#$%&'()*+,-./0  12   #%*-.3456789:;< '(!"./=>?@ABCDEFGHIJKLMNOOPQQRSTUV WXYZ[\]^_`#%ab.-c*defghighjAklAmnopqrstuvwAkxyz{|}~€[‚ƒ„…†‡ˆq‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ĄąŁ€0„ŠŠw‘§š3unordered-containers-0.2.7.2-5FvILdEAx092lIiPKjCuguData.HashMap.Lazy Data.HashSetData.HashMap.StrictData.HashMap.UnsafeShiftData.HashMap.UnsafeData.HashMap.PopCountData.HashMap.ArrayData.HashMap.BaseHashMapempty singletonnullsizememberlookup lookupDefault!insert insertWithdeleteadjustupdatealterunion unionWith unionWithKeyunions mapWithKeymaptraverseWithKey difference intersectionintersectionWithintersectionWithKeyfoldl' foldlWithKey'foldr foldrWithKeymapMaybeWithKeymapMaybe filterWithKeyfilterkeyselemstoListfromList fromListWithHashSettoMapfromMap$fIsListHashSet$fHashableHashSet $fDataHashSet $fShowHashSet $fReadHashSet$fMonoidHashSet$fSemigroupHashSet$fFoldableHashSet $fEqHashSet$fNFDataHashSet unsafeShiftL unsafeShiftRrunSTrunSTRepbase Data.BitspopCountarraymarraynewcopycopyMinsertMupdateM updateWith' unsafeUpdateMdeleteMmap'MArrayunMArrayArrayunArraylengthlengthMrnfArraynew_ singletonMpairreadwriteindexindexM unsafeFreeze unsafeThawrunrun2 undefinedElemthawtraverse $fNFDataArray $fShowArrayhashghc-prim GHC.TypesTrueFalseGHC.BaseNothingGHC.Errerror collision CollisionLeafbitmapIndexedOrFull BitmapIndexedFull unsafeInserttwounsafeInsertWithJust unionArrayBytrim filterMapAux lookupInArrayindexOfupdate16 update16M update16With'clone16 bitsPerSubkey fullNodeMaskptrEqShiftBitmapHashEmptyLfromListConstrhashMapDataTypeequaltoList'isLeafOrCollision updateWithupdateOrSnocWithupdateOrSnocWithKeyupdateOrConcatWithupdateOrConcatWithKey maxChildren subkeyMask sparseIndexmask$fIsListHashMap$fHashableHashMap $fEqHashMap$fTraversableHashMap $fShowHashMap $fReadHashMap $fDataHashMap$fMonoidHashMap$fSemigroupHashMap$fFoldableHashMap$fFunctorHashMap$fNFDataHashMap $fNFDataLeafasMaphashSetDataTypeleaf