Algorithm.fallback_loop: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/algorithm.bend as Algorithm
Lines 226-231 of unified-nsga-iii@0.2.2.0/algorithm.bend: https://jend.leeeet.dev/read.txt?path=unified-nsga-iii@0.2.2.0/algorithm.bend&start_line=226&end_line=231

import Base
import unified-nsga-iii@0.2.2.0/individual.bend as Ind
import unified-nsga-iii@0.2.2.0/rng.bend as Rng
import unified-nsga-iii@0.2.2.0/problems.bend as Prob

def fallback_loop(need: Nat, hold: FHold, +parents: List<&2, Ind.Individual>, +prob: Prob.Problem, +mut_p: F32) -> Rng.State & List<&2, Ind.Individual>:
  match need hold:
    case 0n FH{rng, acc}:
      (rng, acc)
    case 1n+k h:
      fallback_loop(k, fallback_next(parents, prob, mut_p, h), parents, prob, mut_p)

Uses (10):
  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=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/algorithm.bend&name=FHold
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/algorithm.bend&name=fallback_next
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/individual.bend&name=Individual
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=Problem
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/rng.bend&name=State