Concurrency.par_map.array.go: def of bend-kit-concurrency@0.2.0.0
Import: import bend-kit-concurrency@0.2.0.0/concurrency.bend as Concurrency
Lines 114-123 of bend-kit-concurrency@0.2.0.0/concurrency.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-concurrency@0.2.0.0/concurrency.bend&start_line=114&end_line=123

import Base

# An Array is a balanced tree, so each ANode above depth d is a parallel call.
def par_map.array.go(~A: Type, ~B: Type, ~f: A -> B, a: Array<A>, d: Nat) -> Array<B>:
  match a d:
    case ALeaf{x} _:
      ALeaf{f(x)}
    case ANode{xs, ys} 0n:
      ANode{par_map.array.go(~A, ~B, ~f, xs, 0n), par_map.array.go(~A, ~B, ~f, ys, 0n)}
    case ANode{xs, ys} 1n+ +p:
      lo hi = par_map.array.go(~A, ~B, ~f, xs, p) par_map.array.go(~A, ~B, ~f, ys, p)
      ANode{lo, hi}

Uses (2):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat