* methods for series expansion. */
/*
- * GiNaC Copyright (C) 1999-2005 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
* Default constructor
*/
-pseries::pseries() : inherited(TINFO_pseries) { }
+pseries::pseries() : inherited(&pseries::tinfo_static) { }
/*
* @param rel_ expansion variable and point (must hold a relational)
* @param ops_ vector of {coefficient, power} pairs (coefficient must not be zero)
* @return newly constructed pseries */
-pseries::pseries(const ex &rel_, const epvector &ops_) : basic(TINFO_pseries), seq(ops_)
+pseries::pseries(const ex &rel_, const epvector &ops_) : basic(&pseries::tinfo_static), seq(ops_)
{
GINAC_ASSERT(is_a<relational>(rel_));
GINAC_ASSERT(is_a<symbol>(rel_.lhs()));
pseries::pseries(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
{
- for (unsigned int i=0; true; ++i) {
+ archive_node::archive_node_cit first = n.find_first("coeff");
+ archive_node::archive_node_cit last = n.find_last("power");
+ ++last;
+ seq.reserve((last-first)/2);
+
+ for (archive_node::archive_node_cit loc = first; loc < last;) {
ex rest;
ex coeff;
- if (n.find_ex("coeff", rest, sym_lst, i) && n.find_ex("power", coeff, sym_lst, i))
- seq.push_back(expair(rest, coeff));
- else
- break;
+ n.find_ex_by_loc(loc++, rest, sym_lst);
+ n.find_ex_by_loc(loc++, coeff, sym_lst);
+ seq.push_back(expair(rest, coeff));
}
+
n.find_ex("var", var, sym_lst);
n.find_ex("point", point, sym_lst);
}
ex pseries::conjugate() const
{
+ if(!var.info(info_flags::real))
+ return conjugate_function(*this).hold();
+
epvector * newseq = conjugateepvector(seq);
- ex newvar = var.conjugate();
ex newpoint = point.conjugate();
- if (!newseq && are_ex_trivially_equal(newvar, var) && are_ex_trivially_equal(point, newpoint)) {
+ if (!newseq && are_ex_trivially_equal(point, newpoint)) {
return *this;
}
- ex result = (new pseries(newvar==newpoint, newseq ? *newseq : seq))->setflag(status_flags::dynallocated);
+ ex result = (new pseries(var==newpoint, newseq ? *newseq : seq))->setflag(status_flags::dynallocated);
if (newseq) {
delete newseq;
}
return result;
}
+ex pseries::real_part() const
+{
+ if(!var.info(info_flags::real))
+ return real_part_function(*this).hold();
+ ex newpoint = point.real_part();
+ if(newpoint != point)
+ return real_part_function(*this).hold();
+
+ epvector v;
+ v.reserve(seq.size());
+ for(epvector::const_iterator i=seq.begin(); i!=seq.end(); ++i)
+ v.push_back(expair((i->rest).real_part(), i->coeff));
+ return (new pseries(var==point, v))->setflag(status_flags::dynallocated);
+}
+
+ex pseries::imag_part() const
+{
+ if(!var.info(info_flags::real))
+ return imag_part_function(*this).hold();
+ ex newpoint = point.real_part();
+ if(newpoint != point)
+ return imag_part_function(*this).hold();
+
+ epvector v;
+ v.reserve(seq.size());
+ for(epvector::const_iterator i=seq.begin(); i!=seq.end(); ++i)
+ v.push_back(expair((i->rest).imag_part(), i->coeff));
+ return (new pseries(var==point, v))->setflag(status_flags::dynallocated);
+}
+
ex pseries::eval_integ() const
{
epvector *newseq = NULL;
return *this;
}
+ex pseries::evalm() const
+{
+ // evalm each coefficient
+ epvector newseq;
+ bool something_changed = false;
+ for (epvector::const_iterator i=seq.begin(); i!=seq.end(); ++i) {
+ if (something_changed) {
+ ex newcoeff = i->rest.evalm();
+ if (!newcoeff.is_zero())
+ newseq.push_back(expair(newcoeff, i->coeff));
+ }
+ else {
+ ex newcoeff = i->rest.evalm();
+ if (!are_ex_trivially_equal(newcoeff, i->rest)) {
+ something_changed = true;
+ newseq.reserve(seq.size());
+ std::copy(seq.begin(), i, std::back_inserter<epvector>(newseq));
+ if (!newcoeff.is_zero())
+ newseq.push_back(expair(newcoeff, i->coeff));
+ }
+ }
+ }
+ if (something_changed)
+ return (new pseries(var==point, newseq))->setflag(status_flags::dynallocated);
+ else
+ return *this;
+}
+
ex pseries::subs(const exmap & m, unsigned options) const
{
// If expansion variable is being substituted, convert the series to a
}
const ex& sym = r.lhs();
// find existing minimal degree
- int real_ldegree = basis.expand().ldegree(sym-r.rhs());
+ ex eb = basis.expand();
+ int real_ldegree = 0;
+ if (eb.info(info_flags::rational_function))
+ real_ldegree = eb.ldegree(sym-r.rhs());
if (real_ldegree == 0) {
int orderloop = 0;
do {