3 * Implementation of GiNaC's non-commutative products of expressions. */
6 * GiNaC Copyright (C) 1999-2004 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
37 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(ncmul, exprseq,
38 print_func<print_context>(&ncmul::do_print).
39 print_func<print_tree>(&ncmul::do_print_tree).
40 print_func<print_csrc>(&ncmul::do_print_csrc).
41 print_func<print_python_repr>(&ncmul::do_print_csrc))
45 // default constructor
50 tinfo_key = TINFO_ncmul;
59 ncmul::ncmul(const ex & lh, const ex & rh) : inherited(lh,rh)
61 tinfo_key = TINFO_ncmul;
64 ncmul::ncmul(const ex & f1, const ex & f2, const ex & f3) : inherited(f1,f2,f3)
66 tinfo_key = TINFO_ncmul;
69 ncmul::ncmul(const ex & f1, const ex & f2, const ex & f3,
70 const ex & f4) : inherited(f1,f2,f3,f4)
72 tinfo_key = TINFO_ncmul;
75 ncmul::ncmul(const ex & f1, const ex & f2, const ex & f3,
76 const ex & f4, const ex & f5) : inherited(f1,f2,f3,f4,f5)
78 tinfo_key = TINFO_ncmul;
81 ncmul::ncmul(const ex & f1, const ex & f2, const ex & f3,
82 const ex & f4, const ex & f5, const ex & f6) : inherited(f1,f2,f3,f4,f5,f6)
84 tinfo_key = TINFO_ncmul;
87 ncmul::ncmul(const exvector & v, bool discardable) : inherited(v,discardable)
89 tinfo_key = TINFO_ncmul;
92 ncmul::ncmul(std::auto_ptr<exvector> vp) : inherited(vp)
94 tinfo_key = TINFO_ncmul;
101 DEFAULT_ARCHIVING(ncmul)
104 // functions overriding virtual functions from base classes
109 void ncmul::do_print(const print_context & c, unsigned level) const
111 printseq(c, '(', '*', ')', precedence(), level);
114 void ncmul::do_print_csrc(const print_context & c, unsigned level) const
117 printseq(c, '(', ',', ')', precedence(), precedence());
120 bool ncmul::info(unsigned inf) const
122 return inherited::info(inf);
125 typedef std::vector<int> intvector;
127 ex ncmul::expand(unsigned options) const
129 // First, expand the children
130 std::auto_ptr<exvector> vp = expandchildren(options);
131 const exvector &expanded_seq = vp.get() ? *vp : this->seq;
133 // Now, look for all the factors that are sums and remember their
134 // position and number of terms.
135 intvector positions_of_adds(expanded_seq.size());
136 intvector number_of_add_operands(expanded_seq.size());
138 size_t number_of_adds = 0;
139 size_t number_of_expanded_terms = 1;
141 size_t current_position = 0;
142 exvector::const_iterator last = expanded_seq.end();
143 for (exvector::const_iterator cit=expanded_seq.begin(); cit!=last; ++cit) {
144 if (is_exactly_a<add>(*cit)) {
145 positions_of_adds[number_of_adds] = current_position;
146 size_t num_ops = cit->nops();
147 number_of_add_operands[number_of_adds] = num_ops;
148 number_of_expanded_terms *= num_ops;
154 // If there are no sums, we are done
155 if (number_of_adds == 0) {
157 return (new ncmul(vp))->
158 setflag(status_flags::dynallocated | (options == 0 ? status_flags::expanded : 0));
163 // Now, form all possible products of the terms of the sums with the
164 // remaining factors, and add them together
166 distrseq.reserve(number_of_expanded_terms);
168 intvector k(number_of_adds);
171 exvector term = expanded_seq;
172 for (size_t i=0; i<number_of_adds; i++)
173 term[positions_of_adds[i]] = expanded_seq[positions_of_adds[i]].op(k[i]);
174 distrseq.push_back((new ncmul(term, true))->
175 setflag(status_flags::dynallocated | (options == 0 ? status_flags::expanded : 0)));
178 int l = number_of_adds-1;
179 while ((l>=0) && ((++k[l]) >= number_of_add_operands[l])) {
187 return (new add(distrseq))->
188 setflag(status_flags::dynallocated | (options == 0 ? status_flags::expanded : 0));
191 int ncmul::degree(const ex & s) const
193 // Sum up degrees of factors
195 exvector::const_iterator i = seq.begin(), end = seq.end();
197 deg_sum += i->degree(s);
203 int ncmul::ldegree(const ex & s) const
205 // Sum up degrees of factors
207 exvector::const_iterator i = seq.begin(), end = seq.end();
209 deg_sum += i->degree(s);
215 ex ncmul::coeff(const ex & s, int n) const
218 coeffseq.reserve(seq.size());
221 // product of individual coeffs
222 // if a non-zero power of s is found, the resulting product will be 0
223 exvector::const_iterator it=seq.begin();
224 while (it!=seq.end()) {
225 coeffseq.push_back((*it).coeff(s,n));
228 return (new ncmul(coeffseq,1))->setflag(status_flags::dynallocated);
231 exvector::const_iterator i = seq.begin(), end = seq.end();
232 bool coeff_found = false;
234 ex c = i->coeff(s,n);
236 coeffseq.push_back(*i);
238 coeffseq.push_back(c);
244 if (coeff_found) return (new ncmul(coeffseq,1))->setflag(status_flags::dynallocated);
249 size_t ncmul::count_factors(const ex & e) const
251 if ((is_exactly_a<mul>(e)&&(e.return_type()!=return_types::commutative))||
252 (is_exactly_a<ncmul>(e))) {
254 for (size_t i=0; i<e.nops(); i++)
255 factors += count_factors(e.op(i));
262 void ncmul::append_factors(exvector & v, const ex & e) const
264 if ((is_exactly_a<mul>(e)&&(e.return_type()!=return_types::commutative))||
265 (is_exactly_a<ncmul>(e))) {
266 for (size_t i=0; i<e.nops(); i++)
267 append_factors(v, e.op(i));
272 typedef std::vector<unsigned> unsignedvector;
273 typedef std::vector<exvector> exvectorvector;
275 /** Perform automatic term rewriting rules in this class. In the following
276 * x, x1, x2,... stand for a symbolic variables of type ex and c, c1, c2...
277 * stand for such expressions that contain a plain number.
278 * - ncmul(...,*(x1,x2),...,ncmul(x3,x4),...) -> ncmul(...,x1,x2,...,x3,x4,...) (associativity)
281 * - ncmul(...,c1,...,c2,...) -> *(c1,c2,ncmul(...)) (pull out commutative elements)
282 * - ncmul(x1,y1,x2,y2) -> *(ncmul(x1,x2),ncmul(y1,y2)) (collect elements of same type)
283 * - ncmul(x1,x2,x3,...) -> x::eval_ncmul(x1,x2,x3,...)
285 * @param level cut-off in recursive evaluation */
286 ex ncmul::eval(int level) const
288 // The following additional rule would be nice, but produces a recursion,
289 // which must be trapped by introducing a flag that the sub-ncmuls()
290 // are already evaluated (maybe later...)
291 // ncmul(x1,x2,...,X,y1,y2,...) ->
292 // ncmul(ncmul(x1,x2,...),X,ncmul(y1,y2,...)
293 // (X noncommutative_composite)
295 if ((level==1) && (flags & status_flags::evaluated)) {
299 exvector evaledseq=evalchildren(level);
301 // ncmul(...,*(x1,x2),...,ncmul(x3,x4),...) ->
302 // ncmul(...,x1,x2,...,x3,x4,...) (associativity)
304 exvector::const_iterator cit = evaledseq.begin(), citend = evaledseq.end();
305 while (cit != citend)
306 factors += count_factors(*cit++);
309 assocseq.reserve(factors);
310 cit = evaledseq.begin();
311 while (cit != citend)
312 append_factors(assocseq, *cit++);
315 if (assocseq.size()==1) return *(seq.begin());
318 if (assocseq.empty()) return _ex1;
320 // determine return types
321 unsignedvector rettypes;
322 rettypes.reserve(assocseq.size());
324 size_t count_commutative=0;
325 size_t count_noncommutative=0;
326 size_t count_noncommutative_composite=0;
327 cit = assocseq.begin(); citend = assocseq.end();
328 while (cit != citend) {
329 switch (rettypes[i] = cit->return_type()) {
330 case return_types::commutative:
333 case return_types::noncommutative:
334 count_noncommutative++;
336 case return_types::noncommutative_composite:
337 count_noncommutative_composite++;
340 throw(std::logic_error("ncmul::eval(): invalid return type"));
344 GINAC_ASSERT(count_commutative+count_noncommutative+count_noncommutative_composite==assocseq.size());
346 // ncmul(...,c1,...,c2,...) ->
347 // *(c1,c2,ncmul(...)) (pull out commutative elements)
348 if (count_commutative!=0) {
349 exvector commutativeseq;
350 commutativeseq.reserve(count_commutative+1);
351 exvector noncommutativeseq;
352 noncommutativeseq.reserve(assocseq.size()-count_commutative);
353 size_t num = assocseq.size();
354 for (size_t i=0; i<num; ++i) {
355 if (rettypes[i]==return_types::commutative)
356 commutativeseq.push_back(assocseq[i]);
358 noncommutativeseq.push_back(assocseq[i]);
360 commutativeseq.push_back((new ncmul(noncommutativeseq,1))->setflag(status_flags::dynallocated));
361 return (new mul(commutativeseq))->setflag(status_flags::dynallocated);
364 // ncmul(x1,y1,x2,y2) -> *(ncmul(x1,x2),ncmul(y1,y2))
365 // (collect elements of same type)
367 if (count_noncommutative_composite==0) {
368 // there are neither commutative nor noncommutative_composite
369 // elements in assocseq
370 GINAC_ASSERT(count_commutative==0);
372 size_t assoc_num = assocseq.size();
374 unsignedvector rttinfos;
375 evv.reserve(assoc_num);
376 rttinfos.reserve(assoc_num);
378 cit = assocseq.begin(), citend = assocseq.end();
379 while (cit != citend) {
380 unsigned ti = cit->return_type_tinfo();
381 size_t rtt_num = rttinfos.size();
382 // search type in vector of known types
383 for (i=0; i<rtt_num; ++i) {
384 if (ti == rttinfos[i]) {
385 evv[i].push_back(*cit);
391 rttinfos.push_back(ti);
392 evv.push_back(exvector());
393 (evv.end()-1)->reserve(assoc_num);
394 (evv.end()-1)->push_back(*cit);
399 size_t evv_num = evv.size();
400 #ifdef DO_GINAC_ASSERT
401 GINAC_ASSERT(evv_num == rttinfos.size());
402 GINAC_ASSERT(evv_num > 0);
404 for (i=0; i<evv_num; ++i)
406 GINAC_ASSERT(s == assoc_num);
407 #endif // def DO_GINAC_ASSERT
409 // if all elements are of same type, simplify the string
411 return evv[0][0].eval_ncmul(evv[0]);
414 splitseq.reserve(evv_num);
415 for (i=0; i<evv_num; ++i)
416 splitseq.push_back((new ncmul(evv[i]))->setflag(status_flags::dynallocated));
418 return (new mul(splitseq))->setflag(status_flags::dynallocated);
421 return (new ncmul(assocseq))->setflag(status_flags::dynallocated |
422 status_flags::evaluated);
425 ex ncmul::evalm() const
427 // Evaluate children first
428 std::auto_ptr<exvector> s(new exvector);
429 s->reserve(seq.size());
430 exvector::const_iterator it = seq.begin(), itend = seq.end();
431 while (it != itend) {
432 s->push_back(it->evalm());
436 // If there are only matrices, simply multiply them
437 it = s->begin(); itend = s->end();
438 if (is_a<matrix>(*it)) {
439 matrix prod(ex_to<matrix>(*it));
441 while (it != itend) {
442 if (!is_a<matrix>(*it))
444 prod = prod.mul(ex_to<matrix>(*it));
451 return (new ncmul(s))->setflag(status_flags::dynallocated);
454 ex ncmul::thiscontainer(const exvector & v) const
456 return (new ncmul(v))->setflag(status_flags::dynallocated);
459 ex ncmul::thiscontainer(std::auto_ptr<exvector> vp) const
461 return (new ncmul(vp))->setflag(status_flags::dynallocated);
464 ex ncmul::conjugate() const
466 if (return_type() != return_types::noncommutative) {
467 return exprseq::conjugate();
470 if (return_type_tinfo() & 0xffffff00U != TINFO_clifford) {
471 return exprseq::conjugate();
476 for (const_iterator i=end(); i!=begin();) {
478 ev.push_back(i->conjugate());
480 return (new ncmul(ev, true))->setflag(status_flags::dynallocated).eval();
485 /** Implementation of ex::diff() for a non-commutative product. It applies
488 ex ncmul::derivative(const symbol & s) const
490 size_t num = seq.size();
494 // D(a*b*c) = D(a)*b*c + a*D(b)*c + a*b*D(c)
495 exvector ncmulseq = seq;
496 for (size_t i=0; i<num; ++i) {
497 ex e = seq[i].diff(s);
499 addseq.push_back((new ncmul(ncmulseq))->setflag(status_flags::dynallocated));
502 return (new add(addseq))->setflag(status_flags::dynallocated);
505 int ncmul::compare_same_type(const basic & other) const
507 return inherited::compare_same_type(other);
510 unsigned ncmul::return_type() const
513 return return_types::commutative;
515 bool all_commutative = true;
516 exvector::const_iterator noncommutative_element; // point to first found nc element
518 exvector::const_iterator i = seq.begin(), end = seq.end();
520 unsigned rt = i->return_type();
521 if (rt == return_types::noncommutative_composite)
522 return rt; // one ncc -> mul also ncc
523 if ((rt == return_types::noncommutative) && (all_commutative)) {
524 // first nc element found, remember position
525 noncommutative_element = i;
526 all_commutative = false;
528 if ((rt == return_types::noncommutative) && (!all_commutative)) {
529 // another nc element found, compare type_infos
530 if (noncommutative_element->return_type_tinfo() != i->return_type_tinfo()) {
531 // diffent types -> mul is ncc
532 return return_types::noncommutative_composite;
537 // all factors checked
538 GINAC_ASSERT(!all_commutative); // not all factors should commute, because this is a ncmul();
539 return all_commutative ? return_types::commutative : return_types::noncommutative;
542 unsigned ncmul::return_type_tinfo() const
547 // return type_info of first noncommutative element
548 exvector::const_iterator i = seq.begin(), end = seq.end();
550 if (i->return_type() == return_types::noncommutative)
551 return i->return_type_tinfo();
555 // no noncommutative element found, should not happen
560 // new virtual functions which can be overridden by derived classes
566 // non-virtual functions in this class
569 std::auto_ptr<exvector> ncmul::expandchildren(unsigned options) const
571 const_iterator cit = this->seq.begin(), end = this->seq.end();
573 const ex & expanded_ex = cit->expand(options);
574 if (!are_ex_trivially_equal(*cit, expanded_ex)) {
576 // copy first part of seq which hasn't changed
577 std::auto_ptr<exvector> s(new exvector(this->seq.begin(), cit));
578 reserve(*s, this->seq.size());
580 // insert changed element
581 s->push_back(expanded_ex);
586 s->push_back(cit->expand(options));
596 return std::auto_ptr<exvector>(0); // nothing has changed
599 const exvector & ncmul::get_factors() const
608 ex reeval_ncmul(const exvector & v)
610 return (new ncmul(v))->setflag(status_flags::dynallocated);
613 ex hold_ncmul(const exvector & v)
617 else if (v.size() == 1)
620 return (new ncmul(v))->setflag(status_flags::dynallocated |
621 status_flags::evaluated);