{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/loops","name":"loops","description":"loops is a library for fast, imperative-style loops with a clean syntax.\n\nFeatures\n\nFast, imperative-style loops with a clean syntax. Bind (\u003e\u003e=) nests loops,\nso in do-notation, each subsequent line is nested inside loops that appear\nabove it.\n\nIteration over common data structures, like lists and vectors.\n\nRobust performance because there is no reliance on fusion.\n\nNEW! Loop-unrolling to arbitrary depth. Unrollable loop combinators are\nprovided in Control.Monad.Loop.Unroll. (The simple, \"rolled\" interface is\nstill provided in Control.Monad.Loop.) The unrolling depth set at the call\nsite at compile time. My benchmarks show that folding over unrolled loops is\nup to 25% faster than folding over unboxed vectors!\n\nFor best performance, please compile your code with -O2. You should also\nuse GHC's LLVM backend if possible; it generally produces faster executables.","version":"0.2.0.2","softwareVersion":"0.2.0.2","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/ttuegel/loops","issueTracker":"https://github.com/ttuegel/loops/issues","keywords":["bsd3","control","library","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"ThomasTuegel"}],"author":[{"@type":"Person","name":"ThomasTuegel"}],"copyrightHolder":[{"@type":"Person","name":"ThomasTuegel"}],"dateCreated":"2014-06-11","dateModified":"2014-06-13","datePublished":"2014-06-13","copyrightYear":2014,"downloadUrl":"https://hackage.haskell.org/package/loops-0.2.0.2/loops-0.2.0.2.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/loops"],"https://www.w3.org/ns/activitystreams#likes":10}