| Safe Haskell | None |
|---|
Ivory.Language.Loop
- breakOut :: GetBreaks eff ~ Break => Ivory eff ()
- loop :: forall eff n a. SingI n => (Expr -> LoopIncr) -> Ix n -> Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()
- upTo :: SingI n => Ix n -> Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()
- downTo :: SingI n => Ix n -> Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()
- for :: forall eff n a. SingI n => Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()
- times :: forall eff n a. SingI n => Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()
- arrayMap :: forall eff n a. SingI n => (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()
- forever :: Ivory (AllowBreak eff) () -> Ivory eff ()
Documentation
loop :: forall eff n a. SingI n => (Expr -> LoopIncr) -> Ix n -> Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()Source
for :: forall eff n a. SingI n => Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()Source
Run the computation n times, where for
n :: Ix m, 0 <= n < m.
Indexes increment from 0 to n-1.
times :: forall eff n a. SingI n => Ix n -> (Ix n -> Ivory (AllowBreak eff) a) -> Ivory eff ()Source
Run the computation n times, where for
n :: Ix m, 0 <= n < m.
Indexes decrement from n-1 to 0.
forever :: Ivory (AllowBreak eff) () -> Ivory eff ()Source