Control.Selective.Free

newtype FreeS :: (Type -> Type) -> Type -> Typenewtype FreeS f a

A simple free Selective.

Constructors

• FreeS (forall g. Selective g => (f ~> g) -> g a)

Instances

• Functor (FreeS f)
• Apply (FreeS f)
• Select (FreeS f)
• Applicative (FreeS f)
• Selective (FreeS f)

liftF :: forall @f. f ~> (FreeS f)

Lift a computation into the free Selective.

runFree :: forall @g @f. Selective g => (f ~> g) -> ((FreeS f) ~> g)

Run a free computation.

runFreeA :: forall @g @f. Applicative g => (f ~> g) -> ((FreeS f) ~> g)

Run a free computation in an applicative via SelectA

runFreeM :: forall @g @f. Monad g => (f ~> g) -> ((FreeS f) ~> g)

Run a free computation in a monad via SelectM

runFreeTS :: forall @g @f. Traversable g => Applicative g => (f ~> g) -> ((FreeS f) ~> g)

Run a free computation in a traversable via SelectTS

runFreeTM :: forall @g @f. Traversable g => Applicative g => (f ~> g) -> ((FreeS f) ~> g)

Run a free computation in a traversable via SelectTM

foldOver :: forall @m @f @a. Monoid m => (forall x. f x -> m) -> FreeS f a -> m

Fold together every possible effect.

effectsOver :: forall @f @a. Functor f => FreeS f a -> Array (f Unit)

Collect every possible effect into an Array.

countOver :: forall @f @a. FreeS f a -> Int

Count how many possible effects there are.

foldUnder :: forall @m @f @a. Monoid m => (forall x. f x -> m) -> FreeS f a -> m

Fold together every required effect.

effectsUnder :: forall @f @a. Functor f => FreeS f a -> Array (f Unit)

Collect every required effect into an Array.

countUnder :: forall @f @a. FreeS f a -> Int

Count how many required effects there are.

getPure :: forall @a @f. FreeS f a -> Maybe a

Extract a pure value if there are no effects.