@@ -134,12 +134,26 @@ def test_problem_single_assignment():
134134 problem .directions [:] = Direction .MINIMIZE
135135 problem .constraints [:] = Constraint .LESS_THAN_ZERO
136136
137+ assert len (problem .types ) == 2
138+ assert len (problem .directions ) == 2
139+ assert len (problem .constraints ) == 2
140+ assert all ([t is not None for t in problem .types ])
141+ assert all ([d is not None for d in problem .directions ])
142+ assert all ([c is not None for c in problem .constraints ])
143+
137144def test_problem_array_assignment ():
138- problem = Problem (1 , 2 , 2 )
145+ problem = Problem (2 , 2 , 2 )
139146 problem .types [:] = [Real (0 , 1 ), Real (0 , 1 )]
140147 problem .directions [:] = [Direction .MINIMIZE , Direction .MAXIMIZE ]
141148 problem .constraints [:] = [Constraint .LESS_THAN_ZERO , Constraint .GREATER_THAN_ZERO ]
142149
150+ assert len (problem .types ) == 2
151+ assert len (problem .directions ) == 2
152+ assert len (problem .constraints ) == 2
153+ assert all ([t is not None for t in problem .types ])
154+ assert all ([d is not None for d in problem .directions ])
155+ assert all ([c is not None for c in problem .constraints ])
156+
143157def test_pareto_dominance ():
144158 dominance = ParetoDominance ()
145159 assert - 1 == dominance .compare (s0 , s1 )
0 commit comments