def sum.go
import bend-parallel@0.1.0.0/sort.bend as Sortimport Base
124# Columns c to c + n.
125def sum.go(+n: Nat, +wr: Bool, +c: U32, +k: U32, +o: U32, +step: U32, +nb: Nat, p: Three) -> Three:
126 match n:
127 case 0n:
128 sum.one(U32.is_lt(c, k), wr, c, o, step, nb, p)
129 case 1n+q:
130 sum.go(q, wr, (c + 1 : U32), k, o, step, nb, sum.one(U32.is_lt(c, k), wr, c, o, step, nb, p))