X-Git-Url: https://scm.cri.mines-paristech.fr/git/linpy.git/blobdiff_plain/fb070deb31a82b789e1be4ffc5dfa64b4b7a9e36..0f40fdb54d0fc6505342d008deaa1e9c4c9dbcee:/examples/squares.py?ds=inline

diff --git a/examples/squares.py b/examples/squares.py
index 0df8b4b..ea48fe4 100755
--- a/examples/squares.py
+++ b/examples/squares.py
@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from pypol import *
+from linpy import *
 
 a, x, y, z = symbols('a x y z')
 
@@ -9,8 +9,11 @@ sq2 = Le(2, x) & Le(x, 4) & Le(2, y) & Le(y, 4)
 sq3 = Le(0, x) & Le(x, 3) & Le(0, y) & Le(y, 3)
 sq4 = Le(1, x) & Le(x, 2) & Le(1, y) & Le(y, 2)
 sq5 = Le(1, x) & Le(x, 2) & Le(1, y)
-sq6 = Le(1, x) & Le(x, 2) & Le(1, y) & Eq(y, 3)
+sq6 = Le(1, x) & Le(x, 2) & Le(1, y) & Le(y, 3)
 sq7 = Le(0, x) & Le(x, 2) & Le(0, y) & Eq(z, 2) & Le(a, 3)
+p = Le(2*x+1, y) & Le(-2*x-1, y) & Le(y, 1)
+
+
 universe = Polyhedron([])
 q = sq1 - sq2
 e = Empty
@@ -55,7 +58,7 @@ print()
 print('lexographic min of sq2:', sq2.lexmin()) #test lexmax()
 print('lexographic max of sq2:', sq2.lexmax()) #test lexmax()
 print()
-print('Polyhedral hull of sq1 + sq2 is:', q.polyhedral_hull()) #test polyhedral hull
+print('Polyhedral hull of sq1 + sq2 is:', q.aspolyhedron()) #test polyhedral hull
 print()
 print('is sq1 bounded?', sq1.isbounded()) #unbounded should return True
 print('is sq5 bounded?', sq5.isbounded()) #unbounded should return False
@@ -63,9 +66,13 @@ print()
 print('sq6:', sq6)
 print('sq6 simplified:', sq6.sample())
 print()
-print(universe.project_out([x]))
-print('sq7 with out constraints involving y and a', sq7.project_out([a, z, x, y])) #drops dims that are passed
+print(universe.project([x]))
+print('sq7 with out constraints involving y and a', sq7.project([a, z, x, y])) #drops dims that are passed
 print()
 print('sq1 has {} parameters'.format(sq1.num_parameters()))
 print()
 print('does sq1 constraints involve x?', sq1.involves_dims([x]))
+print()
+print('the verticies for s are:', p.vertices())
+print()
+print(p.plot())