Safe Haskell	Safe-Inferred
Language	GHC2021

Fold.Pure.Type

Synopsis

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

Documentation

Processes inputs of type a and results in a value of type b

Constructors

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

Instances details

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