def tree_sum
import bendtorch@1.3.0.0/main.bend as Bendtorchimport Base
3161def tree_sum(+m: U32, a: Array<F32>) -> F32:
3162 ts_go(32n, U32.is_le(m, 1), m, a)
import bendtorch@1.3.0.0/main.bend as Bendtorchimport Base
3161def tree_sum(+m: U32, a: Array<F32>) -> F32:
3162 ts_go(32n, U32.is_le(m, 1), m, a)