h$ \      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst Safe-Inferred'( uvwxy Trustworthy'(3567> insert-ordered-containersz? which tries it's best to remember insertion order of elements.insert-ordered-containers=This is a slight lie, as roundtrip doesn't preserve ordering.insert-ordered-containersThe union of two maps. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.;Ordered traversal will go thru keys in the first map first.insert-ordered-containers!Order preserving mapping of keys.insert-ordered-containersMore efficient than {3, when folding in insertion order is not important.insert-ordered-containersMore efficient than 3, when folding in insertion order is not important.insert-ordered-containersMore efficient than |6, when traversing in insertion order is not important.insert-ordered-containersMore efficient than 6, when traversing in insertion order is not important.1insert-ordered-containers,Test if the internal map structure is valid.Ainsert-ordered-containers1hashWithSalt salt . toHashMap = hashWithSalt salt. insert-ordered-containersDefault value to return.2  !"#$%&'()*+,-./012  !"#$%&'()*+-.,0/1 Trustworthy'(3>Qinsert-ordered-containers}? which tries it's best to remember insertion order of elements.Rinsert-ordered-containers=This is a slight lie, as roundtrip doesn't preserve ordering.cinsert-ordered-containers,Test if the internal map structure is valid.minsert-ordered-containers~ salt . b = ~ salt.QRSTUVWXYZ[\]^_`abcQSTUVWXYZ[\]^`_baRc      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV   "#*01WX5YZ[\]^_`abcdefghijjklmnopqrsqtunvwxyz6insert-ordered-containers-0.2.4-4QCN3jLvi5iG9mwV1i4eDbData.HashMap.Strict.InsOrdData.HashSet.InsOrdData.HashMap.InsOrd.Internal InsOrdHashMaphashMapunorderedTraversalempty singletonnullsizememberlookup lookupDefaultdeleteinsert insertWithadjustupdatealter unionWith unionWithKeyunionunionsmapKeys traverseKeysmap mapWithKeyfoldMapWithKeytraverseWithKeyunorderedFoldMapunorderedFoldMapWithKeyunorderedTraverseunorderedTraverseWithKey difference intersectionintersectionWithintersectionWithKeyfoldl' foldlWithKey'foldr foldrWithKeyfilter filterWithKeymapMaybemapMaybeWithKeykeyselemsfromListtoList toRevList fromHashMap toHashMapvalid $fHashableP$fShowP$fEqP$fAtInsOrdHashMap$fIxedInsOrdHashMap$fAtInsOrdHashMap0$fIxedInsOrdHashMap0$$fTraversableWithIndexkInsOrdHashMap!$fFoldableWithIndexkInsOrdHashMap $fFunctorWithIndexkInsOrdHashMap$fFromJSONInsOrdHashMap$fFromJSON1InsOrdHashMap$fToJSONInsOrdHashMap$fToJSON1InsOrdHashMap$fIsListInsOrdHashMap$fHashableInsOrdHashMap$fBindInsOrdHashMap$fApplyInsOrdHashMap$fTraversableInsOrdHashMap$fFoldableInsOrdHashMap$fMonoidInsOrdHashMap$fSemigroupInsOrdHashMap$fReadInsOrdHashMap$fShowInsOrdHashMap$fEqInsOrdHashMap$fFunctorInsOrdHashMap$fDataInsOrdHashMap $fFunctorP $fFoldableP$fTraversableP$fDataP InsOrdHashSethashSet fromHashSet toHashSet$fContainsInsOrdHashSet$fAtInsOrdHashSet$fIxedInsOrdHashSet$fContainsInsOrdHashSet0$fAtInsOrdHashSet0$fIxedInsOrdHashSet0$fFromJSONInsOrdHashSet$fToJSONInsOrdHashSet$fIsListInsOrdHashSet$fHashableInsOrdHashSet$fFoldableInsOrdHashSet$fMonoidInsOrdHashSet$fSemigroupInsOrdHashSet$fReadInsOrdHashSet$fShowInsOrdHashSet$fEqInsOrdHashSet$fDataInsOrdHashSetSortedApPure liftSortedApretractSortedAp4unordered-containers-0.2.13.0-74JHcjQ66Sy4auaiZwSKzkData.HashMap.InternalHashMapbase Data.FoldablefoldMapData.TraversabletraverseData.HashSet.InternalHashSet'hashable-1.3.1.0-4Nh17OCRUzi2o7taLLLKheData.Hashable.Class hashWithSalt