* Implementation of GiNaC's clifford algebra (Dirac gamma) objects. */
/*
- * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2011 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 <stdexcept>
-
#include "clifford.h"
#include "ex.h"
#include "archive.h"
#include "utils.h"
+#include <stdexcept>
+
namespace GiNaC {
GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(clifford, indexed,
* @see dirac_gamma */
clifford::clifford(const ex & b, const ex & mu, const ex & metr, unsigned char rl, int comm_sign) : inherited(b, mu), representation_label(rl), metric(metr), commutator_sign(comm_sign)
{
- GINAC_ASSERT(is_a<varidx>(mu));
+ GINAC_ASSERT(is_a<idx>(mu));
}
clifford::clifford(unsigned char rl, const ex & metr, int comm_sign, const exvector & v, bool discardable) : inherited(not_symmetric(), v, discardable), representation_label(rl), metric(metr), commutator_sign(comm_sign)
// archiving
//////////
-clifford::clifford(const archive_node & n, lst & sym_lst) : inherited(n, sym_lst)
+void clifford::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("commutator_sign+1", commutator_sign+1);
}
-DEFAULT_UNARCHIVE(clifford)
-DEFAULT_ARCHIVING(diracone)
-DEFAULT_ARCHIVING(cliffordunit)
-DEFAULT_ARCHIVING(diracgamma)
-DEFAULT_ARCHIVING(diracgamma5)
-DEFAULT_ARCHIVING(diracgammaL)
-DEFAULT_ARCHIVING(diracgammaR)
+GINAC_BIND_UNARCHIVER(clifford);
+GINAC_BIND_UNARCHIVER(diracone);
+GINAC_BIND_UNARCHIVER(diracgamma);
+GINAC_BIND_UNARCHIVER(diracgamma5);
+GINAC_BIND_UNARCHIVER(diracgammaL);
+GINAC_BIND_UNARCHIVER(diracgammaR);
ex clifford::get_metric(const ex & i, const ex & j, bool symmetrised) const
return e1;
}
-char clifford_max_label(const ex & e, bool ignore_ONE)
+int clifford_max_label(const ex & e, bool ignore_ONE)
{
if (is_a<clifford>(e))
if (ignore_ONE && is_a<diracone>(e.op(0)))
else
return ex_to<clifford>(e).get_representation_label();
else {
- char rl = -1;
+ int rl = -1;
for (size_t i=0; i < e.nops(); i++)
rl = (rl > clifford_max_label(e.op(i), ignore_ONE)) ? rl : clifford_max_label(e.op(i), ignore_ONE);
return rl;
else if (is_a<ncmul>(e) || is_a<mul>(e)) {
// find a Clifford unit with the same metric, delete it and substitute its index
size_t ind = e.nops() + 1;
- for (size_t j = 0; j < e.nops(); j++)
- if (is_a<clifford>(e.op(j)) && ex_to<clifford>(c).same_metric(e.op(j)))
- if (ind > e.nops())
+ for (size_t j = 0; j < e.nops(); j++) {
+ if (is_a<clifford>(e.op(j)) && ex_to<clifford>(c).same_metric(e.op(j))) {
+ if (ind > e.nops()) {
ind = j;
- else
+ } else {
throw(std::invalid_argument("get_clifford_comp(): expression is a Clifford multi-vector"));
+ }
+ }
+ }
if (ind < e.nops()) {
ex S = 1;
bool same_value_index, found_dummy;
same_value_index = ( ex_to<idx>(e.op(ind).op(1)).is_numeric()
&& (ival == ex_to<numeric>(ex_to<idx>(e.op(ind).op(1)).get_value()).to_int()) );
found_dummy = same_value_index;
- for(size_t j=0; j < e.nops(); j++)
- if (j != ind)
- if (same_value_index)
+ // Run through the expression collecting all non-clifford factors
+ for (size_t j=0; j < e.nops(); j++) {
+ if (j != ind) {
+ if (same_value_index) {
S = S * e.op(j);
- else {
- exvector ind_vec = ex_to<indexed>(e.op(j)).get_dummy_indices(ex_to<indexed>(e.op(ind)));
+ } else {
+ exvector ind_vec;
+ if (is_a<indexed>(e.op(j)))
+ ind_vec = ex_to<indexed>(e.op(j)).get_dummy_indices(ex_to<indexed>(e.op(ind)));
+
if (ind_vec.size() > 0) {
found_dummy = true;
exvector::const_iterator it = ind_vec.begin(), itend = ind_vec.end();
} else
S = S * e.op(j);
}
+ }
+ }
return (found_dummy ? S : 0);
} else
throw(std::invalid_argument("get_clifford_comp(): expression is not a Clifford vector to the given units"));
if (algebraic) // check if algebraic method is applicable
for (unsigned int i = 0; i < D; i++)
if (pow(c.subs(mu == i, subs_options::no_pattern), 2).is_zero()
- or (not is_a<numeric>(pow(c.subs(mu == i, subs_options::no_pattern), 2))))
+ || (! is_a<numeric>(pow(c.subs(mu == i, subs_options::no_pattern), 2))))
algebraic = false;
lst V;
ex v0 = remove_dirac_ONE(canonicalize_clifford(e+clifford_prime(e)).normal())/2;
- if (not v0.is_zero())
+ if (! v0.is_zero())
V.append(v0);
ex e1 = canonicalize_clifford(e - v0 * dirac_ONE(ex_to<clifford>(c).get_representation_label()));
if (algebraic) {
e1 = canonicalize_clifford(expand_dummy_sum(e, true));
V.remove_all();
v0 = remove_dirac_ONE(canonicalize_clifford(e1+clifford_prime(e1)).normal())/2;
- if (not v0.is_zero()) {
+ if (! v0.is_zero()) {
V.append(v0);
e1 = canonicalize_clifford(e1 - v0 * dirac_ONE(ex_to<clifford>(c).get_representation_label()));
}