X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fsymmetry.cpp;h=0cbf00cb0d9ba96a83aefc21c3c8523c4febc1ab;hp=e0f1ba3e338029ebfe5cd6e4a0a07ed19d55d5a4;hb=d6961bac52f5aa15d438d77156f9738974fec0e5;hpb=d448856f20cb58f939ddbf636e7f72e3599b1468

diff --git a/ginac/symmetry.cpp b/ginac/symmetry.cpp
index e0f1ba3e..0cbf00cb 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-2004 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,21 +20,22 @@
  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  */
 
+#include <iostream>
 #include <stdexcept>
 #include <functional>
-#include <algorithm>
 
 #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<print_context>(&symmetry::do_print).
+  print_func<print_tree>(&symmetry::do_print_tree))
 
 /*
    Some notes about the structure of a symmetry tree:
@@ -51,41 +52,28 @@ GINAC_IMPLEMENT_REGISTERED_CLASS(symmetry, basic)
 */
 
 //////////
-// default constructor, destructor, copy constructor assignment operator and helpers
+// default constructor
 //////////
 
-symmetry::symmetry() : type(none)
+symmetry::symmetry() : inherited(TINFO_symmetry), type(none)
 {
-	debugmsg("symmetry default constructor", LOGLEVEL_CONSTRUCT);
-	tinfo_key = TINFO_symmetry;
+	setflag(status_flags::evaluated | status_flags::expanded);
 }
 
-void symmetry::copy(const symmetry & other)
-{
-	inherited::copy(other);
-	type = other.type;
-	indices = other.indices;
-	children = other.children;
-}
-
-DEFAULT_DESTROY(symmetry)
-
 //////////
 // other constructors
 //////////
 
-symmetry::symmetry(unsigned i) : type(none)
+symmetry::symmetry(unsigned i) : inherited(TINFO_symmetry), 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(TINFO_symmetry), 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);
 }
 
 //////////
@@ -93,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"));
@@ -161,65 +147,60 @@ int symmetry::compare_same_type(const basic & other) const
 	return 0;
 }
 
-void symmetry::print(const print_context & c, unsigned level) const
+void symmetry::do_print(const print_context & c, unsigned level) const
 {
-	debugmsg("symmetry print", LOGLEVEL_PRINT);
-
-	if (is_a<print_tree>(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 << "none"; break;
-			case symmetric: c.s << "symm"; break;
-			case antisymmetric: c.s << "anti"; break;
-			case cyclic: c.s << "cycl"; break;
-			default: c.s << "<unknown>"; break;
+			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 << ", indices=(";
-		if (!indices.empty()) {
-			std::set<unsigned>::const_iterator i = indices.begin(), end = indices.end();
-			--end;
-			while (i != end)
-				c.s << *i++ << ",";
-			c.s << *i;
+		c.s << '(';
+		size_t num = children.size();
+		for (size_t i=0; i<num; i++) {
+			children[i].print(c);
+			if (i != num - 1)
+				c.s << ",";
 		}
-		c.s << ")\n";
+		c.s << ')';
+	}
+}
 
-		unsigned delta_indent = static_cast<const print_tree &>(c).delta_indent;
-		exvector::const_iterator i = children.begin(), end = children.end();
-		while (i != end) {
-			i->print(c, level + delta_indent);
-			++i;
-		}
+void symmetry::do_print_tree(const print_tree & c, unsigned level) const
+{
+	c.s << std::string(level, ' ') << class_name() << " @" << this
+	    << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
+	    << ", type=";
+
+	switch (type) {
+		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 << "<unknown>"; break;
+	}
 
-	} else {
+	c.s << ", indices=(";
+	if (!indices.empty()) {
+		std::set<unsigned>::const_iterator i = indices.begin(), end = indices.end();
+		--end;
+		while (i != end)
+			c.s << *i++ << ",";
+		c.s << *i;
+	}
+	c.s << ")\n";
 
-		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<num; i++) {
-				children[i].print(c);
-				if (i != num - 1)
-					c.s << ",";
-			}
-			c.s << ')';
-		}
+	exvector::const_iterator i = children.begin(), end = children.end();
+	while (i != end) {
+		i->print(c, level + c.delta_indent);
+		++i;
 	}
 }
 
