X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?a=blobdiff_plain;ds=sidebyside;f=ginac%2Fsymmetry.cpp;h=c953953a2e55eebf2ee081a84ab6904658cb7adb;hb=7e7beee2c946694130a484c923f6af8391867495;hp=1b818191a64115849189bb8eda2de59f1de0406b;hpb=aa6281216091efd92dc5fcc3f96c7189114e80f1;p=ginac.git diff --git a/ginac/symmetry.cpp b/ginac/symmetry.cpp index 1b818191..c953953a 100644 --- a/ginac/symmetry.cpp +++ b/ginac/symmetry.cpp @@ -3,7 +3,7 @@ * Implementation of GiNaC's symmetry definitions. */ /* - * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany * * 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 @@ -20,9 +20,9 @@ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ +#include #include #include -#include #include "symmetry.h" #include "lst.h" @@ -30,19 +30,31 @@ #include "print.h" #include "archive.h" #include "utils.h" -#include "debugmsg.h" namespace GiNaC { GINAC_IMPLEMENT_REGISTERED_CLASS(symmetry, basic) +/* + Some notes about the structure of a symmetry tree: + - The leaf nodes of the tree are of type "none", have one index, and no + children (of course). They are constructed by the symmetry(unsigned) + constructor. + - Leaf nodes are the only nodes that only have one index. + - Container nodes contain two or more children. The "indices" set member + is the set union of the index sets of all children, and the "children" + vector stores the children themselves. + - The index set of each child of a "symm", "anti" or "cycl" node must + have the same size. It follows that the children of such a node are + either all leaf nodes, or all container nodes with two or more indices. +*/ + ////////// -// default constructor, destructor, copy constructor assignment operator and helpers +// default ctor, dtor, copy ctor, assignment operator and helpers ////////// symmetry::symmetry() : type(none) { - debugmsg("symmetry default constructor", LOGLEVEL_CONSTRUCT); tinfo_key = TINFO_symmetry; } @@ -62,14 +74,12 @@ DEFAULT_DESTROY(symmetry) symmetry::symmetry(unsigned i) : type(none) { - debugmsg("symmetry constructor from unsigned", LOGLEVEL_CONSTRUCT); indices.insert(i); tinfo_key = TINFO_symmetry; } symmetry::symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2) : type(t) { - debugmsg("symmetry constructor from symmetry_type,symmetry &,symmetry &", LOGLEVEL_CONSTRUCT); add(c1); add(c2); tinfo_key = TINFO_symmetry; } @@ -81,8 +91,6 @@ symmetry::symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2) : ty /** Construct object from archive_node. */ symmetry::symmetry(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst) { - debugmsg("symmetry ctor from archive_node", LOGLEVEL_CONSTRUCT); - unsigned t; if (!(n.find_unsigned("type", t))) throw (std::runtime_error("unknown symmetry type in archive")); @@ -140,38 +148,70 @@ DEFAULT_UNARCHIVE(symmetry) int symmetry::compare_same_type(const basic & other) const { - GINAC_ASSERT(is_of_type(other, symmetry)); + GINAC_ASSERT(is_a(other)); // All symmetry trees are equal. They are not supposed to appear in // ordinary expressions anyway... return 0; } -void symmetry::print(const print_context & c, unsigned level = 0) const +void symmetry::print(const print_context & c, unsigned level) const { - debugmsg("symmetry print", LOGLEVEL_PRINT); + if (is_a(c)) { + + c.s << std::string(level, ' ') << class_name() + << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec + << ", type="; - if (children.empty()) { - if (indices.size() > 0) - c.s << *(indices.begin()); - else - c.s << "none"; - } else { switch (type) { - case none: c.s << '!'; break; - case symmetric: c.s << '+'; break; - case antisymmetric: c.s << '-'; break; - case cyclic: c.s << '@'; break; - default: c.s << '?'; break; + case none: c.s << "none"; break; + case symmetric: c.s << "symm"; break; + case antisymmetric: c.s << "anti"; break; + case cyclic: c.s << "cycl"; break; + default: c.s << ""; break; } - c.s << '('; - unsigned num = children.size(); - for (unsigned i=0; i::const_iterator i = indices.begin(), end = indices.end(); + --end; + while (i != end) + c.s << *i++ << ","; + c.s << *i; + } + c.s << ")\n"; + + unsigned delta_indent = static_cast(c).delta_indent; + exvector::const_iterator i = children.begin(), end = children.end(); + while (i != end) { + i->print(c, level + delta_indent); + ++i; + } + + } else { + + if (children.empty()) { + if (indices.size() > 0) + c.s << *(indices.begin()); + else + c.s << "none"; + } else { + switch (type) { + case none: c.s << '!'; break; + case symmetric: c.s << '+'; break; + case antisymmetric: c.s << '-'; break; + case cyclic: c.s << '@'; break; + default: c.s << '?'; break; + } + c.s << '('; + unsigned num = children.size(); + for (unsigned i=0; i(children[0])); if (ex_to(children[0]).indices.size() != c.indices.size()) throw (std::logic_error("symmetry:add(): children must have same number of indices")); } @@ -224,8 +264,8 @@ public: bool operator() (const ex &lh, const ex &rh) const { - GINAC_ASSERT(is_ex_exactly_of_type(lh, symmetry)); - GINAC_ASSERT(is_ex_exactly_of_type(rh, symmetry)); + GINAC_ASSERT(is_exactly_a(lh)); + GINAC_ASSERT(is_exactly_a(rh)); GINAC_ASSERT(ex_to(lh).indices.size() == ex_to(rh).indices.size()); std::set::const_iterator ait = ex_to(lh).indices.begin(), aitend = ex_to(lh).indices.end(), bit = ex_to(rh).indices.begin(); while (ait != aitend) { @@ -250,8 +290,8 @@ public: void operator() (const ex &lh, const ex &rh) { - GINAC_ASSERT(is_ex_exactly_of_type(lh, symmetry)); - GINAC_ASSERT(is_ex_exactly_of_type(rh, symmetry)); + GINAC_ASSERT(is_exactly_a(lh)); + GINAC_ASSERT(is_exactly_a(rh)); GINAC_ASSERT(ex_to(lh).indices.size() == ex_to(rh).indices.size()); std::set::const_iterator ait = ex_to(lh).indices.begin(), aitend = ex_to(lh).indices.end(), bit = ex_to(rh).indices.begin(); while (ait != aitend) { @@ -264,8 +304,8 @@ public: int canonicalize(exvector::iterator v, const symmetry &symm) { - // No children? Then do nothing - if (symm.children.empty()) + // Less than two elements? Then do nothing + if (symm.indices.size() < 2) return INT_MAX; // Canonicalize children first @@ -273,7 +313,7 @@ int canonicalize(exvector::iterator v, const symmetry &symm) int sign = 1; exvector::const_iterator first = symm.children.begin(), last = symm.children.end(); while (first != last) { - GINAC_ASSERT(is_ex_exactly_of_type(*first, symmetry)); + GINAC_ASSERT(is_exactly_a(*first)); int child_sign = canonicalize(v, ex_to(*first)); if (child_sign == 0) return 0; @@ -294,6 +334,8 @@ int canonicalize(exvector::iterator v, const symmetry &symm) case symmetry::antisymmetric: // Sort the children in ascending order, keeping track of the signum sign *= permutation_sign(first, last, sy_is_less(v), sy_swap(v, something_changed)); + if (sign == 0) + return 0; break; case symmetry::cyclic: // Permute the smallest child to the front