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

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

# Rank 0 is feasible whenever any feasible member exists (Deb).
# An all-infeasible front becomes empty here so a dump can skip it.
def feas_only.on(+h: Ind.Individual, rest: List<&2, Ind.Individual>, feas: Bool) -> List<&2, Ind.Individual>:
  match feas:
    case True{}:
      h <> rest
    case False{}:
      rest

Uses (3):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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/individual.bend&name=Individual