LLVM.Extra.MaybeContinuation

Maybe transformer datatype implemented in continuation passing style.

Documentation

newtype T r z a

Isomorphic to ReaderT (CodeGenFunction r z) (ContT z (CodeGenFunction r)) a, where the reader provides the block for Nothing and the continuation part manages the Just.

Constructors

Cons

Fields

• resolve :: CodeGenFunction r z -> (a -> CodeGenFunction r z) -> CodeGenFunction r z

Instances

MonadIO (T r z)

Defined in LLVM.Extra.MaybeContinuation

Methods

liftIO :: IO a -> T r z a

Applicative (T r z)

Defined in LLVM.Extra.MaybeContinuation

Methods

pure :: a -> T r z a

(<*>) :: T r z (a -> b) -> T r z a -> T r z b

liftA2 :: (a -> b -> c) -> T r z a -> T r z b -> T r z c

(*>) :: T r z a -> T r z b -> T r z b

(<*) :: T r z a -> T r z b -> T r z a

Functor (T r z)

Defined in LLVM.Extra.MaybeContinuation

Methods

fmap :: (a -> b) -> T r z a -> T r z b

(<$) :: a -> T r z b -> T r z a

Monad (T r z)

Defined in LLVM.Extra.MaybeContinuation

Methods

(>>=) :: T r z a -> (a -> T r z b) -> T r z b

(>>) :: T r z a -> T r z b -> T r z b

return :: a -> T r z a

map :: (a -> CodeGenFunction r b) -> T r z a -> T r z b

withBool :: Phi z => Value Bool -> CodeGenFunction r a -> T r z a

counterpart to Data.Maybe.HT.toMaybe

fromBool :: Phi z => CodeGenFunction r (Value Bool, a) -> T r z a

toBool :: Undefined a => T r (Value Bool, a) a -> CodeGenFunction r (Value Bool, a)

fromPlainMaybe :: Phi z => T a -> T r z a

fromMaybe :: Phi z => CodeGenFunction r (T a) -> T r z a

toMaybe :: Undefined a => T r (T a) a -> CodeGenFunction r (T a)

isJust :: T r (Value Bool) a -> CodeGenFunction r (Value Bool)

lift :: CodeGenFunction r a -> T r z a

guard :: Phi z => Value Bool -> T r z ()

just :: a -> T r z a

nothing :: T r z a

bind :: T r z a -> (a -> T r z b) -> T r z b

onFail :: CodeGenFunction r () -> T r z a -> T r z a

Run an exception handler if the Maybe-action fails. The exception is propagated. That is, the handler is intended for a cleanup procedure.

alternative :: (Phi z, Undefined a) => T r (T a) a -> T r (T a) a -> T r z a

Run the first action and if that fails run the second action. If both actions fail, then the composed action fails, too.

fixedLengthLoop :: (Phi s, Undefined s, Num i, IsConst i, IsInteger i, CmpRet i, IsPrimitive i) => Value i -> s -> (s -> T r (T s) s) -> CodeGenFunction r (Value i, T s)

arrayLoop :: (Phi s, Undefined s, IsType a, Num i, IsConst i, IsInteger i, CmpRet i, IsPrimitive i) => Value i -> Value (Ptr a) -> s -> (Value (Ptr a) -> s -> T r (T (Value (Ptr a), s)) s) -> CodeGenFunction r (Value i, T s)

If the returned position is smaller than the array size, then returned final state is nothing.

arrayLoop2 :: (Phi s, Undefined s, IsType a, IsType b, Num i, IsConst i, IsInteger i, CmpRet i, IsPrimitive i) => Value i -> Value (Ptr a) -> Value (Ptr b) -> s -> (Value (Ptr a) -> Value (Ptr b) -> s -> T r (T (Value (Ptr a), (Value (Ptr b), s))) s) -> CodeGenFunction r (Value i, T s)