MlbendGenerative.alphas_from: def of mlbend-generative@0.1.1.0
Import: import mlbend-generative@0.1.1.0/main.bend as MlbendGenerative
Lines 138-145 of mlbend-generative@0.1.1.0/main.bend: https://jend.leeeet.dev/read.txt?path=mlbend-generative@0.1.1.0/main.bend&start_line=138&end_line=145

import Base

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

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=mlbend-generative@0.1.1.0/main.bend&name=alpha_at