úÎŪgÔO\      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[SafeVū\]^SafeK_NoneDQV}`Smart constructoraSmart constructorbˆCreate a new mutable array of specified size, in the specified state thread, with each element containing the specified initial value.cEUnsafely copy the elements of an array. Array bounds are not checked.dEUnsafely copy the elements of an array. Array bounds are not checked.eO(n)T Insert an element at the given position in this array, increasing its size by one.fO(n)T Insert an element at the given position in this array, increasing its size by one.gO(n)8 Update the element at the given position in this array.hO(n)8 Update the element at the given position in this array.iO(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.jO(1)J Update the element at the given position in this array, without copying.kO(n)T Delete an element at the given position in this array, decreasing its size by one.lO(n)T Delete an element at the given position in this array, decreasing its size by one.mStrict version of n.!opqrbstuvwxyz{|}~cdefgij€knm‚ƒ„o…†p‡ˆNoneD\‰ŠNone 1DFGOTV}Ĩ;hA map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.‹8A set of values. A set cannot contain duplicate values.@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)› 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 ŽD, the element is discarded (proper set difference). If it returns (™ y+), the element is updated with a new value y. 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.)§The order is total.Note:Ž Because the hash is not guaranteed to be stable across library versions, OSes, or architectures, neither is an actual order of elements in  or an result of ¨ .is stable.Default value to return.CŠĒĢ•Ŧ”‘’­‹Ž“ –— š !œ"#$%&'¯°Ÿ Ą¤ą˛ŖĨĢ”Ŧ•‘’­9 2010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable TrustworthyOŗˆ(O(1)' Construct a map with a single element.)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.*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)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)‚ 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.0O(n): Transform this map by applying a function to every value.1O(n): Transform this map by applying a function to every value.2O(n)] Transform this map by applying a function to every value and retaining only some of them.3O(n)] Transform this map by applying a function to every value and retaining only some of them.4 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 ŽD, the element is discarded (proper set difference). If it returns (™ y+), the element is updated with a new value y.5O(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.6O(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.7 O(n*log n)| Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.8 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.( !"#$%()*+,-./012345678(()* +,-./10456"!32#$%782010-2012 Johan Tibell BSD-stylejohan.tibell@gmail.com provisionalportable TrustworthyļI(  !"#$%&'( "! #$%&'2011 Bryan O'Sullivan BSD-stylejohan.tibell@gmail.com provisionalportable Trustworthy1FGTĶœ98A 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.AO(n)+ Return the number of elements in this set.BO(log n) Return Œ- if the given value is present in this set,  otherwise.CO(log n)% Add the specified value to this set.DO(log n)6 Remove the specified value from this set if present.EO(n)m Transform this set by applying a function to every value. The resulting set may be smaller than the source.FO(n)V Difference of two sets. Return elements of the first set not existing in the second.GO(n)Y Intersection of two sets. Return elements present in both the first set and the second.HO(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.IO(n) Reduce this set by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).JO(n)D Filter this set by retaining only elements satisfying a predicate.KO(n)E Return a list of this set's elements. The list is produced lazily.LO(n*min(W, n))) Construct a set from a list of elements.9:;<=>?@ABCDEFGHIJKL9:;>?@ABCDEFGHIJKL<=9ļˇ¸      !"#$%&'()*+,-./0 () "#/01  23  !$&+./456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWX YZ[\]^_`ab$&c.d+TeUfghijkljkmFnoFpqrstuvwxyzFn{|}~€‚ƒ„]…†‡ˆj‰Š‹ŒtŽ‘’“z”•1–—3unordered-containers-0.2.9.0-74AuJDtsjWUF62QcnSyKl7Data.HashMap.StrictData.HashMap.Lazy Data.HashSetData.HashMap.ListData.HashMap.UnsafeData.HashMap.ArrayData.HashMap.UnsafeShiftData.HashMap.BaseHashMapempty singletonnullsizememberlookup lookupDefault!insert insertWithdeleteadjustupdatealterunion unionWith unionWithKeyunions mapWithKeymaptraverseWithKey differencedifferenceWith intersectionintersectionWithintersectionWithKeyfoldl' foldlWithKey'foldr foldrWithKeymapMaybeWithKeymapMaybe filterWithKeyfilterkeyselemstoListfromList fromListWithHashSettoMapfromMap$fIsListHashSet$fHashableHashSet$fHashable1HashSet $fDataHashSet $fShowHashSet$fShow1HashSet $fReadHashSet$fMonoidHashSet$fSemigroupHashSet$fFoldableHashSet $fOrd1HashSet $fOrdHashSet $fEq1HashSet $fEqHashSet$fNFDataHashSetisPermutationByunorderedComparedeleteBybaseGHC.STrunSTarraymarraynewcopycopyMinsertMupdateM updateWith' unsafeUpdateMdeleteMmap'MArrayArraylengthlengthMnew_ singletonMpairreadwriteindexindexM unsafeFreeze unsafeThawrunrun2thawtraverseunMArrayunArray unsafeShiftL unsafeShiftRhashghc-prim GHC.TypesTrueFalseGHC.BaseNothingGHC.Errerror collision CollisionLeafbitmapIndexedOrFull BitmapIndexedFull unsafeInserttwounsafeInsertWithJust unionArrayBytrim filterMapAux lookupInArrayindexOfupdate16 update16M update16With'clone16 bitsPerSubkey fullNodeMaskptrEq $fOrdHashMap GHC.ClassescompareBitmapHashEmptyL equalKeysupdateOrConcatWithupdateOrConcatWithKey sparseIndexmaskupdateOrSnocWithupdateOrSnocWithKeyasMap