monad-schedule: A new, simple, composable concurrency abstraction.
[ concurrency, library, mit ] [ Propose Tags ]
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
which you can further run or schedule to completion as you like.
[Index] [Quick Jump]
- monad-schedule-0.1.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
For package maintainers and hackage trustees
|Versions [RSS]||0.1.0.0, 0.1.1.0, 0.1.2.0|
|Dependencies||base (>=4.13.0 && <=4.17), free (>=5.1), stm (>=2.5), time-domain (>=0.1), transformers (>=0.5) [details]|
|Uploaded||by turion at 2022-06-26T13:23:53Z|
|Downloads||125 total (6 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2022-06-26 [all 1 reports]