úÎNIŸ     portable provisionaljohan.tibell@gmail.com A non-empty list of key/ value pairs. !"#$%&'(O(n); Insert at the head of the list to avoid copying the whole  list. )*+,-./012345678 !"$%')+-/1357 !!"$%')+-/13579:;AA map from keys to values. A map cannot contain duplicate keys; ( each key can map to at most one value. <=>?@AO(n); Transform this map by applying a function to every value. O(n)6 Reduce this map by applying a binary operator to all 9 elements, using the given starting value (typically the " right-identity of the operator). O(n): Transform this map by accumulating an Applicative result  from every value. BCbin7 assures that we never have empty trees within a tree. DEFGHI Return a J> whose single set bit corresponds to the lowest set bit of w. 9:;<=>BCDEF9:;>=<<=>BCDEFportable provisionaljohan.tibell@gmail.comKLMNOP "$%')1357KMOKMOportable provisionaljohan.tibell@gmail.comO(1) Return Q if this map is empty, R otherwise. O(n)6 Return the number of key-value mappings in this map.  O(min(n,W))0 Return the value to which the specified key is  mapped, or S. if this map contains no mapping for the key.  O(min(n,W))0 Return the value to which the specified key is B mapped, or the default value if this map contains no mapping for  the key. Default value to return. O(1) Construct an empty map. O(1)( Construct a map with a single element.  O(min(n,W))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(min(n,W))4 Remove the mapping for the specified key from this  map if present.  O(min(n,W))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  O(min(n,W)2 Adjust the value tied to a given key in this map 8 only if it is present. Otherwise, leave the map alone. O(n); Transform this map by applying a function to every value. O(n)6 Reduce this map by applying a binary operator to all 9 elements, using the given starting value (typically the " right-identity 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 C left-identity 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 left-identity 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)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 elements. The list is  produced lazily. O(n*min(W, n))* Construct a map from a list of elements. 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.    portable provisionaljohan.tibell@gmail.comO(1)( Construct a map with a single element.  O(min(n,W))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(min(n,W))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  O(min(n,W)2 Adjust the value tied to a given key in this map 8 only if it is present. Otherwise, leave the map alone. O(n); Transform this map by applying a function to every value. O(n*min(W, n))* Construct a map from a list of elements.   portable provisionaljohan.tibell@gmail.comTO(n)3 Return the number of hash collisions in this map. UO(n)2 Return histogram of hash collisions in this map. D Keys are number of entries in bucket, values are number of buckets  of that size. TUTUportable provisionaljohan.tibell@gmail.comTUV      !"# $ %&'()* +, -./0123!456789:;<=>?@()*ABCABD>EFGHIunordered-containers-0.1.2.0Data.HashMap.LazyData.HashMap.StrictData.FullList.LazyData.HashMap.CommonData.FullList.StrictData.HashMap.Lazy.InternalData.HashMap.Strict.InternalHashMap foldrWithKeytraverseWithKeynullsizelookup lookupDefaultempty singletoninsertdelete insertWithadjustmapfoldrfoldl' foldlWithKey' filterWithKeyfiltertoListfromListkeyselemsListConsNilFullListFLsizeLlookupLinsertLdeleteL insertWithLadjustLmapLtraverseWithKeyLfoldlWithKey'L foldrWithKeyLfilterWithKeyLHashMaskSuffixBinTipequalnequaljoinbinzeronomatchmaskmaskW branchMaskcritBitbaseGHC.WordWordghc-primGHC.BoolTrueFalse Data.MaybeNothing collisionscollisionHistogram