NonDominatedSort.verdict: 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 75-81 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=75&end_line=81

import Base

# Minimization: 0n = mutual non-domination, 1n = a dominates b, 2n = b dominates a.
def verdict(ab: Bool, bb: Bool) -> Nat:
  match ab:
    case True{}:
      verdict.a(bb)
    case False{}:
      verdict.b(bb)

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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/non_dominated_sort.bend&name=verdict.a
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/non_dominated_sort.bend&name=verdict.b