#aZ|      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{Safe,-/1456;<=>?DHV_fh.|}~Safe,-/1456;<=>?DHV_fhW/Map Wrapper of a  ] whose semigroup operation is the symmetric difference, and ergo whose monoidal unit is emptyMap Wrapper of a  L whose semigroup operation is the intersection, combining values elementwiseMap Wrapper of a  l whose semigroup operation is the union, combining values elementwise, and ergo whose monoidal unit is empty Map/Class of key-value maps with variable structure Map The empty map MapModify the value of the key in the map, or insert the key and its value into the map, or delete the key and its value from the map, functorially. fmap ( k) .   f k = f . ( k)=This is the most general operation on a given key in the map. MapmCombine two maps with the given function, which is called once for each key present in either map, inclusive. Map>Traverse a function over each value in the map, gathering the  values and forgetting the .Map>Traverse a function over each value in the map, gathering the  and  values separately.MapClass of key-value mapsLaws:   _ =    k <=<  f =    f k <=<     kMap]Modify the value of the key in the map. If the key is absent, the map is returned unmodified.Map/Traverse a function over each value in the map.MapDefault implementation of  in terms of   methodsMapDefault implementation of  in terms of   methodsMapLook up the key in the map.MapjInsert a key and new value into the map, the new value clobbering the old if the key is already present.  =  MapInsert a key and new value into the map, combining the old and new values with the given function if the key is already present.Map`Insert a key and new value into the map, looking up the old value if the key is already present.MapInsert a key and new value into the map, looking up the old value and combining the old and new values with the given function if the key is already present.Map^Delete a key and its value from the map. If the key is absent, the map is returned unmodified.Map]Modify the value of the key in the map. If the key is absent, the map is returned unmodified.MaptModify the value of the key in the map, or delete the key and its value from the map, if the given function returns  or @, in turn. If the key is absent, the map is returned unmodified.MaptModify the value of the key in the map, or delete the key and its value from the map, if the given function returns  or x, in turn, looking up the old value if the key is already present. If the key is absent, the map is returned unmodified.MapModify the value of the key in the map, or insert the key and its value into the map, or delete the key and its value from the map.MapModify the value of the key in the map, or insert the key and its value into the map, or delete the key and its value from the map, looking up the old value if the key is already present. MapModify the value of the key in the map, or insert the key and its value into the map, or delete the key and its value from the map, looking up the old value if the key is already present, functorially.This is no more general than  !, but is defined for convenience.!Map*Map a function over each value in the map."Map9Map a function over each value in the map, gathering the  values and forgetting the .#Map9Map a function over each value in the map, gathering the  and  separately./MapModify the value of the key in the map, looking up the old value if the key is already present. If the key is absent, the map is returned unmodified.0MapMap with a single element1MapKUnion of two maps, combining values of the same key with the given function2MapRIntersection of two maps, combining values of the same key with the given function3MapmCombine two maps with the given function, which is called once for each key present in either map, inclusive.4MapKUnion of two maps, combining values of the same key with the given function5MapRIntersection of two maps, combining values of the same key with the given function6MapiDifference of two maps, which contains exactly the keys present in the first map but absent in the second7MapsSymmetric difference of two maps, which contains exactly the keys present in the either map but absent in the other8Map(Map a function over each key in the map.9MaphMap a function over each key in the map, combining values of keys which collide with the given function.:Map-Traverse a function over each key in the map.;MapmTraverse a function over each key in the map, combining values of keys which collide with the given function.<Map7Map a function over each key in the map, gathering the  values and forgetting the .=Map7Map a function over each key in the map, gathering the  values and forgetting the A, combining values of keys which collide with the given function.>Map<Traverse a function over each key in the map, gathering the  values and forgetting the .?Map<Traverse a function over each key in the map, gathering the  values and forgetting the A, combining values of keys which collide with the given function.@MapKeys of the map @ as  k = k  (as  k)A   !"#$%&'()*+,-./0123456789:;<=>?@A   !"#$%&'()*+,-./0123456789:;<=>?@9       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{||}~~~~~~~~~~Map-0.1.3.2-inplaceData.Map.Class Util.PrivateSymmetricDifferenceunSymmetricDifference IntersectionunIntersectionUnionunUnionMapemptyalterFmergeAmapMaybeWithKeyAmapEitherWithKeyA StaticMapKeyadjustAtraverseWithKeydefaultAdjustAdefaultTraverseWithKey!?insert insertWith insertLookupinsertLookupWithdeleteadjustupdate updateLookupalter alterLookup alterLookupF mapWithKeymapMaybeWithKeymapEitherWithKeyfoldMapWithKeyA foldrWithKeyM foldlWithKeyMfoldMapWithKey foldrWithKey foldlWithKeyfromList fromListWithfromListWithKey fromListWithMfromListWithKeyM adjustLookupA singleton unionWithintersectionWithmerge unionWithAintersectionWithA differencesymmetricDifferencemapKeys mapKeysWith traverseKeystraverseKeysWith mapKeysMaybemapKeysMaybeWithtraverseKeysMaybetraverseKeysMaybeWithkeys$fFiltrableMap$fFiltrableIntMap$fStaticMapProduct$fStaticMapCompose$fStaticMapMap$fStaticMapIntMap$fStaticMapMaybe $fMapProduct $fMapCompose$fMapMap $fMapIntMap $fMapMaybe $fMonoidUnion$fSemigroupUnion $fMapUnion$fStaticMapUnion$fFiltrableUnion$fSemigroupIntersection$fMapIntersection$fStaticMapIntersection$fFiltrableIntersection$fMonoidSymmetricDifference$fSemigroupSymmetricDifference$fMapSymmetricDifference$fStaticMapSymmetricDifference$fFiltrableSymmetricDifference$fFunctorUnion$fFoldableUnion$fTraversableUnion $fEqUnion $fOrdUnion $fReadUnion $fShowUnion $fEq1Union $fOrd1Union $fRead1Union $fShow1Union$fFunctorIntersection$fFoldableIntersection$fTraversableIntersection$fEqIntersection$fOrdIntersection$fReadIntersection$fShowIntersection$fEq1Intersection$fOrd1Intersection$fRead1Intersection$fShow1Intersection$fFunctorSymmetricDifference$fFoldableSymmetricDifference $fTraversableSymmetricDifference$fEqSymmetricDifference$fOrdSymmetricDifference$fReadSymmetricDifference$fShowSymmetricDifference$fEq1SymmetricDifference$fOrd1SymmetricDifference$fRead1SymmetricDifference$fShow1SymmetricDifferenceEndoappEndobase GHC.MaybeJustNothing Data.EitherLeftRightGHC.BasepureData.Functor.ConstConstfmap.getConst<$