LLVM.Extra.Iterator

Documentation

data T r a

Simulates a non-strict list.

Instances

Applicative (T r)

ZipList semantics

Defined in LLVM.Extra.Iterator

Methods

pure :: a -> T r a

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

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

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

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

Functor (T r)

Defined in LLVM.Extra.Iterator

Methods

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

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

consumers

mapM_ :: (a -> CodeGenFunction r ()) -> T r a -> CodeGenFunction r ()

mapState_ :: Phi t => (a -> t -> CodeGenFunction r t) -> T r a -> t -> CodeGenFunction r t

mapStateM_ :: Phi t => (a -> StateT t (CodeGenFunction r) ()) -> T r a -> StateT t (CodeGenFunction r) ()

mapWhileState_ :: Phi t => (a -> t -> CodeGenFunction r (Value Bool, t)) -> T r a -> t -> CodeGenFunction r t

producers

empty :: T r a

singleton :: a -> T r a

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

iterate :: (Phi a, Undefined a) => (a -> CodeGenFunction r a) -> a -> T r a

Attention: This always performs one function call more than necessary. I.e. if f reads from or writes to memory make sure that accessing one more pointer is legal.

countDown :: (Num i, IsConst i, IsInteger i, CmpRet i, IsPrimitive i) => Value i -> T r (Value i)

arrayPtrs :: IsType a => Value (Ptr a) -> T r (Value (Ptr a))

storableArrayPtrs :: C a => Value (Ptr a) -> T r (Value (Ptr a))

modifiers

mapM :: (a -> CodeGenFunction r b) -> T r a -> T r b

mapMaybe :: (Phi b, Undefined b) => (a -> CodeGenFunction r (T b)) -> T r a -> T r b

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

takeWhileJust :: T r (T a) -> T r a

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

cartesian :: (Phi a, Phi b, Undefined a, Undefined b) => T r a -> T r b -> T r (a, b)

take :: (Num i, IsConst i, IsInteger i, CmpRet i, IsPrimitive i) => Value i -> T r a -> T r a

application examples

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

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

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

arrayLoop2 :: (Phi 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 -> CodeGenFunction r s) -> CodeGenFunction r s