Problems.c1_dtlz1: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/problems.bend as Problems
Lines 155-157 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=155&end_line=157

import Base
import unified-nsga-iii@0.2.2.0/bounds.bend as Bounds

# C1-DTLZ1: DTLZ1 plus one inequality. C# default M=3, k=5 (n = M+k-1).
def c1_dtlz1(+m: Nat, k: Nat) -> Problem:
  mk_prob(C1Dtlz1{}, Bounds.unit_n(dtlz_n(m, k), m))

Uses (6):
  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/bounds.bend&name=unit_n
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=Family
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=Problem
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=dtlz_n
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=mk_prob