X-Git-Url: https://svn.cri.ensmp.fr/git/linpy.git/blobdiff_plain/1c48ba9f3483505f53962731dc58c6c02d785fc4..a8bb1d373098fbaaac285cc7aeea6b9b380f2fd7:/pypol/domains.py?ds=inline diff --git a/pypol/domains.py b/pypol/domains.py index 20493fa..6c10de3 100644 --- a/pypol/domains.py +++ b/pypol/domains.py @@ -138,10 +138,11 @@ class Domain: return self.complement() def simplify(self): - # see isl_set_coalesce, isl_set_detect_equalities, - # isl_set_remove_redundancies - # which ones? in which order? - raise NotImplementedError + #does not change anything in any of the examples + #isl seems to do this naturally + islset = self._toislset(self.polyhedra, self.symbols) + islset = libisl.isl_set_remove_redundancies(islset) + return self._fromislset(islset, self.symbols) def polyhedral_hull(self): # several types of hull are available @@ -151,11 +152,22 @@ class Domain: islbset = libisl.isl_set_polyhedral_hull(islset) return Polyhedron._fromislbasicset(islbset, self.symbols) - def project(self, symbols): - # not sure what isl_set_project_out actually does… - # use isl_set_drop_constraints_involving_dims instead? - raise NotImplementedError - + def drop_dims(self, dims): + # use to remove certain variables use isl_set_drop_constraints_involving_dims instead? + from .polyhedra import Polyhedron + dims = list(dims) + symbols = list(self.symbols) + print(symbols) + islset = self._toislset(self.polyhedra, self.symbols) + for dim in dims: + if dim in symbols: + first = symbols.index(dim) + islbset = libisl.isl_set_project_out(islset, libisl.isl_dim_set, first, 1) + symbols.__delitem__(first) + else: + islbset = libisl.isl_set_project_out(islset, libisl.isl_dim_set, 0, 0) + return Polyhedron._fromislset(islbset, symbols) + def sample(self): from .polyhedra import Polyhedron islset = self._toislset(self.polyhedra, self.symbols) @@ -287,25 +299,34 @@ class Domain: return Polyhedron(equalities, inequalities) raise SyntaxError('invalid syntax') + _RE_BRACES = re.compile(r'^\{\s*|\s*\}$') + _RE_EQ = re.compile(r'([^<=>])=([^<=>])') + _RE_AND = re.compile(r'\band\b|,|&&|/\\|∧|∩') + _RE_OR = re.compile(r'\bor\b|;|\|\||\\/|∨|∪') + _RE_NOT = re.compile(r'\bnot\b|!|¬') + _RE_NUM_VAR = Expression._RE_NUM_VAR + _RE_OPERATORS = re.compile(r'(&|\||~)') + @classmethod def fromstring(cls, string): - # remove brackets - string = re.sub(r'^\{\s*|\s*\}$', '', string) + # remove curly brackets + string = cls._RE_BRACES.sub(r'', string) # replace '=' by '==' - string = re.sub(r'([^<=>])=([^<=>])', r'\1==\2', string) + string = cls._RE_EQ.sub(r'\1==\2', string) # replace 'and', 'or', 'not' - string = re.sub(r'\band\b|,|&&|/\\|∧|∩', r' & ', string) - string = re.sub(r'\bor\b|;|\|\||\\/|∨|∪', r' | ', string) - string = re.sub(r'\bnot\b|!|¬', r' ~', string) - tokens = re.split(r'(&|\||~)', string) + string = cls._RE_AND.sub(r' & ', string) + string = cls._RE_OR.sub(r' | ', string) + string = cls._RE_NOT.sub(r' ~', string) + # add implicit multiplication operators, e.g. '5x' -> '5*x' + string = cls._RE_NUM_VAR.sub(r'\1*\2', string) + # add parentheses to force precedence + tokens = cls._RE_OPERATORS.split(string) for i, token in enumerate(tokens): if i % 2 == 0: - # add implicit multiplication operators, e.g. '5x' -> '5*x' - token = re.sub(r'(\d+|\))\s*([^\W\d_]\w*|\()', r'\1*\2', token) token = '({})'.format(token) tokens[i] = token string = ''.join(tokens) - tree = ast.parse(string) + tree = ast.parse(string, 'eval') return cls._fromast(tree) def __repr__(self): @@ -320,7 +341,6 @@ class Domain: def tosympy(self): raise NotImplementedError - def And(*domains): if len(domains) == 0: from .polyhedra import Universe