Fast loops (for when GHC can't optimize forM_)


Version on this page:0.2.0
LTS Haskell 22.16:0.3.0
Stackage Nightly 2024-04-12:0.3.0
Latest on Hackage:0.3.0

See all snapshots loop appears in

MIT licensed and maintained by Niklas Hambüchen
This version can be pinned in stack with:loop-0.2.0@sha256:f105396ac726e8775115f4baf35eb1d29dea706f88ed73ba5aa227626269d268,2448

Module documentation for 0.2.0

Depends on 1 package(full list with versions):
Used by 1 package in lts-3.22(full list with versions):

This package provides a convenient and fast alternative to the common `forM_ [1..n]` idiom, which in many cases GHC cannot fuse to efficient code.

See https://ghc.haskell.org/trac/ghc/ticket/8763.