Histogram.count.go: def of bend-parallel@0.1.0.0
Import: import bend-parallel@0.1.0.0/histogram.bend as Histogram
Lines 120-130 of bend-parallel@0.1.0.0/histogram.bend: https://jend.leeeet.dev/read.txt?path=bend-parallel@0.1.0.0/histogram.bend&start_line=120&end_line=130

import Base

# r holds the keys and the key x read at j: one more in x's bucket of the
# row at row, then the same for the n keys after j. k1 is K - 1.
def count.go(+n: Nat, +j: U32, +row: U32, +k1: U32, t: Array<U32>, r: Array<U32> & U32) -> Two:
  match n:
    case 0n:
      (ks, +x) = r
      Two{ks, bump((row + U32.min(x, k1) : U32), t)}
    case 1n+p:
      (ks, +x) = r
      +q = (j + 1 : U32)
      count.go(p, q, row, k1, bump((row + U32.min(x, k1) : U32), t), ks[q])

Uses (10):
  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/histogram.bend&name=bump