cs170-project/tests.py at master · FibonacciHeap/cs170-project · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
import unittest

from constraint_generator import ConstraintGenerator

class TestConstraintGenerator(unittest.TestCase):
    def setUp(self):
        self.num_wizards = 6
        self.num_constraints = 50
        self.random_cg = ConstraintGenerator(
            self.num_wizards, ConstraintGenerator.RANDOM
        )
        self.ssn_cg = ConstraintGenerator(
            self.num_wizards,
            ConstraintGenerator.SINGLE_SIDE_NEIGHBOR,
        )
        self.balanced_cg = ConstraintGenerator(
            self.num_wizards,
            ConstraintGenerator.BALANCED,
        )
        self.inward_merge_cg = ConstraintGenerator(
            self.num_wizards,
            ConstraintGenerator.INWARD_MERGE,
        )

    def test_random_cg(self):
        constraints = self.random_cg.generate(self.num_constraints)
        # test generated constraints are valid
        for constraint in constraints:
            _constraint = [int(i) for i in constraint]
            self.assertFalse(_constraint[0] < _constraint[2] < _constraint[1])
            self.assertFalse(_constraint[1] < _constraint[2] < _constraint[0])

        # test each group of NUM_WIZARDS constraints have unique target wizards
        wizards_picked = set()
        for i, constraint in enumerate(constraints):
            if i % self.num_wizards == 0:
                wizards_picked = set()
            self.assertNotIn(constraint[2], wizards_picked)
            wizards_picked.add(constraint[2])

        # test that known solution satisfies all constraints
        solution = self.random_cg.wizards
        for wizard in solution:
            for constraint in constraints:
                if constraints[2] == wizard:
                    left = solution.index(constraint[0])
                    right = solution.index(constraint[1])
                    target = solution.index(wizard)
                    self.assertFalse(left < wizard < right)
                    self.assertFalse(right < wizard < left)

    def test_ssn_cg(self):
        constraints = self.ssn_cg.generate(self.num_constraints)

        for constraint in constraints:
            _constraint = [int(i) for i in constraint]
            # test generated constraints are valid
            self.assertFalse(_constraint[0] < _constraint[2] < _constraint[1])
            self.assertFalse(_constraint[1] < _constraint[2] < _constraint[0])
            # test each constraint is from a group of 3 adjacent wizards
            self.assertTrue(abs(_constraint[2] - _constraint[0]) <= 2)
            self.assertTrue(abs(_constraint[1] - _constraint[0]) <= 2)

        # test that known solution satisfies all constraints
        solution = self.ssn_cg.wizards
        for wizard in solution:
            for constraint in constraints:
                if constraints[2] == wizard:
                    left = solution.index(constraint[0])
                    right = solution.index(constraint[1])
                    target = solution.index(wizard)
                    self.assertFalse(left < wizard < right)
                    self.assertFalse(right < wizard < left)

    def test_balanced_cg(self):
        pass

    def test_inward_merge_cg(self):
        constraints = self.inward_merge_cg.generate(self.num_constraints)

        for constraint in constraints:
            _constraint = [int(i) for i in constraint]
            # test generated constraints are valid
            self.assertFalse(_constraint[0] < _constraint[2] < _constraint[1])
            self.assertFalse(_constraint[1] < _constraint[2] < _constraint[0])

        # test that known solution satisfies all constraints
        solution = self.inward_merge_cg.wizards
        for wizard in solution:
            for constraint in constraints:
                if constraints[2] == wizard:
                    left = solution.index(constraint[0])
                    right = solution.index(constraint[1])
                    target = solution.index(wizard)
                    self.assertFalse(left < wizard < right)
                    self.assertFalse(right < wizard < left)


if __name__ == '__main__':
    unittest.main()