úÎ'¸&`     None 3456KV%‰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.YStrict in the monoidal accumulator. Monoidal accumulation happens from left to right.This is ), but strict in its argument and result.BThis is re-defined in this module, and not just re-exported from  Control.Monad^. The reason for this is that there is no way to hide the docs for re-exports with Haddocks.*In the common case that one might import  Control.Monad,, we recommend structuring imports like so: 8import Control.Monad hiding ((<$!>)) import Constrictor or 8import Control.Monad import Constrictor hiding ((<$!>)) lThere should be no unintended side effects introduced as a result of structuring one's imports in this way.This is ), but strict in its argument and result.Note this is equivalent to #, and is provided for convenience.This is ), but strict in its argument and result.Note this is equivalent to #, and is provided for convenience.This is *, but strict in its arguments and result.This is *, but strict in its arguments and result. This is *, but strict in its arguments and result. This is  *, but strict in its arguments and result. This is *, but strict in its arguments and result. Strict version of . Stricter 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.  444    !"#$%&'*constrictor-0.1.2.0-2Pv1dVjYrvaAkCJVhscdaZ Constrictor Data.Functor<$>fmap Control.MonadliftM2liftM3liftM4liftM5mapM foldlMapA foldrMapA foldlMapM' foldrMapM'<$!>fmap'liftM'liftM2'liftM3'liftM4'liftM5'ap' traverse' traverse''mapM'foldlMapfoldrMap foldlMap' foldrMap'baseGHC.BaseliftMapData.TraversabletraverseMonad Data.FoldablefoldMap