X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fsymmetry.cpp;h=9cee0ffb37b24ec718cabf91c3897307ff3c9fab;hp=ab31838b18668d156cc751930579463796666948;hb=7e68cf1c0515b0397a49a13f2f08decae7509af1;hpb=591b85b0697370f2f5f25a29a1e94ff831a02c12 diff --git a/ginac/symmetry.cpp b/ginac/symmetry.cpp index ab31838b..9cee0ffb 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-2006 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 @@ -17,64 +17,63 @@ * * 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 */ +#include #include #include -#include - -#define DO_GINAC_ASSERT -#include "assertion.h" #include "symmetry.h" #include "lst.h" #include "numeric.h" // for factorial() -#include "print.h" +#include "operators.h" #include "archive.h" #include "utils.h" -#include "debugmsg.h" namespace GiNaC { -GINAC_IMPLEMENT_REGISTERED_CLASS(symmetry, basic) +GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(symmetry, basic, + print_func(&symmetry::do_print). + print_func(&symmetry::do_print_tree)) + +/* + 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 constructor ////////// -symmetry::symmetry() : type(none) -{ - debugmsg("symmetry default constructor", LOGLEVEL_CONSTRUCT); - tinfo_key = TINFO_symmetry; -} - -void symmetry::copy(const symmetry & other) +symmetry::symmetry() : inherited(&symmetry::tinfo_static), type(none) { - inherited::copy(other); - type = other.type; - indices = other.indices; - children = other.children; + setflag(status_flags::evaluated | status_flags::expanded); } -DEFAULT_DESTROY(symmetry) - ////////// // other constructors ////////// -symmetry::symmetry(unsigned i) : type(none) +symmetry::symmetry(unsigned i) : inherited(&symmetry::tinfo_static), type(none) { - debugmsg("symmetry constructor from unsigned", LOGLEVEL_CONSTRUCT); indices.insert(i); - tinfo_key = TINFO_symmetry; + setflag(status_flags::evaluated | status_flags::expanded); } -symmetry::symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2) : type(t) +symmetry::symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2) : inherited(&symmetry::tinfo_static), type(t) { - debugmsg("symmetry constructor from symmetry_type,symmetry &,symmetry &", LOGLEVEL_CONSTRUCT); add(c1); add(c2); - tinfo_key = TINFO_symmetry; + setflag(status_flags::evaluated | status_flags::expanded); } ////////// @@ -82,10 +81,8 @@ 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) +symmetry::symmetry(const archive_node &n, 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")); @@ -138,26 +135,83 @@ void symmetry::archive(archive_node &n) const DEFAULT_UNARCHIVE(symmetry) ////////// -// functions overriding virtual functions from bases classes +// functions overriding virtual functions from base classes ////////// int symmetry::compare_same_type(const basic & other) const { - GINAC_ASSERT(is_of_type(other, symmetry)); - const symmetry &o = static_cast(other); + GINAC_ASSERT(is_a(other)); + + // For archiving purposes we need to have an ordering of symmetries. + const symmetry &othersymm = ex_to(other); + + // Compare type. + if (type > othersymm.type) + return 1; + if (type < othersymm.type) + return -1; + + // Compare the index set. + size_t this_size = indices.size(); + size_t that_size = othersymm.indices.size(); + if (this_size > that_size) + return 1; + if (this_size < that_size) + return -1; + typedef std::set::iterator set_it; + set_it end = indices.end(); + for (set_it i=indices.begin(),j=othersymm.indices.begin(); i!=end; ++i,++j) { + if(*i < *j) + return 1; + if(*i > *j) + return -1; + } + + // Compare the children. + if (children.size() > othersymm.children.size()) + return 1; + if (children.size() < othersymm.children.size()) + return -1; + for (size_t i=0; i(children[i]) + .compare_same_type(ex_to(othersymm.children[i])); + if (cmpval) + return cmpval; + } - // 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 +unsigned symmetry::calchash() const { - debugmsg("symmetry print", LOGLEVEL_PRINT); + unsigned v = golden_ratio_hash((p_int)tinfo()); + + if (type == none) { + v = rotate_left(v); + v ^= *(indices.begin()); + } else { + for (exvector::const_iterator i=children.begin(); i!=children.end(); ++i) + { + v = rotate_left(v); + v ^= i->gethash(); + } + } + if (flags & status_flags::evaluated) { + setflag(status_flags::hash_calculated); + hashvalue = v; + } + + return v; +} + +void symmetry::do_print(const print_context & c, unsigned level) const +{ if (children.empty()) { if (indices.size() > 0) c.s << *(indices.begin()); + else + c.s << "none"; } else { switch (type) { case none: c.s << '!'; break; @@ -167,15 +221,47 @@ void symmetry::print(const print_context & c, unsigned level = 0) const default: c.s << '?'; break; } c.s << '('; - for (unsigned i=0; i"; break; + } + + c.s << ", indices=("; + if (!indices.empty()) { + std::set::const_iterator i = indices.begin(), end = indices.end(); + --end; + while (i != end) + c.s << *i++ << ","; + c.s << *i; + } + c.s << ")\n"; + + exvector::const_iterator i = children.begin(), end = children.end(); + while (i != end) { + i->print(c, level + c.delta_indent); + ++i; + } +} + ////////// // non-virtual functions in this class ////////// @@ -184,7 +270,7 @@ symmetry &symmetry::add(const symmetry &c) { // All children must have the same number of indices if (type != none && !children.empty()) { - GINAC_ASSERT(is_ex_exactly_of_type(children[0], symmetry)); + GINAC_ASSERT(is_exactly_a(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")); } @@ -217,6 +303,72 @@ void symmetry::validate(unsigned n) // global functions ////////// +static const symmetry & index0() +{ + static ex s = (new symmetry(0))->setflag(status_flags::dynallocated); + return ex_to(s); +} + +static const symmetry & index1() +{ + static ex s = (new symmetry(1))->setflag(status_flags::dynallocated); + return ex_to(s); +} + +static const symmetry & index2() +{ + static ex s = (new symmetry(2))->setflag(status_flags::dynallocated); + return ex_to(s); +} + +static const symmetry & index3() +{ + static ex s = (new symmetry(3))->setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & not_symmetric() +{ + static ex s = (new symmetry)->setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & symmetric2() +{ + static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & symmetric3() +{ + static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->add(index2()).setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & symmetric4() +{ + static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->add(index2()).add(index3()).setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & antisymmetric2() +{ + static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & antisymmetric3() +{ + static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->add(index2()).setflag(status_flags::dynallocated); + return ex_to(s); +} + +const symmetry & antisymmetric4() +{ + static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->add(index2()).add(index3()).setflag(status_flags::dynallocated); + return ex_to(s); +} + class sy_is_less : public std::binary_function { exvector::iterator v; @@ -225,8 +377,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) { @@ -251,8 +403,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) { @@ -265,8 +417,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 @@ -274,7 +426,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; @@ -289,12 +441,17 @@ int canonicalize(exvector::iterator v, const symmetry &symm) first = symm.children.begin(); switch (symm.type) { case symmetry::symmetric: + // Sort the children in ascending order shaker_sort(first, last, sy_is_less(v), sy_swap(v, something_changed)); break; 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 cyclic_permutation(first, last, min_element(first, last, sy_is_less(v)), sy_swap(v, something_changed)); break; default: @@ -308,14 +465,12 @@ int canonicalize(exvector::iterator v, const symmetry &symm) static ex symm(const ex & e, exvector::const_iterator first, exvector::const_iterator last, bool asymmetric) { // Need at least 2 objects for this operation - int num = last - first; + unsigned num = last - first; if (num < 2) return e; - // Transform object vector to a list - exlist iv_lst; - iv_lst.insert(iv_lst.begin(), first, last); - lst orig_lst(iv_lst, true); + // Transform object vector to a lst (for subs()) + lst orig_lst(first, last); // Create index vectors for permutation unsigned *iv = new unsigned[num], *iv2; @@ -330,7 +485,7 @@ static ex symm(const ex & e, exvector::const_iterator first, exvector::const_ite lst new_lst; for (unsigned i=0; i