def sums.leaf

bend-parallel@0.1.0.0 · scan.bend:108

import bend-parallel@0.1.0.0/scan.bend as Scan
import Base

108# Block i (2^e entries): its sum into s[i].
109def sums.leaf(+i: U32, +e: Nat, a: Array<U32>, s: Array<U32>) -> Two:
110  +at = U32.shln(i, e)
111  sums.leaf.fin(i, s, sum.go(U32.to_nat((U32.shln(1, e) - 1 : U32)), at, 0, a[at]))

Uses (10)

Used by (1)