EV Utilities

Spawn a fiber into a nursery, similar to ev/go.

Suspend the current fiber until the nursery is emptied.

Run instances of a function over multiple threads. On failures, restart the failed thread. Normal function returns will not trigger a restart.

Group a number of fibers into a single object for structured concurrency

Call a function n times (in parallel) for side effects. Each function is called with an integer argument indicating a fiber index. Returns nil.

Executes a dag by calling f on every node in the graph. Can set the number of workers for parallel execution. The graph is represented as a table mapping nodes to arrays of child nodes. Each node will only be evaluated after all children have been evaluated. Modifying `dag` inside `f` will not affect the scheduling of workers. Returns a table mapping each node to the result of `(f node)`.

Map `f` over data in parallel, optionally limiting parallelism to `n` workers.

Function form of `ev/gather`. If any of the sibling fibers error, all other siblings will be canceled. Returns the gathered results in an array. `data` can be any indexed data structure.

Similar to pmap-full, but only runs work n-ways parallel.

Similar to ev/spawn but associate spawned fibers with a nursery

Wait forever until the current fiber is canceled, and then run some cleanup code.