W      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV Safe-Inferred O(log n)< Return the value to which the specified key is mapped, or W- 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 X- if this map contains no mapping for the key.O(log n)D Remove the mapping for the specified key from this map if present.O(1) Construct an empty map.O(1)' Construct a map with a single element.O(1) Return Y if this map is empty, Z otherwise. O(log n) Return Y. if the specified key is present in the map, Z otherwise. O(1)5 Return the number of key-value mappings in this map. 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*log n)| Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.O(n)& Return a list of this map's elements.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 + oldO(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(m*log n) The union of two maps, n - size of the first map. If a key occurs in both maps, the mapping from the first will be the mapping in the result. O(m*log n) The union of two maps, n - size of the first map. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.<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*log(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)] 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)( 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 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*log(n))D Filter this map by retaining only elements satisfying a predicate.  O(n*log(n))N Filter this map by retaining only elements which values satisfy a predicate.! O(n*log n)b Construct a map from a list of elements. Uses the provided function to merge duplicate entries.*[\Default value to return.  !]^_`ab"  !"    !([\  !]^_`ab Safe-Inferred $O(log n)< Return the value to which the specified key is mapped, or W- if this map contains no mapping for the key.% O(n*log n)b Construct a map from a list of elements. Uses the provided function to merge duplicate entries.& O(n*log n)| Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.'O(n)D Return a list of this map's elements. The list is produced lazily.(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)D Remove the mapping for the specified key from this map if present.+O(1) Construct an empty map.,O(1)' Construct a map with a single element.-O(1) Return Y if this map is empty, Z otherwise..O(log n) Return Y. if the specified key is present in the map, Z otherwise./O(1)5 Return the number of key-value mappings in this map.0O(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.1O(log n)? Return the value to which the specified key is mapped. Calls X- if this map contains no mapping for the key.2O(n)A Return a list of this map's keys. The list is produced lazily.3O(n)C Return a list of this map's values. The list is produced lazily.4O(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 + old5O(log n)i Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.6 O(m*log n) The union of two maps, n - size of the first map. If a key occurs in both maps, the mapping from the first will be the mapping in the result.7 O(m*log n) The union of two maps, n - size of the first map. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.8<Construct a set containing all elements from a list of sets.9O(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*log(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)] 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)( 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).AO(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.BO(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).C O(n*log(n))D Filter this map by retaining only elements satisfying a predicate.D O(n*log(n))N Filter this map by retaining only elements which values satisfy a predicate./"#cdefg$%&'()*+,-./0Default value to return.123456789:;<=>?@ABCDhijklmn#"#$%&'()*+,-./0123456789:;<=>?@ABCD#"#+,-/.$01(4*56789:;<=>?A@BDC23'&%)+"#cedfg$%&'()*+,-./0123456789:;<=>?@ABCDhijklmn Safe-InferredE8A set of values. A set cannot contain duplicate values.FO(1) Construct an empty set.GO(1)' Construct a set with a single element.H O(m*log n)O Construct a set containing all elements from both sets, n - size of first map.I<Construct a set containing all elements from a list of sets.JO(1) Return Y if this set is empty, Z otherwise.KO(1)+ Return the number of elements in this set.L O(min(n,W)) Return Y- if the given value is present in this set, Z otherwise.M O(min(n,W))% Add the specified value to this set.N O(min(n,W))6 Remove the specified value from this set if present.OO(n)m Transform this set by applying a function to every value. The resulting set may be smaller than the source.PO(n)V Difference of two sets. Return elements of the first set not existing in the second.QO(n)Y Intersection of two sets. Return elements present in both the first set and the second.RO(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.SO(n) Reduce this set by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).TO(n)D Filter this set by retaining only elements satisfying a predicate.UO(n)D Return a list of this set's elements. The list is produced lazily.VO(n*min(W, n))) Construct a set from a list of elements.EopFGHIJKLMNOPQRSTUVqrEFGHIJKLMNOPQRSTUVEFGHIJKLMNOPQRSTUVEopFGHIJKLMNOPQRSTUVqr Safe-Inferred#"#$%&'()*+,-./0123456789:;<=>?@ABCDs      !"#$%%&      !"#$'      $()*(+,-./-.01123456789:112345;67'<=>?linkedhashmap-0.4.0.0Data.LinkedHashMap.IntMapData.LinkedHashMap.SeqData.LinkedHashSetData.LinkedHashMap LinkedHashMaplookup lookupDefault!deleteempty singletonnullmembersizekeyselemsfromListtoListinsert insertWithadjustunion unionWithunionsmap mapWithKeytraverseWithKey difference intersectionintersectionWithfoldl'foldr foldlWithKey' foldrWithKey filterWithKeyfilter fromListWithpack LinkedHashSetbase Data.MaybeNothingGHC.Errerrorghc-prim GHC.TypesTrueFalseEntry$fTraversableLinkedHashMap$fFoldableLinkedHashMap$fFunctorLinkedHashMap$fNFDataLinkedHashMap $fNFDataEntry$fShowLinkedHashMap MaybePairJustPair NothingPair$fNFDataMaybePairasMap$fNFDataLinkedHashSet$fShowLinkedHashSet