Safe Haskell	Safe-Inferred
Language	GHC2021

Fold.Effectful.Type

Synopsis

data EffectfulFold m a b = forall x.EffectfulFold {
- initial :: m x
- step :: x -> a -> m x
- extract :: x -> m b
}

Documentation

Processes inputs of type a and results in an effectful value of type m b

Constructors

forall x. EffectfulFold
Fields initial :: m x step :: x -> a -> m x extract :: x -> m b

Instances details

Applicative m => Applicative (EffectfulFold m a) Source #
Instance details Defined in Fold.Effectful.Type Methods pure :: a0 -> EffectfulFold m a a0 # (<>) :: EffectfulFold m a (a0 -> b) -> EffectfulFold m a a0 -> EffectfulFold m a b # liftA2 :: (a0 -> b -> c) -> EffectfulFold m a a0 -> EffectfulFold m a b -> EffectfulFold m a c # (>) :: EffectfulFold m a a0 -> EffectfulFold m a b -> EffectfulFold m a b # (<*) :: EffectfulFold m a a0 -> EffectfulFold m a b -> EffectfulFold m a a0 #
Functor m => Functor (EffectfulFold m a) Source #
Instance details Defined in Fold.Effectful.Type Methods fmap :: (a0 -> b) -> EffectfulFold m a a0 -> EffectfulFold m a b # (<$) :: a0 -> EffectfulFold m a b -> EffectfulFold m a a0 #
(Monoid b, Monad m) => Monoid (EffectfulFold m a b) Source #
Instance details Defined in Fold.Effectful.Type Methods mempty :: EffectfulFold m a b # mappend :: EffectfulFold m a b -> EffectfulFold m a b -> EffectfulFold m a b # mconcat :: [EffectfulFold m a b] -> EffectfulFold m a b #
(Semigroup b, Monad m) => Semigroup (EffectfulFold m a b) Source #
Instance details Defined in Fold.Effectful.Type Methods (<>) :: EffectfulFold m a b -> EffectfulFold m a b -> EffectfulFold m a b # sconcat :: NonEmpty (EffectfulFold m a b) -> EffectfulFold m a b # stimes :: Integral b0 => b0 -> EffectfulFold m a b -> EffectfulFold m a b #