X-Git-Url: https://scm.cri.ensmp.fr/git/linpy.git/blobdiff_plain/7941e9e70af9f90f2fce0fd3ea694fc0b422f583..90d7f21ee1486524f499f66ef546a24331b2009c:/pypol/tests/test_domains.py?ds=inline

diff --git a/pypol/tests/test_domains.py b/pypol/tests/test_domains.py
index 555c331..df7b01c 100644
--- a/pypol/tests/test_domains.py
+++ b/pypol/tests/test_domains.py
@@ -1,7 +1,7 @@
 import unittest
 
 from ..domains import *
-from ..linexprs import symbols
+from ..linexprs import Symbol, symbols
 from ..polyhedra import *
 
 
@@ -19,8 +19,9 @@ class TestDomain(unittest.TestCase):
         self.universe = Polyhedron([])
         self.empty = Empty
         self.disjoint = And(Ge(x, 0), Ge(-x + 2, 0), Ge(y, 0), Ge(-y + 2, 0))
-        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)))
+        self.complement = 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)))
         self.hull = And(Ge(x, 0), Ge(-x + 2, 0), Ge(y, 0), Ge(-y + 2, 0))
+        self.dropped = And(Ge(y, 0), Ge(-y + 2, 0))
         self.sample = And(Eq(y - 3, 0), Eq(x - 1, 0))
         self.intersection = And(Ge(x - 1, 0), Ge(-x + 2, 0), Ge(y - 1, 0), Ge(-y + 2, 0))
         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)))
@@ -55,45 +56,71 @@ class TestDomain(unittest.TestCase):
         self.assertFalse(self.square1 == self.square2)
 
     def test_isdisjoint(self):
-        self.assertFalse(self.square1.isdisjoint(self.square2))
+        self.assertFalse(self.square1.isdisjoint(self.square2))        
+        self.assertFalse(self.universe.isdisjoint(self.square1))
         self.assertTrue(self.square1.isdisjoint(self.square5))
+        self.assertTrue(self.empty.isdisjoint(self.square1))
 
     def test_issubset(self):
         self.assertTrue(self.square4.issubset(self.unbound_poly))
         self.assertFalse(self.square1.issubset(self.square2))
+        self.assertTrue(self.square1.issubset(self.universe))
+        self.assertTrue(self.empty.issubset(self.square1))
 
     def test_le(self):
         self.assertTrue(self.square4 <= self.square3)
         self.assertFalse(self.square3 <= self.square4)
-
+        self.assertTrue(self.empty <= self.square1)
+        self.assertTrue(self.square1 <= self.universe)
+        
     def test_lt(self):
         self.assertTrue(self.square4 < self.square3)
         self.assertFalse(self.square3 < self.square4)
+        self.assertTrue(self.empty < self.square1)
+        self.assertTrue(self.square1 < self.universe)
 
-    def test_compliment(self):
-        self.assertEqual(~self.square1, self.compliment)
+    def test_complement(self):
+        self.assertEqual(~self.square1, self.complement)
+        self.assertEqual(~self.universe, Empty)
+        self.assertEqual(~self.empty, self.universe)
 
     def test_polyhedral_hull(self):
         self.assertEqual(self.square1.polyhedral_hull(), self.hull)
+        self.assertEqual(self.universe.polyhedral_hull(), self.universe)
+        self.assertEqual(self.empty.polyhedral_hull(), self.empty)
+
+    def test_project_out(self):
+        self.assertEqual(self.square1.project_out(symbols('x')), self.dropped)
+        self.assertEqual(self.square1.project_out(symbols('x y')), self.universe)
+        self.assertEqual(self.universe.project_out([]), self.universe)
+        self.assertEqual(self.empty.project_out([]), Empty)
 
-    @unittest.expectedFailure
     def test_simplify(self):
         self.assertEqual(self.universe.simplify(), self.universe)
         self.assertEqual(self.empty.simplify(), Empty)
 
     def test_sample(self):
+        self.assertEqual(self.square6.sample(), self.sample)
         self.assertEqual(self.empty.sample(), Empty)
         self.assertEqual(self.universe.sample(), self.universe)
-        self.assertEqual(self.square6.sample(), self.sample)
-
+        
     def test_intersection(self):
         self.assertEqual(self.square1.intersection(self.square2), self.intersection)
 
     def test_and(self):
         self.assertEqual(self.square2 & self.square1, self.intersection)
+        self.assertEqual(self.square1 & self.universe, self.square1)
+        self.assertEqual(self.empty & self.square1, Empty)
+        self.assertEqual(self.universe & self.universe, self.universe)
+        self.assertEqual(self.universe & self.empty, Empty)
+        self.assertEqual(self.empty & self.empty, Empty)
 
     def test_union(self):
         self.assertEqual(self.square1.union(self.square2), self.union)
+        self.assertEqual(self.square1.union(self.empty), self.square1)
+        self.assertEqual(self.square1.union(self.universe), self.universe)
+        self.assertEqual(self.universe.union(self.universe), self.universe)
+        self.assertEqual(self.empty.union(self.empty), self.empty)
 
     def test_or(self):
         self.assertEqual(self.square1 | self.square2, self.union)
@@ -101,6 +128,9 @@ class TestDomain(unittest.TestCase):
     def test_add(self):
         self.assertEqual(self.square2 + self.square1, self.sum1)
         self.assertEqual(Polyhedron(self.square1 + self.square2), self.sum2)
+        self.assertEqual(self.universe + self.square1, self.universe)
+        self.assertEqual(self.empty + self.square1, self.square1)
+        self.assertEqual(self.universe + self.universe, self.universe)
 
     def test_difference(self):
         self.assertEqual(self.square2 - self.square1, self.difference1)
@@ -110,6 +140,10 @@ class TestDomain(unittest.TestCase):
 
     def test_lexmin(self):
         self.assertEqual(self.square1.lexmin(), self.lexmin)
+        self.assertEqual(self.universe.lexmin(), self.universe)
+        self.assertEqual(self.empty.lexmin(), Empty)
 
     def test_lexmax(self):
         self.assertEqual(self.square1.lexmax(), self.lexmax)
+        self.assertEqual(self.universe.lexmax(), self.universe)
+        self.assertEqual(self.empty.lexmax(), Empty)