-basic *pseries::duplicate() const
-{
- debugmsg("pseries duplicate", LOGLEVEL_DUPLICATE);
- return new pseries(*this);
-}
-
-void pseries::print(std::ostream &os, unsigned upper_precedence) const
-{
- debugmsg("pseries print", LOGLEVEL_PRINT);
- for (epvector::const_iterator i=seq.begin(); i!=seq.end(); ++i) {
- // omit zero terms
- if (i->rest.is_zero())
- continue;
- // print a sign, if needed
- if (i!=seq.begin())
- os << '+';
- if (!is_order_function(i->rest)) {
- // print 'rest', i.e. the expansion coefficient
- if (i->rest.info(info_flags::numeric) &&
- i->rest.info(info_flags::positive)) {
- os << i->rest;
- } else
- os << "(" << i->rest << ')';
- // print 'coeff', something like (x-1)^42
- if (!i->coeff.is_zero()) {
- os << '*';
- if (!point.is_zero())
- os << '(' << var-point << ')';
- else
- os << var;
- if (i->coeff.compare(_ex1())) {
- os << '^';
- if (i->coeff.info(info_flags::negative))
- os << '(' << i->coeff << ')';
- else
- os << i->coeff;
- }
- }
- } else {
- os << Order(power(var-point,i->coeff));
- }
- }
-}
-
-
-void pseries::printraw(std::ostream &os) const
-{
- debugmsg("pseries printraw", LOGLEVEL_PRINT);
- os << "pseries(" << var << ";" << point << ";";
- for (epvector::const_iterator i=seq.begin(); i!=seq.end(); ++i) {
- os << "(" << (*i).rest << "," << (*i).coeff << "),";
- }
- os << ")";
-}
-
-
-void pseries::printtree(std::ostream & os, unsigned indent) const
-{
- debugmsg("pseries printtree",LOGLEVEL_PRINT);
- os << std::string(indent,' ') << "pseries "
- << ", hash=" << hashvalue
- << " (0x" << std::hex << hashvalue << std::dec << ")"
- << ", flags=" << flags << std::endl;
- for (unsigned i=0; i<seq.size(); ++i) {
- seq[i].rest.printtree(os,indent+delta_indent);
- seq[i].coeff.printtree(os,indent+delta_indent);
- if (i!=seq.size()-1)
- os << std::string(indent+delta_indent,' ') << "-----" << std::endl;
- }
- var.printtree(os, indent+delta_indent);
- point.printtree(os, indent+delta_indent);
+void pseries::print(const print_context & c, unsigned level) const
+{
+ debugmsg("pseries print", LOGLEVEL_PRINT);
+
+ if (is_of_type(c, print_tree)) {
+
+ c.s << std::string(level, ' ') << class_name()
+ << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
+ << std::endl;
+ unsigned delta_indent = static_cast<const print_tree &>(c).delta_indent;
+ for (unsigned i=0; i<seq.size(); ++i) {
+ seq[i].rest.print(c, level + delta_indent);
+ seq[i].coeff.print(c, level + delta_indent);
+ c.s << std::string(level + delta_indent, ' ') << "-----" << std::endl;
+ }
+ var.print(c, level + delta_indent);
+ point.print(c, level + delta_indent);
+
+ } else {
+
+ if (precedence() <= level)
+ c.s << "(";
+
+ std::string par_open = is_of_type(c, print_latex) ? "{(" : "(";
+ std::string par_close = is_of_type(c, print_latex) ? ")}" : ")";
+
+ // objects of type pseries must not have any zero entries, so the
+ // trivial (zero) pseries needs a special treatment here:
+ if (seq.size() == 0)
+ c.s << '0';
+ for (epvector::const_iterator i=seq.begin(); i!=seq.end(); ++i) {
+ // print a sign, if needed
+ if (i != seq.begin())
+ c.s << '+';
+ if (!is_order_function(i->rest)) {
+ // print 'rest', i.e. the expansion coefficient
+ if (i->rest.info(info_flags::numeric) &&
+ i->rest.info(info_flags::positive)) {
+ i->rest.print(c);
+ } else {
+ c.s << par_open;
+ i->rest.print(c);
+ c.s << par_close;
+ }
+ // print 'coeff', something like (x-1)^42
+ if (!i->coeff.is_zero()) {
+ if (is_of_type(c, print_latex))
+ c.s << ' ';
+ else
+ c.s << '*';
+ if (!point.is_zero()) {
+ c.s << par_open;
+ (var-point).print(c);
+ c.s << par_close;
+ } else
+ var.print(c);
+ if (i->coeff.compare(_ex1())) {
+ c.s << '^';
+ if (i->coeff.info(info_flags::negative)) {
+ c.s << par_open;
+ i->coeff.print(c);
+ c.s << par_close;
+ } else {
+ if (is_of_type(c, print_latex)) {
+ c.s << '{';
+ i->coeff.print(c);
+ c.s << '}';
+ } else
+ i->coeff.print(c);
+ }
+ }
+ }
+ } else
+ Order(power(var-point,i->coeff)).print(c);
+ }
+
+ if (precedence() <= level)
+ c.s << ")";
+ }
+}
+
+int pseries::compare_same_type(const basic & other) const
+{
+ GINAC_ASSERT(is_of_type(other, pseries));
+ const pseries &o = static_cast<const pseries &>(other);
+
+ // first compare the lengths of the series...
+ if (seq.size()>o.seq.size())
+ return 1;
+ if (seq.size()<o.seq.size())
+ return -1;
+
+ // ...then the expansion point...
+ int cmpval = var.compare(o.var);
+ if (cmpval)
+ return cmpval;
+ cmpval = point.compare(o.point);
+ if (cmpval)
+ return cmpval;
+
+ // ...and if that failed the individual elements
+ epvector::const_iterator it = seq.begin(), o_it = o.seq.begin();
+ while (it!=seq.end() && o_it!=o.seq.end()) {
+ cmpval = it->compare(*o_it);
+ if (cmpval)
+ return cmpval;
+ ++it;
+ ++o_it;
+ }
+
+ // so they are equal.
+ return 0;