úÎNì(      !"#$%&'None3456KVø“A wrapped applicative functor. Please note that base 4.12.0.0 will include this type, and it will be removed from this library at that point.VLazy in the monoidal accumulator. Monoidal accumulation happens from left to right.VLazy in the monoidal accumulator. Monoidal accumulation happens from left to right.¯Strict in the monoidal accumulator. For monads strict in the left argument of bind, this will run in constant space. Monoidal accumulation happens from left to right.Strict version of  Strict version of .Note this is equivalent to #, and is provided for convenience. Strict version of . Strict version of . Strict version of . Strict version of  .Strict version of  Strict version of (.Strict version of  . This is just  specialised to ).rMap each element of a foldable structure to a monoid, and combine the results. This function is left-associative.;The operator is applied lazily. For a strict version, see .sMap each element of a foldable structure to a monoid, and combine the results. This function is right-associative. Note that this is equivalent to *.rMap each element of a foldable structure to a monoid, and combine the results. This function is left-associative.;The operator is applied strictly. For a lazy version, see .sMap each element of a foldable structure to a monoid, and combine the results. This function is right-associative. Note that this is equivalent to *, but is strict.  44 4+    !"#$%&'()*+,-./012345367389:*constrictor-0.1.1.0-7n16Q7AfpcmHeb7BJal3ge Constrictor Data.Functor<$> Control.MonadliftMliftM2liftM3liftM4liftM5apmapMApgetAp foldlMapA foldrMapA foldlMapM' foldrMapM'<$!>fmap'liftM'liftM2'liftM3'liftM4'liftM5'ap' traverse'mapM'foldlMapfoldrMap foldlMap' foldrMap' $fMonoidAp $fSemigroupAp$fAlternativeAp$fApplicativeAp$fEnumAp$fEqAp $fFoldableAp $fFunctorAp $fGenericAp $fGeneric1Ap $fMonadAp $fMonadFailAp $fMonadFixAp $fMonadPlusAp$fNumAp$fOrdAp$fReadAp$fShowAp$fTraversableApbaseData.TraversabletraverseGHC.BaseMonad Data.FoldablefoldMap