monad-schedule: A new, simple, composable concurrency abstraction.
A monad m
is said to allow scheduling if you can pass a number of actions m a
to it,
and those can be executed at the same time concurrently.
You can observe the result of the actions after some time:
Some actions will complete first, and the results of these are returned then as a list
.
Other actions are still running, and for these you will receive continuations of type NonEmpty
am a
,
which you can further run or schedule to completion as you like.
Modules
[Index] [Quick Jump]
Flags
Manual Flags
Name | Description | Default |
---|---|---|
dev | Enable warnings as errors. Active on ci. | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- monad-schedule-0.2.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.2.2, 0.2, 0.2.0.1 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.16.0 && <4.21.0), base-compat (>=0.13 && <0.14), free (>=5.1 && <5.3), operational (>=0.2.4 && <0.3), stm (>=2.5 && <2.6), time-domain (>=0.1 && <0.2), transformers (>=0.5 && <0.7) [details] |
License | MIT |
Author | Manuel Bärenz |
Maintainer | programming@manuelbaerenz.de |
Category | Concurrency |
Source repo | head: git clone https://github.com/turion/monad-schedule |
Uploaded | by turion at 2024-07-30T09:36:55Z |
Distributions | LTSHaskell:0.1.2.2, NixOS:0.2.0.1, Stackage:0.2.0.1 |
Reverse Dependencies | 3 direct, 1 indirect [details] |
Downloads | 558 total (27 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2024-07-30 [all 1 reports] |