Sort.bases: def of bend-parallel@0.1.0.0
Import: import bend-parallel@0.1.0.0/sort.bend as Sort
Lines 212-227 of bend-parallel@0.1.0.0/sort.bend: https://jend.leeeet.dev/read.txt?path=bend-parallel@0.1.0.0/sort.bend&start_line=212&end_line=227

import Base
import bend-parallel@0.1.0.0/histogram.bend as Hist

# Pass 2c's forks, shaped as pass 2a's (Hist.grp), with two handles each
# to the table and the offsets. Lane i reads the offsets and reads and
# writes only its group's rows in its columns.
def bases(+d: Nat, +i: U32, +gc: Nat, +w: Nat, +m: Nat, +kb: Nat, +k: U32, ft: Array<U32> & Array<U32>, fo: Array<U32> & Array<U32>) -> Hist.Two:
  match d:
    case 0n:
      (t, t2) = ft
      (os, os2) = fo
      Hist.two.rejoin(t2, os2, base.leaf(i, gc, w, m, kb, k, Hist.Two{t, os}))
    case 1n+p:
      (t0, t1) = ft
      (o0, o1) = fo
      +j = (i * 2 : U32)
      l r = bases(p, j, gc, w, m, kb, k, Array.fork(U32, t0), Array.fork(U32, o0))
        bases(p, (j + 1 : U32), gc, w, m, kb, k, Array.fork(U32, t1), Array.fork(U32, o1))
      Hist.two.join(l, r)

Uses (12):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.fork
  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=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.mul
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/histogram.bend&name=Two
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/histogram.bend&name=two.join
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/histogram.bend&name=two.rejoin
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/sort.bend&name=base.leaf