Fold.ShortcutNonempty.Type

Documentation

data ShortcutNonemptyFold a b

Processes at least one input of type a, has the ability to halt midway through the stream, and results in a value of type b

Constructors

forall x y. ShortcutNonemptyFold

Fields

• initial :: a -> Vitality x y
• step :: y -> a -> Vitality x y
• extract :: Vitality x y -> b

Instances

Applicative (ShortcutNonemptyFold a)

Defined in Fold.ShortcutNonempty.Type

Methods

pure :: a0 -> ShortcutNonemptyFold a a0

(<*>) :: ShortcutNonemptyFold a (a0 -> b) -> ShortcutNonemptyFold a a0 -> ShortcutNonemptyFold a b

liftA2 :: (a0 -> b -> c) -> ShortcutNonemptyFold a a0 -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a c

(*>) :: ShortcutNonemptyFold a a0 -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a b

(<*) :: ShortcutNonemptyFold a a0 -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a a0

Functor (ShortcutNonemptyFold a)

Defined in Fold.ShortcutNonempty.Type

Methods

fmap :: (a0 -> b) -> ShortcutNonemptyFold a a0 -> ShortcutNonemptyFold a b

(<$) :: a0 -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a a0

Monoid b => Monoid (ShortcutNonemptyFold a b)

Defined in Fold.ShortcutNonempty.Type

Methods

mempty :: ShortcutNonemptyFold a b

mappend :: ShortcutNonemptyFold a b -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a b

mconcat :: [ShortcutNonemptyFold a b] -> ShortcutNonemptyFold a b

Semigroup b => Semigroup (ShortcutNonemptyFold a b)

Defined in Fold.ShortcutNonempty.Type

Methods

(<>) :: ShortcutNonemptyFold a b -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a b

sconcat :: NonEmpty (ShortcutNonemptyFold a b) -> ShortcutNonemptyFold a b

stimes :: Integral b0 => b0 -> ShortcutNonemptyFold a b -> ShortcutNonemptyFold a b

data Will

Constructors

Ambivalent

Tenacious

Instances

Monoid Will

Defined in Strict

Methods

mempty :: Will

mappend :: Will -> Will -> Will

mconcat :: [Will] -> Will

Semigroup Will

Defined in Strict

Methods

(<>) :: Will -> Will -> Will

sconcat :: NonEmpty Will -> Will

stimes :: Integral b => b -> Will -> Will

data Vitality a b

Constructors

Dead a

Alive Will b

Instances

Functor (Vitality a)

Defined in Strict

Methods

fmap :: (a0 -> b) -> Vitality a a0 -> Vitality a b

(<$) :: a0 -> Vitality a b -> Vitality a a0