Safe Haskell	Trustworthy
Language	Haskell2010

GHC.Internal.Data.Functor.Utils

Synopsis

newtype Max a = Max {
- getMax :: Maybe a
}
newtype Min a = Min {
- getMin :: Maybe a
}
newtype StateL s a = StateL {
- runStateL :: s -> (s, a)
}
newtype StateR s a = StateR {
- runStateR :: s -> (s, a)
}
newtype StateT s (m :: Type -> Type) a = StateT {
- runStateT :: s -> m (s, a)
}
(#.) :: Coercible b c => (b -> c) -> (a -> b) -> a -> c

Documentation

newtype Max a #

Constructors

Max
Fields getMax :: Maybe a

Instances

Instances details

Ord a => Monoid (Max a) #	Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods mempty :: Max a # mappend :: Max a -> Max a -> Max a # mconcat :: [Max a] -> Max a #
Ord a => Semigroup (Max a) #	Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #

newtype Min a #

Constructors

Min
Fields getMin :: Maybe a

Instances

Instances details

Ord a => Monoid (Min a) #	Since: base-4.8.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods mempty :: Min a # mappend :: Min a -> Min a -> Min a # mconcat :: [Min a] -> Min a #
Ord a => Semigroup (Min a) #	Since: base-4.11.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (<>) :: Min a -> Min a -> Min a # sconcat :: NonEmpty (Min a) -> Min a # stimes :: Integral b => b -> Min a -> Min a #

newtype StateL s a #

Constructors

StateL
Fields runStateL :: s -> (s, a)

Instances

Instances details

Applicative (StateL s) #	Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods pure :: a -> StateL s a # (<>) :: StateL s (a -> b) -> StateL s a -> StateL s b # liftA2 :: (a -> b -> c) -> StateL s a -> StateL s b -> StateL s c # (>) :: StateL s a -> StateL s b -> StateL s b # (<*) :: StateL s a -> StateL s b -> StateL s a #
Functor (StateL s) #	Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateL s a -> StateL s b # (<$) :: a -> StateL s b -> StateL s a #

newtype StateR s a #

Constructors

StateR
Fields runStateR :: s -> (s, a)

Instances

Instances details

Applicative (StateR s) #	Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods pure :: a -> StateR s a # (<>) :: StateR s (a -> b) -> StateR s a -> StateR s b # liftA2 :: (a -> b -> c) -> StateR s a -> StateR s b -> StateR s c # (>) :: StateR s a -> StateR s b -> StateR s b # (<*) :: StateR s a -> StateR s b -> StateR s a #
Functor (StateR s) #	Since: base-4.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateR s a -> StateR s b # (<$) :: a -> StateR s b -> StateR s a #

newtype StateT s (m :: Type -> Type) a #

A state transformer monad parameterized by the state and inner monad. The implementation is copied from the transformers package with the return tuple swapped.

Since: base-4.18.0.0

Constructors

StateT
Fields runStateT :: s -> m (s, a)

Instances

Instances details

Monad m => Applicative (StateT s m) #	Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
Monad m => Functor (StateT s m) #	Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b # (<$) :: a -> StateT s m b -> StateT s m a #
Monad m => Monad (StateT s m) #	Since: base-4.18.0.0
Instance details Defined in GHC.Internal.Data.Functor.Utils Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b # (>>) :: StateT s m a -> StateT s m b -> StateT s m b # return :: a -> StateT s m a #

(#.) :: Coercible b c => (b -> c) -> (a -> b) -> a -> c #