NonDominatedSort.rows_of.go: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/non_dominated_sort.bend as NonDominatedSort
Lines 44-49 of unified-nsga-iii@0.2.2.0/non_dominated_sort.bend: https://jend.leeeet.dev/read.txt?path=unified-nsga-iii@0.2.2.0/non_dominated_sort.bend&start_line=44&end_line=49

import Base
import unified-nsga-iii@0.2.2.0/individual.bend as Ind

def rows_of.go(pop: List<&2, Ind.Individual>, +i: Nat) -> List<&2, Row>:
  match pop:
    case Nil{}:
      Nil{}
    case +h <> t:
      Row{i, Ind.objectives(h), Ind.constraint_violation(h)} <> rows_of.go(t, 1n+i)

Uses (6):
  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=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/individual.bend&name=constraint_violation
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/individual.bend&name=objectives
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/non_dominated_sort.bend&name=Row