def fallback_next
unified-nsga-iii@0.2.2.0 · algorithm.bend:219
import unified-nsga-iii@0.2.2.0/algorithm.bend as Algorithm
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/polynomial_mutation.bend as Poly
import unified-nsga-iii@0.2.2.0/problems.bend as Prob
import unified-nsga-iii@0.2.2.0/util.bend as Util
219def fallback_next(+parents: List<&2, Ind.Individual>, +prob: Prob.Problem, +mut_p: F32, hold: FHold) -> FHold:
220 match hold:
221 case FH{rng, acc}:
222 +n = Util.list_len(Ind.Individual, parents)
223 +rng_i = Rng.next_nat(rng, n)
224 fallback_next.m(acc, Poly.mutate(Poly.default(), get_ind(parents, Rng.last_nat(rng_i)), Prob.box_of(prob), rng_i, mut_p))