def
Task.mapList
{α : Type u_1}
{β : Type u_2}
(f : List α → β)
(tasks : List (Task α))
(prio : Priority := Priority.default)
(sync : Bool := false)
:
Task β
Creates a task that, when all tasks
have finished, computes the result of f
applied to their
results.
Equations
- Task.mapList f tasks prio sync = Task.mapList.go✝ f prio sync tasks []