Sort.put.go: def of bend-parallel@0.1.0.0
Import: import bend-parallel@0.1.0.0/sort.bend as Sort
Lines 299-309 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=299&end_line=309

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

# r holds the keys and the key x read at j: key j goes to the next slot
# of its bucket in the row at row, then the n keys after j. k1 is K - 1.
def put.go(+n: Nat, +j: U32, +row: U32, +k1: U32, p: Hist.Two, r: Array<U32> & U32) -> Three:
  match n:
    case 0n:
      (ks, +x) = r
      put.fin(ks, put.one(j, (row + U32.min(x, k1) : U32), p))
    case 1n+q:
      (ks, +x) = r
      +i = (j + 1 : U32)
      put.go(q, i, row, k1, put.one(j, (row + U32.min(x, k1) : U32), p), ks[i])

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.get
  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.min
  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/sort.bend&name=Three
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/sort.bend&name=put.fin
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/sort.bend&name=put.one