#include "symbol.h"
#include "debugmsg.h"
+#ifndef NO_GINAC_NAMESPACE
namespace GiNaC {
+#endif // ndef NO_GINAC_NAMESPACE
typedef vector<int> intvector;
power::power(ex const & lh, ex const & rh) : basic(TINFO_power), basis(lh), exponent(rh)
{
debugmsg("power constructor from ex,ex",LOGLEVEL_CONSTRUCT);
- ASSERT(basis.return_type()==return_types::commutative);
+ GINAC_ASSERT(basis.return_type()==return_types::commutative);
}
power::power(ex const & lh, numeric const & rh) : basic(TINFO_power), basis(lh), exponent(rh)
{
debugmsg("power constructor from ex,numeric",LOGLEVEL_CONSTRUCT);
- ASSERT(basis.return_type()==return_types::commutative);
+ GINAC_ASSERT(basis.return_type()==return_types::commutative);
}
//////////
return new power(*this);
}
+void power::print(ostream & os, unsigned upper_precedence) const
+{
+ debugmsg("power print",LOGLEVEL_PRINT);
+ if (precedence<=upper_precedence) os << "(";
+ basis.print(os,precedence);
+ os << "^";
+ exponent.print(os,precedence);
+ if (precedence<=upper_precedence) os << ")";
+}
+
+void power::printraw(ostream & os) const
+{
+ debugmsg("power printraw",LOGLEVEL_PRINT);
+
+ os << "power(";
+ basis.printraw(os);
+ os << ",";
+ exponent.printraw(os);
+ os << ",hash=" << hashvalue << ",flags=" << flags << ")";
+}
+
+void power::printtree(ostream & os, unsigned indent) const
+{
+ debugmsg("power printtree",LOGLEVEL_PRINT);
+
+ os << string(indent,' ') << "power: "
+ << "hash=" << hashvalue << " (0x" << hex << hashvalue << dec << ")"
+ << ", flags=" << flags << endl;
+ basis.printtree(os,indent+delta_indent);
+ exponent.printtree(os,indent+delta_indent);
+}
+
+static void print_sym_pow(ostream & os, unsigned type, const symbol &x, int exp)
+{
+ // Optimal output of integer powers of symbols to aid compiler CSE
+ if (exp == 1) {
+ x.printcsrc(os, type, 0);
+ } else if (exp == 2) {
+ x.printcsrc(os, type, 0);
+ os << "*";
+ x.printcsrc(os, type, 0);
+ } else if (exp & 1) {
+ x.printcsrc(os, 0);
+ os << "*";
+ print_sym_pow(os, type, x, exp-1);
+ } else {
+ os << "(";
+ print_sym_pow(os, type, x, exp >> 1);
+ os << ")*(";
+ print_sym_pow(os, type, x, exp >> 1);
+ os << ")";
+ }
+}
+
+void power::printcsrc(ostream & os, unsigned type, unsigned upper_precedence) const
+{
+ debugmsg("power print csrc", LOGLEVEL_PRINT);
+
+ // Integer powers of symbols are printed in a special, optimized way
+ if (exponent.info(info_flags::integer) &&
+ (is_ex_exactly_of_type(basis, symbol) ||
+ is_ex_exactly_of_type(basis, constant))) {
+ int exp = ex_to_numeric(exponent).to_int();
+ if (exp > 0)
+ os << "(";
+ else {
+ exp = -exp;
+ if (type == csrc_types::ctype_cl_N)
+ os << "recip(";
+ else
+ os << "1.0/(";
+ }
+ print_sym_pow(os, type, static_cast<const symbol &>(*basis.bp), exp);
+ os << ")";
+
+ // <expr>^-1 is printed as "1.0/<expr>" or with the recip() function of CLN
+ } else if (exponent.compare(numMINUSONE()) == 0) {
+ if (type == csrc_types::ctype_cl_N)
+ os << "recip(";
+ else
+ os << "1.0/(";
+ basis.bp->printcsrc(os, type, 0);
+ os << ")";
+
+ // Otherwise, use the pow() or expt() (CLN) functions
+ } else {
+ if (type == csrc_types::ctype_cl_N)
+ os << "expt(";
+ else
+ os << "pow(";
+ basis.bp->printcsrc(os, type, 0);
+ os << ",";
+ exponent.bp->printcsrc(os, type, 0);
+ os << ")";
+ }
+}
+
bool power::info(unsigned inf) const
{
- if (inf==info_flags::polynomial || inf==info_flags::integer_polynomial || inf==info_flags::rational_polynomial) {
+ if (inf==info_flags::polynomial ||
+ inf==info_flags::integer_polynomial ||
+ inf==info_flags::cinteger_polynomial ||
+ inf==info_flags::rational_polynomial ||
+ inf==info_flags::crational_polynomial) {
return exponent.info(info_flags::nonnegint);
} else if (inf==info_flags::rational_function) {
return exponent.info(info_flags::integer);
ex & power::let_op(int const i)
{
- ASSERT(i>=0);
- ASSERT(i<2);
+ GINAC_ASSERT(i>=0);
+ GINAC_ASSERT(i<2);
return i==0 ? basis : exponent;
}
if (basis_is_numerical && exponent_is_numerical) {
// ^(c1,c2) -> c1^c2 (c1, c2 numeric(),
// except if c1,c2 are rational, but c1^c2 is not)
- bool basis_is_rational = num_basis->is_rational();
- bool exponent_is_rational = num_exponent->is_rational();
+ bool basis_is_crational = num_basis->is_crational();
+ bool exponent_is_crational = num_exponent->is_crational();
numeric res = (*num_basis).power(*num_exponent);
- if ((!basis_is_rational || !exponent_is_rational)
- || res.is_rational()) {
+ if ((!basis_is_crational || !exponent_is_crational)
+ || res.is_crational()) {
return res;
}
- ASSERT(!num_exponent->is_integer()); // has been handled by now
+ GINAC_ASSERT(!num_exponent->is_integer()); // has been handled by now
// ^(c1,n/m) -> *(c1^q,c1^(n/m-q)), 0<(n/m-h)<1, q integer
- if (basis_is_rational && exponent_is_rational
+ if (basis_is_crational && exponent_is_crational
&& num_exponent->is_real()
&& !num_exponent->is_integer()) {
numeric r, q, n, m;
ex const & sub_exponent=sub_power.exponent;
if (is_ex_exactly_of_type(sub_exponent,numeric)) {
numeric const & num_sub_exponent=ex_to_numeric(sub_exponent);
- ASSERT(num_sub_exponent!=numeric(1));
+ GINAC_ASSERT(num_sub_exponent!=numeric(1));
if (num_exponent->is_integer() || abs(num_sub_exponent)<1) {
return power(sub_basis,num_sub_exponent.mul(*num_exponent));
}
// ^(*(...,x;c1),c2) -> ^(*(...,x;1),c2)*c1^c2 (c1, c2 numeric(), c1>0)
// ^(*(...,x,c1),c2) -> ^(*(...,x;-1),c2)*(-c1)^c2 (c1, c2 numeric(), c1<0)
if (exponent_is_numerical && is_ex_exactly_of_type(ebasis,mul)) {
- ASSERT(!num_exponent->is_integer()); // should have been handled above
+ GINAC_ASSERT(!num_exponent->is_integer()); // should have been handled above
mul const & mulref=ex_to_mul(ebasis);
if (!mulref.overall_coeff.is_equal(exONE())) {
numeric const & num_coeff=ex_to_numeric(mulref.overall_coeff);
power(num_coeff,*num_exponent)))->
setflag(status_flags::dynallocated);
} else {
- ASSERT(num_coeff.compare(numZERO())<0);
+ GINAC_ASSERT(num_coeff.compare(numZERO())<0);
if (num_coeff.compare(numMINUSONE())!=0) {
mul * mulp=new mul(mulref);
mulp->overall_coeff=exMINUSONE();
int power::compare_same_type(basic const & other) const
{
- ASSERT(is_exactly_of_type(other, power));
+ GINAC_ASSERT(is_exactly_of_type(other, power));
power const & o=static_cast<power const &>(const_cast<basic &>(other));
int cmpval;
term.reserve(m+1);
for (l=0; l<m-1; l++) {
ex const & b=a.op(l);
- ASSERT(!is_ex_exactly_of_type(b,add));
- ASSERT(!is_ex_exactly_of_type(b,power)||
+ GINAC_ASSERT(!is_ex_exactly_of_type(b,add));
+ GINAC_ASSERT(!is_ex_exactly_of_type(b,power)||
!is_ex_exactly_of_type(ex_to_power(b).exponent,numeric)||
!ex_to_numeric(ex_to_power(b).exponent).is_pos_integer());
if (is_ex_exactly_of_type(b,mul)) {
}
ex const & b=a.op(l);
- ASSERT(!is_ex_exactly_of_type(b,add));
- ASSERT(!is_ex_exactly_of_type(b,power)||
+ GINAC_ASSERT(!is_ex_exactly_of_type(b,add));
+ GINAC_ASSERT(!is_ex_exactly_of_type(b,power)||
!is_ex_exactly_of_type(ex_to_power(b).exponent,numeric)||
!ex_to_numeric(ex_to_power(b).exponent).is_pos_integer());
if (is_ex_exactly_of_type(b,mul)) {
for (epvector::const_iterator cit0=a.seq.begin(); cit0!=last; ++cit0) {
ex const & b=a.recombine_pair_to_ex(*cit0);
- ASSERT(!is_ex_exactly_of_type(b,add));
- ASSERT(!is_ex_exactly_of_type(b,power)||
+ GINAC_ASSERT(!is_ex_exactly_of_type(b,add));
+ GINAC_ASSERT(!is_ex_exactly_of_type(b,power)||
!is_ex_exactly_of_type(ex_to_power(b).exponent,numeric)||
!ex_to_numeric(ex_to_power(b).exponent).is_pos_integer());
if (is_ex_exactly_of_type(b,mul)) {
}
}
- ASSERT(sum.size()==(a.seq.size()*(a.seq.size()+1))/2);
+ GINAC_ASSERT(sum.size()==(a.seq.size()*(a.seq.size()+1))/2);
return (new add(sum))->setflag(status_flags::dynallocated);
}
ex const & r=(*cit0).rest;
ex const & c=(*cit0).coeff;
- ASSERT(!is_ex_exactly_of_type(r,add));
- ASSERT(!is_ex_exactly_of_type(r,power)||
+ GINAC_ASSERT(!is_ex_exactly_of_type(r,add));
+ GINAC_ASSERT(!is_ex_exactly_of_type(r,power)||
!is_ex_exactly_of_type(ex_to_power(r).exponent,numeric)||
!ex_to_numeric(ex_to_power(r).exponent).is_pos_integer()||
!is_ex_exactly_of_type(ex_to_power(r).basis,add)||
}
}
- ASSERT(sum.size()==(a.seq.size()*(a.seq.size()+1))/2);
+ GINAC_ASSERT(sum.size()==(a.seq.size()*(a.seq.size()+1))/2);
// second part: add terms coming from overall_factor (if != 0)
if (!a.overall_coeff.is_equal(exZERO())) {
sum.push_back(expair(ex_to_numeric(a.overall_coeff).power_dyn(numTWO()),exONE()));
}
- ASSERT(sum.size()==(a_nops*(a_nops+1))/2);
+ GINAC_ASSERT(sum.size()==(a_nops*(a_nops+1))/2);
return (new add(sum))->setflag(status_flags::dynallocated);
}
const power some_power;
type_info const & typeid_power=typeid(some_power);
+#ifndef NO_GINAC_NAMESPACE
} // namespace GiNaC
+#endif // ndef NO_GINAC_NAMESPACE