Problems.dtlz_n: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/problems.bend as Problems
Lines 88-98 of unified-nsga-iii@0.2.2.0/problems.bend: https://jend.leeeet.dev/read.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&start_line=88&end_line=98

import Base

# n = M + k - 1 (C# Dtlz*Problem).
def dtlz_n(m: Nat, k: Nat) -> Nat:
  match m:
    case 0n:
      k
    case 1n+pm:
      match k:
        case 0n:
          pm
        case 1n+pk:
          Nat.add(pm, 1n+pk)

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