def asum

bendtorch@1.3.0.0 · main.bend:1494

import bendtorch@1.3.0.0/main.bend as Bendtorch

import Base

1494# acc + a[j] for j = idx..idx + k, in order
1495def asum(k: Nat, +idx: U32, acc: F32, r: Array<F32> & F32) -> AS:
1496  match k r:
1497    case 0n Tuple{a, +x}:
1498      AS{a, (acc + x : F32)}
1499    case 1n+q Tuple{a, +x}:
1500      asum(q, (idx + 1 : U32), (acc + x : F32), Array.get(F32, a, (idx + 1 : U32)))

Uses (10)

Used by (4)