def alphas_from

mlbend-generative@0.1.1.0 · main.bend:138

import Base

138# The schedule from step `from` on, `left` entries. The count left is the
139# recursion; the step rides after it.
140def alphas_from(+steps: Nat, +left: Nat, +from: Nat) -> List<&2, F32>:
141  match left:
142    case 0n:
143      Nil{}
144    case 1n+rest:
145      Con{alpha_at(from, steps), alphas_from(steps, rest, (1n + from : Nat))}