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

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

# The nb + 1 entries from at, step apart: their sum; when wr, each also
# becomes the sum of those before it.
def sum.col(+wr: Bool, +at: U32, +step: U32, +nb: Nat, t: Array<U32>) -> Array<U32> & U32:
  match wr:
    case True{}:
      xs.go(nb, at, step, 0, t[at])
    case False{}:
      Hist.col.go(nb, at, step, 0, t[at])

Uses (8):
  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=Bool
  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=U32
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/histogram.bend&name=col.go
  https://jend.leeeet.dev/definition.txt?path=bend-parallel@0.1.0.0/sort.bend&name=xs.go