Data.Machine.Mealy

newtype MealyT f s a

Instances

• (Monad f) => Functor (MealyT f s)
• (Monad f) => Apply (MealyT f s)
• (Monad f) => Applicative (MealyT f s)
• (Monad f) => Profunctor (MealyT f)
• (Monad f) => Strong (MealyT f)
• (Monad f) => Semigroup (MealyT f s a)
• (Monad f) => Monoid (MealyT f s a)
• (Monad f) => Semigroupoid (MealyT f)
• (Monad f) => Category (MealyT f)
• (Monad f) => Bind (MealyT f s)
• (Monad f) => Monad (MealyT f s)
• (Monad f) => Alt (MealyT f s)
• (Monad f) => Plus (MealyT f s)
• (Monad f) => Alternative (MealyT f s)
• (Monad f) => MonadZero (MealyT f s)
• (Monad f) => MonadPlus (MealyT f s)
• (Monad f, MonadEff eff f) => MonadEff eff (MealyT f s)
• (Monad f) => Lazy (MealyT f s a)

runMealyT :: forall a s f. MealyT f s a -> s -> f (Step f s a)

data Step f s a

Constructors

• Emit a (MealyT f s a)
• Halt

type Source f s = MealyT f Unit s

type Sink f a = MealyT f a Unit

source :: forall s f. Monad f => f s -> Source f s

sink :: forall a f. Monad f => (a -> f Unit) -> Sink f a

runMealy :: forall f. Monad f => MealyT f Unit Unit -> f Unit

stepMealy :: forall a s f. Monad f => s -> MealyT f s a -> f (Step f s a)

pureMealy :: forall a s f. Applicative f => (s -> Step f s a) -> MealyT f s a

mealy :: forall a s f. Applicative f => (s -> f (Step f s a)) -> MealyT f s a

halt :: forall a s f. Applicative f => MealyT f s a

take :: forall a s f. Monad f => Int -> MealyT f s a -> MealyT f s a

drop :: forall a s f. Monad f => Int -> MealyT f s a -> MealyT f s a

loop :: forall a s f. Monad f => MealyT f s a -> MealyT f s a

zipWith :: forall c b a s f. Monad f => (a -> b -> c) -> MealyT f s a -> MealyT f s b -> MealyT f s c

scanl :: forall b a s f. Monad f => (b -> a -> b) -> b -> MealyT f s a -> MealyT f s b

collect :: forall a s f. Monad f => MealyT f s a -> MealyT f s (List a)

singleton :: forall a s f. Monad f => a -> MealyT f s a

fromMaybe :: forall a s f. Monad f => Maybe a -> MealyT f s a

fromArray :: forall a s f. Monad f => Array a -> MealyT f s a

wrapEffect :: forall a s f. Monad f => f a -> MealyT f s a

msplit :: forall a s f. Monad f => MealyT f s a -> MealyT f s (Maybe (Tuple a (MealyT f s a)))

interleave :: forall a s f. Monad f => MealyT f s a -> MealyT f s a -> MealyT f s a

ifte :: forall b a s f. Monad f => MealyT f s a -> (a -> MealyT f s b) -> MealyT f s b -> MealyT f s b

when :: forall b a s f. Monad f => MealyT f s a -> (a -> MealyT f s b) -> MealyT f s b