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

import Base

# Columns c to c + n.
def sum.go(+n: Nat, +wr: Bool, +c: U32, +k: U32, +o: U32, +step: U32, +nb: Nat, p: Three) -> Three:
  match n:
    case 0n:
      sum.one(U32.is_lt(c, k), wr, c, o, step, nb, p)
    case 1n+q:
      sum.go(q, wr, (c + 1 : U32), k, o, step, nb, sum.one(U32.is_lt(c, k), wr, c, o, step, nb, p))

Uses (7):
  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=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.is_lt
  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=sum.one