__slots__ = (
'_equalities',
'_inequalities',
- '_constraints',
'_symbols',
'_dimension',
)
if inequalities is not None:
raise TypeError('too many arguments')
return equalities.aspolyhedron()
- if equalities is None:
- equalities = []
- else:
- for i, equality in enumerate(equalities):
+ sc_equalities = []
+ if equalities is not None:
+ for equality in equalities:
if not isinstance(equality, LinExpr):
raise TypeError('equalities must be linear expressions')
- equalities[i] = equality.scaleint()
- if inequalities is None:
- inequalities = []
- else:
- for i, inequality in enumerate(inequalities):
+ sc_equalities.append(equality.scaleint())
+ sc_inequalities = []
+ if inequalities is not None:
+ for inequality in inequalities:
if not isinstance(inequality, LinExpr):
raise TypeError('inequalities must be linear expressions')
- inequalities[i] = inequality.scaleint()
- symbols = cls._xsymbols(equalities + inequalities)
- islbset = cls._toislbasicset(equalities, inequalities, symbols)
+ sc_inequalities.append(inequality.scaleint())
+ symbols = cls._xsymbols(sc_equalities + sc_inequalities)
+ islbset = cls._toislbasicset(sc_equalities, sc_inequalities, symbols)
return cls._fromislbasicset(islbset, symbols)
@property
The tuple of constraints, i.e., equalities and inequalities. This is
semantically equivalent to: equalities + inequalities.
"""
- return self._constraints
+ return self._equalities + self._inequalities
@property
def polyhedra(self):
def widen(self, other):
"""
Compute the standard widening of two polyhedra, à la Halbwachs.
+
+ In its current implementation, this method is slow and should not be
+ used on large polyhedra.
"""
if not isinstance(other, Polyhedron):
- raise ValueError('argument must be a Polyhedron instance')
+ raise TypeError('argument must be a Polyhedron instance')
inequalities1 = self._asinequalities()
inequalities2 = other._asinequalities()
inequalities = []
self = object().__new__(Polyhedron)
self._equalities = tuple(equalities)
self._inequalities = tuple(inequalities)
- self._constraints = tuple(equalities + inequalities)
- self._symbols = cls._xsymbols(self._constraints)
+ self._symbols = cls._xsymbols(self.constraints)
self._dimension = len(self._symbols)
return self
The empty polyhedron, whose set of constraints is not satisfiable.
"""
- __slots__ = Polyhedron.__slots__
-
def __new__(cls):
self = object().__new__(cls)
self._equalities = (Rational(1),)
self._inequalities = ()
- self._constraints = self._equalities
self._symbols = ()
self._dimension = 0
return self
i.e. is empty.
"""
- __slots__ = Polyhedron.__slots__
-
def __new__(cls):
self = object().__new__(cls)
self._equalities = ()
self._inequalities = ()
- self._constraints = ()
self._symbols = ()
self._dimension = ()
return self
return ~Eq(left, right)
@_polymorphic
-def Gt(left, right):
+def Ge(left, right):
"""
- Create the polyhedron with constraints expr1 > expr2 > expr3 ...
+ Create the polyhedron with constraints expr1 >= expr2 >= expr3 ...
"""
- return Polyhedron([], [left - right - 1])
+ return Polyhedron([], [left - right])
@_polymorphic
-def Ge(left, right):
+def Gt(left, right):
"""
- Create the polyhedron with constraints expr1 >= expr2 >= expr3 ...
+ Create the polyhedron with constraints expr1 > expr2 > expr3 ...
"""
- return Polyhedron([], [left - right])
+ return Polyhedron([], [left - right - 1])