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

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

# ZDT1 / ZDT2 / ZDT3: n variables (C# default 30), 2 objectives, x ∈ [0,1]^n.
def zdt1(n: Nat) -> Problem:
  mk_prob(Zdt1{}, Bounds.unit_n(n, 2n))

Uses (5):
  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=mk_prob