úÎ Q      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOP Trustworthy%&02349;<=DRT Q? which tries it's best to remember insertion order of elements.=This is a slight lie, as roundtrip doesn't preserve ordering.The 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.!Order preserving mapping of keys.More efficient than R3, when folding in insertion order is not important.More efficient than 3, when folding in insertion order is not important.More efficient than S6, when traversing in insertion order is not important.More efficient than 6, when traversing in insertion order is not important.1,Test if the internal map structure is valid.>1hashWithSalt salt . toHashMap = hashWithSalt salt.ZTUVWXYZ[\]^ Default value to return. _` !"#$%&'()*+,-./0a1b23456789:;<=>?@ABCDEFGHIJ2  !"#$%&'()*+,-./012  !"#$%&'()*+-.,0/1TTUVWXYZ[\]^ _` !"#$%&'()*+,-./0a1b23456789:;<=>?@ABCDEFGHIJc      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXVYZ[\[]^__`abcdefg8insert-ordered-containers-0.2.1.0-DsvlBnrDC3mKSTWCWKc4IFData.HashMap.Strict.InsOrd InsOrdHashMaphashMapunorderedTraversalempty singletonnullsizememberlookup lookupDefaultdeleteinsert insertWithadjustupdatealter unionWith unionWithKeyunionunionsmapKeys traverseKeysmap mapWithKeyfoldMapWithKeytraverseWithKeyunorderedFoldMapunorderedFoldMapWithKeyunorderedTraverseunorderedTraverseWithKey difference intersectionintersectionWithintersectionWithKeyfoldl' foldlWithKey'foldr foldrWithKeyfilter filterWithKeymapMaybemapMaybeWithKeykeyselemsfromListtoList toRevList fromHashMap toHashMapvalid$fApplicativeSortedAp$fFunctorSortedAp$$fTraversableWithIndexkInsOrdHashMap!$fFoldableWithIndexkInsOrdHashMap $fFunctorWithIndexkInsOrdHashMap$fAtInsOrdHashMap$fIxedInsOrdHashMap$fFromJSONInsOrdHashMap$fFromJSON1InsOrdHashMap$fToJSONInsOrdHashMap$fToJSON1InsOrdHashMap$fIsListInsOrdHashMap$fHashableInsOrdHashMap$fBindInsOrdHashMap$fApplyInsOrdHashMap$fTraversableInsOrdHashMap$fFoldableInsOrdHashMap$fMonoidInsOrdHashMap$fSemigroupInsOrdHashMap$fReadInsOrdHashMap$fShowInsOrdHashMap$fEqInsOrdHashMap $fHashableP$fShowP$fEqP $fFunctorP $fFoldableP$fTraversableP$fDataP$fFunctorInsOrdHashMap$fDataInsOrdHashMap3unordered-containers-0.2.8.0-5pNp3l8vBzrGaRUqynRgkTData.HashMap.BaseHashMapbase Data.FoldablefoldMapData.TraversabletraverseSortedApPure _getIndexgetInsOrdHashMapPgetPKgetPVincPK liftSortedApretractSortedAp fromHashMapPnewP