1 /** @file expairseq.cpp
3 * Implementation of sequences of expression pairs. */
6 * GiNaC Copyright (C) 1999-2015 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
23 #include "expairseq.h"
28 #include "relational.h"
31 #include "operators.h"
33 #include "hash_seed.h"
45 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(expairseq, basic,
46 print_func<print_context>(&expairseq::do_print).
47 print_func<print_tree>(&expairseq::do_print_tree))
57 bool operator()(const epp &lh, const epp &rh) const
59 return (*lh).is_less(*rh);
64 // default constructor
69 expairseq::expairseq()
78 expairseq::expairseq(const ex &lh, const ex &rh)
80 construct_from_2_ex(lh,rh);
81 GINAC_ASSERT(is_canonical());
84 expairseq::expairseq(const exvector &v)
86 construct_from_exvector(v);
87 GINAC_ASSERT(is_canonical());
90 expairseq::expairseq(const epvector &v, const ex &oc, bool do_index_renaming)
93 GINAC_ASSERT(is_a<numeric>(oc));
94 construct_from_epvector(v, do_index_renaming);
95 GINAC_ASSERT(is_canonical());
98 expairseq::expairseq(epvector && vp, const ex &oc, bool do_index_renaming)
101 GINAC_ASSERT(is_a<numeric>(oc));
102 construct_from_epvector(std::move(vp), do_index_renaming);
103 GINAC_ASSERT(is_canonical());
110 void expairseq::read_archive(const archive_node &n, lst &sym_lst)
112 inherited::read_archive(n, sym_lst);
113 auto first = n.find_first("rest");
114 auto last = n.find_last("coeff");
116 seq.reserve((last-first)/2);
118 for (auto loc = first; loc < last;) {
121 n.find_ex_by_loc(loc++, rest, sym_lst);
122 n.find_ex_by_loc(loc++, coeff, sym_lst);
123 seq.push_back(expair(rest, coeff));
126 n.find_ex("overall_coeff", overall_coeff, sym_lst);
129 GINAC_ASSERT(is_canonical());
132 void expairseq::archive(archive_node &n) const
134 inherited::archive(n);
135 for (auto & i : seq) {
136 n.add_ex("rest", i.rest);
137 n.add_ex("coeff", i.coeff);
139 n.add_ex("overall_coeff", overall_coeff);
144 // functions overriding virtual functions from base classes
149 void expairseq::do_print(const print_context & c, unsigned level) const
152 printseq(c, ',', precedence(), level);
156 void expairseq::do_print_tree(const print_tree & c, unsigned level) const
158 c.s << std::string(level, ' ') << class_name() << " @" << this
159 << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
160 << ", nops=" << nops()
162 size_t num = seq.size();
163 for (size_t i=0; i<num; ++i) {
164 seq[i].rest.print(c, level + c.delta_indent);
165 seq[i].coeff.print(c, level + c.delta_indent);
167 c.s << std::string(level + c.delta_indent, ' ') << "-----" << std::endl;
169 if (!overall_coeff.is_equal(default_overall_coeff())) {
170 c.s << std::string(level + c.delta_indent, ' ') << "-----" << std::endl
171 << std::string(level + c.delta_indent, ' ') << "overall_coeff" << std::endl;
172 overall_coeff.print(c, level + c.delta_indent);
174 c.s << std::string(level + c.delta_indent,' ') << "=====" << std::endl;
177 bool expairseq::info(unsigned inf) const
180 case info_flags::expanded:
181 return (flags & status_flags::expanded);
182 case info_flags::has_indices: {
183 if (flags & status_flags::has_indices)
185 else if (flags & status_flags::has_no_indices)
187 for (auto & i : seq) {
188 if (i.rest.info(info_flags::has_indices)) {
189 this->setflag(status_flags::has_indices);
190 this->clearflag(status_flags::has_no_indices);
194 this->clearflag(status_flags::has_indices);
195 this->setflag(status_flags::has_no_indices);
199 return inherited::info(inf);
202 size_t expairseq::nops() const
204 if (overall_coeff.is_equal(default_overall_coeff()))
210 ex expairseq::op(size_t i) const
213 return recombine_pair_to_ex(seq[i]);
214 GINAC_ASSERT(!overall_coeff.is_equal(default_overall_coeff()));
215 return overall_coeff;
218 ex expairseq::map(map_function &f) const
221 v.reserve(seq.size()+1);
223 for (auto & it : seq)
224 v.push_back(split_ex_to_pair(f(recombine_pair_to_ex(it))));
226 if (overall_coeff.is_equal(default_overall_coeff()))
227 return thisexpairseq(std::move(v), default_overall_coeff(), true);
229 ex newcoeff = f(overall_coeff);
230 if(is_a<numeric>(newcoeff))
231 return thisexpairseq(std::move(v), newcoeff, true);
233 v.push_back(split_ex_to_pair(newcoeff));
234 return thisexpairseq(std::move(v), default_overall_coeff(), true);
239 /** Perform coefficient-wise automatic term rewriting rules in this class. */
240 ex expairseq::eval(int level) const
242 if ((level==1) && (flags &status_flags::evaluated))
245 epvector evaled = evalchildren(level);
247 return (new expairseq(std::move(evaled), overall_coeff))->setflag(status_flags::dynallocated | status_flags::evaluated);
252 epvector* conjugateepvector(const epvector&epv)
254 epvector *newepv = nullptr;
255 for (auto i=epv.begin(); i!=epv.end(); ++i) {
257 newepv->push_back(i->conjugate());
260 expair x = i->conjugate();
261 if (x.is_equal(*i)) {
264 newepv = new epvector;
265 newepv->reserve(epv.size());
266 for (epvector::const_iterator j=epv.begin(); j!=i; ++j) {
267 newepv->push_back(*j);
269 newepv->push_back(x);
274 ex expairseq::conjugate() const
276 std::unique_ptr<epvector> newepv(conjugateepvector(seq));
277 ex x = overall_coeff.conjugate();
279 return thisexpairseq(std::move(*newepv), x);
281 if (are_ex_trivially_equal(x, overall_coeff)) {
284 return thisexpairseq(seq, x);
287 bool expairseq::match(const ex & pattern, exmap & repl_lst) const
289 // This differs from basic::match() because we want "a+b+c+d" to
290 // match "d+*+b" with "*" being "a+c", and we want to honor commutativity
292 if (typeid(*this) == typeid(ex_to<basic>(pattern))) {
294 // Check whether global wildcard (one that matches the "rest of the
295 // expression", like "*" above) is present
296 bool has_global_wildcard = false;
298 for (size_t i=0; i<pattern.nops(); i++) {
299 if (is_exactly_a<wildcard>(pattern.op(i))) {
300 has_global_wildcard = true;
301 global_wildcard = pattern.op(i);
306 // Even if the expression does not match the pattern, some of
307 // its subexpressions could match it. For example, x^5*y^(-1)
308 // does not match the pattern $0^5, but its subexpression x^5
309 // does. So, save repl_lst in order to not add bogus entries.
310 exmap tmp_repl = repl_lst;
312 // Unfortunately, this is an O(N^2) operation because we can't
313 // sort the pattern in a useful way...
318 for (size_t i=0; i<nops(); i++)
319 ops.push_back(op(i));
321 // Now, for every term of the pattern, look for a matching term in
322 // the expression and remove the match
323 for (size_t i=0; i<pattern.nops(); i++) {
324 ex p = pattern.op(i);
325 if (has_global_wildcard && p.is_equal(global_wildcard))
327 auto it = ops.begin(), itend = ops.end();
328 while (it != itend) {
329 if (it->match(p, tmp_repl)) {
335 return false; // no match found
339 if (has_global_wildcard) {
341 // Assign all the remaining terms to the global wildcard (unless
342 // it has already been matched before, in which case the matches
344 size_t num = ops.size();
347 for (size_t i=0; i<num; i++)
348 vp.push_back(split_ex_to_pair(ops[i]));
349 ex rest = thisexpairseq(std::move(vp), default_overall_coeff());
350 for (auto & it : tmp_repl) {
351 if (it.first.is_equal(global_wildcard)) {
352 if (rest.is_equal(it.second)) {
360 repl_lst[global_wildcard] = rest;
365 // No global wildcard, then the match fails if there are any
366 // unmatched terms left
374 return inherited::match(pattern, repl_lst);
377 ex expairseq::subs(const exmap & m, unsigned options) const
379 epvector subsed = subschildren(m, options);
381 return ex_to<basic>(thisexpairseq(std::move(subsed), overall_coeff, (options & subs_options::no_index_renaming) == 0));
382 else if ((options & subs_options::algebraic) && is_exactly_a<mul>(*this))
383 return static_cast<const mul *>(this)->algebraic_subs_mul(m, options);
385 return subs_one_level(m, options);
390 int expairseq::compare_same_type(const basic &other) const
392 GINAC_ASSERT(is_a<expairseq>(other));
393 const expairseq &o = static_cast<const expairseq &>(other);
397 // compare number of elements
398 if (seq.size() != o.seq.size())
399 return (seq.size()<o.seq.size()) ? -1 : 1;
401 // compare overall_coeff
402 cmpval = overall_coeff.compare(o.overall_coeff);
406 auto cit1 = seq.begin(), last1 = seq.end();
407 auto cit2 = o.seq.begin(), last2 = o.seq.end();
408 for (; (cit1!=last1) && (cit2!=last2); ++cit1, ++cit2) {
409 cmpval = (*cit1).compare(*cit2);
410 if (cmpval!=0) return cmpval;
413 GINAC_ASSERT(cit1==last1);
414 GINAC_ASSERT(cit2==last2);
419 bool expairseq::is_equal_same_type(const basic &other) const
421 const expairseq &o = static_cast<const expairseq &>(other);
423 // compare number of elements
424 if (seq.size()!=o.seq.size())
427 // compare overall_coeff
428 if (!overall_coeff.is_equal(o.overall_coeff))
431 auto cit2 = o.seq.begin();
432 for (auto & cit1 : seq) {
433 if (!cit1.is_equal(*cit2))
441 unsigned expairseq::return_type() const
443 return return_types::noncommutative_composite;
446 unsigned expairseq::calchash() const
448 unsigned v = make_hash_seed(typeid(*this));
449 for (auto & i : seq) {
450 v ^= i.rest.gethash();
452 v ^= i.coeff.gethash();
455 v ^= overall_coeff.gethash();
457 // store calculated hash value only if object is already evaluated
458 if (flags &status_flags::evaluated) {
459 setflag(status_flags::hash_calculated);
466 ex expairseq::expand(unsigned options) const
468 epvector expanded = expandchildren(options);
469 if (!expanded.empty()) {
470 return thisexpairseq(std::move(expanded), overall_coeff);
472 return (options == 0) ? setflag(status_flags::expanded) : *this;
476 // new virtual functions which can be overridden by derived classes
481 /** Create an object of this type.
482 * This method works similar to a constructor. It is useful because expairseq
483 * has (at least) two possible different semantics but we want to inherit
484 * methods thus avoiding code duplication. Sometimes a method in expairseq
485 * has to create a new one of the same semantics, which cannot be done by a
486 * ctor because the name (add, mul,...) is unknown on the expairseq level. In
487 * order for this trick to work a derived class must of course override this
489 ex expairseq::thisexpairseq(const epvector &v, const ex &oc, bool do_index_renaming) const
491 return expairseq(v, oc, do_index_renaming);
494 ex expairseq::thisexpairseq(epvector && vp, const ex &oc, bool do_index_renaming) const
496 return expairseq(std::move(vp), oc, do_index_renaming);
499 void expairseq::printpair(const print_context & c, const expair & p, unsigned upper_precedence) const
502 p.rest.print(c, precedence());
504 p.coeff.print(c, precedence());
508 void expairseq::printseq(const print_context & c, char delim,
509 unsigned this_precedence,
510 unsigned upper_precedence) const
512 if (this_precedence <= upper_precedence)
514 auto it = seq.begin(), it_last = seq.end() - 1;
515 for (; it!=it_last; ++it) {
516 printpair(c, *it, this_precedence);
519 printpair(c, *it, this_precedence);
520 if (!overall_coeff.is_equal(default_overall_coeff())) {
522 overall_coeff.print(c, this_precedence);
525 if (this_precedence <= upper_precedence)
530 /** Form an expair from an ex, using the corresponding semantics.
531 * @see expairseq::recombine_pair_to_ex() */
532 expair expairseq::split_ex_to_pair(const ex &e) const
534 return expair(e,_ex1);
538 expair expairseq::combine_ex_with_coeff_to_pair(const ex &e,
541 GINAC_ASSERT(is_exactly_a<numeric>(c));
547 expair expairseq::combine_pair_with_coeff_to_pair(const expair &p,
550 GINAC_ASSERT(is_exactly_a<numeric>(p.coeff));
551 GINAC_ASSERT(is_exactly_a<numeric>(c));
553 return expair(p.rest,ex_to<numeric>(p.coeff).mul_dyn(ex_to<numeric>(c)));
557 /** Form an ex out of an expair, using the corresponding semantics.
558 * @see expairseq::split_ex_to_pair() */
559 ex expairseq::recombine_pair_to_ex(const expair &p) const
561 return lst(p.rest,p.coeff);
564 bool expairseq::expair_needs_further_processing(epp it)
569 ex expairseq::default_overall_coeff() const
574 void expairseq::combine_overall_coeff(const ex &c)
576 GINAC_ASSERT(is_exactly_a<numeric>(overall_coeff));
577 GINAC_ASSERT(is_exactly_a<numeric>(c));
578 overall_coeff = ex_to<numeric>(overall_coeff).add_dyn(ex_to<numeric>(c));
581 void expairseq::combine_overall_coeff(const ex &c1, const ex &c2)
583 GINAC_ASSERT(is_exactly_a<numeric>(overall_coeff));
584 GINAC_ASSERT(is_exactly_a<numeric>(c1));
585 GINAC_ASSERT(is_exactly_a<numeric>(c2));
586 overall_coeff = ex_to<numeric>(overall_coeff).
587 add_dyn(ex_to<numeric>(c1).mul(ex_to<numeric>(c2)));
590 bool expairseq::can_make_flat(const expair &p) const
597 // non-virtual functions in this class
600 void expairseq::construct_from_2_ex_via_exvector(const ex &lh, const ex &rh)
606 construct_from_exvector(v);
609 void expairseq::construct_from_2_ex(const ex &lh, const ex &rh)
611 if (typeid(ex_to<basic>(lh)) == typeid(*this)) {
612 if (typeid(ex_to<basic>(rh)) == typeid(*this)) {
613 if (is_a<mul>(lh) && lh.info(info_flags::has_indices) &&
614 rh.info(info_flags::has_indices)) {
615 ex newrh=rename_dummy_indices_uniquely(lh, rh);
616 construct_from_2_expairseq(ex_to<expairseq>(lh),
617 ex_to<expairseq>(newrh));
620 construct_from_2_expairseq(ex_to<expairseq>(lh),
621 ex_to<expairseq>(rh));
624 construct_from_expairseq_ex(ex_to<expairseq>(lh), rh);
627 } else if (typeid(ex_to<basic>(rh)) == typeid(*this)) {
628 construct_from_expairseq_ex(ex_to<expairseq>(rh),lh);
632 if (is_exactly_a<numeric>(lh)) {
633 if (is_exactly_a<numeric>(rh)) {
634 combine_overall_coeff(lh);
635 combine_overall_coeff(rh);
637 combine_overall_coeff(lh);
638 seq.push_back(split_ex_to_pair(rh));
641 if (is_exactly_a<numeric>(rh)) {
642 combine_overall_coeff(rh);
643 seq.push_back(split_ex_to_pair(lh));
645 expair p1 = split_ex_to_pair(lh);
646 expair p2 = split_ex_to_pair(rh);
648 int cmpval = p1.rest.compare(p2.rest);
650 p1.coeff = ex_to<numeric>(p1.coeff).add_dyn(ex_to<numeric>(p2.coeff));
651 if (!ex_to<numeric>(p1.coeff).is_zero()) {
652 // no further processing is necessary, since this
653 // one element will usually be recombined in eval()
670 void expairseq::construct_from_2_expairseq(const expairseq &s1,
673 combine_overall_coeff(s1.overall_coeff);
674 combine_overall_coeff(s2.overall_coeff);
676 auto first1 = s1.seq.begin(), last1 = s1.seq.end();
677 auto first2 = s2.seq.begin(), last2 = s2.seq.end();
679 seq.reserve(s1.seq.size()+s2.seq.size());
681 bool needs_further_processing=false;
683 while (first1!=last1 && first2!=last2) {
684 int cmpval = (*first1).rest.compare((*first2).rest);
688 const numeric &newcoeff = ex_to<numeric>(first1->coeff).
689 add(ex_to<numeric>(first2->coeff));
690 if (!newcoeff.is_zero()) {
691 seq.push_back(expair(first1->rest,newcoeff));
692 if (expair_needs_further_processing(seq.end()-1)) {
693 needs_further_processing = true;
698 } else if (cmpval<0) {
699 seq.push_back(*first1);
702 seq.push_back(*first2);
707 while (first1!=last1) {
708 seq.push_back(*first1);
711 while (first2!=last2) {
712 seq.push_back(*first2);
716 if (needs_further_processing) {
719 construct_from_epvector(std::move(v));
723 void expairseq::construct_from_expairseq_ex(const expairseq &s,
726 combine_overall_coeff(s.overall_coeff);
727 if (is_exactly_a<numeric>(e)) {
728 combine_overall_coeff(e);
733 auto first = s.seq.begin(), last = s.seq.end();
734 expair p = split_ex_to_pair(e);
736 seq.reserve(s.seq.size()+1);
737 bool p_pushed = false;
739 bool needs_further_processing=false;
741 // merge p into s.seq
742 while (first!=last) {
743 int cmpval = (*first).rest.compare(p.rest);
746 const numeric &newcoeff = ex_to<numeric>(first->coeff).
747 add(ex_to<numeric>(p.coeff));
748 if (!newcoeff.is_zero()) {
749 seq.push_back(expair(first->rest,newcoeff));
750 if (expair_needs_further_processing(seq.end()-1))
751 needs_further_processing = true;
756 } else if (cmpval<0) {
757 seq.push_back(*first);
767 // while loop exited because p was pushed, now push rest of s.seq
768 while (first!=last) {
769 seq.push_back(*first);
773 // while loop exited because s.seq was pushed, now push p
777 if (needs_further_processing) {
780 construct_from_epvector(std::move(v));
784 void expairseq::construct_from_exvector(const exvector &v)
786 // simplifications: +(a,+(b,c),d) -> +(a,b,c,d) (associativity)
787 // +(d,b,c,a) -> +(a,b,c,d) (canonicalization)
788 // +(...,x,*(x,c1),*(x,c2)) -> +(...,*(x,1+c1+c2)) (c1, c2 numeric)
789 // (same for (+,*) -> (*,^)
793 combine_same_terms_sorted_seq();
796 void expairseq::construct_from_epvector(const epvector &v, bool do_index_renaming)
798 // simplifications: +(a,+(b,c),d) -> +(a,b,c,d) (associativity)
799 // +(d,b,c,a) -> +(a,b,c,d) (canonicalization)
800 // +(...,x,*(x,c1),*(x,c2)) -> +(...,*(x,1+c1+c2)) (c1, c2 numeric)
801 // same for (+,*) -> (*,^)
803 make_flat(v, do_index_renaming);
805 combine_same_terms_sorted_seq();
808 void expairseq::construct_from_epvector(epvector &&v, bool do_index_renaming)
810 // simplifications: +(a,+(b,c),d) -> +(a,b,c,d) (associativity)
811 // +(d,b,c,a) -> +(a,b,c,d) (canonicalization)
812 // +(...,x,*(x,c1),*(x,c2)) -> +(...,*(x,1+c1+c2)) (c1, c2 numeric)
813 // same for (+,*) -> (*,^)
815 make_flat(std::move(v), do_index_renaming);
817 combine_same_terms_sorted_seq();
820 /** Combine this expairseq with argument exvector.
821 * It cares for associativity as well as for special handling of numerics. */
822 void expairseq::make_flat(const exvector &v)
824 // count number of operands which are of same expairseq derived type
825 // and their cumulative number of operands
828 bool do_idx_rename = false;
830 for (auto & cit : v) {
831 if (typeid(ex_to<basic>(cit)) == typeid(*this)) {
833 noperands += ex_to<expairseq>(cit).seq.size();
835 if (is_a<mul>(*this) && (!do_idx_rename) &&
836 cit.info(info_flags::has_indices))
837 do_idx_rename = true;
840 // reserve seq and coeffseq which will hold all operands
841 seq.reserve(v.size()+noperands-nexpairseqs);
843 // copy elements and split off numerical part
844 make_flat_inserter mf(v, do_idx_rename);
845 for (auto & cit : v) {
846 if (typeid(ex_to<basic>(cit)) == typeid(*this)) {
847 ex newfactor = mf.handle_factor(cit, _ex1);
848 const expairseq &subseqref = ex_to<expairseq>(newfactor);
849 combine_overall_coeff(subseqref.overall_coeff);
850 for (auto & cit_s : subseqref.seq) {
851 seq.push_back(cit_s);
854 if (is_exactly_a<numeric>(cit))
855 combine_overall_coeff(cit);
857 ex newfactor = mf.handle_factor(cit, _ex1);
858 seq.push_back(split_ex_to_pair(newfactor));
864 /** Combine this expairseq with argument epvector.
865 * It cares for associativity as well as for special handling of numerics. */
866 void expairseq::make_flat(const epvector &v, bool do_index_renaming)
868 // count number of operands which are of same expairseq derived type
869 // and their cumulative number of operands
872 bool really_need_rename_inds = false;
874 for (auto & cit : v) {
875 if (typeid(ex_to<basic>(cit.rest)) == typeid(*this)) {
877 noperands += ex_to<expairseq>(cit.rest).seq.size();
879 if ((!really_need_rename_inds) && is_a<mul>(*this) &&
880 cit.rest.info(info_flags::has_indices))
881 really_need_rename_inds = true;
883 do_index_renaming = do_index_renaming && really_need_rename_inds;
885 // reserve seq and coeffseq which will hold all operands
886 seq.reserve(v.size()+noperands-nexpairseqs);
887 make_flat_inserter mf(v, do_index_renaming);
889 // copy elements and split off numerical part
890 for (auto & cit : v) {
891 if (typeid(ex_to<basic>(cit.rest)) == typeid(*this) &&
892 this->can_make_flat(cit)) {
893 ex newrest = mf.handle_factor(cit.rest, cit.coeff);
894 const expairseq &subseqref = ex_to<expairseq>(newrest);
895 combine_overall_coeff(ex_to<numeric>(subseqref.overall_coeff),
896 ex_to<numeric>(cit.coeff));
897 for (auto & cit_s : subseqref.seq) {
898 seq.push_back(expair(cit_s.rest,
899 ex_to<numeric>(cit_s.coeff).mul_dyn(ex_to<numeric>(cit.coeff))));
902 if (cit.is_canonical_numeric())
903 combine_overall_coeff(mf.handle_factor(cit.rest, _ex1));
906 ex newrest = mf.handle_factor(rest, cit.coeff);
907 if (are_ex_trivially_equal(newrest, rest))
910 seq.push_back(expair(newrest, cit.coeff));
916 /** Brings this expairseq into a sorted (canonical) form. */
917 void expairseq::canonicalize()
919 std::sort(seq.begin(), seq.end(), expair_rest_is_less());
923 /** Compact a presorted expairseq by combining all matching expairs to one
924 * each. On an add object, this is responsible for 2*x+3*x+y -> 5*x+y, for
926 void expairseq::combine_same_terms_sorted_seq()
931 bool needs_further_processing = false;
933 auto itin1 = seq.begin();
934 auto itin2 = itin1 + 1;
936 auto last = seq.end();
937 // must_copy will be set to true the first time some combination is
938 // possible from then on the sequence has changed and must be compacted
939 bool must_copy = false;
940 while (itin2!=last) {
941 if (itin1->rest.compare(itin2->rest)==0) {
942 itin1->coeff = ex_to<numeric>(itin1->coeff).
943 add_dyn(ex_to<numeric>(itin2->coeff));
944 if (expair_needs_further_processing(itin1))
945 needs_further_processing = true;
948 if (!ex_to<numeric>(itin1->coeff).is_zero()) {
957 if (!ex_to<numeric>(itin1->coeff).is_zero()) {
963 seq.erase(itout,last);
965 if (needs_further_processing) {
968 construct_from_epvector(std::move(v));
972 /** Check if this expairseq is in sorted (canonical) form. Useful mainly for
973 * debugging or in assertions since being sorted is an invariance. */
974 bool expairseq::is_canonical() const
979 auto it = seq.begin(), itend = seq.end();
981 for (++it; it!=itend; it_last=it, ++it) {
982 if (!(it_last->is_less(*it) || it_last->is_equal(*it))) {
983 if (!is_exactly_a<numeric>(it_last->rest) ||
984 !is_exactly_a<numeric>(it->rest)) {
985 // double test makes it easier to set a breakpoint...
986 if (!is_exactly_a<numeric>(it_last->rest) ||
987 !is_exactly_a<numeric>(it->rest)) {
988 printpair(std::clog, *it_last, 0);
990 printpair(std::clog, *it, 0);
992 std::clog << "pair1:" << std::endl;
993 it_last->rest.print(print_tree(std::clog));
994 it_last->coeff.print(print_tree(std::clog));
995 std::clog << "pair2:" << std::endl;
996 it->rest.print(print_tree(std::clog));
997 it->coeff.print(print_tree(std::clog));
1006 /** Member-wise expand the expairs in this sequence.
1008 * @see expairseq::expand()
1009 * @return epvector containing expanded pairs, empty if no members
1010 * had to be changed. */
1011 epvector expairseq::expandchildren(unsigned options) const
1013 auto cit = seq.begin(), last = seq.end();
1015 const ex &expanded_ex = cit->rest.expand(options);
1016 if (!are_ex_trivially_equal(cit->rest,expanded_ex)) {
1018 // something changed, copy seq, eval and return it
1020 s.reserve(seq.size());
1022 // copy parts of seq which are known not to have changed
1023 auto cit2 = seq.begin();
1029 // copy first changed element
1030 s.push_back(combine_ex_with_coeff_to_pair(expanded_ex,
1035 while (cit2!=last) {
1036 s.push_back(combine_ex_with_coeff_to_pair(cit2->rest.expand(options),
1045 return epvector(); // empty signalling nothing has changed
1049 /** Member-wise evaluate the expairs in this sequence.
1051 * @see expairseq::eval()
1052 * @return epvector containing evaluated pairs, empty if no members
1053 * had to be changed. */
1054 epvector expairseq::evalchildren(int level) const
1057 return epvector(); // nothing had to be evaluated
1059 if (level == -max_recursion_level)
1060 throw(std::runtime_error("max recursion level reached"));
1063 auto cit = seq.begin(), last = seq.end();
1065 const ex evaled_ex = cit->rest.eval(level);
1066 if (!are_ex_trivially_equal(cit->rest,evaled_ex)) {
1068 // something changed, copy seq, eval and return it
1070 s.reserve(seq.size());
1072 // copy parts of seq which are known not to have changed
1073 auto cit2 = seq.begin();
1079 // copy first changed element
1080 s.push_back(combine_ex_with_coeff_to_pair(evaled_ex,
1085 while (cit2!=last) {
1086 s.push_back(combine_ex_with_coeff_to_pair(cit2->rest.eval(level),
1090 return std::move(s);
1095 return epvector(); // signalling nothing has changed
1098 /** Member-wise substitute in this sequence.
1100 * @see expairseq::subs()
1101 * @return epvector containing expanded pairs, empty if no members
1102 * had to be changed. */
1103 epvector expairseq::subschildren(const exmap & m, unsigned options) const
1105 // When any of the objects to be substituted is a product or power
1106 // we have to recombine the pairs because the numeric coefficients may
1107 // be part of the search pattern.
1108 if (!(options & (subs_options::pattern_is_product | subs_options::pattern_is_not_product))) {
1110 // Search the list of substitutions and cache our findings
1111 for (auto & it : m) {
1112 if (is_exactly_a<mul>(it.first) || is_exactly_a<power>(it.first)) {
1113 options |= subs_options::pattern_is_product;
1117 if (!(options & subs_options::pattern_is_product))
1118 options |= subs_options::pattern_is_not_product;
1121 if (options & subs_options::pattern_is_product) {
1123 // Substitute in the recombined pairs
1124 auto cit = seq.begin(), last = seq.end();
1125 while (cit != last) {
1127 const ex &orig_ex = recombine_pair_to_ex(*cit);
1128 const ex &subsed_ex = orig_ex.subs(m, options);
1129 if (!are_ex_trivially_equal(orig_ex, subsed_ex)) {
1131 // Something changed, copy seq, subs and return it
1133 s.reserve(seq.size());
1135 // Copy parts of seq which are known not to have changed
1136 s.insert(s.begin(), seq.begin(), cit);
1138 // Copy first changed element
1139 s.push_back(split_ex_to_pair(subsed_ex));
1143 while (cit != last) {
1144 s.push_back(split_ex_to_pair(recombine_pair_to_ex(*cit).subs(m, options)));
1155 // Substitute only in the "rest" part of the pairs
1156 auto cit = seq.begin(), last = seq.end();
1157 while (cit != last) {
1159 const ex &subsed_ex = cit->rest.subs(m, options);
1160 if (!are_ex_trivially_equal(cit->rest, subsed_ex)) {
1162 // Something changed, copy seq, subs and return it
1164 s.reserve(seq.size());
1166 // Copy parts of seq which are known not to have changed
1167 s.insert(s.begin(), seq.begin(), cit);
1169 // Copy first changed element
1170 s.push_back(combine_ex_with_coeff_to_pair(subsed_ex, cit->coeff));
1174 while (cit != last) {
1175 s.push_back(combine_ex_with_coeff_to_pair(cit->rest.subs(m, options), cit->coeff));
1185 // Nothing has changed
1190 // static member variables
1193 } // namespace GiNaC