Safe Haskell	Safe-Inferred
Language	GHC2021

Box.Functor

Description

Some higher-kinded Functor types that make do until we get FunctorOf

Synopsis

class FFunctor (h :: (Type -> Type) -> Type -> Type) where
- foist :: (forall x. f x -> g x) -> h f a -> h g a
class FoldableM (t :: (Type -> Type) -> Type -> Type) where
- foldrM :: Monad m => (a -> m b -> m b) -> m b -> t m a -> m b

Documentation

class FFunctor (h :: (Type -> Type) -> Type -> Type) where Source #

An endofunctor in the category of endofunctors.

Like MFunctor but without a Monad constraint.

Methods

foist :: (forall x. f x -> g x) -> h f a -> h g a Source #

Instances details

FFunctor Committer Source #
Instance details Defined in Box.Committer Methods foist :: (forall x. f x -> g x) -> Committer f a -> Committer g a Source #
FFunctor Emitter Source #
Instance details Defined in Box.Emitter Methods foist :: (forall x. f x -> g x) -> Emitter f a -> Emitter g a Source #

class FoldableM (t :: (Type -> Type) -> Type -> Type) where Source #

Monadically Foldable

Methods

foldrM :: Monad m => (a -> m b -> m b) -> m b -> t m a -> m b Source #

Instances details

FoldableM Emitter Source #	This fold completes on the first Nothing emitted, which may not be what you want.
Instance details Defined in Box.Emitter Methods foldrM :: Monad m => (a -> m b -> m b) -> m b -> Emitter m a -> m b Source #