pypol/tests/test_domains.py

   1 import unittest
   2
   3 from ..domains import *
   4 from ..linexprs import symbols
   5 from ..polyhedra import *
   6
   7
   8 class TestDomain(unittest.TestCase):
   9
  10     def setUp(self):
  11         x, y = symbols('x y')
  12         self.square1 = Polyhedron(inequalities=[x, 2 - x, y, 2 - y])
  13         self.square2 = Polyhedron(inequalities=[x - 1, 3 - x , y - 1, 3 - y]) #correct representation
  14         self.square3 = Polyhedron(inequalities=[x, 3 - x, y, 3 - y])
  15         self.square4 = Polyhedron(inequalities=[x - 1, 2 - x, y - 1, 2 - y])
  16         self.square5 = Polyhedron(inequalities=[x - 3, 6 - x, y - 3, 6 -y])
  17         self.square6 = Polyhedron(equalities=[3 - y], inequalities=[x - 1, 3 - x, y - 1])
  18         self.unbound_poly = Polyhedron(inequalities=[x, 3 - x, y])
  19         self.universe = Polyhedron([])
  20         self.empty = Empty
  21         self.disjoint = And(Ge(x, 0), Ge(-x + 2, 0), Ge(y, 0), Ge(-y + 2, 0))
  22         self.compliment = Or(Ge(-x - 1, 0), Ge(x - 3, 0), And(Ge(x, 0), Ge(-x + 2, 0), Ge(-y - 1, 0)), And(Ge(x, 0), Ge(-x + 2, 0), Ge(y - 3, 0)))
  23         self.hull = And(Ge(x, 0), Ge(-x + 2, 0), Ge(y, 0), Ge(-y + 2, 0))
  24         self.sample = And(Eq(y - 3, 0), Eq(x - 1, 0))
  25         self.intersection = And(Ge(x - 1, 0), Ge(-x + 2, 0), Ge(y - 1, 0), Ge(-y + 2, 0))
  26         self.union = Or(And(Ge(x, 0), Ge(-x + 2, 0), Ge(y, 0), Ge(-y + 2, 0)), And(Ge(x - 1, 0), Ge(-x + 3, 0), Ge(y - 1, 0), Ge(-y + 3, 0)))
  27         self.sum1 = Or(And(Ge(x, 0), Ge(-x + 2, 0), Ge(y, 0), Ge(-y + 2, 0)), And(Ge(x - 1, 0), Ge(-x + 3, 0), Ge(y - 1, 0), Ge(-y + 3, 0)))
  28         self.sum2 =And(Ge(x, 0), Ge(y, 0), Ge(-y + 3, 0), Ge(-x + 3, 0), Ge(x - y + 2, 0), Ge(-x + y + 2, 0))
  29         self.difference1 = Or(And(Eq(x - 3, 0), Ge(y - 1, 0), Ge(-y + 3, 0)), And(Eq(y - 3, 0), Ge(x - 1, 0), Ge(-x + 2, 0)))
  30         self.difference2 = And(Ge(x + y - 4, 0), Ge(-x + 3, 0), Ge(-y + 3, 0))
  31         self.lexmin = And(Eq(y, 0), Eq(x, 0))
  32         self.lexmax = And(Eq(y - 2, 0), Eq(x - 2, 0))
  33
  34     def test_new(self):
  35         with self.assertRaises(TypeError):
  36             Polyhedron(1)
  37
  38     def test_disjoint(self):
  39         self.assertEqual(self.square1.disjoint(), self.disjoint)
  40
  41     def test_isempty(self):
  42         self.assertFalse(self.square1.isempty())
  43         self.assertTrue(self.empty.isempty())
  44
  45     def test_isuniverse(self):
  46         self.assertFalse(self.square1.isuniverse())
  47         self.assertTrue(self.universe.isuniverse())
  48
  49     def test_isbounded(self):
  50         self.assertTrue(self.square1.isbounded())
  51         self.assertFalse(self.unbound_poly.isbounded())
  52
  53     def test_eq(self):
  54         self.assertTrue(self.square1 == self.square1)
  55         self.assertFalse(self.square1 == self.square2)
  56
  57     def test_isdisjoint(self):
  58         self.assertFalse(self.square1.isdisjoint(self.square2))
  59         self.assertTrue(self.square1.isdisjoint(self.square5))
  60
  61     def test_issubset(self):
  62         self.assertTrue(self.square4.issubset(self.unbound_poly))
  63         self.assertFalse(self.square1.issubset(self.square2))
  64
  65     def test_le(self):
  66         self.assertTrue(self.square4 <= self.square3)
  67         self.assertFalse(self.square3 <= self.square4)
  68
  69     def test_lt(self):
  70         self.assertTrue(self.square4 < self.square3)
  71         self.assertFalse(self.square3 < self.square4)
  72
  73     def test_compliment(self):
  74         self.assertEqual(~self.square1, self.compliment)
  75
  76     def test_polyhedral_hull(self):
  77         self.assertEqual(self.square1.polyhedral_hull(), self.hull)
  78
  79     @unittest.expectedFailure
  80     def test_simplify(self):
  81         self.assertEqual(self.universe.simplify(), self.universe)
  82         self.assertEqual(self.empty.simplify(), Empty)
  83
  84     def test_sample(self):
  85         self.assertEqual(self.empty.sample(), Empty)
  86         self.assertEqual(self.universe.sample(), self.universe)
  87         self.assertEqual(self.square6.sample(), self.sample)
  88
  89     def test_intersection(self):
  90         self.assertEqual(self.square1.intersection(self.square2), self.intersection)
  91
  92     def test_and(self):
  93         self.assertEqual(self.square2 & self.square1, self.intersection)
  94
  95     def test_union(self):
  96         self.assertEqual(self.square1.union(self.square2), self.union)
  97
  98     def test_or(self):
  99         self.assertEqual(self.square1 | self.square2, self.union)
 100
 101     def test_add(self):
 102         self.assertEqual(self.square2 + self.square1, self.sum1)
 103         self.assertEqual(Polyhedron(self.square1 + self.square2), self.sum2)
 104
 105     def test_difference(self):
 106         self.assertEqual(self.square2 - self.square1, self.difference1)
 107         self.assertEqual(Polyhedron(self.square2 - self.square1), self.difference2)
 108         self.assertEqual(self.square2 - self.square2, Empty)
 109         self.assertEqual(self.universe - self.universe, Empty)
 110
 111     def test_lexmin(self):
 112         self.assertEqual(self.square1.lexmin(), self.lexmin)
 113
 114     def test_lexmax(self):
 115         self.assertEqual(self.square1.lexmax(), self.lexmax)