- raised coefficient bit-length limit in heur_gcd() (CLN is good with large

[ginac.git] / ginac / numeric.cpp

diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp
index 8c80e9417800f671db988a6789d8f6db15997c52..c0649f6f70b550987df6177efcea50f44b0e8f9d 100644 (file)
--- a/ginac/numeric.cpp
+++ b/ginac/numeric.cpp
@@ -410,7 +410,7 @@ void numeric::print(ostream & os, unsigned upper_precedence) const
     debugmsg("numeric print", LOGLEVEL_PRINT);
     if (this->is_real()) {
         // case 1, real:  x  or  -x
-        if ((precedence<=upper_precedence) && (!this->is_pos_integer())) {
+        if ((precedence<=upper_precedence) && (!this->is_nonneg_integer())) {
             os << "(";
             print_real_number(os, The(cl_R)(*value));
             os << ")";
@@ -1382,11 +1382,11 @@ const numeric zeta(const numeric & x)
 }
 
 
-/** The gamma function.
+/** The Gamma function.
  *  This is only a stub! */
-const numeric gamma(const numeric & x)
+const numeric Gamma(const numeric & x)
 {
-    clog << "gamma(" << x
+    clog << "Gamma(" << x
          << "): Does anybody know good way to calculate this numerically?"
          << endl;
     return numeric(0);
@@ -1732,7 +1732,7 @@ ex PiEvalf(void)
 
 
 /** Floating point evaluation of Euler's constant Gamma. */
-ex EulerGammaEvalf(void)
+ex gammaEvalf(void)
 { 
     return numeric(::cl_eulerconst(cl_default_float_format));  // -> CLN
 }