Algorithm.pair_mate.go: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/algorithm.bend as Algorithm
Lines 193-200 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=193&end_line=200

import Base

# Second parent. In range: pair+1. At the end (odd N, first parent is
# N-1): parent 0. Even N never asks for a mate past N-1.
def pair_mate.go(+i: Nat, ok: Bool) -> Nat:
  match ok:
    case True{}:
      i
    case False{}:
      0n

Uses (2):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat