* Some internal reorganization WRT flyweight handling and initialization,

[ginac.git] / ginac / numeric.cpp

diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp
index 9d5f7f012aef95b8375fa7350f2356010a6174e7..b1a4033cd73fe5c57f51dd0cb858bc843b8d2fcc 100644 (file)
--- a/ginac/numeric.cpp
+++ b/ginac/numeric.cpp
@@ -390,7 +390,7 @@ void numeric::print(const print_context & c, unsigned level) const
                std::ios::fmtflags oldflags = c.s.flags();
                c.s.setf(std::ios::scientific);
                if (this->is_rational() && !this->is_integer()) {
-                       if (compare(_num0()) > 0) {
+                       if (compare(_num0) > 0) {
                                c.s << "(";
                                if (is_a<print_csrc_cl_N>(c))
                                        c.s << "cln::cl_F(\"" << numer().evalf() << "\")";
@@ -626,10 +626,9 @@ unsigned numeric::calchash(void) const
 const numeric numeric::add(const numeric &other) const
 {
        // Efficiency shortcut: trap the neutral element by pointer.
-       static const numeric * _num0p = &_num0();
-       if (this==_num0p)
+       if (this==_num0_p)
                return other;
-       else if (&other==_num0p)
+       else if (&other==_num0_p)
                return *this;
        
        return numeric(cln::the<cln::cl_N>(value)+cln::the<cln::cl_N>(other.value));
@@ -649,10 +648,9 @@ const numeric numeric::sub(const numeric &other) const
 const numeric numeric::mul(const numeric &other) const
 {
        // Efficiency shortcut: trap the neutral element by pointer.
-       static const numeric * _num1p = &_num1();
-       if (this==_num1p)
+       if (this==_num1_p)
                return other;
-       else if (&other==_num1p)
+       else if (&other==_num1_p)
                return *this;
        
        return numeric(cln::the<cln::cl_N>(value)*cln::the<cln::cl_N>(other.value));
@@ -676,8 +674,7 @@ const numeric numeric::div(const numeric &other) const
 const numeric numeric::power(const numeric &other) const
 {
        // Efficiency shortcut: trap the neutral exponent by pointer.
-       static const numeric * _num1p = &_num1();
-       if (&other==_num1p)
+       if (&other==_num1_p)
                return *this;
        
        if (cln::zerop(cln::the<cln::cl_N>(value))) {
@@ -688,7 +685,7 @@ const numeric numeric::power(const numeric &other) const
                else if (cln::minusp(cln::realpart(cln::the<cln::cl_N>(other.value))))
                        throw std::overflow_error("numeric::eval(): division by zero");
                else
-                       return _num0();
+                       return _num0;
        }
        return numeric(cln::expt(cln::the<cln::cl_N>(value),cln::the<cln::cl_N>(other.value)));
 }
@@ -697,10 +694,9 @@ const numeric numeric::power(const numeric &other) const
 const numeric &numeric::add_dyn(const numeric &other) const
 {
        // Efficiency shortcut: trap the neutral element by pointer.
-       static const numeric * _num0p = &_num0();
-       if (this==_num0p)
+       if (this==_num0_p)
                return other;
-       else if (&other==_num0p)
+       else if (&other==_num0_p)
                return *this;
        
        return static_cast<const numeric &>((new numeric(cln::the<cln::cl_N>(value)+cln::the<cln::cl_N>(other.value)))->
@@ -718,10 +714,9 @@ const numeric &numeric::sub_dyn(const numeric &other) const
 const numeric &numeric::mul_dyn(const numeric &other) const
 {
        // Efficiency shortcut: trap the neutral element by pointer.
-       static const numeric * _num1p = &_num1();
-       if (this==_num1p)
+       if (this==_num1_p)
                return other;
-       else if (&other==_num1p)
+       else if (&other==_num1_p)
                return *this;
        
        return static_cast<const numeric &>((new numeric(cln::the<cln::cl_N>(value)*cln::the<cln::cl_N>(other.value)))->
@@ -741,8 +736,7 @@ const numeric &numeric::div_dyn(const numeric &other) const
 const numeric &numeric::power_dyn(const numeric &other) const
 {
        // Efficiency shortcut: trap the neutral exponent by pointer.
-       static const numeric * _num1p=&_num1();
-       if (&other==_num1p)
+       if (&other==_num1_p)
                return *this;
        
        if (cln::zerop(cln::the<cln::cl_N>(value))) {
@@ -753,7 +747,7 @@ const numeric &numeric::power_dyn(const numeric &other) const
                else if (cln::minusp(cln::realpart(cln::the<cln::cl_N>(other.value))))
                        throw std::overflow_error("numeric::eval(): division by zero");
                else
-                       return _num0();
+                       return _num0;
        }
        return static_cast<const numeric &>((new numeric(cln::expt(cln::the<cln::cl_N>(value),cln::the<cln::cl_N>(other.value))))->
                                             setflag(status_flags::dynallocated));
@@ -1120,7 +1114,7 @@ const numeric numeric::numer(void) const
 const numeric numeric::denom(void) const
 {
        if (this->is_integer())
-               return _num1();
+               return _num1;
        
        if (cln::instanceof(value, cln::cl_RA_ring))
                return numeric(cln::denominator(cln::the<cln::cl_RA>(value)));
@@ -1129,7 +1123,7 @@ const numeric numeric::denom(void) const
                const cln::cl_RA r = cln::the<cln::cl_RA>(cln::realpart(cln::the<cln::cl_N>(value)));
                const cln::cl_RA i = cln::the<cln::cl_RA>(cln::imagpart(cln::the<cln::cl_N>(value)));
                if (cln::instanceof(r, cln::cl_I_ring) && cln::instanceof(i, cln::cl_I_ring))
-                       return _num1();
+                       return _num1;
                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))
@@ -1138,7 +1132,7 @@ const numeric numeric::denom(void) const
                        return numeric(cln::lcm(cln::denominator(r), cln::denominator(i)));
        }
        // at least one float encountered
-       return _num1();
+       return _num1;
 }
 
 
@@ -1242,7 +1236,7 @@ const numeric atan(const numeric &x)
 {
        if (!x.is_real() &&
            x.real().is_zero() &&
-           abs(x.imag()).is_equal(_num1()))
+           abs(x.imag()).is_equal(_num1))
                throw pole_error("atan(): logarithmic pole",0);
        return cln::atan(x.to_cl_N());
 }
@@ -1393,7 +1387,7 @@ static cln::cl_N Li2_projection(const cln::cl_N &x,
 const numeric Li2(const numeric &x)
 {
        if (x.is_zero())
-               return _num0();
+               return _num0;
        
        // what is the desired float format?
        // first guess: default format
@@ -1484,8 +1478,8 @@ const numeric factorial(const numeric &n)
  *  @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))
+               return _num1;
        
        if (!n.is_nonneg_integer())
                throw std::range_error("numeric::doublefactorial(): argument must be integer >= -1");
@@ -1502,12 +1496,12 @@ const numeric binomial(const numeric &n, const numeric &k)
 {
        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)!=-1)
                                return numeric(cln::binomial(n.to_int(),k.to_int()));
                        else
-                               return _num0();
+                               return _num0;
                } else {
-                       return _num_1().power(k)*binomial(k-n-_num1(),k);
+                       return _num_1.power(k)*binomial(k-n-_num1,k);
                }
        }
        
@@ -1558,10 +1552,10 @@ const numeric bernoulli(const numeric &nn)
        // we don't use it.)
        
        // the special cases not covered by the algorithm below
-       if (nn.is_equal(_num1()))
-               return _num_1_2();
+       if (nn.is_equal(_num1))
+               return _num_1_2;
        if (nn.is_odd())
-               return _num0();
+               return _num0;
        
        // store nonvanishing Bernoulli numbers here
        static std::vector< cln::cl_RA > results;
@@ -1619,7 +1613,7 @@ const numeric fibonacci(const numeric &n)
        // hence
        //      F(2n+2) = F(n+1)*(2*F(n) + F(n+1))
        if (n.is_zero())
-               return _num0();
+               return _num0;
        if (n.is_negative())
                if (n.is_even())
                        return -fibonacci(-n);
@@ -1671,7 +1665,7 @@ const numeric mod(const numeric &a, const numeric &b)
                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;
 }
 
 
@@ -1686,7 +1680,7 @@ const numeric smod(const numeric &a, const numeric &b)
                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;
 }
 
 
@@ -1702,7 +1696,7 @@ const numeric irem(const numeric &a, const numeric &b)
                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;
 }
 
 
@@ -1721,8 +1715,8 @@ const numeric irem(const numeric &a, const numeric &b, numeric &q)
                q = rem_quo.quotient;
                return rem_quo.remainder;
        } else {
-               q = _num0();
-               return _num0();
+               q = _num0;
+               return _num0;
        }
 }
 
@@ -1737,7 +1731,7 @@ const numeric iquo(const numeric &a, const numeric &b)
                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;
 }
 
 
@@ -1755,8 +1749,8 @@ const numeric iquo(const numeric &a, const numeric &b, numeric &r)
                r = rem_quo.remainder;
                return rem_quo.quotient;
        } else {
-               r = _num0();
-               return _num0();
+               r = _num0;
+               return _num0;
        }
 }
 
@@ -1771,7 +1765,7 @@ const numeric gcd(const numeric &a, const numeric &b)
                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;
 }
 
 
@@ -1811,7 +1805,7 @@ const numeric isqrt(const numeric &x)
                cln::isqrt(cln::the<cln::cl_I>(x.to_cl_N()), &root);
                return root;
        } else
-               return _num0();
+               return _num0;
 }