Better implementation of symbols and constants
[linpy.git] / pypol / linexprs.py
index d8b020d..9449219 100644 (file)
@@ -36,6 +36,7 @@ class Expression:
         '_constant',
         '_symbols',
         '_dimension',
         '_constant',
         '_symbols',
         '_dimension',
+        '_hash',
     )
 
     def __new__(cls, coefficients=None, constant=0):
     )
 
     def __new__(cls, coefficients=None, constant=0):
@@ -77,11 +78,12 @@ class Expression:
         self._constant = constant
         self._symbols = tuple(self._coefficients)
         self._dimension = len(self._symbols)
         self._constant = constant
         self._symbols = tuple(self._coefficients)
         self._dimension = len(self._symbols)
+        self._hash = hash((tuple(self._coefficients.items()), self._constant))
         return self
 
     def coefficient(self, symbol):
         if isinstance(symbol, Symbol):
         return self
 
     def coefficient(self, symbol):
         if isinstance(symbol, Symbol):
-            symbol = str(symbol)
+            symbol = symbol.name
         elif not isinstance(symbol, str):
             raise TypeError('symbol must be a string or a Symbol instance')
         try:
         elif not isinstance(symbol, str):
             raise TypeError('symbol must be a string or a Symbol instance')
         try:
@@ -106,6 +108,9 @@ class Expression:
     def dimension(self):
         return self._dimension
 
     def dimension(self):
         return self._dimension
 
+    def __hash__(self):
+        return self._hash
+
     def isconstant(self):
         return False
 
     def isconstant(self):
         return False
 
@@ -220,9 +225,6 @@ class Expression:
         from .polyhedra import Gt
         return Gt(self, other)
 
         from .polyhedra import Gt
         return Gt(self, other)
 
-    def __hash__(self):
-        return hash((tuple(self.coefficients()), self._constant))
-
     def _toint(self):
         lcm = functools.reduce(lambda a, b: a*b // gcd(a, b),
             [value.denominator for value in self.values()])
     def _toint(self):
         lcm = functools.reduce(lambda a, b: a*b // gcd(a, b),
             [value.denominator for value in self.values()])
@@ -337,8 +339,9 @@ class Expression:
 
 class Symbol(Expression):
 
 
 class Symbol(Expression):
 
-    __slots__ = Expression.__slots__ + (
+    __slots__ = (
         '_name',
         '_name',
+        '_hash',
     )
 
     def __new__(cls, name):
     )
 
     def __new__(cls, name):
@@ -348,20 +351,48 @@ class Symbol(Expression):
             raise TypeError('name must be a string or a Symbol instance')
         name = name.strip()
         self = object().__new__(cls)
             raise TypeError('name must be a string or a Symbol instance')
         name = name.strip()
         self = object().__new__(cls)
-        self._coefficients = {name: 1}
-        self._constant = 0
-        self._symbols = tuple(name)
         self._name = name
         self._name = name
-        self._dimension = 1
+        self._hash = hash(self._name)
         return self
 
     @property
     def name(self):
         return self._name
 
         return self
 
     @property
     def name(self):
         return self._name
 
+    def __hash__(self):
+        return self._hash
+
+    def coefficient(self, symbol):
+        if isinstance(symbol, Symbol):
+            symbol = symbol.name
+        elif not isinstance(symbol, str):
+            raise TypeError('symbol must be a string or a Symbol instance')
+        if symbol == self.name:
+            return 1
+        else:
+            return 0
+
+    def coefficients(self):
+        yield self.name, 1
+
+    @property
+    def constant(self):
+        return 0
+
+    @property
+    def symbols(self):
+        return self.name,
+
+    @property
+    def dimension(self):
+        return 1
+
     def issymbol(self):
         return True
 
     def issymbol(self):
         return True
 
+    def __eq__(self, other):
+        return isinstance(other, Symbol) and self.name == other.name
+
     @classmethod
     def _fromast(cls, node):
         if isinstance(node, ast.Module) and len(node.body) == 1:
     @classmethod
     def _fromast(cls, node):
         if isinstance(node, ast.Module) and len(node.body) == 1:
@@ -392,20 +423,48 @@ def symbols(names):
 
 class Constant(Expression):
 
 
 class Constant(Expression):
 
+    __slots__ = (
+        '_constant',
+        '_hash',
+    )
+
     def __new__(cls, numerator=0, denominator=None):
         self = object().__new__(cls)
         if denominator is None and isinstance(numerator, Constant):
             self._constant = numerator.constant
         else:
             self._constant = Fraction(numerator, denominator)
     def __new__(cls, numerator=0, denominator=None):
         self = object().__new__(cls)
         if denominator is None and isinstance(numerator, Constant):
             self._constant = numerator.constant
         else:
             self._constant = Fraction(numerator, denominator)
-        self._coefficients = {}
-        self._symbols = ()
-        self._dimension = 0
+        self._hash = hash(self._constant)
         return self
 
         return self
 
+    def __hash__(self):
+        return self._hash
+
+    def coefficient(self, symbol):
+        if isinstance(symbol, Symbol):
+            symbol = symbol.name
+        elif not isinstance(symbol, str):
+            raise TypeError('symbol must be a string or a Symbol instance')
+        return 0
+
+    def coefficients(self):
+        yield from []
+
+    @property
+    def symbols(self):
+        return ()
+
+    @property
+    def dimension(self):
+        return 0
+
     def isconstant(self):
         return True
 
     def isconstant(self):
         return True
 
+    @_polymorphic
+    def __eq__(self, other):
+        return isinstance(other, Constant) and self.constant == other.constant
+
     def __bool__(self):
         return self.constant != 0
 
     def __bool__(self):
         return self.constant != 0