Îõ³h$);'½?      !"#$%&'()*+,-./0123456789:;<=> Safe-Inferred hashmap-ioO(1) Construct an empty map. hashmap-ioO(1)' Construct a map with a single element. hashmap-ioO(1) Return ? if this map is empty, @ otherwise. hashmap-ioO(n)5 Return the number of key-value mappings in this map. hashmap-ioO(log n) Return ?. if the specified key is present in the map, @ otherwise.  hashmap-ioO(log n)< Return the value to which the specified key is mapped, or A- if this map contains no mapping for the key.   hashmap-ioO(log n)< Return the value to which the specified key is mapped, or A- if this map contains no mapping for the key.This is a flipped version of  .   hashmap-ioO(log n)ú Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key.  hashmap-ioO(log n)? Return the value to which the specified key is mapped. Calls B- if this map contains no mapping for the key.  hashmap-ioO(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. hashmap-ioO(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 hashmap-ioO(log n)Ä Remove the mapping for the specified key from this map if present. hashmap-ioO(log n)é Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone. hashmap-ioO(log n) The expression ( f k map) updates the value x at k (if it is in the map). If (f x) is A$, the element is deleted. If it is (C y) , the key k is bound to the new value y. hashmap-ioO(log n) The expression ( f k map) alters the value x at k, or absence thereof.Å can be used to insert, delete, or update a value in a map. In short:   k ( f k m) = f (  k m)  hashmap-ioO(n)ê Reduce the map by applying a function to each element and combining the results with a monoid operation. hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). hashmap-ioO(n)¡ Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value. hashmap-ioO(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 using the result in the next application. This function is strict in the starting value. hashmap-ioO(n)¡ Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value. hashmap-ioO(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 using the result in the next application. This function is strict in the starting value. hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator). hashmap-ioO(n)Á Return a list of this map's keys. The list is produced lazily. hashmap-ioO(n)Ã Return a list of this map's values. The list is produced lazily. hashmap-ioO(n)ï Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified. hashmap-ioO(n)û Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.  hashmap-ioDefault value to return.     9  Safe-Inferred'C# hashmap-ioO(1) Construct an empty map.$ hashmap-ioO(1)' Construct a map with a single element.% hashmap-ioO(1) Return ? if this map is empty, @ otherwise.& hashmap-ioO(n)5 Return the number of key-value mappings in this map.' hashmap-ioO(log n) Return ?. if the specified key is present in the map, @ otherwise.( hashmap-ioO(log n)< Return the value to which the specified key is mapped, or A- if this map contains no mapping for the key.)  hashmap-ioO(log n)< Return the value to which the specified key is mapped, or A- if this map contains no mapping for the key.This is a flipped version of (.*  hashmap-ioO(log n)ú Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key.+ hashmap-ioO(log n)? Return the value to which the specified key is mapped. Calls B- if this map contains no mapping for the key., hashmap-ioO(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.- hashmap-ioO(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. hashmap-ioO(log n)Ä Remove the mapping for the specified key from this map if present./ hashmap-ioO(log n)é Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.0 hashmap-ioO(log n) The expression (0 f k map) updates the value x at k (if it is in the map). If (f x) is A$, the element is deleted. If it is (C y) , the key k is bound to the new value y.1 hashmap-ioO(log n) The expression (1 f k map) alters the value x at k, or absence thereof.1Å can be used to insert, delete, or update a value in a map. In short: ( k (1 f k m) = f (( k m) 2 hashmap-ioO(n)ê Reduce the map by applying a function to each element and combining the results with a monoid operation.3 hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).4 hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).5 hashmap-ioO(n)¡ Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.6 hashmap-ioO(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 using the result in the next application. This function is strict in the starting value.7 hashmap-ioO(n)¡ Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator). Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.8 hashmap-ioO(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 using the result in the next application. This function is strict in the starting value.9 hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).: hashmap-ioO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the left-identity of the operator).; hashmap-ioO(n)Á Return a list of this map's keys. The list is produced lazily.< hashmap-ioO(n)Ã Return a list of this map's values. The list is produced lazily.= hashmap-ioO(n)ï Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified.> hashmap-ioO(n)û Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.* hashmap-ioDefault value to return. !"#$%&'()*+,-./0123456789:;<=> !"#$%&'()*+,-./0123456789:;<=>+9  Safe-Inferred'°DEFGHIJKÌ      !"#      !"#$%&$%'()*(+,()-./0123456hashmap-io-0.1.0.0-inplaceData.IOHashMap.STMData.IOHashMapPaths_hashmap_io IOHashMap newIOHashMap readIOHashMapmodifyIOHashMapempty singletonnullsizememberlookup!?findWithDefault!insert insertWithdeleteadjustupdatealterfoldMapWithKeyfoldrfoldlfoldr'foldl' foldrWithKey' foldlWithKey' foldrWithKey foldlWithKeykeyselemstoListfromListghc-prim GHC.TypesTrueFalsebase GHC.MaybeNothingGHC.ErrerrorJustversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName