def passes

bendtorch@1.3.0.0 · spec.bend:193

import Base

193# r passes of tree_sum; tree_sum (ts_go) stops once one cell is left, and a pass leaves one cell as it is, so the sum of
194# m cells is passes(r, row) for any r at least the number of passes it makes
195def passes(r: Nat, xs: List<&2, Sum>) -> List<&2, Sum>:
196  match r:
197    case 0n:
198      xs
199    case 1n+q:
200      spass(passes(q, xs))