* Implementation of GiNaC's color (SU(3) Lie algebra) objects. */
/*
- * GiNaC Copyright (C) 1999-2003 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
*
* 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 "color.h"
#include "idx.h"
#include "ncmul.h"
#include "archive.h"
#include "utils.h"
+#include <iostream>
+#include <stdexcept>
+
namespace GiNaC {
GINAC_IMPLEMENT_REGISTERED_CLASS(color, indexed)
color::color() : representation_label(0)
{
- tinfo_key = TINFO_color;
}
DEFAULT_CTOR(su3one)
* @see color_ONE */
color::color(const ex & b, unsigned char rl) : inherited(b), representation_label(rl)
{
- tinfo_key = TINFO_color;
}
/** Construct object with one color index. This constructor is for internal
* @see color_T */
color::color(const ex & b, const ex & i1, unsigned char rl) : inherited(b, i1), representation_label(rl)
{
- tinfo_key = TINFO_color;
}
-color::color(unsigned char rl, const exvector & v, bool discardable) : inherited(sy_none(), v, discardable), representation_label(rl)
+color::color(unsigned char rl, const exvector & v) : inherited(not_symmetric(), v), representation_label(rl)
{
- tinfo_key = TINFO_color;
}
-color::color(unsigned char rl, exvector * vp) : inherited(sy_none(), vp), representation_label(rl)
+color::color(unsigned char rl, exvector && v) : inherited(not_symmetric(), std::move(v)), representation_label(rl)
{
- tinfo_key = TINFO_color;
+}
+
+return_type_t color::return_type_tinfo() const
+{
+ return make_return_type_t<color>(representation_label);
}
//////////
// archiving
//////////
-color::color(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
+void color::read_archive(const archive_node& n, lst& sym_lst)
{
+ inherited::read_archive(n, sym_lst);
unsigned rl;
n.find_unsigned("label", rl);
representation_label = rl;
n.add_unsigned("label", representation_label);
}
-DEFAULT_UNARCHIVE(color)
-DEFAULT_ARCHIVING(su3one)
-DEFAULT_ARCHIVING(su3t)
-DEFAULT_ARCHIVING(su3f)
-DEFAULT_ARCHIVING(su3d)
+GINAC_BIND_UNARCHIVER(color);
+GINAC_BIND_UNARCHIVER(su3one);
+GINAC_BIND_UNARCHIVER(su3t);
+GINAC_BIND_UNARCHIVER(su3f);
+GINAC_BIND_UNARCHIVER(su3d);
//////////
// functions overriding virtual functions from base classes
s.reserve(v.size());
// Remove superfluous ONEs
- exvector::const_iterator it = v.begin(), itend = v.end();
- while (it != itend) {
- if (!is_a<su3one>(it->op(0)))
- s.push_back(*it);
- it++;
+ for (auto & it : v) {
+ if (!is_a<su3one>(it.op(0)))
+ s.push_back(it);
}
if (s.empty())
return color(representation_label, v);
}
-ex color::thiscontainer(exvector * vp) const
+ex color::thiscontainer(exvector && v) const
{
- return color(representation_label, vp);
+ return color(representation_label, std::move(v));
}
/** Given a vector iv3 of three indices and a vector iv2 of two indices that
*
* @param iv3 Vector of 3 indices
* @param iv2 Vector of 2 indices, must be a subset of iv3
- * @param sig Returs sign introduced by index permutation
+ * @param sig Returns sign introduced by index permutation
* @return the free index (the one that is in iv3 but not in iv2) */
static ex permute_free_index_to_front(const exvector & iv3, const exvector & iv2, int & sig)
{
if (is_exactly_a<su3t>(other->op(0))) {
- // Contraction only makes sense if the represenation labels are equal
+ // Contraction only makes sense if the representation labels are equal
GINAC_ASSERT(is_a<color>(*other));
if (ex_to<color>(*other).get_representation_label() != rl)
return false;
// T.a S T.a = 1/2 Tr(S) - 1/6 S
} else {
- exvector::iterator it = self + 1;
+ auto it = self + 1;
while (it != other) {
if (!is_a<color>(*it)) {
return false;
&& ex_to<indexed>(*self).has_dummy_index_for(other[1].op(1))) {
exvector self_indices = ex_to<indexed>(*self).get_indices();
- exvector dummy_indices;
- dummy_indices.push_back(other[0].op(1));
- dummy_indices.push_back(other[1].op(1));
+ exvector dummy_indices = {other[0].op(1), other[1].op(1)};
int sig;
ex a = permute_free_index_to_front(self_indices, dummy_indices, sig);
*self = numeric(5, 6);
&& ex_to<indexed>(*self).has_dummy_index_for(other[1].op(1))) {
exvector self_indices = ex_to<indexed>(*self).get_indices();
- exvector dummy_indices;
- dummy_indices.push_back(other[0].op(1));
- dummy_indices.push_back(other[1].op(1));
+ exvector dummy_indices = {other[0].op(1), other[1].op(1)};
int sig;
ex a = permute_free_index_to_front(self_indices, dummy_indices, sig);
*self = numeric(3, 2) * sig * I;
ex color_ONE(unsigned char rl)
{
- return color(su3one(), rl);
+ static ex ONE = dynallocate<su3one>();
+ return color(ONE, rl);
}
ex color_T(const ex & a, unsigned char rl)
{
+ static ex t = dynallocate<su3t>();
+
if (!is_a<idx>(a))
throw(std::invalid_argument("indices of color_T must be of type idx"));
if (!ex_to<idx>(a).get_dim().is_equal(8))
throw(std::invalid_argument("index dimension for color_T must be 8"));
- return color(su3t(), a, rl);
+ return color(t, a, rl);
}
ex color_f(const ex & a, const ex & b, const ex & c)
{
+ static ex f = dynallocate<su3f>();
+
if (!is_a<idx>(a) || !is_a<idx>(b) || !is_a<idx>(c))
throw(std::invalid_argument("indices of color_f must be of type idx"));
if (!ex_to<idx>(a).get_dim().is_equal(8) || !ex_to<idx>(b).get_dim().is_equal(8) || !ex_to<idx>(c).get_dim().is_equal(8))
throw(std::invalid_argument("index dimension for color_f must be 8"));
- return indexed(su3f(), sy_anti(), a, b, c);
+ return indexed(f, antisymmetric3(), a, b, c);
}
ex color_d(const ex & a, const ex & b, const ex & c)
{
+ static ex d = dynallocate<su3d>();
+
if (!is_a<idx>(a) || !is_a<idx>(b) || !is_a<idx>(c))
throw(std::invalid_argument("indices of color_d must be of type idx"));
if (!ex_to<idx>(a).get_dim().is_equal(8) || !ex_to<idx>(b).get_dim().is_equal(8) || !ex_to<idx>(c).get_dim().is_equal(8))
throw(std::invalid_argument("index dimension for color_d must be 8"));
- return indexed(su3d(), sy_symm(), a, b, c);
+ return indexed(d, symmetric3(), a, b, c);
}
ex color_h(const ex & a, const ex & b, const ex & c)
}
/** Check whether a given tinfo key (as returned by return_type_tinfo()
- * is that of a color object with the specified representation label. */
-static bool is_color_tinfo(unsigned ti, unsigned char rl)
+ * is that of a color object (with an arbitrary representation label). */
+static bool is_color_tinfo(const return_type_t& ti)
{
- return ti == (TINFO_color + rl);
+ return *(ti.tinfo) == typeid(color);
}
-ex color_trace(const ex & e, unsigned char rl)
+/** Extract representation label from tinfo key (as returned by
+ * return_type_tinfo()). */
+static unsigned char get_representation_label(const return_type_t& ti)
+{
+ return (unsigned char)ti.rl;
+}
+
+ex color_trace(const ex & e, const std::set<unsigned char> & rls)
{
if (is_a<color>(e)) {
- if (ex_to<color>(e).get_representation_label() == rl
- && is_a<su3one>(e.op(0)))
+ unsigned char rl = ex_to<color>(e).get_representation_label();
+
+ // Are we taking the trace over this object's representation label?
+ if (rls.find(rl) == rls.end())
+ return e;
+
+ // Yes, all generators are traceless, except for color_ONE
+ if (is_a<su3one>(e.op(0)))
return _ex3;
else
return _ex0;
ex prod = _ex1;
for (size_t i=0; i<e.nops(); i++) {
const ex &o = e.op(i);
- if (is_color_tinfo(o.return_type_tinfo(), rl))
- prod *= color_trace(o, rl);
+ if (is_color_tinfo(o.return_type_tinfo()))
+ prod *= color_trace(o, rls);
else
prod *= o;
}
} else if (is_exactly_a<ncmul>(e)) {
- if (!is_color_tinfo(e.return_type_tinfo(), rl))
- return _ex0;
+ unsigned char rl = get_representation_label(e.return_type_tinfo());
- // Expand product, if necessary
+ // Are we taking the trace over this string's representation label?
+ if (rls.find(rl) == rls.end())
+ return e;
+
+ // Yes, expand product if necessary
ex e_expanded = e.expand();
if (!is_a<ncmul>(e_expanded))
- return color_trace(e_expanded, rl);
+ return color_trace(e_expanded, rls);
size_t num = e.nops();
// + 1/2 h_a(n-1)_an_k Tr T_a1 .. T_a(n-2) T_k
const ex &last_index = e.op(num - 1).op(1);
const ex &next_to_last_index = e.op(num - 2).op(1);
- idx summation_index((new symbol)->setflag(status_flags::dynallocated), 8);
+ idx summation_index(dynallocate<symbol>(), 8);
exvector v1;
v1.reserve(num - 2);
} else if (e.nops() > 0) {
// Trace maps to all other container classes (this includes sums)
- pointer_to_map_function_1arg<unsigned char> fcn(color_trace, rl);
+ pointer_to_map_function_1arg<const std::set<unsigned char> &> fcn(color_trace, rls);
return e.map(fcn);
} else
return _ex0;
}
+ex color_trace(const ex & e, const lst & rll)
+{
+ // Convert list to set
+ std::set<unsigned char> rls;
+ for (auto & it : rll) {
+ if (it.info(info_flags::nonnegint))
+ rls.insert(ex_to<numeric>(it).to_int());
+ }
+
+ return color_trace(e, rls);
+}
+
+ex color_trace(const ex & e, unsigned char rl)
+{
+ // Convert label to set
+ std::set<unsigned char> rls;
+ rls.insert(rl);
+
+ return color_trace(e, rls);
+}
+
} // namespace GiNaC
git://www.ginac.de / ginac.git / blobdiff