3 * This file contains the interface to the underlying bignum package.
4 * Its most important design principle is to completely hide the inner
5 * working of that other package from the user of GiNaC. It must either
6 * provide implementation of arithmetic operators and numerical evaluation
7 * of special functions or implement the interface to the bignum package. */
10 * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2 of the License, or
15 * (at your option) any later version.
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with this program; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
33 #if defined(HAVE_SSTREAM)
35 #elif defined(HAVE_STRSTREAM)
38 #error Need either sstream or strstream
48 // CLN should pollute the global namespace as little as possible. Hence, we
49 // include most of it here and include only the part needed for properly
50 // declaring cln::cl_number in numeric.h. This can only be safely done in
51 // namespaced versions of CLN, i.e. version > 1.1.0. Also, we only need a
52 // subset of CLN, so we don't include the complete <cln/cln.h> but only the
54 #include <cln/output.h>
55 #include <cln/integer_io.h>
56 #include <cln/integer_ring.h>
57 #include <cln/rational_io.h>
58 #include <cln/rational_ring.h>
59 #include <cln/lfloat_class.h>
60 #include <cln/lfloat_io.h>
61 #include <cln/real_io.h>
62 #include <cln/real_ring.h>
63 #include <cln/complex_io.h>
64 #include <cln/complex_ring.h>
65 #include <cln/numtheory.h>
69 GINAC_IMPLEMENT_REGISTERED_CLASS(numeric, basic)
72 // default ctor, dtor, copy ctor assignment
73 // operator and helpers
76 /** default ctor. Numerically it initializes to an integer zero. */
77 numeric::numeric() : basic(TINFO_numeric)
79 debugmsg("numeric default ctor", LOGLEVEL_CONSTRUCT);
81 setflag(status_flags::evaluated | status_flags::expanded);
84 void numeric::copy(const numeric &other)
86 inherited::copy(other);
90 DEFAULT_DESTROY(numeric)
98 numeric::numeric(int i) : basic(TINFO_numeric)
100 debugmsg("numeric ctor from int",LOGLEVEL_CONSTRUCT);
101 // Not the whole int-range is available if we don't cast to long
102 // first. This is due to the behaviour of the cl_I-ctor, which
103 // emphasizes efficiency. However, if the integer is small enough,
104 // i.e. satisfies cl_immediate_p(), we save space and dereferences by
105 // using an immediate type:
106 if (cln::cl_immediate_p(i))
107 value = cln::cl_I(i);
109 value = cln::cl_I((long) i);
110 setflag(status_flags::evaluated | status_flags::expanded);
114 numeric::numeric(unsigned int i) : basic(TINFO_numeric)
116 debugmsg("numeric ctor from uint",LOGLEVEL_CONSTRUCT);
117 // Not the whole uint-range is available if we don't cast to ulong
118 // first. This is due to the behaviour of the cl_I-ctor, which
119 // emphasizes efficiency. However, if the integer is small enough,
120 // i.e. satisfies cl_immediate_p(), we save space and dereferences by
121 // using an immediate type:
122 if (cln::cl_immediate_p(i))
123 value = cln::cl_I(i);
125 value = cln::cl_I((unsigned long) i);
126 setflag(status_flags::evaluated | status_flags::expanded);
130 numeric::numeric(long i) : basic(TINFO_numeric)
132 debugmsg("numeric ctor from long",LOGLEVEL_CONSTRUCT);
133 value = cln::cl_I(i);
134 setflag(status_flags::evaluated | status_flags::expanded);
138 numeric::numeric(unsigned long i) : basic(TINFO_numeric)
140 debugmsg("numeric ctor from ulong",LOGLEVEL_CONSTRUCT);
141 value = cln::cl_I(i);
142 setflag(status_flags::evaluated | status_flags::expanded);
145 /** Ctor for rational numerics a/b.
147 * @exception overflow_error (division by zero) */
148 numeric::numeric(long numer, long denom) : basic(TINFO_numeric)
150 debugmsg("numeric ctor from long/long",LOGLEVEL_CONSTRUCT);
152 throw std::overflow_error("division by zero");
153 value = cln::cl_I(numer) / cln::cl_I(denom);
154 setflag(status_flags::evaluated | status_flags::expanded);
158 numeric::numeric(double d) : basic(TINFO_numeric)
160 debugmsg("numeric ctor from double",LOGLEVEL_CONSTRUCT);
161 // We really want to explicitly use the type cl_LF instead of the
162 // more general cl_F, since that would give us a cl_DF only which
163 // will not be promoted to cl_LF if overflow occurs:
164 value = cln::cl_float(d, cln::default_float_format);
165 setflag(status_flags::evaluated | status_flags::expanded);
169 /** ctor from C-style string. It also accepts complex numbers in GiNaC
170 * notation like "2+5*I". */
171 numeric::numeric(const char *s) : basic(TINFO_numeric)
173 debugmsg("numeric ctor from string",LOGLEVEL_CONSTRUCT);
174 cln::cl_N ctorval = 0;
175 // parse complex numbers (functional but not completely safe, unfortunately
176 // std::string does not understand regexpese):
177 // ss should represent a simple sum like 2+5*I
179 // make it safe by adding explicit sign
180 if (ss.at(0) != '+' && ss.at(0) != '-' && ss.at(0) != '#')
182 std::string::size_type delim;
184 // chop ss into terms from left to right
186 bool imaginary = false;
187 delim = ss.find_first_of(std::string("+-"),1);
188 // Do we have an exponent marker like "31.415E-1"? If so, hop on!
189 if ((delim != std::string::npos) && (ss.at(delim-1) == 'E'))
190 delim = ss.find_first_of(std::string("+-"),delim+1);
191 term = ss.substr(0,delim);
192 if (delim != std::string::npos)
193 ss = ss.substr(delim);
194 // is the term imaginary?
195 if (term.find("I") != std::string::npos) {
197 term = term.replace(term.find("I"),1,"");
199 if (term.find("*") != std::string::npos)
200 term = term.replace(term.find("*"),1,"");
201 // correct for trivial +/-I without explicit factor on I:
202 if (term.size() == 1)
206 if (term.find(".") != std::string::npos) {
207 // CLN's short type cl_SF is not very useful within the GiNaC
208 // framework where we are mainly interested in the arbitrary
209 // precision type cl_LF. Hence we go straight to the construction
210 // of generic floats. In order to create them we have to convert
211 // our own floating point notation used for output and construction
212 // from char * to CLN's generic notation:
213 // 3.14 --> 3.14e0_<Digits>
214 // 31.4E-1 --> 31.4e-1_<Digits>
216 // No exponent marker? Let's add a trivial one.
217 if (term.find("E") == std::string::npos)
220 term = term.replace(term.find("E"),1,"e");
221 // append _<Digits> to term
222 #if defined(HAVE_SSTREAM)
223 std::ostringstream buf;
224 buf << unsigned(Digits) << std::ends;
225 term += "_" + buf.str();
228 std::ostrstream(buf,sizeof(buf)) << unsigned(Digits) << std::ends;
229 term += "_" + std::string(buf);
231 // construct float using cln::cl_F(const char *) ctor.
233 ctorval = ctorval + cln::complex(cln::cl_I(0),cln::cl_F(term.c_str()));
235 ctorval = ctorval + cln::cl_F(term.c_str());
237 // not a floating point number...
239 ctorval = ctorval + cln::complex(cln::cl_I(0),cln::cl_R(term.c_str()));
241 ctorval = ctorval + cln::cl_R(term.c_str());
243 } while(delim != std::string::npos);
245 setflag(status_flags::evaluated | status_flags::expanded);
249 /** Ctor from CLN types. This is for the initiated user or internal use
251 numeric::numeric(const cln::cl_N &z) : basic(TINFO_numeric)
253 debugmsg("numeric ctor from cl_N", LOGLEVEL_CONSTRUCT);
255 setflag(status_flags::evaluated | status_flags::expanded);
262 numeric::numeric(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
264 debugmsg("numeric ctor from archive_node", LOGLEVEL_CONSTRUCT);
265 cln::cl_N ctorval = 0;
267 // Read number as string
269 if (n.find_string("number", str)) {
271 std::istringstream s(str);
273 std::istrstream s(str.c_str(), str.size() + 1);
275 cln::cl_idecoded_float re, im;
279 case 'R': // Integer-decoded real number
280 s >> re.sign >> re.mantissa >> re.exponent;
281 ctorval = re.sign * re.mantissa * cln::expt(cln::cl_float(2.0, cln::default_float_format), re.exponent);
283 case 'C': // Integer-decoded complex number
284 s >> re.sign >> re.mantissa >> re.exponent;
285 s >> im.sign >> im.mantissa >> im.exponent;
286 ctorval = cln::complex(re.sign * re.mantissa * cln::expt(cln::cl_float(2.0, cln::default_float_format), re.exponent),
287 im.sign * im.mantissa * cln::expt(cln::cl_float(2.0, cln::default_float_format), im.exponent));
289 default: // Ordinary number
296 setflag(status_flags::evaluated | status_flags::expanded);
299 void numeric::archive(archive_node &n) const
301 inherited::archive(n);
303 // Write number as string
305 std::ostringstream s;
308 std::ostrstream s(buf, 1024);
310 if (this->is_crational())
311 s << cln::the<cln::cl_N>(value);
313 // Non-rational numbers are written in an integer-decoded format
314 // to preserve the precision
315 if (this->is_real()) {
316 cln::cl_idecoded_float re = cln::integer_decode_float(cln::the<cln::cl_F>(value));
318 s << re.sign << " " << re.mantissa << " " << re.exponent;
320 cln::cl_idecoded_float re = cln::integer_decode_float(cln::the<cln::cl_F>(cln::realpart(cln::the<cln::cl_N>(value))));
321 cln::cl_idecoded_float im = cln::integer_decode_float(cln::the<cln::cl_F>(cln::imagpart(cln::the<cln::cl_N>(value))));
323 s << re.sign << " " << re.mantissa << " " << re.exponent << " ";
324 s << im.sign << " " << im.mantissa << " " << im.exponent;
328 n.add_string("number", s.str());
331 std::string str(buf);
332 n.add_string("number", str);
336 DEFAULT_UNARCHIVE(numeric)
339 // functions overriding virtual functions from base classes
342 /** Helper function to print a real number in a nicer way than is CLN's
343 * default. Instead of printing 42.0L0 this just prints 42.0 to ostream os
344 * and instead of 3.99168L7 it prints 3.99168E7. This is fine in GiNaC as
345 * long as it only uses cl_LF and no other floating point types that we might
346 * want to visibly distinguish from cl_LF.
348 * @see numeric::print() */
349 static void print_real_number(const print_context & c, const cln::cl_R &x)
351 cln::cl_print_flags ourflags;
352 if (cln::instanceof(x, cln::cl_RA_ring)) {
353 // case 1: integer or rational
354 if (cln::instanceof(x, cln::cl_I_ring) ||
355 !is_a<print_latex>(c)) {
356 cln::print_real(c.s, ourflags, x);
357 } else { // rational output in LaTeX context
359 cln::print_real(c.s, ourflags, cln::numerator(cln::the<cln::cl_RA>(x)));
361 cln::print_real(c.s, ourflags, cln::denominator(cln::the<cln::cl_RA>(x)));
366 // make CLN believe this number has default_float_format, so it prints
367 // 'E' as exponent marker instead of 'L':
368 ourflags.default_float_format = cln::float_format(cln::the<cln::cl_F>(x));
369 cln::print_real(c.s, ourflags, x);
373 /** This method adds to the output so it blends more consistently together
374 * with the other routines and produces something compatible to ginsh input.
376 * @see print_real_number() */
377 void numeric::print(const print_context & c, unsigned level) const
379 debugmsg("numeric print", LOGLEVEL_PRINT);
381 if (is_a<print_tree>(c)) {
383 c.s << std::string(level, ' ') << cln::the<cln::cl_N>(value)
384 << " (" << class_name() << ")"
385 << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
388 } else if (is_a<print_csrc>(c)) {
390 std::ios::fmtflags oldflags = c.s.flags();
391 c.s.setf(std::ios::scientific);
392 if (this->is_rational() && !this->is_integer()) {
393 if (compare(_num0()) > 0) {
395 if (is_a<print_csrc_cl_N>(c))
396 c.s << "cln::cl_F(\"" << numer().evalf() << "\")";
398 c.s << numer().to_double();
401 if (is_a<print_csrc_cl_N>(c))
402 c.s << "cln::cl_F(\"" << -numer().evalf() << "\")";
404 c.s << -numer().to_double();
407 if (is_a<print_csrc_cl_N>(c))
408 c.s << "cln::cl_F(\"" << denom().evalf() << "\")";
410 c.s << denom().to_double();
413 if (is_a<print_csrc_cl_N>(c))
414 c.s << "cln::cl_F(\"" << evalf() << "\")";
421 const std::string par_open = is_a<print_latex>(c) ? "{(" : "(";
422 const std::string par_close = is_a<print_latex>(c) ? ")}" : ")";
423 const std::string imag_sym = is_a<print_latex>(c) ? "i" : "I";
424 const std::string mul_sym = is_a<print_latex>(c) ? " " : "*";
425 const cln::cl_R r = cln::realpart(cln::the<cln::cl_N>(value));
426 const cln::cl_R i = cln::imagpart(cln::the<cln::cl_N>(value));
428 // case 1, real: x or -x
429 if ((precedence() <= level) && (!this->is_nonneg_integer())) {
431 print_real_number(c, r);
434 print_real_number(c, r);
438 // case 2, imaginary: y*I or -y*I
439 if ((precedence() <= level) && (i < 0)) {
441 c.s << par_open+imag_sym+par_close;
444 print_real_number(c, i);
445 c.s << mul_sym+imag_sym+par_close;
452 c.s << "-" << imag_sym;
454 print_real_number(c, i);
455 c.s << mul_sym+imag_sym;
460 // case 3, complex: x+y*I or x-y*I or -x+y*I or -x-y*I
461 if (precedence() <= level)
463 print_real_number(c, r);
468 print_real_number(c, i);
469 c.s << mul_sym+imag_sym;
476 print_real_number(c, i);
477 c.s << mul_sym+imag_sym;
480 if (precedence() <= level)
487 bool numeric::info(unsigned inf) const
490 case info_flags::numeric:
491 case info_flags::polynomial:
492 case info_flags::rational_function:
494 case info_flags::real:
496 case info_flags::rational:
497 case info_flags::rational_polynomial:
498 return is_rational();
499 case info_flags::crational:
500 case info_flags::crational_polynomial:
501 return is_crational();
502 case info_flags::integer:
503 case info_flags::integer_polynomial:
505 case info_flags::cinteger:
506 case info_flags::cinteger_polynomial:
507 return is_cinteger();
508 case info_flags::positive:
509 return is_positive();
510 case info_flags::negative:
511 return is_negative();
512 case info_flags::nonnegative:
513 return !is_negative();
514 case info_flags::posint:
515 return is_pos_integer();
516 case info_flags::negint:
517 return is_integer() && is_negative();
518 case info_flags::nonnegint:
519 return is_nonneg_integer();
520 case info_flags::even:
522 case info_flags::odd:
524 case info_flags::prime:
526 case info_flags::algebraic:
532 /** Disassemble real part and imaginary part to scan for the occurrence of a
533 * single number. Also handles the imaginary unit. It ignores the sign on
534 * both this and the argument, which may lead to what might appear as funny
535 * results: (2+I).has(-2) -> true. But this is consistent, since we also
536 * would like to have (-2+I).has(2) -> true and we want to think about the
537 * sign as a multiplicative factor. */
538 bool numeric::has(const ex &other) const
540 if (!is_exactly_of_type(*other.bp, numeric))
542 const numeric &o = static_cast<const numeric &>(*other.bp);
543 if (this->is_equal(o) || this->is_equal(-o))
545 if (o.imag().is_zero()) // e.g. scan for 3 in -3*I
546 return (this->real().is_equal(o) || this->imag().is_equal(o) ||
547 this->real().is_equal(-o) || this->imag().is_equal(-o));
549 if (o.is_equal(I)) // e.g scan for I in 42*I
550 return !this->is_real();
551 if (o.real().is_zero()) // e.g. scan for 2*I in 2*I+1
552 return (this->real().has(o*I) || this->imag().has(o*I) ||
553 this->real().has(-o*I) || this->imag().has(-o*I));
559 /** Evaluation of numbers doesn't do anything at all. */
560 ex numeric::eval(int level) const
562 // Warning: if this is ever gonna do something, the ex ctors from all kinds
563 // of numbers should be checking for status_flags::evaluated.
568 /** Cast numeric into a floating-point object. For example exact numeric(1) is
569 * returned as a 1.0000000000000000000000 and so on according to how Digits is
570 * currently set. In case the object already was a floating point number the
571 * precision is trimmed to match the currently set default.
573 * @param level ignored, only needed for overriding basic::evalf.
574 * @return an ex-handle to a numeric. */
575 ex numeric::evalf(int level) const
577 // level can safely be discarded for numeric objects.
578 return numeric(cln::cl_float(1.0, cln::default_float_format) *
579 (cln::the<cln::cl_N>(value)));
584 int numeric::compare_same_type(const basic &other) const
586 GINAC_ASSERT(is_exactly_of_type(other, numeric));
587 const numeric &o = static_cast<const numeric &>(other);
589 return this->compare(o);
593 bool numeric::is_equal_same_type(const basic &other) const
595 GINAC_ASSERT(is_exactly_of_type(other,numeric));
596 const numeric &o = static_cast<const numeric &>(other);
598 return this->is_equal(o);
602 unsigned numeric::calchash(void) const
604 // Use CLN's hashcode. Warning: It depends only on the number's value, not
605 // its type or precision (i.e. a true equivalence relation on numbers). As
606 // a consequence, 3 and 3.0 share the same hashvalue.
607 setflag(status_flags::hash_calculated);
608 return (hashvalue = cln::equal_hashcode(cln::the<cln::cl_N>(value)) | 0x80000000U);
613 // new virtual functions which can be overridden by derived classes
619 // non-virtual functions in this class
624 /** Numerical addition method. Adds argument to *this and returns result as
625 * a numeric object. */
626 const numeric numeric::add(const numeric &other) const
628 // Efficiency shortcut: trap the neutral element by pointer.
629 static const numeric * _num0p = &_num0();
632 else if (&other==_num0p)
635 return numeric(cln::the<cln::cl_N>(value)+cln::the<cln::cl_N>(other.value));
639 /** Numerical subtraction method. Subtracts argument from *this and returns
640 * result as a numeric object. */
641 const numeric numeric::sub(const numeric &other) const
643 return numeric(cln::the<cln::cl_N>(value)-cln::the<cln::cl_N>(other.value));
647 /** Numerical multiplication method. Multiplies *this and argument and returns
648 * result as a numeric object. */
649 const numeric numeric::mul(const numeric &other) const
651 // Efficiency shortcut: trap the neutral element by pointer.
652 static const numeric * _num1p = &_num1();
655 else if (&other==_num1p)
658 return numeric(cln::the<cln::cl_N>(value)*cln::the<cln::cl_N>(other.value));
662 /** Numerical division method. Divides *this by argument and returns result as
665 * @exception overflow_error (division by zero) */
666 const numeric numeric::div(const numeric &other) const
668 if (cln::zerop(cln::the<cln::cl_N>(other.value)))
669 throw std::overflow_error("numeric::div(): division by zero");
670 return numeric(cln::the<cln::cl_N>(value)/cln::the<cln::cl_N>(other.value));
674 /** Numerical exponentiation. Raises *this to the power given as argument and
675 * returns result as a numeric object. */
676 const numeric numeric::power(const numeric &other) const
678 // Efficiency shortcut: trap the neutral exponent by pointer.
679 static const numeric * _num1p = &_num1();
683 if (cln::zerop(cln::the<cln::cl_N>(value))) {
684 if (cln::zerop(cln::the<cln::cl_N>(other.value)))
685 throw std::domain_error("numeric::eval(): pow(0,0) is undefined");
686 else if (cln::zerop(cln::realpart(cln::the<cln::cl_N>(other.value))))
687 throw std::domain_error("numeric::eval(): pow(0,I) is undefined");
688 else if (cln::minusp(cln::realpart(cln::the<cln::cl_N>(other.value))))
689 throw std::overflow_error("numeric::eval(): division by zero");
693 return numeric(cln::expt(cln::the<cln::cl_N>(value),cln::the<cln::cl_N>(other.value)));
697 const numeric &numeric::add_dyn(const numeric &other) const
699 // Efficiency shortcut: trap the neutral element by pointer.
700 static const numeric * _num0p = &_num0();
703 else if (&other==_num0p)
706 return static_cast<const numeric &>((new numeric(cln::the<cln::cl_N>(value)+cln::the<cln::cl_N>(other.value)))->
707 setflag(status_flags::dynallocated));
711 const numeric &numeric::sub_dyn(const numeric &other) const
713 return static_cast<const numeric &>((new numeric(cln::the<cln::cl_N>(value)-cln::the<cln::cl_N>(other.value)))->
714 setflag(status_flags::dynallocated));
718 const numeric &numeric::mul_dyn(const numeric &other) const
720 // Efficiency shortcut: trap the neutral element by pointer.
721 static const numeric * _num1p = &_num1();
724 else if (&other==_num1p)
727 return static_cast<const numeric &>((new numeric(cln::the<cln::cl_N>(value)*cln::the<cln::cl_N>(other.value)))->
728 setflag(status_flags::dynallocated));
732 const numeric &numeric::div_dyn(const numeric &other) const
734 if (cln::zerop(cln::the<cln::cl_N>(other.value)))
735 throw std::overflow_error("division by zero");
736 return static_cast<const numeric &>((new numeric(cln::the<cln::cl_N>(value)/cln::the<cln::cl_N>(other.value)))->
737 setflag(status_flags::dynallocated));
741 const numeric &numeric::power_dyn(const numeric &other) const
743 // Efficiency shortcut: trap the neutral exponent by pointer.
744 static const numeric * _num1p=&_num1();
748 if (cln::zerop(cln::the<cln::cl_N>(value))) {
749 if (cln::zerop(cln::the<cln::cl_N>(other.value)))
750 throw std::domain_error("numeric::eval(): pow(0,0) is undefined");
751 else if (cln::zerop(cln::realpart(cln::the<cln::cl_N>(other.value))))
752 throw std::domain_error("numeric::eval(): pow(0,I) is undefined");
753 else if (cln::minusp(cln::realpart(cln::the<cln::cl_N>(other.value))))
754 throw std::overflow_error("numeric::eval(): division by zero");
758 return static_cast<const numeric &>((new numeric(cln::expt(cln::the<cln::cl_N>(value),cln::the<cln::cl_N>(other.value))))->
759 setflag(status_flags::dynallocated));
763 const numeric &numeric::operator=(int i)
765 return operator=(numeric(i));
769 const numeric &numeric::operator=(unsigned int i)
771 return operator=(numeric(i));
775 const numeric &numeric::operator=(long i)
777 return operator=(numeric(i));
781 const numeric &numeric::operator=(unsigned long i)
783 return operator=(numeric(i));
787 const numeric &numeric::operator=(double d)
789 return operator=(numeric(d));
793 const numeric &numeric::operator=(const char * s)
795 return operator=(numeric(s));
799 /** Inverse of a number. */
800 const numeric numeric::inverse(void) const
802 if (cln::zerop(cln::the<cln::cl_N>(value)))
803 throw std::overflow_error("numeric::inverse(): division by zero");
804 return numeric(cln::recip(cln::the<cln::cl_N>(value)));
808 /** Return the complex half-plane (left or right) in which the number lies.
809 * csgn(x)==0 for x==0, csgn(x)==1 for Re(x)>0 or Re(x)=0 and Im(x)>0,
810 * csgn(x)==-1 for Re(x)<0 or Re(x)=0 and Im(x)<0.
812 * @see numeric::compare(const numeric &other) */
813 int numeric::csgn(void) const
815 if (cln::zerop(cln::the<cln::cl_N>(value)))
817 cln::cl_R r = cln::realpart(cln::the<cln::cl_N>(value));
818 if (!cln::zerop(r)) {
824 if (cln::plusp(cln::imagpart(cln::the<cln::cl_N>(value))))
832 /** This method establishes a canonical order on all numbers. For complex
833 * numbers this is not possible in a mathematically consistent way but we need
834 * to establish some order and it ought to be fast. So we simply define it
835 * to be compatible with our method csgn.
837 * @return csgn(*this-other)
838 * @see numeric::csgn(void) */
839 int numeric::compare(const numeric &other) const
841 // Comparing two real numbers?
842 if (cln::instanceof(value, cln::cl_R_ring) &&
843 cln::instanceof(other.value, cln::cl_R_ring))
844 // Yes, so just cln::compare them
845 return cln::compare(cln::the<cln::cl_R>(value), cln::the<cln::cl_R>(other.value));
847 // No, first cln::compare real parts...
848 cl_signean real_cmp = cln::compare(cln::realpart(cln::the<cln::cl_N>(value)), cln::realpart(cln::the<cln::cl_N>(other.value)));
851 // ...and then the imaginary parts.
852 return cln::compare(cln::imagpart(cln::the<cln::cl_N>(value)), cln::imagpart(cln::the<cln::cl_N>(other.value)));
857 bool numeric::is_equal(const numeric &other) const
859 return cln::equal(cln::the<cln::cl_N>(value),cln::the<cln::cl_N>(other.value));
863 /** True if object is zero. */
864 bool numeric::is_zero(void) const
866 return cln::zerop(cln::the<cln::cl_N>(value));
870 /** True if object is not complex and greater than zero. */
871 bool numeric::is_positive(void) const
874 return cln::plusp(cln::the<cln::cl_R>(value));
879 /** True if object is not complex and less than zero. */
880 bool numeric::is_negative(void) const
883 return cln::minusp(cln::the<cln::cl_R>(value));
888 /** True if object is a non-complex integer. */
889 bool numeric::is_integer(void) const
891 return cln::instanceof(value, cln::cl_I_ring);
895 /** True if object is an exact integer greater than zero. */
896 bool numeric::is_pos_integer(void) const
898 return (this->is_integer() && cln::plusp(cln::the<cln::cl_I>(value)));
902 /** True if object is an exact integer greater or equal zero. */
903 bool numeric::is_nonneg_integer(void) const
905 return (this->is_integer() && !cln::minusp(cln::the<cln::cl_I>(value)));
909 /** True if object is an exact even integer. */
910 bool numeric::is_even(void) const
912 return (this->is_integer() && cln::evenp(cln::the<cln::cl_I>(value)));
916 /** True if object is an exact odd integer. */
917 bool numeric::is_odd(void) const
919 return (this->is_integer() && cln::oddp(cln::the<cln::cl_I>(value)));
923 /** Probabilistic primality test.
925 * @return true if object is exact integer and prime. */
926 bool numeric::is_prime(void) const
928 return (this->is_integer() && cln::isprobprime(cln::the<cln::cl_I>(value)));
932 /** True if object is an exact rational number, may even be complex
933 * (denominator may be unity). */
934 bool numeric::is_rational(void) const
936 return cln::instanceof(value, cln::cl_RA_ring);
940 /** True if object is a real integer, rational or float (but not complex). */
941 bool numeric::is_real(void) const
943 return cln::instanceof(value, cln::cl_R_ring);
947 bool numeric::operator==(const numeric &other) const
949 return cln::equal(cln::the<cln::cl_N>(value), cln::the<cln::cl_N>(other.value));
953 bool numeric::operator!=(const numeric &other) const
955 return !cln::equal(cln::the<cln::cl_N>(value), cln::the<cln::cl_N>(other.value));
959 /** True if object is element of the domain of integers extended by I, i.e. is
960 * of the form a+b*I, where a and b are integers. */
961 bool numeric::is_cinteger(void) const
963 if (cln::instanceof(value, cln::cl_I_ring))
965 else if (!this->is_real()) { // complex case, handle n+m*I
966 if (cln::instanceof(cln::realpart(cln::the<cln::cl_N>(value)), cln::cl_I_ring) &&
967 cln::instanceof(cln::imagpart(cln::the<cln::cl_N>(value)), cln::cl_I_ring))
974 /** True if object is an exact rational number, may even be complex
975 * (denominator may be unity). */
976 bool numeric::is_crational(void) const
978 if (cln::instanceof(value, cln::cl_RA_ring))
980 else if (!this->is_real()) { // complex case, handle Q(i):
981 if (cln::instanceof(cln::realpart(cln::the<cln::cl_N>(value)), cln::cl_RA_ring) &&
982 cln::instanceof(cln::imagpart(cln::the<cln::cl_N>(value)), cln::cl_RA_ring))
989 /** Numerical comparison: less.
991 * @exception invalid_argument (complex inequality) */
992 bool numeric::operator<(const numeric &other) const
994 if (this->is_real() && other.is_real())
995 return (cln::the<cln::cl_R>(value) < cln::the<cln::cl_R>(other.value));
996 throw std::invalid_argument("numeric::operator<(): complex inequality");
1000 /** Numerical comparison: less or equal.
1002 * @exception invalid_argument (complex inequality) */
1003 bool numeric::operator<=(const numeric &other) const
1005 if (this->is_real() && other.is_real())
1006 return (cln::the<cln::cl_R>(value) <= cln::the<cln::cl_R>(other.value));
1007 throw std::invalid_argument("numeric::operator<=(): complex inequality");
1011 /** Numerical comparison: greater.
1013 * @exception invalid_argument (complex inequality) */
1014 bool numeric::operator>(const numeric &other) const
1016 if (this->is_real() && other.is_real())
1017 return (cln::the<cln::cl_R>(value) > cln::the<cln::cl_R>(other.value));
1018 throw std::invalid_argument("numeric::operator>(): complex inequality");
1022 /** Numerical comparison: greater or equal.
1024 * @exception invalid_argument (complex inequality) */
1025 bool numeric::operator>=(const numeric &other) const
1027 if (this->is_real() && other.is_real())
1028 return (cln::the<cln::cl_R>(value) >= cln::the<cln::cl_R>(other.value));
1029 throw std::invalid_argument("numeric::operator>=(): complex inequality");
1033 /** Converts numeric types to machine's int. You should check with
1034 * is_integer() if the number is really an integer before calling this method.
1035 * You may also consider checking the range first. */
1036 int numeric::to_int(void) const
1038 GINAC_ASSERT(this->is_integer());
1039 return cln::cl_I_to_int(cln::the<cln::cl_I>(value));
1043 /** Converts numeric types to machine's long. You should check with
1044 * is_integer() if the number is really an integer before calling this method.
1045 * You may also consider checking the range first. */
1046 long numeric::to_long(void) const
1048 GINAC_ASSERT(this->is_integer());
1049 return cln::cl_I_to_long(cln::the<cln::cl_I>(value));
1053 /** Converts numeric types to machine's double. You should check with is_real()
1054 * if the number is really not complex before calling this method. */
1055 double numeric::to_double(void) const
1057 GINAC_ASSERT(this->is_real());
1058 return cln::double_approx(cln::realpart(cln::the<cln::cl_N>(value)));
1062 /** Returns a new CLN object of type cl_N, representing the value of *this.
1063 * This method may be used when mixing GiNaC and CLN in one project.
1065 cln::cl_N numeric::to_cl_N(void) const
1067 return cln::cl_N(cln::the<cln::cl_N>(value));
1071 /** Real part of a number. */
1072 const numeric numeric::real(void) const
1074 return numeric(cln::realpart(cln::the<cln::cl_N>(value)));
1078 /** Imaginary part of a number. */
1079 const numeric numeric::imag(void) const
1081 return numeric(cln::imagpart(cln::the<cln::cl_N>(value)));
1085 /** Numerator. Computes the numerator of rational numbers, rationalized
1086 * numerator of complex if real and imaginary part are both rational numbers
1087 * (i.e numer(4/3+5/6*I) == 8+5*I), the number carrying the sign in all other
1089 const numeric numeric::numer(void) const
1091 if (this->is_integer())
1092 return numeric(*this);
1094 else if (cln::instanceof(value, cln::cl_RA_ring))
1095 return numeric(cln::numerator(cln::the<cln::cl_RA>(value)));
1097 else if (!this->is_real()) { // complex case, handle Q(i):
1098 const cln::cl_RA r = cln::the<cln::cl_RA>(cln::realpart(cln::the<cln::cl_N>(value)));
1099 const cln::cl_RA i = cln::the<cln::cl_RA>(cln::imagpart(cln::the<cln::cl_N>(value)));
1100 if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_I_ring))
1101 return numeric(*this);
1102 if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_RA_ring))
1103 return numeric(cln::complex(r*cln::denominator(i), cln::numerator(i)));
1104 if (cln::instanceof(r, cln::cl_RA_ring) && cln::instanceof(i, cln::cl_I_ring))
1105 return numeric(cln::complex(cln::numerator(r), i*cln::denominator(r)));
1106 if (cln::instanceof(r, cln::cl_RA_ring) && cln::instanceof(i, cln::cl_RA_ring)) {
1107 const cln::cl_I s = cln::lcm(cln::denominator(r), cln::denominator(i));
1108 return numeric(cln::complex(cln::numerator(r)*(cln::exquo(s,cln::denominator(r))),
1109 cln::numerator(i)*(cln::exquo(s,cln::denominator(i)))));
1112 // at least one float encountered
1113 return numeric(*this);
1117 /** Denominator. Computes the denominator of rational numbers, common integer
1118 * denominator of complex if real and imaginary part are both rational numbers
1119 * (i.e denom(4/3+5/6*I) == 6), one in all other cases. */
1120 const numeric numeric::denom(void) const
1122 if (this->is_integer())
1125 if (cln::instanceof(value, cln::cl_RA_ring))
1126 return numeric(cln::denominator(cln::the<cln::cl_RA>(value)));
1128 if (!this->is_real()) { // complex case, handle Q(i):
1129 const cln::cl_RA r = cln::the<cln::cl_RA>(cln::realpart(cln::the<cln::cl_N>(value)));
1130 const cln::cl_RA i = cln::the<cln::cl_RA>(cln::imagpart(cln::the<cln::cl_N>(value)));
1131 if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_I_ring))
1133 if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_RA_ring))
1134 return numeric(cln::denominator(i));
1135 if (cln::instanceof(r, cln::cl_RA_ring) && cln::instanceof(i, cln::cl_I_ring))
1136 return numeric(cln::denominator(r));
1137 if (cln::instanceof(r, cln::cl_RA_ring) && cln::instanceof(i, cln::cl_RA_ring))
1138 return numeric(cln::lcm(cln::denominator(r), cln::denominator(i)));
1140 // at least one float encountered
1145 /** Size in binary notation. For integers, this is the smallest n >= 0 such
1146 * that -2^n <= x < 2^n. If x > 0, this is the unique n > 0 such that
1147 * 2^(n-1) <= x < 2^n.
1149 * @return number of bits (excluding sign) needed to represent that number
1150 * in two's complement if it is an integer, 0 otherwise. */
1151 int numeric::int_length(void) const
1153 if (this->is_integer())
1154 return cln::integer_length(cln::the<cln::cl_I>(value));
1163 /** Imaginary unit. This is not a constant but a numeric since we are
1164 * natively handing complex numbers anyways, so in each expression containing
1165 * an I it is automatically eval'ed away anyhow. */
1166 const numeric I = numeric(cln::complex(cln::cl_I(0),cln::cl_I(1)));
1169 /** Exponential function.
1171 * @return arbitrary precision numerical exp(x). */
1172 const numeric exp(const numeric &x)
1174 return cln::exp(x.to_cl_N());
1178 /** Natural logarithm.
1180 * @param z complex number
1181 * @return arbitrary precision numerical log(x).
1182 * @exception pole_error("log(): logarithmic pole",0) */
1183 const numeric log(const numeric &z)
1186 throw pole_error("log(): logarithmic pole",0);
1187 return cln::log(z.to_cl_N());
1191 /** Numeric sine (trigonometric function).
1193 * @return arbitrary precision numerical sin(x). */
1194 const numeric sin(const numeric &x)
1196 return cln::sin(x.to_cl_N());
1200 /** Numeric cosine (trigonometric function).
1202 * @return arbitrary precision numerical cos(x). */
1203 const numeric cos(const numeric &x)
1205 return cln::cos(x.to_cl_N());
1209 /** Numeric tangent (trigonometric function).
1211 * @return arbitrary precision numerical tan(x). */
1212 const numeric tan(const numeric &x)
1214 return cln::tan(x.to_cl_N());
1218 /** Numeric inverse sine (trigonometric function).
1220 * @return arbitrary precision numerical asin(x). */
1221 const numeric asin(const numeric &x)
1223 return cln::asin(x.to_cl_N());
1227 /** Numeric inverse cosine (trigonometric function).
1229 * @return arbitrary precision numerical acos(x). */
1230 const numeric acos(const numeric &x)
1232 return cln::acos(x.to_cl_N());
1238 * @param z complex number
1240 * @exception pole_error("atan(): logarithmic pole",0) */
1241 const numeric atan(const numeric &x)
1244 x.real().is_zero() &&
1245 abs(x.imag()).is_equal(_num1()))
1246 throw pole_error("atan(): logarithmic pole",0);
1247 return cln::atan(x.to_cl_N());
1253 * @param x real number
1254 * @param y real number
1255 * @return atan(y/x) */
1256 const numeric atan(const numeric &y, const numeric &x)
1258 if (x.is_real() && y.is_real())
1259 return cln::atan(cln::the<cln::cl_R>(x.to_cl_N()),
1260 cln::the<cln::cl_R>(y.to_cl_N()));
1262 throw std::invalid_argument("atan(): complex argument");
1266 /** Numeric hyperbolic sine (trigonometric function).
1268 * @return arbitrary precision numerical sinh(x). */
1269 const numeric sinh(const numeric &x)
1271 return cln::sinh(x.to_cl_N());
1275 /** Numeric hyperbolic cosine (trigonometric function).
1277 * @return arbitrary precision numerical cosh(x). */
1278 const numeric cosh(const numeric &x)
1280 return cln::cosh(x.to_cl_N());
1284 /** Numeric hyperbolic tangent (trigonometric function).
1286 * @return arbitrary precision numerical tanh(x). */
1287 const numeric tanh(const numeric &x)
1289 return cln::tanh(x.to_cl_N());
1293 /** Numeric inverse hyperbolic sine (trigonometric function).
1295 * @return arbitrary precision numerical asinh(x). */
1296 const numeric asinh(const numeric &x)
1298 return cln::asinh(x.to_cl_N());
1302 /** Numeric inverse hyperbolic cosine (trigonometric function).
1304 * @return arbitrary precision numerical acosh(x). */
1305 const numeric acosh(const numeric &x)
1307 return cln::acosh(x.to_cl_N());
1311 /** Numeric inverse hyperbolic tangent (trigonometric function).
1313 * @return arbitrary precision numerical atanh(x). */
1314 const numeric atanh(const numeric &x)
1316 return cln::atanh(x.to_cl_N());
1320 /*static cln::cl_N Li2_series(const ::cl_N &x,
1321 const ::float_format_t &prec)
1323 // Note: argument must be in the unit circle
1324 // This is very inefficient unless we have fast floating point Bernoulli
1325 // numbers implemented!
1326 cln::cl_N c1 = -cln::log(1-x);
1328 // hard-wire the first two Bernoulli numbers
1329 cln::cl_N acc = c1 - cln::square(c1)/4;
1331 cln::cl_F pisq = cln::square(cln::cl_pi(prec)); // pi^2
1332 cln::cl_F piac = cln::cl_float(1, prec); // accumulator: pi^(2*i)
1334 c1 = cln::square(c1);
1338 aug = c2 * (*(bernoulli(numeric(2*i)).clnptr())) / cln::factorial(2*i+1);
1339 // aug = c2 * cln::cl_I(i%2 ? 1 : -1) / cln::cl_I(2*i+1) * cln::cl_zeta(2*i, prec) / piac / (cln::cl_I(1)<<(2*i-1));
1342 } while (acc != acc+aug);
1346 /** Numeric evaluation of Dilogarithm within circle of convergence (unit
1347 * circle) using a power series. */
1348 static cln::cl_N Li2_series(const cln::cl_N &x,
1349 const cln::float_format_t &prec)
1351 // Note: argument must be in the unit circle
1353 cln::cl_N num = cln::complex(cln::cl_float(1, prec), 0);
1358 den = den + i; // 1, 4, 9, 16, ...
1362 } while (acc != acc+aug);
1366 /** Folds Li2's argument inside a small rectangle to enhance convergence. */
1367 static cln::cl_N Li2_projection(const cln::cl_N &x,
1368 const cln::float_format_t &prec)
1370 const cln::cl_R re = cln::realpart(x);
1371 const cln::cl_R im = cln::imagpart(x);
1372 if (re > cln::cl_F(".5"))
1373 // zeta(2) - Li2(1-x) - log(x)*log(1-x)
1375 - Li2_series(1-x, prec)
1376 - cln::log(x)*cln::log(1-x));
1377 if ((re <= 0 && cln::abs(im) > cln::cl_F(".75")) || (re < cln::cl_F("-.5")))
1378 // -log(1-x)^2 / 2 - Li2(x/(x-1))
1379 return(- cln::square(cln::log(1-x))/2
1380 - Li2_series(x/(x-1), prec));
1381 if (re > 0 && cln::abs(im) > cln::cl_LF(".75"))
1382 // Li2(x^2)/2 - Li2(-x)
1383 return(Li2_projection(cln::square(x), prec)/2
1384 - Li2_projection(-x, prec));
1385 return Li2_series(x, prec);
1388 /** Numeric evaluation of Dilogarithm. The domain is the entire complex plane,
1389 * the branch cut lies along the positive real axis, starting at 1 and
1390 * continuous with quadrant IV.
1392 * @return arbitrary precision numerical Li2(x). */
1393 const numeric Li2(const numeric &x)
1398 // what is the desired float format?
1399 // first guess: default format
1400 cln::float_format_t prec = cln::default_float_format;
1401 const cln::cl_N value = x.to_cl_N();
1402 // second guess: the argument's format
1403 if (!x.real().is_rational())
1404 prec = cln::float_format(cln::the<cln::cl_F>(cln::realpart(value)));
1405 else if (!x.imag().is_rational())
1406 prec = cln::float_format(cln::the<cln::cl_F>(cln::imagpart(value)));
1408 if (cln::the<cln::cl_N>(value)==1) // may cause trouble with log(1-x)
1409 return cln::zeta(2, prec);
1411 if (cln::abs(value) > 1)
1412 // -log(-x)^2 / 2 - zeta(2) - Li2(1/x)
1413 return(- cln::square(cln::log(-value))/2
1414 - cln::zeta(2, prec)
1415 - Li2_projection(cln::recip(value), prec));
1417 return Li2_projection(x.to_cl_N(), prec);
1421 /** Numeric evaluation of Riemann's Zeta function. Currently works only for
1422 * integer arguments. */
1423 const numeric zeta(const numeric &x)
1425 // A dirty hack to allow for things like zeta(3.0), since CLN currently
1426 // only knows about integer arguments and zeta(3).evalf() automatically
1427 // cascades down to zeta(3.0).evalf(). The trick is to rely on 3.0-3
1428 // being an exact zero for CLN, which can be tested and then we can just
1429 // pass the number casted to an int:
1431 const int aux = (int)(cln::double_approx(cln::the<cln::cl_R>(x.to_cl_N())));
1432 if (cln::zerop(x.to_cl_N()-aux))
1433 return cln::zeta(aux);
1439 /** The Gamma function.
1440 * This is only a stub! */
1441 const numeric lgamma(const numeric &x)
1445 const numeric tgamma(const numeric &x)
1451 /** The psi function (aka polygamma function).
1452 * This is only a stub! */
1453 const numeric psi(const numeric &x)
1459 /** The psi functions (aka polygamma functions).
1460 * This is only a stub! */
1461 const numeric psi(const numeric &n, const numeric &x)
1467 /** Factorial combinatorial function.
1469 * @param n integer argument >= 0
1470 * @exception range_error (argument must be integer >= 0) */
1471 const numeric factorial(const numeric &n)
1473 if (!n.is_nonneg_integer())
1474 throw std::range_error("numeric::factorial(): argument must be integer >= 0");
1475 return numeric(cln::factorial(n.to_int()));
1479 /** The double factorial combinatorial function. (Scarcely used, but still
1480 * useful in cases, like for exact results of tgamma(n+1/2) for instance.)
1482 * @param n integer argument >= -1
1483 * @return n!! == n * (n-2) * (n-4) * ... * ({1|2}) with 0!! == (-1)!! == 1
1484 * @exception range_error (argument must be integer >= -1) */
1485 const numeric doublefactorial(const numeric &n)
1487 if (n.is_equal(_num_1()))
1490 if (!n.is_nonneg_integer())
1491 throw std::range_error("numeric::doublefactorial(): argument must be integer >= -1");
1493 return numeric(cln::doublefactorial(n.to_int()));
1497 /** The Binomial coefficients. It computes the binomial coefficients. For
1498 * integer n and k and positive n this is the number of ways of choosing k
1499 * objects from n distinct objects. If n is negative, the formula
1500 * binomial(n,k) == (-1)^k*binomial(k-n-1,k) is used to compute the result. */
1501 const numeric binomial(const numeric &n, const numeric &k)
1503 if (n.is_integer() && k.is_integer()) {
1504 if (n.is_nonneg_integer()) {
1505 if (k.compare(n)!=1 && k.compare(_num0())!=-1)
1506 return numeric(cln::binomial(n.to_int(),k.to_int()));
1510 return _num_1().power(k)*binomial(k-n-_num1(),k);
1514 // should really be gamma(n+1)/gamma(r+1)/gamma(n-r+1) or a suitable limit
1515 throw std::range_error("numeric::binomial(): don´t know how to evaluate that.");
1519 /** Bernoulli number. The nth Bernoulli number is the coefficient of x^n/n!
1520 * in the expansion of the function x/(e^x-1).
1522 * @return the nth Bernoulli number (a rational number).
1523 * @exception range_error (argument must be integer >= 0) */
1524 const numeric bernoulli(const numeric &nn)
1526 if (!nn.is_integer() || nn.is_negative())
1527 throw std::range_error("numeric::bernoulli(): argument must be integer >= 0");
1531 // The Bernoulli numbers are rational numbers that may be computed using
1534 // B_n = - 1/(n+1) * sum_{k=0}^{n-1}(binomial(n+1,k)*B_k)
1536 // with B(0) = 1. Since the n'th Bernoulli number depends on all the
1537 // previous ones, the computation is necessarily very expensive. There are
1538 // several other ways of computing them, a particularly good one being
1542 // for (unsigned i=0; i<n; i++) {
1543 // c = exquo(c*(i-n),(i+2));
1544 // Bern = Bern + c*s/(i+2);
1545 // s = s + expt_pos(cl_I(i+2),n);
1549 // But if somebody works with the n'th Bernoulli number she is likely to
1550 // also need all previous Bernoulli numbers. So we need a complete remember
1551 // table and above divide and conquer algorithm is not suited to build one
1552 // up. The code below is adapted from Pari's function bernvec().
1554 // (There is an interesting relation with the tangent polynomials described
1555 // in `Concrete Mathematics', which leads to a program twice as fast as our
1556 // implementation below, but it requires storing one such polynomial in
1557 // addition to the remember table. This doubles the memory footprint so
1558 // we don't use it.)
1560 // the special cases not covered by the algorithm below
1561 if (nn.is_equal(_num1()))
1566 // store nonvanishing Bernoulli numbers here
1567 static std::vector< cln::cl_RA > results;
1568 static int highest_result = 0;
1569 // algorithm not applicable to B(0), so just store it
1570 if (results.empty())
1571 results.push_back(cln::cl_RA(1));
1573 int n = nn.to_long();
1574 for (int i=highest_result; i<n/2; ++i) {
1580 for (int j=i; j>0; --j) {
1581 B = cln::cl_I(n*m) * (B+results[j]) / (d1*d2);
1587 B = (1 - ((B+1)/(2*i+3))) / (cln::cl_I(1)<<(2*i+2));
1588 results.push_back(B);
1591 return results[n/2];
1595 /** Fibonacci number. The nth Fibonacci number F(n) is defined by the
1596 * recurrence formula F(n)==F(n-1)+F(n-2) with F(0)==0 and F(1)==1.
1598 * @param n an integer
1599 * @return the nth Fibonacci number F(n) (an integer number)
1600 * @exception range_error (argument must be an integer) */
1601 const numeric fibonacci(const numeric &n)
1603 if (!n.is_integer())
1604 throw std::range_error("numeric::fibonacci(): argument must be integer");
1607 // The following addition formula holds:
1609 // F(n+m) = F(m-1)*F(n) + F(m)*F(n+1) for m >= 1, n >= 0.
1611 // (Proof: For fixed m, the LHS and the RHS satisfy the same recurrence
1612 // w.r.t. n, and the initial values (n=0, n=1) agree. Hence all values
1614 // Replace m by m+1:
1615 // F(n+m+1) = F(m)*F(n) + F(m+1)*F(n+1) for m >= 0, n >= 0
1616 // Now put in m = n, to get
1617 // F(2n) = (F(n+1)-F(n))*F(n) + F(n)*F(n+1) = F(n)*(2*F(n+1) - F(n))
1618 // F(2n+1) = F(n)^2 + F(n+1)^2
1620 // F(2n+2) = F(n+1)*(2*F(n) + F(n+1))
1623 if (n.is_negative())
1625 return -fibonacci(-n);
1627 return fibonacci(-n);
1631 cln::cl_I m = cln::the<cln::cl_I>(n.to_cl_N()) >> 1L; // floor(n/2);
1632 for (uintL bit=cln::integer_length(m); bit>0; --bit) {
1633 // Since a squaring is cheaper than a multiplication, better use
1634 // three squarings instead of one multiplication and two squarings.
1635 cln::cl_I u2 = cln::square(u);
1636 cln::cl_I v2 = cln::square(v);
1637 if (cln::logbitp(bit-1, m)) {
1638 v = cln::square(u + v) - u2;
1641 u = v2 - cln::square(v - u);
1646 // Here we don't use the squaring formula because one multiplication
1647 // is cheaper than two squarings.
1648 return u * ((v << 1) - u);
1650 return cln::square(u) + cln::square(v);
1654 /** Absolute value. */
1655 const numeric abs(const numeric& x)
1657 return cln::abs(x.to_cl_N());
1661 /** Modulus (in positive representation).
1662 * In general, mod(a,b) has the sign of b or is zero, and rem(a,b) has the
1663 * sign of a or is zero. This is different from Maple's modp, where the sign
1664 * of b is ignored. It is in agreement with Mathematica's Mod.
1666 * @return a mod b in the range [0,abs(b)-1] with sign of b if both are
1667 * integer, 0 otherwise. */
1668 const numeric mod(const numeric &a, const numeric &b)
1670 if (a.is_integer() && b.is_integer())
1671 return cln::mod(cln::the<cln::cl_I>(a.to_cl_N()),
1672 cln::the<cln::cl_I>(b.to_cl_N()));
1678 /** Modulus (in symmetric representation).
1679 * Equivalent to Maple's mods.
1681 * @return a mod b in the range [-iquo(abs(m)-1,2), iquo(abs(m),2)]. */
1682 const numeric smod(const numeric &a, const numeric &b)
1684 if (a.is_integer() && b.is_integer()) {
1685 const cln::cl_I b2 = cln::ceiling1(cln::the<cln::cl_I>(b.to_cl_N()) >> 1) - 1;
1686 return cln::mod(cln::the<cln::cl_I>(a.to_cl_N()) + b2,
1687 cln::the<cln::cl_I>(b.to_cl_N())) - b2;
1693 /** Numeric integer remainder.
1694 * Equivalent to Maple's irem(a,b) as far as sign conventions are concerned.
1695 * In general, mod(a,b) has the sign of b or is zero, and irem(a,b) has the
1696 * sign of a or is zero.
1698 * @return remainder of a/b if both are integer, 0 otherwise. */
1699 const numeric irem(const numeric &a, const numeric &b)
1701 if (a.is_integer() && b.is_integer())
1702 return cln::rem(cln::the<cln::cl_I>(a.to_cl_N()),
1703 cln::the<cln::cl_I>(b.to_cl_N()));
1709 /** Numeric integer remainder.
1710 * Equivalent to Maple's irem(a,b,'q') it obeyes the relation
1711 * irem(a,b,q) == a - q*b. In general, mod(a,b) has the sign of b or is zero,
1712 * and irem(a,b) has the sign of a or is zero.
1714 * @return remainder of a/b and quotient stored in q if both are integer,
1716 const numeric irem(const numeric &a, const numeric &b, numeric &q)
1718 if (a.is_integer() && b.is_integer()) {
1719 const cln::cl_I_div_t rem_quo = cln::truncate2(cln::the<cln::cl_I>(a.to_cl_N()),
1720 cln::the<cln::cl_I>(b.to_cl_N()));
1721 q = rem_quo.quotient;
1722 return rem_quo.remainder;
1730 /** Numeric integer quotient.
1731 * Equivalent to Maple's iquo as far as sign conventions are concerned.
1733 * @return truncated quotient of a/b if both are integer, 0 otherwise. */
1734 const numeric iquo(const numeric &a, const numeric &b)
1736 if (a.is_integer() && b.is_integer())
1737 return cln::truncate1(cln::the<cln::cl_I>(a.to_cl_N()),
1738 cln::the<cln::cl_I>(b.to_cl_N()));
1744 /** Numeric integer quotient.
1745 * Equivalent to Maple's iquo(a,b,'r') it obeyes the relation
1746 * r == a - iquo(a,b,r)*b.
1748 * @return truncated quotient of a/b and remainder stored in r if both are
1749 * integer, 0 otherwise. */
1750 const numeric iquo(const numeric &a, const numeric &b, numeric &r)
1752 if (a.is_integer() && b.is_integer()) {
1753 const cln::cl_I_div_t rem_quo = cln::truncate2(cln::the<cln::cl_I>(a.to_cl_N()),
1754 cln::the<cln::cl_I>(b.to_cl_N()));
1755 r = rem_quo.remainder;
1756 return rem_quo.quotient;
1764 /** Greatest Common Divisor.
1766 * @return The GCD of two numbers if both are integer, a numerical 1
1767 * if they are not. */
1768 const numeric gcd(const numeric &a, const numeric &b)
1770 if (a.is_integer() && b.is_integer())
1771 return cln::gcd(cln::the<cln::cl_I>(a.to_cl_N()),
1772 cln::the<cln::cl_I>(b.to_cl_N()));
1778 /** Least Common Multiple.
1780 * @return The LCM of two numbers if both are integer, the product of those
1781 * two numbers if they are not. */
1782 const numeric lcm(const numeric &a, const numeric &b)
1784 if (a.is_integer() && b.is_integer())
1785 return cln::lcm(cln::the<cln::cl_I>(a.to_cl_N()),
1786 cln::the<cln::cl_I>(b.to_cl_N()));
1792 /** Numeric square root.
1793 * If possible, sqrt(z) should respect squares of exact numbers, i.e. sqrt(4)
1794 * should return integer 2.
1796 * @param z numeric argument
1797 * @return square root of z. Branch cut along negative real axis, the negative
1798 * real axis itself where imag(z)==0 and real(z)<0 belongs to the upper part
1799 * where imag(z)>0. */
1800 const numeric sqrt(const numeric &z)
1802 return cln::sqrt(z.to_cl_N());
1806 /** Integer numeric square root. */
1807 const numeric isqrt(const numeric &x)
1809 if (x.is_integer()) {
1811 cln::isqrt(cln::the<cln::cl_I>(x.to_cl_N()), &root);
1818 /** Floating point evaluation of Archimedes' constant Pi. */
1821 return numeric(cln::pi(cln::default_float_format));
1825 /** Floating point evaluation of Euler's constant gamma. */
1828 return numeric(cln::eulerconst(cln::default_float_format));
1832 /** Floating point evaluation of Catalan's constant. */
1833 ex CatalanEvalf(void)
1835 return numeric(cln::catalanconst(cln::default_float_format));
1839 /** _numeric_digits default ctor, checking for singleton invariance. */
1840 _numeric_digits::_numeric_digits()
1843 // It initializes to 17 digits, because in CLN float_format(17) turns out
1844 // to be 61 (<64) while float_format(18)=65. The reason is we want to
1845 // have a cl_LF instead of cl_SF, cl_FF or cl_DF.
1847 throw(std::runtime_error("I told you not to do instantiate me!"));
1849 cln::default_float_format = cln::float_format(17);
1853 /** Assign a native long to global Digits object. */
1854 _numeric_digits& _numeric_digits::operator=(long prec)
1857 cln::default_float_format = cln::float_format(prec);
1862 /** Convert global Digits object to native type long. */
1863 _numeric_digits::operator long()
1865 // BTW, this is approx. unsigned(cln::default_float_format*0.301)-1
1866 return (long)digits;
1870 /** Append global Digits object to ostream. */
1871 void _numeric_digits::print(std::ostream &os) const
1873 debugmsg("_numeric_digits print", LOGLEVEL_PRINT);
1878 std::ostream& operator<<(std::ostream &os, const _numeric_digits &e)
1885 // static member variables
1890 bool _numeric_digits::too_late = false;
1893 /** Accuracy in decimal digits. Only object of this type! Can be set using
1894 * assignment from C++ unsigned ints and evaluated like any built-in type. */
1895 _numeric_digits Digits;
1897 } // namespace GiNaC