Data.Machine.Source

Sources

type Source b = forall k. Machine k b

A Source never reads from its inputs.

type SourceT m b = forall k. MachineT m k b

A SourceT never reads from its inputs, but may have monadic side-effects.

source :: Foldable f => f b -> Source b

Generate a Source from any Foldable container.

repeated :: o -> Source o

Repeat the same value, over and over.

cycled :: Foldable f => f b -> Source b

Loop through a Foldable container over and over.

cap :: Process a b -> Source a -> Source b

You can transform a Source with a Process.

Alternately you can view this as capping the Source end of a Process, yielding a new Source.

cap l r = l <~ r

iterated :: (a -> a) -> a -> Source a

iterated f x returns an infinite source of repeated applications of f to x

replicated :: Int -> a -> Source a

replicated n x is a source of x emitted n time(s)

enumerateFromTo :: (Enum a, Eq a) => a -> a -> Source a

Enumerate from a value to a final value, inclusive, via succ

unfold :: (r -> Maybe (a, r)) -> r -> Source a

unfold k seed The function takes the element and returns Nothing if it is done producing values or returns Just (a,r), in which case, a is yielded and r is used as the next element in a recursive call.

unfoldT :: Monad m => (r -> m (Maybe (a, r))) -> r -> SourceT m a

Effectful unfold variant.