def pair_sums
import bend-ml-llama@0.2.1.0/main.bend as BendMlLlamaimport Base
365# adjacent pairs added: [a, b, c, d, e] -> [a + b, c + d, e]
366def pair_sums(xs: List<&2, F32>) -> List<&2, F32>:
367 match xs:
368 case Con{+a, Con{+b, t}}:
369 (a + b : F32) <> pair_sums(t)
370 case _:
371 xs