* Implementation of GiNaC's indices. */
/*
- * GiNaC Copyright (C) 1999-2002 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2003 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
*/
#include <iostream>
+#include <sstream>
#include <stdexcept>
#include "idx.h"
#include "symbol.h"
#include "lst.h"
#include "relational.h"
+#include "operators.h"
#include "print.h"
#include "archive.h"
#include "utils.h"
GINAC_IMPLEMENT_REGISTERED_CLASS(spinidx, varidx)
//////////
-// default ctor, dtor, copy ctor, assignment operator and helpers
+// default constructor
//////////
idx::idx() : inherited(TINFO_idx) {}
tinfo_key = TINFO_spinidx;
}
-void idx::copy(const idx & other)
-{
- inherited::copy(other);
- value = other.value;
- dim = other.dim;
-}
-
-void varidx::copy(const varidx & other)
-{
- inherited::copy(other);
- covariant = other.covariant;
-}
-
-void spinidx::copy(const spinidx & other)
-{
- inherited::copy(other);
- dotted = other.dotted;
-}
-
-DEFAULT_DESTROY(idx)
-DEFAULT_DESTROY(varidx)
-DEFAULT_DESTROY(spinidx)
-
//////////
// other constructors
//////////
// archiving
//////////
-idx::idx(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
+idx::idx(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
{
n.find_ex("value", value, sym_lst);
n.find_ex("dim", dim, sym_lst);
}
-varidx::varidx(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
+varidx::varidx(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
{
n.find_bool("covariant", covariant);
}
-spinidx::spinidx(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
+spinidx::spinidx(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
{
n.find_bool("dotted", dotted);
}
void idx::print(const print_context & c, unsigned level) const
{
- if (is_of_type(c, print_tree)) {
+ if (is_a<print_tree>(c)) {
c.s << std::string(level, ' ') << class_name()
<< std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
c.s << "{";
else
c.s << ".";
- bool need_parens = !(is_ex_exactly_of_type(value, numeric) || is_ex_of_type(value, symbol));
+ bool need_parens = !(is_exactly_a<numeric>(value) || is_a<symbol>(value));
if (need_parens)
c.s << "(";
value.print(c);
if (need_parens)
c.s << ")";
+ if (c.options & print_options::print_index_dimensions) {
+ c.s << "[";
+ dim.print(c);
+ c.s << "]";
+ }
if (is_a<print_latex>(c))
c.s << "}";
}
void varidx::print(const print_context & c, unsigned level) const
{
- if (is_of_type(c, print_tree)) {
+ if (is_a<print_tree>(c)) {
c.s << std::string(level, ' ') << class_name()
<< std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
else
c.s << "~";
}
- bool need_parens = !(is_ex_exactly_of_type(value, numeric) || is_ex_of_type(value, symbol));
+ bool need_parens = !(is_exactly_a<numeric>(value) || is_a<symbol>(value));
if (need_parens)
c.s << "(";
value.print(c);
if (need_parens)
c.s << ")";
+ if (c.options & print_options::print_index_dimensions) {
+ c.s << "[";
+ dim.print(c);
+ c.s << "]";
+ }
if (is_a<print_latex>(c))
c.s << "}";
}
void spinidx::print(const print_context & c, unsigned level) const
{
- if (is_of_type(c, print_tree)) {
+ if (is_a<print_tree>(c)) {
c.s << std::string(level, ' ') << class_name()
<< std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
} else {
- bool is_tex = is_of_type(c, print_latex);
+ bool is_tex = is_a<print_latex>(c);
if (is_tex) {
if (covariant)
c.s << "_{";
else
c.s << "*";
}
- bool need_parens = !(is_ex_exactly_of_type(value, numeric) || is_ex_of_type(value, symbol));
+ bool need_parens = !(is_exactly_a<numeric>(value) || is_a<symbol>(value));
if (need_parens)
c.s << "(";
value.print(c);
return inherited::info(inf);
}
-unsigned idx::nops() const
+size_t idx::nops() const
{
// don't count the dimension as that is not really a sub-expression
return 1;
}
-ex & idx::let_op(int i)
+ex idx::op(size_t i) const
{
GINAC_ASSERT(i == 0);
return value;
}
+ex idx::map(map_function & f) const
+{
+ idx *copy = duplicate();
+ copy->setflag(status_flags::dynallocated);
+ copy->clearflag(status_flags::hash_calculated);
+ copy->value = f(value);
+ return *copy;
+}
+
/** Returns order relation between two indices of the same type. The order
* must be such that dummy indices lie next to each other. */
int idx::compare_same_type(const basic & other) const
// Check variance last so dummy indices will end up next to each other
if (covariant != o.covariant)
return covariant ? -1 : 1;
+
return 0;
}
if (covariant != o.covariant)
return false;
+
return inherited::match_same_type(other);
}
return *this;
}
-ex idx::subs(const lst & ls, const lst & lr, bool no_pattern) const
+ex idx::subs(const exmap & m, unsigned options) const
{
- GINAC_ASSERT(ls.nops() == lr.nops());
-
// First look for index substitutions
- for (unsigned i=0; i<ls.nops(); i++) {
- if (is_equal(ex_to<basic>(ls.op(i)))) {
-
- // Substitution index->index
- if (is_ex_of_type(lr.op(i), idx))
- return lr.op(i);
-
- // Otherwise substitute value
- idx *i_copy = static_cast<idx *>(duplicate());
- i_copy->value = lr.op(i);
- i_copy->clearflag(status_flags::hash_calculated);
- return i_copy->setflag(status_flags::dynallocated);
- }
+ exmap::const_iterator it = m.find(*this);
+ if (it != m.end()) {
+
+ // Substitution index->index
+ if (is_a<idx>(it->second))
+ return it->second;
+
+ // Otherwise substitute value
+ idx *i_copy = duplicate();
+ i_copy->value = it->second;
+ i_copy->clearflag(status_flags::hash_calculated);
+ return i_copy->setflag(status_flags::dynallocated);
}
// None, substitute objects in value (not in dimension)
- const ex &subsed_value = value.subs(ls, lr, no_pattern);
+ const ex &subsed_value = value.subs(m, options);
if (are_ex_trivially_equal(value, subsed_value))
return *this;
- idx *i_copy = static_cast<idx *>(duplicate());
+ idx *i_copy = duplicate();
i_copy->value = subsed_value;
i_copy->clearflag(status_flags::hash_calculated);
return i_copy->setflag(status_flags::dynallocated);
{
const idx &o = static_cast<const idx &>(other);
- // Only pure symbols form dummy pairs, numeric indices and expressions
- // like "2n+1" don't
- if (!is_ex_of_type(value, symbol))
+ // Only pure symbols form dummy pairs, "2n+1" doesn't
+ if (!is_a<symbol>(value))
return false;
// Value must be equal, of course
if (dim.is_equal(o.dim))
return true;
- return (dim < o.dim || dim > o.dim);
+ return (dim < o.dim || dim > o.dim || (is_exactly_a<numeric>(dim) && is_a<symbol>(o.dim)) || (is_a<symbol>(dim) && is_exactly_a<numeric>(o.dim)));
}
bool varidx::is_dummy_pair_same_type(const basic & other) const
ex idx::replace_dim(const ex & new_dim) const
{
- idx *i_copy = static_cast<idx *>(duplicate());
+ idx *i_copy = duplicate();
i_copy->dim = new_dim;
i_copy->clearflag(status_flags::hash_calculated);
return i_copy->setflag(status_flags::dynallocated);
ex idx::minimal_dim(const idx & other) const
{
- if (dim.is_equal(other.dim) || dim < other.dim)
- return dim;
- else if (dim > other.dim)
- return other.dim;
- else
- throw (std::runtime_error("idx::minimal_dim: index dimensions cannot be ordered"));
+ return GiNaC::minimal_dim(dim, other.dim);
}
-ex varidx::toggle_variance(void) const
+ex varidx::toggle_variance() const
{
- varidx *i_copy = static_cast<varidx *>(duplicate());
+ varidx *i_copy = duplicate();
i_copy->covariant = !i_copy->covariant;
i_copy->clearflag(status_flags::hash_calculated);
return i_copy->setflag(status_flags::dynallocated);
}
-ex spinidx::toggle_dot(void) const
+ex spinidx::toggle_dot() const
{
- spinidx *i_copy = static_cast<spinidx *>(duplicate());
+ spinidx *i_copy = duplicate();
i_copy->dotted = !i_copy->dotted;
i_copy->clearflag(status_flags::hash_calculated);
return i_copy->setflag(status_flags::dynallocated);
}
-ex spinidx::toggle_variance_dot(void) const
+ex spinidx::toggle_variance_dot() const
{
- spinidx *i_copy = static_cast<spinidx *>(duplicate());
+ spinidx *i_copy = duplicate();
i_copy->covariant = !i_copy->covariant;
i_copy->dotted = !i_copy->dotted;
i_copy->clearflag(status_flags::hash_calculated);
bool is_dummy_pair(const ex & e1, const ex & e2)
{
// The expressions must be indices
- if (!is_ex_of_type(e1, idx) || !is_ex_of_type(e2, idx))
+ if (!is_a<idx>(e1) || !is_a<idx>(e2))
return false;
return is_dummy_pair(ex_to<idx>(e1), ex_to<idx>(e2));
out_free.push_back(*last);
}
+ex minimal_dim(const ex & dim1, const ex & dim2)
+{
+ if (dim1.is_equal(dim2) || dim1 < dim2 || (is_exactly_a<numeric>(dim1) && is_a<symbol>(dim2)))
+ return dim1;
+ else if (dim1 > dim2 || (is_a<symbol>(dim1) && is_exactly_a<numeric>(dim2)))
+ return dim2;
+ else {
+ std::ostringstream s;
+ s << "minimal_dim(): index dimensions " << dim1 << " and " << dim2 << " cannot be ordered";
+ throw (std::runtime_error(s.str()));
+ }
+}
+
} // namespace GiNaC
git://www.ginac.de / ginac.git / blobdiff