*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
/** Check whether this node actually represents any kind of symmetry. */
bool has_symmetry() const {return type != none || !children.empty(); }
/** Check whether this node actually represents any kind of symmetry. */
bool has_symmetry() const {return type != none || !children.empty(); }
protected:
void do_print(const print_context & c, unsigned level) const;
void do_print_tree(const print_tree & c, unsigned level) const;
protected:
void do_print(const print_context & c, unsigned level) const;
void do_print_tree(const print_tree & c, unsigned level) const;
* @param v Start of expression vector
* @param symm Root node of symmetry tree
* @return the overall sign introduced by the reordering (+1, -1 or 0)
* @param v Start of expression vector
* @param symm Root node of symmetry tree
* @return the overall sign introduced by the reordering (+1, -1 or 0)
extern int canonicalize(exvector::iterator v, const symmetry &symm);
/** Symmetrize expression over a set of objects (symbols, indices). */
extern int canonicalize(exvector::iterator v, const symmetry &symm);
/** Symmetrize expression over a set of objects (symbols, indices). */