Algorithm.init_next: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/algorithm.bend as Algorithm
Lines 123-126 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=123&end_line=126

import Base
import unified-nsga-iii@0.2.2.0/bounds.bend as Bounds

def init_next(+box: Bounds.Box, +n_obj: Nat, hold: IHold) -> IHold:
  match hold:
    case IH{rng, acc}:
      init_next.xs(n_obj, acc, rand_xs(box, rng))

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/algorithm.bend&name=IHold
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/algorithm.bend&name=init_next.xs
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/algorithm.bend&name=rand_xs
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/bounds.bend&name=Box