@@ -264,6 +245,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<symmetry>(s);
+}
+
+static const symmetry & index1()
+{
+	static ex s = (new symmetry(1))->setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+static const symmetry & index2()
+{
+	static ex s = (new symmetry(2))->setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+static const symmetry & index3()
+{
+	static ex s = (new symmetry(3))->setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & not_symmetric()
+{
+	static ex s = (new symmetry)->setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & symmetric2()
+{
+	static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & symmetric3()
+{
+	static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->add(index2()).setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & symmetric4()
+{
+	static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->add(index2()).add(index3()).setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & antisymmetric2()
+{
+	static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & antisymmetric3()
+{
+	static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->add(index2()).setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
+const symmetry & antisymmetric4()
+{
+	static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->add(index2()).add(index3()).setflag(status_flags::dynallocated);
+	return ex_to<symmetry>(s);
+}
+
 class sy_is_less : public std::binary_function<ex, ex, bool> {
 	exvector::iterator v;
 
@@ -312,7 +359,7 @@ public:
 
 int canonicalize(exvector::iterator v, const symmetry &symm)
 {
-	// Less than two indices? Then do nothing
+	// Less than two elements? Then do nothing
 	if (symm.indices.size() < 2)
 		return INT_MAX;
 
@@ -342,6 +389,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
@@ -362,10 +411,8 @@ static ex symm(const ex & e, exvector::const_iterator first, exvector::const_ite
 	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;
@@ -380,7 +427,7 @@ static ex symm(const ex & e, exvector::const_iterator first, exvector::const_ite
 		lst new_lst;
 		for (unsigned i=0; i<num; i++)
 			new_lst.append(orig_lst.op(iv[i]));
-		ex term = e.subs(orig_lst, new_lst);
+		ex term = e.subs(orig_lst, new_lst, subs_options::no_pattern);
 		if (asymmetric) {
 			memcpy(iv2, iv, num * sizeof(unsigned));
 			term *= permutation_sign(iv2, iv2 + num);
@@ -411,10 +458,8 @@ ex symmetrize_cyclic(const ex & e, exvector::const_iterator first, exvector::con
 	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);
 	lst new_lst = orig_lst;
 
 	// Loop over all cyclic permutations (the first permutation, which is
@@ -423,7 +468,7 @@ ex symmetrize_cyclic(const ex & e, exvector::const_iterator first, exvector::con
 	for (unsigned i=0; i<num-1; i++) {
 		ex perm = new_lst.op(0);
 		new_lst.remove_first().append(perm);
-		sum += e.subs(orig_lst, new_lst);
+		sum += e.subs(orig_lst, new_lst, subs_options::no_pattern);
 	}
 	return sum / num;
 }
@@ -431,20 +476,14 @@ ex symmetrize_cyclic(const ex & e, exvector::const_iterator first, exvector::con
 /** Symmetrize expression over a list of objects (symbols, indices). */
 ex ex::symmetrize(const lst & l) const
 {
-	exvector v;
-	v.reserve(l.nops());
-	for (unsigned i=0; i<l.nops(); i++)
-		v.push_back(l.op(i));
+	exvector v(l.begin(), l.end());
 	return symm(*this, v.begin(), v.end(), false);
 }
 
 /** Antisymmetrize expression over a list of objects (symbols, indices). */
 ex ex::antisymmetrize(const lst & l) const
 {
-	exvector v;
-	v.reserve(l.nops());
-	for (unsigned i=0; i<l.nops(); i++)
-		v.push_back(l.op(i));
+	exvector v(l.begin(), l.end());
 	return symm(*this, v.begin(), v.end(), true);
 }
 
@@ -452,10 +491,7 @@ ex ex::antisymmetrize(const lst & l) const
  *  (symbols, indices). */
 ex ex::symmetrize_cyclic(const lst & l) const
 {
-	exvector v;
-	v.reserve(l.nops());
-	for (unsigned i=0; i<l.nops(); i++)
-		v.push_back(l.op(i));
+	exvector v(l.begin(), l.end());
 	return GiNaC::symmetrize_cyclic(*this, v.begin(), v.end());
 }