úÎBs>œ     portable provisionaljohan.tibell@gmail.comA non-empty list of key/ value pairs.  !"#$O(n); Insert at the head of the list to avoid copying the whole  list. %&'()*+,-./0 !#%')+-/ !#%')+-/123AA map from keys to values. A map cannot contain duplicate keys; ( each key can map to at most one value. 456789O(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). ;<bin7 assures that we never have empty trees within a tree. =>?@AB Return a C$ where only the highest bit is set. 123456;<=>?@AB123654456;<=>?@ABportable provisionaljohan.tibell@gmail.comDEFG  !#%+-/DFDFportable provisionaljohan.tibell@gmail.comO(1) Return H if this map is empty, I 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 J. if this map contains no mapping for the key. 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(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 " 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(n); Transform this map by applying a function to every value. O(n*min(W, n))* Construct a map from a list of elements.   K           ! "#$%&'()*+,-./0123456789#$:;<:;=7>?@unordered-containers-0.1.0.0Data.HashMap.LazyData.HashMap.StrictData.FullList.LazyData.HashMap.CommonData.FullList.StrictHashMapnullsizelookupempty singletoninsertdelete insertWithmapfoldr foldrWithKeyfoldl' foldlWithKey' filterWithKeyfiltertoListfromListkeyselemsListConsNilFullListFLsizeLlookupLinsertLdeleteL insertWithLmapLfoldlWithKey'L foldrWithKeyLfilterWithKeyLHashMaskPrefixBinTipequalnequaljoinbinzeronomatchmaskmaskW branchMaskhighBitbaseGHC.WordWordghc-primGHC.BoolTrueFalse Data.MaybeNothing