Data.Extensible.Effect

Name-based extensible effects

Base

data Instruction (xs :: [Assoc k (Type -> Type)]) a where

A unit of named effects. This is a variant of (:|) specialised for 'Type -> Type'.

Constructors

Instruction :: !(Membership xs kv) -> TargetOf kv a -> Instruction xs a

Instances

(Monoid w, Lookup xs "Writer" ((,) w)) => MonadWriter w (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

writer :: (a, w) -> Eff xs a

tell :: w -> Eff xs ()

listen :: Eff xs a -> Eff xs (a, w)

pass :: Eff xs (a, w -> w) -> Eff xs a

Lookup xs "State" (State s) => MonadState s (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

get :: Eff xs s

put :: s -> Eff xs ()

state :: (s -> (a, s)) -> Eff xs a

Lookup xs "Reader" ((:~:) r) => MonadReader r (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

ask :: Eff xs r

local :: (r -> r) -> Eff xs a -> Eff xs a

reader :: (r -> a) -> Eff xs a

Lookup xs "Either" (Const e :: Type -> Type) => MonadError e (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

throwError :: e -> Eff xs a

catchError :: Eff xs a -> (e -> Eff xs a) -> Eff xs a

(Monoid e, Lookup xs "Either" (Const e :: Type -> Type)) => Alternative (Eff xs)

A bit dubious

Defined in Data.Extensible.Effect.Default

Methods

empty :: Eff xs a

(<|>) :: Eff xs a -> Eff xs a -> Eff xs a

some :: Eff xs a -> Eff xs [a]

many :: Eff xs a -> Eff xs [a]

(Monoid e, Lookup xs "Either" (Const e :: Type -> Type)) => MonadPlus (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

mzero :: Eff xs a

mplus :: Eff xs a -> Eff xs a -> Eff xs a

(MonadIO m, Lookup xs "IO" m) => MonadIO (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

liftIO :: IO a -> Eff xs a

(MonadThrow m, Lookup xs "IO" m) => MonadThrow (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

throwM :: Exception e => e -> Eff xs a

(MonadCatch m, Lookup xs "IO" m) => MonadCatch (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

catch :: Exception e => Eff xs a -> (e -> Eff xs a) -> Eff xs a

MonadCont (Eff (ContDef r (Eff xs) ': xs))

Defined in Data.Extensible.Effect.Default

Methods

callCC :: ((a -> Eff (ContDef r (Eff xs) ': xs) b) -> Eff (ContDef r (Eff xs) ': xs) a) -> Eff (ContDef r (Eff xs) ': xs) a

(MonadResource m, Lookup xs "IO" m) => MonadResource (Eff xs)

Defined in Data.Extensible.Effect.Default

Methods

liftResourceT :: ResourceT IO a -> Eff xs a

type Eff xs = Skeleton (Instruction xs)

The extensible operational monad

liftEff :: forall s t xs a. Lookup xs s t => Proxy s -> t a -> Eff xs a

Lift an instruction onto an Eff action.

liftsEff :: forall s t xs a r. Lookup xs s t => Proxy s -> t a -> (a -> r) -> Eff xs r

Lift an instruction onto an Eff action and apply a function to the result.

hoistEff :: forall s t xs a. Lookup xs s t => Proxy s -> (forall x. t x -> t x) -> Eff xs a -> Eff xs a

Censor a specific type of effects in an action.

castEff :: IncludeAssoc ys xs => Eff xs a -> Eff ys a

Upcast an action.

Step-wise handling

newtype Interpreter f g

Transformation between effects

Constructors

Interpreter

Fields

• runInterpreter :: forall a. g a -> f a

handleEff :: RecordOf (Interpreter m) xs -> Eff xs a -> MonadView m (Eff xs) a

Process an Eff action using a record of Interpreters.

Peeling

peelEff

Arguments

:: forall k t xs a r. Rebinder xs r

Re-bind an unrelated action

-> (a -> r)

return the result

-> (forall x. t x -> (x -> r) -> r)

Handle the foremost type of an action

-> Eff ((k >: t) ': xs) a

-> r

Build a relay-style handler from a triple of functions.

runStateEff = peelEff1 (a s -> return (a, s))
  (m k s -> let (a, s') = runState m s in k a s')

type Rebinder xs r = forall x. Instruction xs x -> (x -> r) -> r

A function to bind an Instruction in peelEff.

rebindEff0 :: Rebinder xs (Eff xs r)

A common value for the second argument of peelEff. Binds an instruction directly.

peelEff0

Arguments

:: forall k t xs a r. (a -> Eff xs r)

return the result

-> (forall x. t x -> (x -> Eff xs r) -> Eff xs r)

Handle the foremost type of an action

-> Eff ((k >: t) ': xs) a

-> Eff xs r

peelEff specialised for continuations with no argument

rebindEff1 :: Rebinder xs (a -> Eff xs r)

A pre-defined value for the second argument of peelEff. Preserves the argument of the continuation.

peelEff1

Arguments

:: forall k t xs a b r. (a -> b -> Eff xs r)

return the result

-> (forall x. t x -> (x -> b -> Eff xs r) -> b -> Eff xs r)

Handle the foremost type of an action

-> Eff ((k >: t) ': xs) a

-> b

-> Eff xs r

peelEff specialised for 1-argument continuation

rebindEff2 :: Rebinder xs (a -> b -> Eff xs r)

A pre-defined value for the second argument of peelEff. Preserves two arguments of the continuation.

leaveEff :: Eff '[] a -> a

Reveal the final result of Eff.

retractEff :: forall k m a. Monad m => Eff '[k >: m] a -> m a

Tear down an action using the Monad instance of the instruction.

Anonymous actions

data Action (args :: [Type]) a r where

Anonymous representation of instructions.

Constructors

AResult :: Action '[] a a

AArgument :: x -> Action xs a r -> Action (x ': xs) a r

type family Function args r :: Type where ...

Function [a, b, c] r is a -> b -> c -> r

Equations

Function '[] r = r

Function (x ': xs) r = x -> Function xs r

runAction :: Function xs (f a) -> Action xs a r -> f r

Pass the arguments of Action to the supplied function.

(@!?) :: FieldName k -> Function xs (f a) -> Field (Interpreter f) (k :> Action xs a) infix 1

Create a Field of a Interpreter for an Action.

peelAction

Arguments

:: forall k ps q xs a r. (forall x. Instruction xs x -> (x -> r) -> r)

Re-bind an unrelated action

-> (a -> r)

return the result

-> Function ps ((q -> r) -> r)

Handle the foremost action

-> Eff ((k >: Action ps q) ': xs) a

-> r

Specialised version of peelEff for Actions. You can pass a function a -> b -> ... -> (q -> r) -> r as a handler for Action '[a, b, ...] q.

peelAction0

Arguments

:: forall k ps q xs a. Function ps (Eff xs q)

Handle the foremost action

-> Eff ((k >: Action ps q) ': xs) a

-> Eff xs a

Non continuation-passing variant of peelAction.

transformers-compatible actions and handlers

Reader

type ReaderEff = (:~:)

The reader monad is characterised by a type equality between the result type and the enviroment type.

askEff :: forall k r xs. Lookup xs k (ReaderEff r) => Proxy k -> Eff xs r

Fetch the environment.

asksEff :: forall k r xs a. Lookup xs k (ReaderEff r) => Proxy k -> (r -> a) -> Eff xs a

Pass the environment to a function.

localEff :: forall k r xs a. Lookup xs k (ReaderEff r) => Proxy k -> (r -> r) -> Eff xs a -> Eff xs a

Modify the enviroment locally.

runReaderEff :: forall k r xs a. Eff ((k >: ReaderEff r) ': xs) a -> r -> Eff xs a

Run the frontal reader effect.

State

type State s = StateT s Identity

A state monad parameterized by the type s of the state to carry.

The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

getEff :: forall k s xs. Lookup xs k (State s) => Proxy k -> Eff xs s

Get the current state.

getsEff :: forall k s a xs. Lookup xs k (State s) => Proxy k -> (s -> a) -> Eff xs a

Pass the current state to a function.

putEff :: forall k s xs. Lookup xs k (State s) => Proxy k -> s -> Eff xs ()

Replace the state with a new value.

modifyEff :: forall k s xs. Lookup xs k (State s) => Proxy k -> (s -> s) -> Eff xs ()

Modify the state.

stateEff :: forall k s xs a. Lookup xs k (State s) => Proxy k -> (s -> (a, s)) -> Eff xs a

Lift a state modification function.

runStateEff :: forall k s xs a. Eff ((k >: State s) ': xs) a -> s -> Eff xs (a, s)

Run the frontal state effect.

execStateEff :: forall k s xs a. Eff ((k >: State s) ': xs) a -> s -> Eff xs s

Run the frontal state effect and return the final state.

evalStateEff :: forall k s xs a. Eff ((k >: State s) ': xs) a -> s -> Eff xs a

Run the frontal state effect and return the final result.

Writer

type WriterEff w = (,) w

(,) already is a writer monad.

writerEff :: forall k w xs a. Lookup xs k (WriterEff w) => Proxy k -> (a, w) -> Eff xs a

Write the second element and return the first element.

tellEff :: forall k w xs. Lookup xs k (WriterEff w) => Proxy k -> w -> Eff xs ()

Write a value.

listenEff :: forall k w xs a. (Lookup xs k (WriterEff w), Monoid w) => Proxy k -> Eff xs a -> Eff xs (a, w)

Squash the outputs into one step and return it.

passEff :: forall k w xs a. (Lookup xs k (WriterEff w), Monoid w) => Proxy k -> Eff xs (a, w -> w) -> Eff xs a

Modify the output using the function in the result.

runWriterEff :: forall k w xs a. Monoid w => Eff ((k >: WriterEff w) ': xs) a -> Eff xs (a, w)

Run the frontal writer effect.

execWriterEff :: forall k w xs a. Monoid w => Eff ((k >: WriterEff w) ': xs) a -> Eff xs w

Run the frontal state effect.

Maybe

type MaybeEff = Const ()

An effect with no result

nothingEff :: Lookup xs k MaybeEff => Proxy k -> Eff xs a

Break out of the computation. Similar to Nothing.

runMaybeEff :: forall k xs a. Eff ((k >: MaybeEff) ': xs) a -> Eff xs (Maybe a)

Run an effect which may fail in the name of k.

Either

type EitherEff = Const

Throwing an exception

throwEff :: Lookup xs k (EitherEff e) => Proxy k -> e -> Eff xs a

Throw an exception e, throwing the rest of the computation away.

catchEff :: forall k e xs a. Lookup xs k (EitherEff e) => Proxy k -> Eff xs a -> (e -> Eff xs a) -> Eff xs a

Attach a handler for an exception.

runEitherEff :: forall k e xs a. Eff ((k >: EitherEff e) ': xs) a -> Eff xs (Either e a)

Run an action and abort on throwEff.

mapLeftEff :: (e -> e') -> Eff ((k >: EitherEff e) ': xs) a -> Eff ((k >: EitherEff e') ': xs) a

Take a function and applies it to an Either effect iff the effect takes the form Left _.

Iter

data Identity a

Identity functor and monad. (a non-strict monad)

Since: base-4.8.0.0

Instances

Monad Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b

(>>) :: Identity a -> Identity b -> Identity b

return :: a -> Identity a

Functor Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b

(<$) :: a -> Identity b -> Identity a

MonadFix Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

mfix :: (a -> Identity a) -> Identity a

Applicative Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

pure :: a -> Identity a

(<*>) :: Identity (a -> b) -> Identity a -> Identity b

liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c

(*>) :: Identity a -> Identity b -> Identity b

(<*) :: Identity a -> Identity b -> Identity a

Foldable Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

fold :: Monoid m => Identity m -> m

foldMap :: Monoid m => (a -> m) -> Identity a -> m

foldMap' :: Monoid m => (a -> m) -> Identity a -> m

foldr :: (a -> b -> b) -> b -> Identity a -> b

foldr' :: (a -> b -> b) -> b -> Identity a -> b

foldl :: (b -> a -> b) -> b -> Identity a -> b

foldl' :: (b -> a -> b) -> b -> Identity a -> b

foldr1 :: (a -> a -> a) -> Identity a -> a

foldl1 :: (a -> a -> a) -> Identity a -> a

toList :: Identity a -> [a]

null :: Identity a -> Bool

length :: Identity a -> Int

elem :: Eq a => a -> Identity a -> Bool

maximum :: Ord a => Identity a -> a

minimum :: Ord a => Identity a -> a

sum :: Num a => Identity a -> a

product :: Num a => Identity a -> a

Traversable Identity

Since: base-4.9.0.0

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b)

sequenceA :: Applicative f => Identity (f a) -> f (Identity a)

mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b)

sequence :: Monad m => Identity (m a) -> m (Identity a)

Comonad Identity

Defined in Control.Comonad

Methods

extract :: Identity a -> a

duplicate :: Identity a -> Identity (Identity a)

extend :: (Identity a -> b) -> Identity a -> Identity b

ComonadApply Identity

Defined in Control.Comonad

Methods

(<@>) :: Identity (a -> b) -> Identity a -> Identity b

(@>) :: Identity a -> Identity b -> Identity b

(<@) :: Identity a -> Identity b -> Identity a

Hashable1 Identity

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Identity a -> Int

Unbox a => Vector Vector (Identity a)

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Identity a) -> m (Vector (Identity a))

basicUnsafeThaw :: PrimMonad m => Vector (Identity a) -> m (Mutable Vector (PrimState m) (Identity a))

basicLength :: Vector (Identity a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Identity a) -> Vector (Identity a)

basicUnsafeIndexM :: Monad m => Vector (Identity a) -> Int -> m (Identity a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Identity a) -> Vector (Identity a) -> m ()

elemseq :: Vector (Identity a) -> Identity a -> b -> b

Unbox a => MVector MVector (Identity a)

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s (Identity a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Identity a) -> MVector s (Identity a)

basicOverlaps :: MVector s (Identity a) -> MVector s (Identity a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Identity a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Identity a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Identity a -> m (MVector (PrimState m) (Identity a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> m (Identity a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> Identity a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Identity a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Identity a) -> Identity a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Identity a) -> MVector (PrimState m) (Identity a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Identity a) -> MVector (PrimState m) (Identity a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> m (MVector (PrimState m) (Identity a))

Bounded a => Bounded (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

minBound :: Identity a

maxBound :: Identity a

Enum a => Enum (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

succ :: Identity a -> Identity a

pred :: Identity a -> Identity a

toEnum :: Int -> Identity a

fromEnum :: Identity a -> Int

enumFrom :: Identity a -> [Identity a]

enumFromThen :: Identity a -> Identity a -> [Identity a]

enumFromTo :: Identity a -> Identity a -> [Identity a]

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a]

Eq a => Eq (Identity a)

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

(==) :: Identity a -> Identity a -> Bool

(/=) :: Identity a -> Identity a -> Bool

Floating a => Floating (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

pi :: Identity a

exp :: Identity a -> Identity a

log :: Identity a -> Identity a

sqrt :: Identity a -> Identity a

(**) :: Identity a -> Identity a -> Identity a

logBase :: Identity a -> Identity a -> Identity a

sin :: Identity a -> Identity a

cos :: Identity a -> Identity a

tan :: Identity a -> Identity a

asin :: Identity a -> Identity a

acos :: Identity a -> Identity a

atan :: Identity a -> Identity a

sinh :: Identity a -> Identity a

cosh :: Identity a -> Identity a

tanh :: Identity a -> Identity a

asinh :: Identity a -> Identity a

acosh :: Identity a -> Identity a

atanh :: Identity a -> Identity a

log1p :: Identity a -> Identity a

expm1 :: Identity a -> Identity a

log1pexp :: Identity a -> Identity a

log1mexp :: Identity a -> Identity a

Fractional a => Fractional (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

(/) :: Identity a -> Identity a -> Identity a

recip :: Identity a -> Identity a

fromRational :: Rational -> Identity a

Integral a => Integral (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

quot :: Identity a -> Identity a -> Identity a

rem :: Identity a -> Identity a -> Identity a

div :: Identity a -> Identity a -> Identity a

mod :: Identity a -> Identity a -> Identity a

quotRem :: Identity a -> Identity a -> (Identity a, Identity a)

divMod :: Identity a -> Identity a -> (Identity a, Identity a)

toInteger :: Identity a -> Integer

Num a => Num (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

(+) :: Identity a -> Identity a -> Identity a

(-) :: Identity a -> Identity a -> Identity a

(*) :: Identity a -> Identity a -> Identity a

negate :: Identity a -> Identity a

abs :: Identity a -> Identity a

signum :: Identity a -> Identity a

fromInteger :: Integer -> Identity a

Ord a => Ord (Identity a)

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

compare :: Identity a -> Identity a -> Ordering

(<) :: Identity a -> Identity a -> Bool

(<=) :: Identity a -> Identity a -> Bool

(>) :: Identity a -> Identity a -> Bool

(>=) :: Identity a -> Identity a -> Bool

max :: Identity a -> Identity a -> Identity a

min :: Identity a -> Identity a -> Identity a

Read a => Read (Identity a)

This instance would be equivalent to the derived instances of the Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

readsPrec :: Int -> ReadS (Identity a)

readList :: ReadS [Identity a]

readPrec :: ReadPrec (Identity a)

readListPrec :: ReadPrec [Identity a]

Real a => Real (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

toRational :: Identity a -> Rational

RealFloat a => RealFloat (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

floatRadix :: Identity a -> Integer

floatDigits :: Identity a -> Int

floatRange :: Identity a -> (Int, Int)

decodeFloat :: Identity a -> (Integer, Int)

encodeFloat :: Integer -> Int -> Identity a

exponent :: Identity a -> Int

significand :: Identity a -> Identity a

scaleFloat :: Int -> Identity a -> Identity a

isNaN :: Identity a -> Bool

isInfinite :: Identity a -> Bool

isDenormalized :: Identity a -> Bool

isNegativeZero :: Identity a -> Bool

isIEEE :: Identity a -> Bool

atan2 :: Identity a -> Identity a -> Identity a

RealFrac a => RealFrac (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

properFraction :: Integral b => Identity a -> (b, Identity a)

truncate :: Integral b => Identity a -> b

round :: Integral b => Identity a -> b

ceiling :: Integral b => Identity a -> b

floor :: Integral b => Identity a -> b

Show a => Show (Identity a)

This instance would be equivalent to the derived instances of the Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

showsPrec :: Int -> Identity a -> ShowS

show :: Identity a -> String

showList :: [Identity a] -> ShowS

Ix a => Ix (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

range :: (Identity a, Identity a) -> [Identity a]

index :: (Identity a, Identity a) -> Identity a -> Int

unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int

inRange :: (Identity a, Identity a) -> Identity a -> Bool

rangeSize :: (Identity a, Identity a) -> Int

unsafeRangeSize :: (Identity a, Identity a) -> Int

Generic (Identity a)

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Associated Types

type Rep (Identity a) :: Type -> Type

Methods

from :: Identity a -> Rep (Identity a) x

to :: Rep (Identity a) x -> Identity a

Semigroup a => Semigroup (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

(<>) :: Identity a -> Identity a -> Identity a

sconcat :: NonEmpty (Identity a) -> Identity a

stimes :: Integral b => b -> Identity a -> Identity a

Monoid a => Monoid (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

mempty :: Identity a

mappend :: Identity a -> Identity a -> Identity a

mconcat :: [Identity a] -> Identity a

Hashable a => Hashable (Identity a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Identity a -> Int

hash :: Identity a -> Int

Storable a => Storable (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

sizeOf :: Identity a -> Int

alignment :: Identity a -> Int

peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a)

pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Identity a)

pokeByteOff :: Ptr b -> Int -> Identity a -> IO ()

peek :: Ptr (Identity a) -> IO (Identity a)

poke :: Ptr (Identity a) -> Identity a -> IO ()

Bits a => Bits (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

(.&.) :: Identity a -> Identity a -> Identity a

(.|.) :: Identity a -> Identity a -> Identity a

xor :: Identity a -> Identity a -> Identity a

complement :: Identity a -> Identity a

shift :: Identity a -> Int -> Identity a

rotate :: Identity a -> Int -> Identity a

zeroBits :: Identity a

bit :: Int -> Identity a

setBit :: Identity a -> Int -> Identity a

clearBit :: Identity a -> Int -> Identity a

complementBit :: Identity a -> Int -> Identity a

testBit :: Identity a -> Int -> Bool

bitSizeMaybe :: Identity a -> Maybe Int

bitSize :: Identity a -> Int

isSigned :: Identity a -> Bool

shiftL :: Identity a -> Int -> Identity a

unsafeShiftL :: Identity a -> Int -> Identity a

shiftR :: Identity a -> Int -> Identity a

unsafeShiftR :: Identity a -> Int -> Identity a

rotateL :: Identity a -> Int -> Identity a

rotateR :: Identity a -> Int -> Identity a

popCount :: Identity a -> Int

FiniteBits a => FiniteBits (Identity a)

Since: base-4.9.0.0

Defined in Data.Functor.Identity

Methods

finiteBitSize :: Identity a -> Int

countLeadingZeros :: Identity a -> Int

countTrailingZeros :: Identity a -> Int

Incremental a => Incremental (Identity a)

Defined in Data.Incremental

Associated Types

type Delta (Identity a)

Methods

patch :: Identity a -> Delta (Identity a) -> Identity a

diff :: Identity a -> Identity a -> Maybe (Delta (Identity a))

Pretty a => Pretty (Identity a)

>>> pretty (Identity 1)
1

Defined in Prettyprinter.Internal

Methods

pretty :: Identity a -> Doc ann

prettyList :: [Identity a] -> Doc ann

Unbox a => Unbox (Identity a)

Defined in Data.Vector.Unboxed.Base

Generic1 Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Associated Types

type Rep1 Identity :: k -> Type

Methods

from1 :: forall (a :: k). Identity a -> Rep1 Identity a

to1 :: forall (a :: k). Rep1 Identity a -> Identity a

Wrapper Identity

Defined in Data.Extensible.Wrapper

Associated Types

type Repr Identity v

Methods

_Wrapper :: forall f p (v :: k). (Functor f, Profunctor p) => Optic' p f (Identity v) (Repr Identity v)

wrap :: forall (v :: k). Repr Identity v -> Identity v

unwrap :: forall (v :: k). Identity v -> Repr Identity v

newtype MVector s (Identity a)

Defined in Data.Vector.Unboxed.Base

newtype MVector s (Identity a) = MV_Identity (MVector s a)

type Rep (Identity a)

Defined in Data.Functor.Identity

type Rep (Identity a) = D1 ('MetaData "Identity" "Data.Functor.Identity" "base" 'True) (C1 ('MetaCons "Identity" 'PrefixI 'True) (S1 ('MetaSel ('Just "runIdentity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

type Delta (Identity a)

Defined in Data.Incremental

type Delta (Identity a) = Delta a

newtype Vector (Identity a)

Defined in Data.Vector.Unboxed.Base

newtype Vector (Identity a) = V_Identity (Vector a)

type Rep1 Identity

Defined in Data.Functor.Identity

type Rep1 Identity = D1 ('MetaData "Identity" "Data.Functor.Identity" "base" 'True) (C1 ('MetaCons "Identity" 'PrefixI 'True) (S1 ('MetaSel ('Just "runIdentity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))

type Repr Identity (a :: Type)

Defined in Data.Extensible.Wrapper

type Repr Identity (a :: Type) = a

tickEff :: Lookup xs k Identity => Proxy k -> Eff xs ()

Put a milestone on a computation.

runIterEff :: Eff ((k >: Identity) ': xs) a -> Eff xs (Either a (Eff ((k >: Identity) ': xs) a))

Run a computation until the first call of tickEff.

Cont

data ContT (r :: k) (m :: k -> Type) a

The continuation monad transformer. Can be used to add continuation handling to any type constructor: the Monad instance and most of the operations do not require m to be a monad.

ContT is not a functor on the category of monads, and many operations cannot be lifted through it.

Instances

MonadState s m => MonadState s (ContT r m)

Defined in Control.Monad.State.Class

Methods

get :: ContT r m s

put :: s -> ContT r m ()

state :: (s -> (a, s)) -> ContT r m a

MonadReader r' m => MonadReader r' (ContT r m)

Defined in Control.Monad.Reader.Class

Methods

ask :: ContT r m r'

local :: (r' -> r') -> ContT r m a -> ContT r m a

reader :: (r' -> a) -> ContT r m a

MonadTrans (ContT r)

Defined in Control.Monad.Trans.Cont

Methods

lift :: Monad m => m a -> ContT r m a

MonadCont (Eff (ContDef r (Eff xs) ': xs))

Defined in Data.Extensible.Effect.Default

Methods

callCC :: ((a -> Eff (ContDef r (Eff xs) ': xs) b) -> Eff (ContDef r (Eff xs) ': xs) a) -> Eff (ContDef r (Eff xs) ': xs) a

Monad (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

(>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b

(>>) :: ContT r m a -> ContT r m b -> ContT r m b

return :: a -> ContT r m a

Functor (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

fmap :: (a -> b) -> ContT r m a -> ContT r m b

(<$) :: a -> ContT r m b -> ContT r m a

MonadFail m => MonadFail (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

fail :: String -> ContT r m a

Applicative (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

pure :: a -> ContT r m a

(<*>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b

liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c

(*>) :: ContT r m a -> ContT r m b -> ContT r m b

(<*) :: ContT r m a -> ContT r m b -> ContT r m a

MonadIO m => MonadIO (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

liftIO :: IO a -> ContT r m a

MonadThrow m => MonadThrow (ContT r m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> ContT r m a

MonadCont (ContT r m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> ContT r m b) -> ContT r m a) -> ContT r m a

PrimMonad m => PrimMonad (ContT r m)

Since: primitive-0.6.3.0

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ContT r m)

Methods

primitive :: (State# (PrimState (ContT r m)) -> (# State# (PrimState (ContT r m)), a #)) -> ContT r m a

MonadResource m => MonadResource (ContT r m)

Defined in Control.Monad.Trans.Resource.Internal

Methods

liftResourceT :: ResourceT IO a -> ContT r m a

type PrimState (ContT r m)

Defined in Control.Monad.Primitive

type PrimState (ContT r m) = PrimState m

contEff :: Lookup xs k (ContT r m) => Proxy k -> ((a -> m r) -> m r) -> Eff xs a

Place a continuation-passing action.

runContEff :: forall k r xs a. Eff ((k >: ContT r (Eff xs)) ': xs) a -> (a -> Eff xs r) -> Eff xs r

Unwrap a continuation.

callCCEff :: Proxy k -> ((a -> Eff ((k >: ContT r (Eff xs)) ': xs) b) -> Eff ((k >: ContT r (Eff xs)) ': xs) a) -> Eff ((k >: ContT r (Eff xs)) ': xs) a

Call a function with the current continuation as its argument