Data.Functor.Plus

Documentation

class Alt f => Plus f where

Laws:

zero <!> m = m
m <!> zero = m

If extended to an Alternative then zero should equal empty.

Minimal complete definition

zero

Methods

zero :: f a

Instances

Plus []

Defined in Data.Functor.Plus

Methods

zero :: [a]

Plus Maybe

Defined in Data.Functor.Plus

Methods

zero :: Maybe a

Plus IO

Defined in Data.Functor.Plus

Methods

zero :: IO a

Plus Option

Defined in Data.Functor.Plus

Methods

zero :: Option a

Plus First

Defined in Data.Functor.Plus

Methods

zero :: First a

Plus Last

Defined in Data.Functor.Plus

Methods

zero :: Last a

Plus IntMap

Defined in Data.Functor.Plus

Methods

zero :: IntMap a

Plus Seq

Defined in Data.Functor.Plus

Methods

zero :: Seq a

Plus (U1 :: * -> *)

Defined in Data.Functor.Plus

Methods

zero :: U1 a

MonadPlus m => Plus (WrappedMonad m)

Defined in Data.Functor.Plus

Methods

zero :: WrappedMonad m a

Plus (Proxy :: * -> *)

Defined in Data.Functor.Plus

Methods

zero :: Proxy a

Ord k => Plus (Map k)

Defined in Data.Functor.Plus

Methods

zero :: Map k a

Plus f => Plus (Lift f)

Defined in Data.Functor.Plus

Methods

zero :: Lift f a

(Bind f, Monad f) => Plus (MaybeT f)

Defined in Data.Functor.Plus

Methods

zero :: MaybeT f a

(Apply f, Applicative f) => Plus (ListT f)

Defined in Data.Functor.Plus

Methods

zero :: ListT f a

Alternative f => Plus (WrappedApplicative f)

Defined in Data.Functor.Plus

Methods

zero :: WrappedApplicative f a

Plus f => Plus (Rec1 f)

Defined in Data.Functor.Plus

Methods

zero :: Rec1 f a

ArrowPlus a => Plus (WrappedArrow a b)

Defined in Data.Functor.Plus

Methods

zero :: WrappedArrow a b a0

Plus f => Plus (IdentityT f)

Defined in Data.Functor.Plus

Methods

zero :: IdentityT f a

Plus f => Plus (Reverse f)

Defined in Data.Functor.Plus

Methods

zero :: Reverse f a

Plus f => Plus (WriterT w f)

Defined in Data.Functor.Plus

Methods

zero :: WriterT w f a

Plus f => Plus (WriterT w f)

Defined in Data.Functor.Plus

Methods

zero :: WriterT w f a

Plus f => Plus (StateT e f)

Defined in Data.Functor.Plus

Methods

zero :: StateT e f a

Plus f => Plus (StateT e f)

Defined in Data.Functor.Plus

Methods

zero :: StateT e f a

(Bind f, Monad f, Semigroup e, Monoid e) => Plus (ExceptT e f)

Defined in Data.Functor.Plus

Methods

zero :: ExceptT e f a

(Bind f, Monad f, Error e) => Plus (ErrorT e f)

Defined in Data.Functor.Plus

Methods

zero :: ErrorT e f a

Plus f => Plus (Backwards f)

Defined in Data.Functor.Plus

Methods

zero :: Backwards f a

Plus f => Plus (Static f a)

Defined in Data.Semigroupoid.Static

Methods

zero :: Static f a a0

(Plus f, Plus g) => Plus (f :*: g)

Defined in Data.Functor.Plus

Methods

zero :: (f :*: g) a

(Plus f, Plus g) => Plus (Product f g)

Defined in Data.Functor.Plus

Methods

zero :: Product f g a

Plus f => Plus (ReaderT e f)

Defined in Data.Functor.Plus

Methods

zero :: ReaderT e f a

Plus f => Plus (M1 i c f)

Defined in Data.Functor.Plus

Methods

zero :: M1 i c f a

(Plus f, Functor g) => Plus (Compose f g)

Defined in Data.Functor.Plus

Methods

zero :: Compose f g a

Plus f => Plus (RWST r w s f)

Defined in Data.Functor.Plus

Methods

zero :: RWST r w s f a

Plus f => Plus (RWST r w s f)

Defined in Data.Functor.Plus

Methods

zero :: RWST r w s f a

module Data.Functor.Alt