MlbendGenerative.lin_alphas_from: def of mlbend-generative@0.1.1.0
Import: import mlbend-generative@0.1.1.0/main.bend as MlbendGenerative
Lines 181-190 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=181&end_line=190

import Base

# The schedule ᾱ_1 .. from `from` on, `left` entries, the running product
# riding beside. The count left is the recursion; the step and the
# product ride after it.
def lin_alphas_from(+steps: Nat, +left: Nat, +from: Nat, +acc: F32) -> List<&2, F32>:
  match left:
    case 0n:
      Nil{}
    case 1n+rest:
      +acc2 = (acc * (1.0 - lin_beta_at(from, steps) : F32) : F32)
      Con{acc2, lin_alphas_from(steps, rest, (1n + from : Nat), acc2)}

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.mul
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.sub
  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=lin_beta_at