使用辅助函数将“承诺”作为一个值x,将一个“承诺”作为一组值acc:
module Async =
let sequence x acc = async {
let! x = x
let! y = acc
return x :: y
}
我们可以tasks按它们的“锁定 ID”异步分组,稍微清理一下结果列表,然后将sequence每个组分成一个async“包含”其组结果列表的单个组。然后并行处理此列表。一旦ts : 'b list []可用,我们将其展平:
let wrapTasks tasks = async {
let! ts =
tasks
|> List.groupBy fst
|> List.map (snd >> List.map snd)
|> List.map (fun asyncs -> List.foldBack Async.sequence asyncs (async { return [] }))
|> Async.Parallel
return ts |> List.ofArray |> List.collect id
}
这可以用例如测试
List.init 50 (fun i -> i % 5, async {
let now = System.DateTime.UtcNow.Ticks
do! Async.Sleep 10
return i, now })
|> wrapTasks
|> Async.RunSynchronously
|> List.groupBy snd
|> List.map (fun (t, rs) -> t, rs |> List.map fst)
|> List.sort
通过改变除数,我们可以调整并行度并说服自己该函数按预期工作:-)
[(636766393199727614L, [0; 1; 2; 3; 4]);
(636766393199962986L, [5; 6; 7; 8; 9]);
(636766393200068008L, [10; 11; 12; 13; 14]);
(636766393200278385L, [15; 16; 17; 18; 19]);
(636766393200382690L, [20; 21; 22; 23; 24]);
(636766393200597692L, [25; 26; 27; 28; 29]);
(636766393200703235L, [30; 31; 32; 33; 34]);
(636766393200918241L, [35; 36; 37; 38; 39]);
(636766393201027938L, [40; 41; 42; 43; 44]);
(636766393201133307L, [45; 46; 47; 48; 49])]
完全披露:为了得到这个好结果,我不得不执行几次测试。通常数字会有点偏。