NonDominatedSort.split_ne: 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 230-239 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=230&end_line=239

import Base

# Empty first front (unreachable on a finite Pareto set) keeps the head
# so peel stays a partition.
def split_ne(+r: Row, +rest: List<&2, Row>, s: Split) -> Split:
  match s:
    case Split{ff, ot}:
      match ff:
        case Nil{}:
          Split{row_idx(r) <> Nil{}, rest}
        case h <> t:
          Split{h <> t, ot}

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/non_dominated_sort.bend&name=Row
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/non_dominated_sort.bend&name=Split
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/non_dominated_sort.bend&name=row_idx