* Implementation of GiNaC's indices. */
/*
- * GiNaC Copyright (C) 1999-2006 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2007 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
GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(idx, basic,
print_func<print_context>(&idx::do_print).
print_func<print_latex>(&idx::do_print_latex).
+ print_func<print_csrc>(&idx::do_print_csrc).
print_func<print_tree>(&idx::do_print_tree))
GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(varidx, idx,
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<numeric>(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() << " @" << this
// 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((unsigned)tinfo());
+ unsigned v = golden_ratio_hash((p_int)tinfo());
v = rotate_left(v);
v ^= value.gethash();
if (it != m.end()) {
// Substitution index->index
- if (is_a<idx>(it->second))
+ if (is_a<idx>(it->second) || (options & subs_options::really_subs_idx))
return it->second;
// Otherwise substitute value