NonDominatedSort.split_front: 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 241-246 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=241&end_line=246

import Base

def split_front(remaining: List<&2, Row>) -> Split:
  match remaining:
    case Nil{}:
      Split{Nil{}, Nil{}}
    case +r <> +rest:
      split_ne(r, rest, split_walk(r <> rest, r <> rest))

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