Scan.run.pick: def of bend-parallel@0.1.0.0
Import: import bend-parallel@0.1.0.0/scan.bend as Scan
Lines 207-215 of bend-parallel@0.1.0.0/scan.bend: https://jend.leeeet.dev/read.txt?path=bend-parallel@0.1.0.0/scan.bend&start_line=207&end_line=215

import Base

# Pass 2 by run1 from 2^12 sums up, else on one lane: on the GPU we
# measured, the nested scan's forks cost more than one lane's walk below
# that.
def run.pick(lo: Bool, +inc: Bool, +d: Nat, +e: Nat, r: Two) -> Array<U32> & U32:
  match lo:
    case True{}:
      run0.sums(inc, d, e, r)
    case False{}:
      run1.sums(inc, d, e, r)

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/scan.bend&name=Two
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/scan.bend&name=run0.sums
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/scan.bend&name=run1.sums