points.append(Point(coordinates))
return points
+ def __contains__(self, point):
+ for polyhedron in self.polyhedra:
+ if point in polyhedron:
+ return True
+ return False
+
def subs(self, symbol, expression=None):
polyhedra = [polyhedron.subs(symbol, expression)
for polyhedron in self.polyhedra]
from . import islhelper
from .islhelper import mainctx, libisl
+from .coordinates import Point
from .linexprs import Expression, Symbol, Rational
from .domains import Domain
def aspolyhedron(self):
return self
+ def __contains__(self, point):
+ if not isinstance(point, Point):
+ raise TypeError('point must be a Point instance')
+ if self.symbols != point.symbols:
+ raise ValueError('arguments must belong to the same space')
+ for equality in self.equalities:
+ if equality.subs(point.coordinates()) != 0:
+ return False
+ for inequality in self.inequalities:
+ if inequality.subs(point.coordinates()) < 0:
+ return False
+ return True
+
def subs(self, symbol, expression=None):
equalities = [equality.subs(symbol, expression)
for equality in self.equalities]