* Implementation of GiNaC's symmetry definitions. */
/*
- * GiNaC Copyright (C) 1999-2006 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2019 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
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#include <iostream>
-#include <stdexcept>
-#include <functional>
-
#include "symmetry.h"
#include "lst.h"
+#include "add.h"
#include "numeric.h" // for factorial()
#include "operators.h"
#include "archive.h"
#include "utils.h"
+#include "hash_seed.h"
+
+#include <functional>
+#include <iostream>
+#include <limits>
+#include <stdexcept>
namespace GiNaC {
// default constructor
//////////
-symmetry::symmetry() : inherited(&symmetry::tinfo_static), type(none)
+symmetry::symmetry() : type(none)
{
setflag(status_flags::evaluated | status_flags::expanded);
}
// other constructors
//////////
-symmetry::symmetry(unsigned i) : inherited(&symmetry::tinfo_static), 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(&symmetry::tinfo_static), 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
n.add_unsigned("type", type);
if (children.empty()) {
- std::set<unsigned>::const_iterator i = indices.begin(), iend = indices.end();
- while (i != iend) {
- n.add_unsigned("index", *i);
- i++;
+ for (auto & i : indices) {
+ n.add_unsigned("index", i);
}
} else {
- exvector::const_iterator i = children.begin(), iend = children.end();
- while (i != iend) {
- n.add_ex("child", *i);
- i++;
+ for (auto & i : children) {
+ n.add_ex("child", i);
}
}
}
-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;
+ auto end = indices.end();
+ for (auto 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 = make_hash_seed(typeid(*this));
+
+ if (type == none) {
+ v = rotate_left(v);
+ if (!indices.empty())
+ v ^= *(indices.begin());
+ } else {
+ for (auto & i : children) {
+ 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()) {
c.s << ", indices=(";
if (!indices.empty()) {
- std::set<unsigned>::const_iterator i = indices.begin(), end = indices.end();
+ auto i = indices.begin(), end = indices.end();
--end;
while (i != end)
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;
+ for (auto & i : children) {
+ i.print(c, level + c.delta_indent);
}
}
// non-virtual functions in this class
//////////
+bool symmetry::has_nonsymmetric() const
+{
+ if (type == antisymmetric || type == cyclic)
+ return true;
+
+ for (auto & i : children)
+ if (ex_to<symmetry>(i).has_nonsymmetric())
+ return true;
+
+ return false;
+}
+
+bool symmetry::has_cyclic() const
+{
+ if (type == cyclic)
+ return true;
+
+ for (auto & i : children)
+ 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
static const symmetry & index0()
{
- static ex s = (new symmetry(0))->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(0);
return ex_to<symmetry>(s);
}
static const symmetry & index1()
{
- static ex s = (new symmetry(1))->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(1);
return ex_to<symmetry>(s);
}
static const symmetry & index2()
{
- static ex s = (new symmetry(2))->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(2);
return ex_to<symmetry>(s);
}
static const symmetry & index3()
{
- static ex s = (new symmetry(3))->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(3);
return ex_to<symmetry>(s);
}
const symmetry & not_symmetric()
{
- static ex s = (new symmetry)->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>();
return ex_to<symmetry>(s);
}
const symmetry & symmetric2()
{
- static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(symmetry::symmetric, index0(), index1());
return ex_to<symmetry>(s);
}
const symmetry & symmetric3()
{
- static ex s = (new symmetry(symmetry::symmetric, index0(), index1()))->add(index2()).setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(symmetry::symmetric, index0(), index1()).add(index2());
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);
+ static ex s = dynallocate<symmetry>(symmetry::symmetric, index0(), index1()).add(index2()).add(index3());
return ex_to<symmetry>(s);
}
const symmetry & antisymmetric2()
{
- static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(symmetry::antisymmetric, index0(), index1());
return ex_to<symmetry>(s);
}
const symmetry & antisymmetric3()
{
- static ex s = (new symmetry(symmetry::antisymmetric, index0(), index1()))->add(index2()).setflag(status_flags::dynallocated);
+ static ex s = dynallocate<symmetry>(symmetry::antisymmetric, index0(), index1()).add(index2());
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);
+ static ex s = dynallocate<symmetry>(symmetry::antisymmetric, index0(), index1()).add(index2()).add(index3());
return ex_to<symmetry>(s);
}
-class sy_is_less : public std::binary_function<ex, ex, bool> {
+class sy_is_less {
exvector::iterator v;
public:
GINAC_ASSERT(is_exactly_a<symmetry>(lh));
GINAC_ASSERT(is_exactly_a<symmetry>(rh));
GINAC_ASSERT(ex_to<symmetry>(lh).indices.size() == ex_to<symmetry>(rh).indices.size());
- std::set<unsigned>::const_iterator ait = ex_to<symmetry>(lh).indices.begin(), aitend = ex_to<symmetry>(lh).indices.end(), bit = ex_to<symmetry>(rh).indices.begin();
+ auto ait = ex_to<symmetry>(lh).indices.begin(), aitend = ex_to<symmetry>(lh).indices.end(), bit = ex_to<symmetry>(rh).indices.begin();
while (ait != aitend) {
int cmpval = v[*ait].compare(v[*bit]);
if (cmpval < 0)
}
};
-class sy_swap : public std::binary_function<ex, ex, void> {
+class sy_swap {
exvector::iterator v;
public:
GINAC_ASSERT(is_exactly_a<symmetry>(lh));
GINAC_ASSERT(is_exactly_a<symmetry>(rh));
GINAC_ASSERT(ex_to<symmetry>(lh).indices.size() == ex_to<symmetry>(rh).indices.size());
- std::set<unsigned>::const_iterator ait = ex_to<symmetry>(lh).indices.begin(), aitend = ex_to<symmetry>(lh).indices.end(), bit = ex_to<symmetry>(rh).indices.begin();
+ auto ait = ex_to<symmetry>(lh).indices.begin(), aitend = ex_to<symmetry>(lh).indices.end(), bit = ex_to<symmetry>(rh).indices.begin();
while (ait != aitend) {
v[*ait].swap(v[*bit]);
++ait; ++bit;
{
// 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 sign = 1;
- exvector::const_iterator first = symm.children.begin(), last = symm.children.end();
+ auto first = symm.children.begin(), last = symm.children.end();
while (first != last) {
GINAC_ASSERT(is_exactly_a<symmetry>(*first));
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();
}
unsigned *iv = new unsigned[num], *iv2;
for (unsigned i=0; i<num; i++)
iv[i] = i;
- iv2 = (asymmetric ? new unsigned[num] : NULL);
+ iv2 = (asymmetric ? new unsigned[num] : nullptr);
// Loop over all permutations (the first permutation, which is the
// identity, is unrolled)
- ex sum = e;
+ exvector sum_v;
+ sum_v.push_back(e);
while (std::next_permutation(iv, iv + num)) {
lst new_lst;
for (unsigned i=0; i<num; i++)
memcpy(iv2, iv, num * sizeof(unsigned));
term *= permutation_sign(iv2, iv2 + num);
}
- sum += term;
+ sum_v.push_back(term);
}
+ ex sum = dynallocate<add>(sum_v);
delete[] iv;
delete[] iv2;
git://www.ginac.de / ginac.git / blobdiff