3 * Implementation of GiNaC's indices. */
6 * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
35 GINAC_IMPLEMENT_REGISTERED_CLASS(idx, basic)
36 GINAC_IMPLEMENT_REGISTERED_CLASS(varidx, idx)
37 GINAC_IMPLEMENT_REGISTERED_CLASS(spinidx, varidx)
40 // default ctor, dtor, copy ctor, assignment operator and helpers
43 idx::idx() : inherited(TINFO_idx) {}
45 varidx::varidx() : covariant(false)
47 tinfo_key = TINFO_varidx;
50 spinidx::spinidx() : dotted(false)
52 tinfo_key = TINFO_spinidx;
55 void idx::copy(const idx & other)
57 inherited::copy(other);
62 void varidx::copy(const varidx & other)
64 inherited::copy(other);
65 covariant = other.covariant;
68 void spinidx::copy(const spinidx & other)
70 inherited::copy(other);
71 dotted = other.dotted;
75 DEFAULT_DESTROY(varidx)
76 DEFAULT_DESTROY(spinidx)
82 idx::idx(const ex & v, const ex & d) : inherited(TINFO_idx), value(v), dim(d)
85 if (!dim.info(info_flags::posint))
86 throw(std::invalid_argument("dimension of space must be a positive integer"));
89 varidx::varidx(const ex & v, const ex & d, bool cov) : inherited(v, d), covariant(cov)
91 tinfo_key = TINFO_varidx;
94 spinidx::spinidx(const ex & v, const ex & d, bool cov, bool dot) : inherited(v, d, cov), dotted(dot)
96 tinfo_key = TINFO_spinidx;
103 idx::idx(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
105 n.find_ex("value", value, sym_lst);
106 n.find_ex("dim", dim, sym_lst);
109 varidx::varidx(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
111 n.find_bool("covariant", covariant);
114 spinidx::spinidx(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
116 n.find_bool("dotted", dotted);
119 void idx::archive(archive_node &n) const
121 inherited::archive(n);
122 n.add_ex("value", value);
123 n.add_ex("dim", dim);
126 void varidx::archive(archive_node &n) const
128 inherited::archive(n);
129 n.add_bool("covariant", covariant);
132 void spinidx::archive(archive_node &n) const
134 inherited::archive(n);
135 n.add_bool("dotted", dotted);
138 DEFAULT_UNARCHIVE(idx)
139 DEFAULT_UNARCHIVE(varidx)
140 DEFAULT_UNARCHIVE(spinidx)
143 // functions overriding virtual functions from base classes
146 void idx::print(const print_context & c, unsigned level) const
148 if (is_of_type(c, print_tree)) {
150 c.s << std::string(level, ' ') << class_name()
151 << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
153 unsigned delta_indent = static_cast<const print_tree &>(c).delta_indent;
154 value.print(c, level + delta_indent);
155 dim.print(c, level + delta_indent);
159 if (!is_of_type(c, print_latex))
161 bool need_parens = !(is_ex_exactly_of_type(value, numeric) || is_ex_of_type(value, symbol));
170 void varidx::print(const print_context & c, unsigned level) const
172 if (is_of_type(c, print_tree)) {
174 c.s << std::string(level, ' ') << class_name()
175 << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
176 << (covariant ? ", covariant" : ", contravariant")
178 unsigned delta_indent = static_cast<const print_tree &>(c).delta_indent;
179 value.print(c, level + delta_indent);
180 dim.print(c, level + delta_indent);
184 if (!is_of_type(c, print_latex)) {
190 bool need_parens = !(is_ex_exactly_of_type(value, numeric) || is_ex_of_type(value, symbol));
199 void spinidx::print(const print_context & c, unsigned level) const
201 if (is_of_type(c, print_tree)) {
203 c.s << std::string(level, ' ') << class_name()
204 << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
205 << (covariant ? ", covariant" : ", contravariant")
206 << (dotted ? ", dotted" : ", undotted")
208 unsigned delta_indent = static_cast<const print_tree &>(c).delta_indent;
209 value.print(c, level + delta_indent);
210 dim.print(c, level + delta_indent);
214 bool is_tex = is_of_type(c, print_latex);
227 bool need_parens = !(is_ex_exactly_of_type(value, numeric) || is_ex_of_type(value, symbol));
233 if (is_tex && dotted)
238 bool idx::info(unsigned inf) const
240 if (inf == info_flags::idx)
242 return inherited::info(inf);
245 unsigned idx::nops() const
247 // don't count the dimension as that is not really a sub-expression
251 ex & idx::let_op(int i)
253 GINAC_ASSERT(i == 0);
257 /** Returns order relation between two indices of the same type. The order
258 * must be such that dummy indices lie next to each other. */
259 int idx::compare_same_type(const basic & other) const
261 GINAC_ASSERT(is_a<idx>(other));
262 const idx &o = static_cast<const idx &>(other);
264 int cmpval = value.compare(o.value);
267 return dim.compare(o.dim);
270 bool idx::match_same_type(const basic & other) const
272 GINAC_ASSERT(is_a<idx>(other));
273 const idx &o = static_cast<const idx &>(other);
275 return dim.is_equal(o.dim);
278 int varidx::compare_same_type(const basic & other) const
280 GINAC_ASSERT(is_a<varidx>(other));
281 const varidx &o = static_cast<const varidx &>(other);
283 int cmpval = inherited::compare_same_type(other);
287 // Check variance last so dummy indices will end up next to each other
288 if (covariant != o.covariant)
289 return covariant ? -1 : 1;
293 bool varidx::match_same_type(const basic & other) const
295 GINAC_ASSERT(is_a<varidx>(other));
296 const varidx &o = static_cast<const varidx &>(other);
298 if (covariant != o.covariant)
300 return inherited::match_same_type(other);
303 int spinidx::compare_same_type(const basic & other) const
305 GINAC_ASSERT(is_a<spinidx>(other));
306 const spinidx &o = static_cast<const spinidx &>(other);
308 // Check dottedness first so dummy indices will end up next to each other
309 if (dotted != o.dotted)
310 return dotted ? -1 : 1;
312 int cmpval = inherited::compare_same_type(other);
319 bool spinidx::match_same_type(const basic & other) const
321 GINAC_ASSERT(is_a<spinidx>(other));
322 const spinidx &o = static_cast<const spinidx &>(other);
324 if (dotted != o.dotted)
326 return inherited::match_same_type(other);
329 /** By default, basic::evalf would evaluate the index value but we don't want
330 * a.1 to become a.(1.0). */
331 ex idx::evalf(int level) const
336 ex idx::subs(const lst & ls, const lst & lr, bool no_pattern) const
338 GINAC_ASSERT(ls.nops() == lr.nops());
340 // First look for index substitutions
341 for (unsigned i=0; i<ls.nops(); i++) {
342 if (is_equal(ex_to<basic>(ls.op(i)))) {
344 // Substitution index->index
345 if (is_ex_of_type(lr.op(i), idx))
348 // Otherwise substitute value
349 idx *i_copy = static_cast<idx *>(duplicate());
350 i_copy->value = lr.op(i);
351 i_copy->clearflag(status_flags::hash_calculated);
352 return i_copy->setflag(status_flags::dynallocated);
356 // None, substitute objects in value (not in dimension)
357 const ex &subsed_value = value.subs(ls, lr, no_pattern);
358 if (are_ex_trivially_equal(value, subsed_value))
361 idx *i_copy = static_cast<idx *>(duplicate());
362 i_copy->value = subsed_value;
363 i_copy->clearflag(status_flags::hash_calculated);
364 return i_copy->setflag(status_flags::dynallocated);
367 /** Implementation of ex::diff() for an index always returns 0.
370 ex idx::derivative(const symbol & s) const
376 // new virtual functions
379 bool idx::is_dummy_pair_same_type(const basic & other) const
381 const idx &o = static_cast<const idx &>(other);
383 // Only pure symbols form dummy pairs, "2n+1" doesn't
384 if (!is_ex_of_type(value, symbol))
387 // Value must be equal, of course
388 if (!value.is_equal(o.value))
391 // Also the dimension
392 return dim.is_equal(o.dim);
395 bool varidx::is_dummy_pair_same_type(const basic & other) const
397 const varidx &o = static_cast<const varidx &>(other);
399 // Variance must be opposite
400 if (covariant == o.covariant)
403 return inherited::is_dummy_pair_same_type(other);
406 bool spinidx::is_dummy_pair_same_type(const basic & other) const
408 const spinidx &o = static_cast<const spinidx &>(other);
410 // Dottedness must be the same
411 if (dotted != o.dotted)
414 return inherited::is_dummy_pair_same_type(other);
419 // non-virtual functions
422 ex varidx::toggle_variance(void) const
424 varidx *i_copy = static_cast<varidx *>(duplicate());
425 i_copy->covariant = !i_copy->covariant;
426 i_copy->clearflag(status_flags::hash_calculated);
427 return i_copy->setflag(status_flags::dynallocated);
430 ex spinidx::toggle_dot(void) const
432 spinidx *i_copy = static_cast<spinidx *>(duplicate());
433 i_copy->dotted = !i_copy->dotted;
434 i_copy->clearflag(status_flags::hash_calculated);
435 return i_copy->setflag(status_flags::dynallocated);
438 ex spinidx::toggle_variance_dot(void) const
440 spinidx *i_copy = static_cast<spinidx *>(duplicate());
441 i_copy->covariant = !i_copy->covariant;
442 i_copy->dotted = !i_copy->dotted;
443 i_copy->clearflag(status_flags::hash_calculated);
444 return i_copy->setflag(status_flags::dynallocated);
451 bool is_dummy_pair(const idx & i1, const idx & i2)
453 // The indices must be of exactly the same type
454 if (i1.tinfo() != i2.tinfo())
457 // Same type, let the indices decide whether they are paired
458 return i1.is_dummy_pair_same_type(i2);
461 bool is_dummy_pair(const ex & e1, const ex & e2)
463 // The expressions must be indices
464 if (!is_ex_of_type(e1, idx) || !is_ex_of_type(e2, idx))
467 return is_dummy_pair(ex_to<idx>(e1), ex_to<idx>(e2));
470 void find_free_and_dummy(exvector::const_iterator it, exvector::const_iterator itend, exvector & out_free, exvector & out_dummy)
475 // No indices? Then do nothing
479 // Only one index? Then it is a free one if it's not numeric
480 if (itend - it == 1) {
481 if (ex_to<idx>(*it).is_symbolic())
482 out_free.push_back(*it);
486 // Sort index vector. This will cause dummy indices come to lie next
487 // to each other (because the sort order is defined to guarantee this).
488 exvector v(it, itend);
489 shaker_sort(v.begin(), v.end(), ex_is_less(), ex_swap());
491 // Find dummy pairs and free indices
492 it = v.begin(); itend = v.end();
493 exvector::const_iterator last = it++;
494 while (it != itend) {
495 if (is_dummy_pair(*it, *last)) {
496 out_dummy.push_back(*last);
501 if (!it->is_equal(*last) && ex_to<idx>(*last).is_symbolic())
502 out_free.push_back(*last);
506 if (ex_to<idx>(*last).is_symbolic())
507 out_free.push_back(*last);