Implement method Point.aspolyhedron()

[linpy.git] / pypol / tests / test_coordinates.py

diff --git a/pypol/tests/test_coordinates.py b/pypol/tests/test_coordinates.py
index 2e14032..044d773 100644 (file)
--- a/pypol/tests/test_coordinates.py
+++ b/pypol/tests/test_coordinates.py
@@ -1,8 +1,9 @@
 import math
 import unittest
 
 import math
 import unittest
 

-from ..linexprs import Symbol

 from ..coordinates import *
 from ..coordinates import *

+from ..linexprs import Symbol
+from ..polyhedra import Eq

 
 
 class TestPoint(unittest.TestCase):
 
 
 class TestPoint(unittest.TestCase):


@@ -29,6 +30,9 @@ class TestPoint(unittest.TestCase):
         self.assertEqual(self.pt1 - self.pt2, Vector({self.x: -5, self.y: -35, self.z: -59}))
         self.assertEqual(self.pt1 - self.vec1, Point({self.x: -10, self.y: -25, self.z: -39}))
 
         self.assertEqual(self.pt1 - self.pt2, Vector({self.x: -5, self.y: -35, self.z: -59}))
         self.assertEqual(self.pt1 - self.vec1, Point({self.x: -10, self.y: -25, self.z: -39}))
 

+    def test_aspolyhedron(self):
+        self.assertEqual(self.pt1.aspolyhedron(), Eq(self.x, 10) & Eq(self.y, 5) & Eq(self.z, 1))
+

 
 class TestVector(unittest.TestCase):
 
 
 class TestVector(unittest.TestCase):