X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fidx.cpp;h=c1412b9de73ff8bcfe5c43e7d679e7c4d3757935;hp=be9d6b41d91b5e2ad328c3a5f7ec492b9d361549;hb=4ee761760b3db8649b8b616256cd7466fe2cd033;hpb=b4be7b0f30fbb6178cf4ee83e1b3952e084bd8ca diff --git a/ginac/idx.cpp b/ginac/idx.cpp index be9d6b41..c1412b9d 100644 --- a/ginac/idx.cpp +++ b/ginac/idx.cpp @@ -3,7 +3,7 @@ * Implementation of GiNaC's indices. */ /* - * GiNaC Copyright (C) 1999-2003 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 @@ -17,7 +17,7 @@ * * 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 @@ -37,11 +37,12 @@ namespace GiNaC { GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(idx, basic, print_func(&idx::do_print). print_func(&idx::do_print_latex). + print_func(&idx::do_print_csrc). print_func(&idx::do_print_tree)) GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(varidx, idx, print_func(&varidx::do_print). - // print_latex inherited from idx + print_func(&varidx::do_print_latex). print_func(&varidx::do_print_tree)) GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(spinidx, varidx, @@ -53,23 +54,23 @@ GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(spinidx, varidx, // default constructor ////////// -idx::idx() : inherited(TINFO_idx) {} +idx::idx() : inherited(&idx::tinfo_static) {} varidx::varidx() : covariant(false) { - tinfo_key = TINFO_varidx; + tinfo_key = &varidx::tinfo_static; } spinidx::spinidx() : dotted(false) { - tinfo_key = TINFO_spinidx; + tinfo_key = &spinidx::tinfo_static; } ////////// // other constructors ////////// -idx::idx(const ex & v, const ex & d) : inherited(TINFO_idx), value(v), dim(d) +idx::idx(const ex & v, const ex & d) : inherited(&idx::tinfo_static), value(v), dim(d) { if (is_dim_numeric()) if (!dim.info(info_flags::posint)) @@ -78,12 +79,12 @@ idx::idx(const ex & v, const ex & d) : inherited(TINFO_idx), value(v), dim(d) varidx::varidx(const ex & v, const ex & d, bool cov) : inherited(v, d), covariant(cov) { - tinfo_key = TINFO_varidx; + tinfo_key = &varidx::tinfo_static; } spinidx::spinidx(const ex & v, const ex & d, bool cov, bool dot) : inherited(v, d, cov), dotted(dot) { - tinfo_key = TINFO_spinidx; + tinfo_key = &spinidx::tinfo_static; } ////////// @@ -161,9 +162,19 @@ void idx::do_print_latex(const print_latex & c, unsigned level) const c.s << "}"; } +void idx::do_print_csrc(const print_csrc & c, unsigned level) const +{ + c.s << "["; + if (value.info(info_flags::integer)) + c.s << ex_to(value).to_int(); + else + value.print(c); + c.s << "]"; +} + void idx::do_print_tree(const print_tree & c, unsigned level) const { - c.s << std::string(level, ' ') << class_name() + c.s << std::string(level, ' ') << class_name() << " @" << this << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec << std::endl; value.print(c, level + c.delta_indent); @@ -181,7 +192,7 @@ void varidx::do_print(const print_context & c, unsigned level) const void varidx::do_print_tree(const print_tree & c, unsigned level) const { - c.s << std::string(level, ' ') << class_name() + c.s << std::string(level, ' ') << class_name() << " @" << this << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec << (covariant ? ", covariant" : ", contravariant") << std::endl; @@ -212,7 +223,7 @@ void spinidx::do_print_latex(const print_latex & c, unsigned level) const void spinidx::do_print_tree(const print_tree & c, unsigned level) const { - c.s << std::string(level, ' ') << class_name() + c.s << std::string(level, ' ') << class_name() << " @" << this << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec << (covariant ? ", covariant" : ", contravariant") << (dotted ? ", dotted" : ", undotted") @@ -223,8 +234,11 @@ void spinidx::do_print_tree(const print_tree & c, unsigned level) const bool idx::info(unsigned inf) const { - if (inf == info_flags::idx) - return true; + switch(inf) { + case info_flags::idx: + case info_flags::has_indices: + return true; + } return inherited::info(inf); } @@ -242,11 +256,16 @@ ex idx::op(size_t i) const 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; + const ex &mapped_value = f(value); + if (are_ex_trivially_equal(value, mapped_value)) + return *this; + else { + idx *copy = duplicate(); + copy->setflag(status_flags::dynallocated); + copy->clearflag(status_flags::hash_calculated); + copy->value = mapped_value; + return *copy; + } } /** Returns order relation between two indices of the same type. The order @@ -325,11 +344,17 @@ bool spinidx::match_same_type(const basic & other) const unsigned idx::calchash() const { - unsigned v = golden_ratio_hash(tinfo()); + // NOTE: The code in simplify_indexed() assumes that canonically + // ordered sequences of indices have the two members of dummy index + // pairs lying next to each other. The hash values for indices must + // be devised accordingly. The easiest (only?) way to guarantee the + // desired ordering is to make indices with the same value have equal + // hash keys. That is, the hash values must not depend on the index + // dimensions or other attributes (variance etc.). + // The compare_same_type() methods will take care of the rest. + unsigned v = golden_ratio_hash((p_int)tinfo()); v = rotate_left(v); v ^= value.gethash(); - v = rotate_left(v); - v ^= dim.gethash(); // Store calculated hash value only if object is already evaluated if (flags & status_flags::evaluated) { @@ -354,7 +379,7 @@ ex idx::subs(const exmap & m, unsigned options) const if (it != m.end()) { // Substitution index->index - if (is_a(it->second)) + if (is_a(it->second) || (options & subs_options::really_subs_idx)) return it->second; // Otherwise substitute value @@ -404,7 +429,7 @@ bool idx::is_dummy_pair_same_type(const basic & other) const if (dim.is_equal(o.dim)) return true; - return (dim < o.dim || dim > o.dim || (is_exactly_a(dim) && is_a(o.dim)) || (is_a(dim) && is_exactly_a(o.dim))); + return is_exactly_a(dim) || is_exactly_a(o.dim); } bool varidx::is_dummy_pair_same_type(const basic & other) const @@ -537,9 +562,9 @@ void find_free_and_dummy(exvector::const_iterator it, exvector::const_iterator i ex minimal_dim(const ex & dim1, const ex & dim2) { - if (dim1.is_equal(dim2) || dim1 < dim2 || (is_exactly_a(dim1) && is_a(dim2))) + if (dim1.is_equal(dim2) || dim1 < dim2 || (is_exactly_a(dim1) && !is_a(dim2))) return dim1; - else if (dim1 > dim2 || (is_a(dim1) && is_exactly_a(dim2))) + else if (dim1 > dim2 || (!is_a(dim1) && is_exactly_a(dim2))) return dim2; else { std::ostringstream s;