* Implementation of GiNaC's symmetry definitions. */
/*
- * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2008 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>
#include <stdexcept>
#include <functional>
+#include <limits>
#include "symmetry.h"
#include "lst.h"
// default constructor
//////////
-symmetry::symmetry() : inherited(TINFO_symmetry), type(none)
+symmetry::symmetry() : type(none)
{
setflag(status_flags::evaluated | status_flags::expanded);
}
// other constructors
//////////
-symmetry::symmetry(unsigned i) : inherited(TINFO_symmetry), type(none)
+symmetry::symmetry(unsigned i) : type(none)
{
indices.insert(i);
setflag(status_flags::evaluated | status_flags::expanded);
}
-symmetry::symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2) : inherited(TINFO_symmetry), type(t)
+symmetry::symmetry(symmetry_type t, const symmetry &c1, const symmetry &c2) : type(t)
{
add(c1); add(c2);
setflag(status_flags::evaluated | status_flags::expanded);
//////////
/** Construct object from archive_node. */
-symmetry::symmetry(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
+void symmetry::read_archive(const archive_node &n, lst &sym_lst)
{
+ inherited::read_archive(n, sym_lst);
unsigned t;
if (!(n.find_unsigned("type", t)))
throw (std::runtime_error("unknown symmetry type in archive"));
}
}
}
+GINAC_BIND_UNARCHIVER(symmetry);
/** Archive the object. */
void symmetry::archive(archive_node &n) const
}
}
-DEFAULT_UNARCHIVE(symmetry)
-
//////////
// functions overriding virtual functions from base classes
//////////
{
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
+{
+ const void* this_tinfo = (const void*)typeid(*this).name();
+ unsigned v = golden_ratio_hash((p_int)this_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()) {
// non-virtual functions in this class
//////////
+bool symmetry::has_cyclic() const
+{
+ if (type == cyclic)
+ return true;
+
+ for (exvector::const_iterator i=children.begin(); i!=children.end(); ++i)
+ if (ex_to<symmetry>(*i).has_cyclic())
+ return true;
+
+ return false;
+}
+
symmetry &symmetry::add(const symmetry &c)
{
// All children must have the same number of indices
{
// Less than two elements? Then do nothing
if (symm.indices.size() < 2)
- return INT_MAX;
+ return std::numeric_limits<int>::max();
// Canonicalize children first
bool something_changed = false;
int child_sign = canonicalize(v, ex_to<symmetry>(*first));
if (child_sign == 0)
return 0;
- if (child_sign != INT_MAX) {
+ if (child_sign != std::numeric_limits<int>::max()) {
something_changed = true;
sign *= child_sign;
}
default:
break;
}
- return something_changed ? sign : INT_MAX;
+ return something_changed ? sign : std::numeric_limits<int>::max();
}
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