$;
!"#$%&'()*+,./0123456789:None;<;<;<
SafeInferred=None>>Return the value computed by a state transformer computation.
The forall ensures that the internal state used by the ?
9 computation is inaccessible to the rest of the program.
>@>>@NoneASmart constructor
BSmart constructor
C?Create a new mutable array of specified size, in the specified
B state thread, with each element containing the specified initial
value.
DFUnsafely copy the elements of an array. Array bounds are not checked.
EFUnsafely copy the elements of an array. Array bounds are not checked.
FO(n)8 Insert an element at the given position in this array,
increasing its size by one.
GO(n)8 Insert an element at the given position in this array,
increasing its size by one.
HO(n)9 Update the element at the given position in this array.
IO(n)9 Update the element at the given position in this array.
JO(n); Update the element at the given positio in this array, by
B applying a function to it. Evaluates the element to WHNF before
inserting it into the array.
KO(1)9 Update the element at the given position in this array,
without copying.
LO(n)8 Delete an element at the given position in this array,
decreasing its size by one.
MO(n)8 Delete an element at the given position in this array,
decreasing its size by one.
NStrict version of O.
.PQRSTUVAWBXCYZ[\]^_`abcdDEFGHIJKefghLMONijklmn!PSVWCYZ[\]^_`abcdDEFGHJKefhLONjkl*PQRSTUVAWBXCYZ[\]^_`abcdDEFGHIJKefghLMONijklmnNone1AA map from keys to values. A map cannot contain duplicate keys;
( each key can map to at most one value.
oAConvenience 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 p if this map is empty, q otherwise.
O(n)6 Return the number of keyvalue mappings in this map.
O(log n) Return p( if the specified key is present in the
map, q otherwise.
O(log n)8 Return the value to which the specified key is mapped,
or r. if this map contains no mapping for the key.
O(log n)8 Return the value to which the specified key is mapped,
C or the default value if this map contains no mapping for the key.
O(log n)8 Return the value to which the specified key is mapped.
Calls s. if this map contains no mapping for the key.
t Create a u value with two v values.
w Create a x or y node.
O(log n)2 Associate the specified value with the specified
B key in this map. If this map previously contained a mapping for
% the key, the old value is replaced.
z"Inplace update version of insert
{6Create a map from two keyvalue pairs which hashes don't collide.
O(log n)3 Associate the value with the key in this map. If
D this map previously contained a mapping for the key, the old value
E is replaced by the result of applying the given function to the new
and old value. Example:
insertWith f k v map
where f new old = new + old
&Inplace update version of insertWith
O(log n)8 Remove the mapping for the specified key from this map
if present.
O(log n)7 Adjust the value tied to a given key in this map only
3 if it is present. Otherwise, leave the map alone.
O(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.
O(n+m)7 The union of two maps. If a key occurs in both maps,
D 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 accumulating an Applicative result
from every value.
O(n*log m): Difference of two maps. Return elements of the first map
not existing in the second.
O(n*log m)8 Intersection of two maps. Return elements of the first
& map for keys existing in the second.
O(n+m)8 Intersection of two maps. If a key occurs in both maps
B the provided function is used to combine the values from the two
maps.
O(n)6 Reduce this map by applying a binary operator to all
9 elements, using the given starting value (typically the
C leftidentity of the operator). Each application of the operator
9 is evaluated before before using the result in the next
> application. This function is strict in the starting value.
O(n)6 Reduce this map by applying a binary operator to all
9 elements, using the given starting value (typically the
C leftidentity of the operator). Each application of the operator
9 is evaluated before before using the result in the next
> application. This function is strict in the starting value.
O(n)6 Reduce this map by applying a binary operator to all
9 elements, using the given starting value (typically the
" rightidentity of the operator).
O(n)6 Reduce this map by applying a binary operator to all
9 elements, using the given starting value (typically the
" rightidentity of the operator).
Create a new array of the n first elements of mary.
O(n)9 Filter this map by retaining only elements satisfying a
predicate.
O(n)9 Filter this map by retaining only elements which values
satisfy a predicate.
O(n) Return a list of this map's keys. The list is produced
lazily.
O(n) Return a list of this map' s values. The list is produced
lazily.
O(n) Return a list of this map's elements. The list is
produced lazily.
O(n): Construct a map with the supplied mappings. If the list
B contains duplicate mappings, the later mappings take precedence.
O(n*log n)0 Construct a map from a list of elements. Uses
3 the provided function to merge duplicate entries.
O(n)8 Lookup the value associated with the given key in this
array. Returns r if the key wasn' t found.
O(n)8 Lookup the value associated with the given key in this
array. Returns r if the key wasn' t found.
O(n)9 Update the element at the given position in this array.
O(n)9 Update the element at the given position in this array.
O(n)W Update the element at the given position in this array, by applying a function to it.
AUnsafely clone an array of 16 elements. The length of the input
array is not checked.
Mask out the & 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
A function might give false negatives (due to GC moving objects.)
QuyxvoDefault value to return.
tw z{

}~8uyxvotw z{
}Kxyuvotw z{

}~portableprovisionaljohan.tibell@gmail.comTrustworthy O(1)( Construct a map with a single element.
!O(log n)2 Associate the specified value with the specified
B key in this map. If this map previously contained a mapping for
% the key, the old value is replaced.
"O(log n)3 Associate the value with the key in this map. If
D this map previously contained a mapping for the key, the old value
E is replaced by the result of applying the given function to the new
and old value. Example:
insertWith f k v map
where f new old = new + old
&Inplace update version of insertWith
#O(log n)7 Adjust the value tied to a given key in this map only
3 if it is present. Otherwise, leave the map alone.
$O(n+m)7 The union of two maps. If a key occurs in both maps,
L the provided function (first argument) will be used to compute the result.
O(n); Transform this map by applying a function to every value.
&O(n+m)8 Intersection of two maps. If a key occurs in both maps
B the provided function is used to combine the values from the two
maps.
'
O(n*log n)5 Construct a map with the supplied mappings. If the
; list contains duplicate mappings, the later mappings take
precedence.
(
O(n*log n)0 Construct a map from a list of elements. Uses
3 the provided function to merge duplicate entries.
;Append the given key and value to the array. If the key is
B already present, instead update the value of the key by applying
B the given function to the new and old value (in that order). The
B value is always evaluated to WHNF before being inserted into the
array.
!"#$%&'(
!"#$%&'( !"#
$%&'( !"#$%&'(portableprovisionaljohan.tibell@gmail.comTrustworthy
portableprovisionaljohan.tibell@gmail.comNone)9A 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(n+m)9 Construct a set containing all elements from both sets.
ATo 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 p if this set is empty, q otherwise.
/O(n), Return the number of elements in this set.
0O(min(n,W)) Return p' if the given value is present in this
set, q otherwise.
1O(min(n,W))& Add the specified value to this set.
2O(min(n,W)) Remove the specified value from this set if
present.
3O(n); Transform this set by applying a function to every value.
3 The resulting set may be smaller than the source.
4O(n): Difference of two sets. Return elements of the first set
not existing in the second.
5O(n); Intersection of two sets. Return elements present in both
the first set and the second.
6O(n)6 Reduce this set by applying a binary operator to all
9 elements, using the given starting value (typically the
C leftidentity of the operator). Each application of the operator
9 is evaluated before before using the result in the next
> application. This function is strict in the starting value.
7O(n)6 Reduce this set by applying a binary operator to all
9 elements, using the given starting value (typically the
" rightidentity of the operator).
8O(n)9 Filter this set by retaining only elements satisfying a
predicate.
9O(n) 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:)*+,./0123456789:)*+,./0123456789:)*+,./0123456789:
!"#$%&'('()
#&'*+,./,0123456789:;<=>??@AABCDEFGHIJKLMNOP QR'&S#TUVWXYWXZ,[\,]^_`abcdefghijklmnopKqrstuvawxyz{}~gi~})yunorderedcontainers0.2.3.3Data.HashMap.StrictData.HashMap.LazyData.HashSetData.HashMap.UnsafeShiftData.HashMap.PopCountData.HashMap.UnsafeData.HashMap.ArrayData.HashMap.BaseHashMapempty singletonnullsizememberlookup
lookupDefault!insert
insertWithdeleteadjustunion unionWithunionsmaptraverseWithKey
differenceintersectionintersectionWithfoldl'
foldlWithKey'foldrfoldrWithKey
filterWithKeyfilterkeyselemstoListfromListfromListWithHashSetunsafeShiftLunsafeShiftRbase Data.BitspopCountrunSTGHC.STSTrunSTReparraymarraynewcopycopyMinsertMupdateupdateMupdateWith'
unsafeUpdateMdeleteMmap'MArrayunMArrayArrayunArraylengthlengthMrnfArraynew_
singletonMpairreadwriteindexindexMunsafeFreeze
unsafeThawrunrun2
undefinedElemthawtraverse
$fNFDataArray$fShowArrayhashghcprim GHC.TypesTrueFalse
Data.MaybeNothingGHC.Errerror collision CollisionLeafbitmapIndexedOrFull
BitmapIndexedFullunsafeInserttwounsafeInsertWithunionArrayBy
mapWithKeytrim
lookupInArrayindexOfupdate16 update16M
update16With'clone16
bitsPerSubkeyfullNodeMaskptrEqShiftBitmapHashEmptyLfromListConstrhashMapDataTypeequalisLeafOrCollision
updateWithupdateOrSnocWithupdateOrConcatWithmaxChildren
subkeyMasksparseIndexmask$fEqHashMap$fTraversableHashMap
$fShowHashMap
$fDataHashMap$fMonoidHashMap$fFoldableHashMap$fFunctorHashMap$fNFDataHashMap$fNFDataLeafleafasMaphashSetDataType
$fDataHashSet
$fShowHashSet$fMonoidHashSet$fFoldableHashSet$fEqHashSet$fNFDataHashSet