* Implementation of GiNaC's symmetry definitions. */
/*
- * GiNaC Copyright (C) 1999-2003 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
*
* 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 <iostream>
// default constructor
//////////
-symmetry::symmetry() : type(none)
+symmetry::symmetry() : inherited(&symmetry::tinfo_static), type(none)
{
- tinfo_key = TINFO_symmetry;
+ setflag(status_flags::evaluated | status_flags::expanded);
}
//////////
// other constructors
//////////
-symmetry::symmetry(unsigned i) : type(none)
+symmetry::symmetry(unsigned i) : inherited(&symmetry::tinfo_static), type(none)
{
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)
{
add(c1); add(c2);
- tinfo_key = TINFO_symmetry;
+ setflag(status_flags::evaluated | status_flags::expanded);
}
//////////
{
GINAC_ASSERT(is_a<symmetry>(other));
- // All symmetry trees are equal. They are not supposed to appear in
- // ordinary expressions anyway...
+ // For archiving purposes we need to have an ordering of symmetries.
+ const symmetry &othersymm = ex_to<symmetry>(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<unsigned>::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.size(); ++i) {
+ int cmpval = ex_to<symmetry>(children[i])
+ .compare_same_type(ex_to<symmetry>(othersymm.children[i]));
+ if (cmpval)
+ return cmpval;
+ }
+
return 0;
}
+unsigned symmetry::calchash() const
+{
+ 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()) {
void symmetry::do_print_tree(const print_tree & c, unsigned level) const
{
- c.s << std::string(level, ' ') << class_name()
+ c.s << std::string(level, ' ') << class_name() << " @" << this
<< std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
<< ", type=";
// 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;
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, subs_options::no_pattern);
+ ex term = e.subs(orig_lst, new_lst, subs_options::no_pattern|subs_options::no_index_renaming);
if (asymmetric) {
memcpy(iv2, iv, num * sizeof(unsigned));
term *= permutation_sign(iv2, iv2 + num);
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, subs_options::no_pattern);
+ sum += e.subs(orig_lst, new_lst, subs_options::no_pattern|subs_options::no_index_renaming);
}
return sum / num;
}
git://www.ginac.de / ginac.git / blobdiff