* of special functions or implement the interface to the bignum package. */
/*
- * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2005 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
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "config.h"
setflag(status_flags::evaluated | status_flags::expanded);
}
+
//////////
// archiving
//////////
const numeric &o = ex_to<numeric>(other);
if (this->is_equal(o) || this->is_equal(-o))
return true;
- if (o.imag().is_zero()) // e.g. scan for 3 in -3*I
- return (this->real().is_equal(o) || this->imag().is_equal(o) ||
- this->real().is_equal(-o) || this->imag().is_equal(-o));
+ if (o.imag().is_zero()) { // e.g. scan for 3 in -3*I
+ if (!this->real().is_equal(*_num0_p))
+ if (this->real().is_equal(o) || this->real().is_equal(-o))
+ return true;
+ if (!this->imag().is_equal(*_num0_p))
+ if (this->imag().is_equal(o) || this->imag().is_equal(-o))
+ return true;
+ return false;
+ }
else {
if (o.is_equal(I)) // e.g scan for I in 42*I
return !this->is_real();
if (o.real().is_zero()) // e.g. scan for 2*I in 2*I+1
- return (this->real().has(o*I) || this->imag().has(o*I) ||
- this->real().has(-o*I) || this->imag().has(-o*I));
+ if (!this->imag().is_equal(*_num0_p))
+ if (this->imag().is_equal(o*I) || this->imag().is_equal(-o*I))
+ return true;
}
return false;
}
{
// Shortcut for efficiency and numeric stability (as in 1.0 exponent):
// trap the neutral exponent.
- if (&other==_num1_p || cln::equal(other.value,_num1.value))
+ if (&other==_num1_p || cln::equal(other.value,_num1_p->value))
return *this;
if (cln::zerop(value)) {
else if (cln::minusp(cln::realpart(other.value)))
throw std::overflow_error("numeric::eval(): division by zero");
else
- return _num0;
+ return *_num0_p;
}
return numeric(cln::expt(value, other.value));
}
// Efficiency shortcut: trap the neutral exponent (first try by pointer, then
// try harder, since calls to cln::expt() below may return amazing results for
// floating point exponent 1.0).
- if (&other==_num1_p || cln::equal(other.value, _num1.value))
+ if (&other==_num1_p || cln::equal(other.value, _num1_p->value))
return *this;
if (cln::zerop(value)) {
else if (cln::minusp(cln::realpart(other.value)))
throw std::overflow_error("numeric::eval(): division by zero");
else
- return _num0;
+ return *_num0_p;
}
return static_cast<const numeric &>((new numeric(cln::expt(value, other.value)))->
setflag(status_flags::dynallocated));
const numeric numeric::denom() const
{
if (cln::instanceof(value, cln::cl_I_ring))
- return _num1; // integer case
+ return *_num1_p; // integer case
if (cln::instanceof(value, cln::cl_RA_ring))
return numeric(cln::denominator(cln::the<cln::cl_RA>(value)));
const cln::cl_RA r = cln::the<cln::cl_RA>(cln::realpart(value));
const cln::cl_RA i = cln::the<cln::cl_RA>(cln::imagpart(value));
if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_I_ring))
- return _num1;
+ return *_num1_p;
if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_RA_ring))
return numeric(cln::denominator(i));
if (cln::instanceof(r, cln::cl_RA_ring) && cln::instanceof(i, cln::cl_I_ring))
return numeric(cln::lcm(cln::denominator(r), cln::denominator(i)));
}
// at least one float encountered
- return _num1;
+ return *_num1_p;
}
{
if (!x.is_real() &&
x.real().is_zero() &&
- abs(x.imag()).is_equal(_num1))
+ abs(x.imag()).is_equal(*_num1_p))
throw pole_error("atan(): logarithmic pole",0);
return cln::atan(x.to_cl_N());
}
const numeric Li2(const numeric &x)
{
if (x.is_zero())
- return _num0;
+ return *_num0_p;
// what is the desired float format?
// first guess: default format
* @exception range_error (argument must be integer >= -1) */
const numeric doublefactorial(const numeric &n)
{
- if (n.is_equal(_num_1))
- return _num1;
+ if (n.is_equal(*_num_1_p))
+ return *_num1_p;
if (!n.is_nonneg_integer())
throw std::range_error("numeric::doublefactorial(): argument must be integer >= -1");
{
if (n.is_integer() && k.is_integer()) {
if (n.is_nonneg_integer()) {
- if (k.compare(n)!=1 && k.compare(_num0)!=-1)
+ if (k.compare(n)!=1 && k.compare(*_num0_p)!=-1)
return numeric(cln::binomial(n.to_int(),k.to_int()));
else
- return _num0;
+ return *_num0_p;
} else {
- return _num_1.power(k)*binomial(k-n-_num1,k);
+ return _num_1_p->power(k)*binomial(k-n-(*_num1_p),k);
}
}
- // should really be gamma(n+1)/gamma(r+1)/gamma(n-r+1) or a suitable limit
- throw std::range_error("numeric::binomial(): donยดt know how to evaluate that.");
+ // should really be gamma(n+1)/gamma(k+1)/gamma(n-k+1) or a suitable limit
+ throw std::range_error("numeric::binomial(): don't know how to evaluate that.");
}
// the special cases not covered by the algorithm below
if (n & 1)
- return (n==1) ? _num_1_2 : _num0;
+ return (n==1) ? (*_num_1_2_p) : (*_num0_p);
if (!n)
- return _num1;
+ return *_num1_p;
// store nonvanishing Bernoulli numbers here
static std::vector< cln::cl_RA > results;
// hence
// F(2n+2) = F(n+1)*(2*F(n) + F(n+1))
if (n.is_zero())
- return _num0;
+ return *_num0_p;
if (n.is_negative())
if (n.is_even())
return -fibonacci(-n);
return cln::mod(cln::the<cln::cl_I>(a.to_cl_N()),
cln::the<cln::cl_I>(b.to_cl_N()));
else
- return _num0;
+ return *_num0_p;
}
return cln::mod(cln::the<cln::cl_I>(a.to_cl_N()) + b2,
cln::the<cln::cl_I>(b.to_cl_N())) - b2;
} else
- return _num0;
+ return *_num0_p;
}
return cln::rem(cln::the<cln::cl_I>(a.to_cl_N()),
cln::the<cln::cl_I>(b.to_cl_N()));
else
- return _num0;
+ return *_num0_p;
}
q = rem_quo.quotient;
return rem_quo.remainder;
} else {
- q = _num0;
- return _num0;
+ q = *_num0_p;
+ return *_num0_p;
}
}
return cln::truncate1(cln::the<cln::cl_I>(a.to_cl_N()),
cln::the<cln::cl_I>(b.to_cl_N()));
else
- return _num0;
+ return *_num0_p;
}
r = rem_quo.remainder;
return rem_quo.quotient;
} else {
- r = _num0;
- return _num0;
+ r = *_num0_p;
+ return *_num0_p;
}
}
return cln::gcd(cln::the<cln::cl_I>(a.to_cl_N()),
cln::the<cln::cl_I>(b.to_cl_N()));
else
- return _num1;
+ return *_num1_p;
}
cln::isqrt(cln::the<cln::cl_I>(x.to_cl_N()), &root);
return root;
} else
- return _num0;
+ return *_num0_p;
}
throw(std::runtime_error("I told you not to do instantiate me!"));
too_late = true;
cln::default_float_format = cln::float_format(17);
+
+ // add callbacks for built-in functions
+ // like ... add_callback(Li_lookuptable);
}
/** Assign a native long to global Digits object. */
_numeric_digits& _numeric_digits::operator=(long prec)
{
+ long digitsdiff = prec - digits;
digits = prec;
- cln::default_float_format = cln::float_format(prec);
+ cln::default_float_format = cln::float_format(prec);
+
+ // call registered callbacks
+ std::vector<digits_changed_callback>::const_iterator it = callbacklist.begin(), end = callbacklist.end();
+ for (; it != end; ++it) {
+ (*it)(digitsdiff);
+ }
+
return *this;
}
}
+/** Add a new callback function. */
+void _numeric_digits::add_callback(digits_changed_callback callback)
+{
+ callbacklist.push_back(callback);
+}
+
+
std::ostream& operator<<(std::ostream &os, const _numeric_digits &e)
{
e.print(os);