bigdecimal 3.2.2 → 3.2.3

data/ext/bigdecimal/bigdecimal.h

@@ -17,7 +17,7 @@
 # include <float.h>
 #endif
 
-#ifdef HAVE_INT64_T
+#if defined(HAVE_INT64_T) && !defined(BIGDECIMAL_USE_DECDIG_UINT16_T)
 # define DECDIG uint32_t
 # define DECDIG_DBL uint64_t
 # define DECDIG_DBL_SIGNED int64_t
@@ -167,7 +167,6 @@ enum rbd_rounding_mode {
  *  r = 0.xxxxxxxxx *BASE**exponent
  */
 typedef struct {
-    VALUE  obj;     /* Back pointer(VALUE) for Ruby object.     */
     size_t MaxPrec; /* Maximum precision size                   */
                     /* This is the actual size of frac[]        */
                     /*(frac[0] to frac[MaxPrec] are available). */
@@ -195,13 +194,7 @@ typedef struct {
  *  ------------------
  */
 
-VP_EXPORT Real *VpNewRbClass(size_t mx, char const *str, VALUE klass, bool strict_p, bool raise_exception);
-
-VP_EXPORT Real *VpCreateRbObject(size_t mx, const char *str, bool raise_exception);
-
 #define VpBaseFig() BIGDECIMAL_COMPONENT_FIGURES
-#define VpDblFig() BIGDECIMAL_DOUBLE_FIGURES
-#define VpBaseVal() BIGDECIMAL_BASE
 
 /* Zero,Inf,NaN (isinf(),isnan() used to check) */
 VP_EXPORT double VpGetDoubleNaN(void);
@@ -211,7 +204,7 @@ VP_EXPORT double VpGetDoubleNegZero(void);
 
 /* These 2 functions added at v1.1.7 */
 VP_EXPORT size_t VpGetPrecLimit(void);
-VP_EXPORT size_t VpSetPrecLimit(size_t n);
+VP_EXPORT void VpSetPrecLimit(size_t n);
 
 /* Round mode */
 VP_EXPORT int            VpIsRoundMode(unsigned short n);
@@ -219,16 +212,14 @@ VP_EXPORT unsigned short VpGetRoundMode(void);
 VP_EXPORT unsigned short VpSetRoundMode(unsigned short n);
 
 VP_EXPORT int VpException(unsigned short f,const char *str,int always);
-#if 0  /* unused */
-VP_EXPORT int VpIsNegDoubleZero(double v);
-#endif
 VP_EXPORT size_t VpNumOfChars(Real *vp,const char *pszFmt);
 VP_EXPORT size_t VpInit(DECDIG BaseVal);
-VP_EXPORT Real *VpAlloc(size_t mx, const char *szVal, int strict_p, int exc);
+VP_EXPORT Real *VpAlloc(const char *szVal, int strict_p, int exc);
 VP_EXPORT size_t VpAsgn(Real *c, Real *a, int isw);
 VP_EXPORT size_t VpAddSub(Real *c,Real *a,Real *b,int operation);
 VP_EXPORT size_t VpMult(Real *c,Real *a,Real *b);
 VP_EXPORT size_t VpDivd(Real *c,Real *r,Real *a,Real *b);
+VP_EXPORT int VpNmlz(Real *a);
 VP_EXPORT int VpComp(Real *a,Real *b);
 VP_EXPORT ssize_t VpExponent10(Real *a);
 VP_EXPORT void VpSzMantissa(Real *a, char *buf, size_t bufsize);
@@ -237,17 +228,10 @@ VP_EXPORT void VpToString(Real *a, char *buf, size_t bufsize, size_t fFmt, int f
 VP_EXPORT void VpToFString(Real *a, char *buf, size_t bufsize, size_t fFmt, int fPlus);
 VP_EXPORT int VpCtoV(Real *a, const char *int_chr, size_t ni, const char *frac, size_t nf, const char *exp_chr, size_t ne);
 VP_EXPORT int VpVtoD(double *d, SIGNED_VALUE *e, Real *m);
-VP_EXPORT void VpDtoV(Real *m,double d);
-#if 0  /* unused */
-VP_EXPORT void VpItoV(Real *m,S_INT ival);
-#endif
-VP_EXPORT int VpSqrt(Real *y,Real *x);
 VP_EXPORT int VpActiveRound(Real *y, Real *x, unsigned short f, ssize_t il);
 VP_EXPORT int VpMidRound(Real *y, unsigned short f, ssize_t nf);
 VP_EXPORT int VpLeftRound(Real *y, unsigned short f, ssize_t nf);
 VP_EXPORT void VpFrac(Real *y, Real *x);
-VP_EXPORT int VpPowerByInt(Real *y, Real *x, SIGNED_VALUE n);
-#define VpPower VpPowerByInt
 
 /* VP constants */
 VP_EXPORT Real *VpOne(void);
@@ -261,10 +245,6 @@ VP_EXPORT Real *VpOne(void);
 #define Max(a, b)  (((a)>(b))?(a):(b))
 #define Min(a, b)  (((a)>(b))?(b):(a))
 
-#define VpMaxPrec(a)   ((a)->MaxPrec)
-#define VpPrec(a)      ((a)->Prec)
-#define VpGetFlag(a)   ((a)->flag)
-
 /* Sign */
 
 /* VpGetSign(a) returns 1,-1 if a>0,a<0 respectively */
@@ -299,7 +279,6 @@ VP_EXPORT Real *VpOne(void);
 #define VpSetInf(a,s)   (void)(((s)>0)?VpSetPosInf(a):VpSetNegInf(a))
 #define VpHasVal(a)     (a->frac[0])
 #define VpIsOne(a)      ((a->Prec==1)&&(a->frac[0]==1)&&(a->exponent==1))
-#define VpExponent(a)   (a->exponent)
 #ifdef BIGDECIMAL_DEBUG
 int VpVarCheck(Real * v);
 #endif /* BIGDECIMAL_DEBUG */

data/ext/bigdecimal/bits.h

@@ -26,6 +26,9 @@
       ((b) > 0 ? (max) / (a) < (b) : (min) / (a) > (b)) : \
       ((b) > 0 ? (min) / (a) < (b) : (max) / (a) > (b)))
 
+#define ADD_OVERFLOW_SIGNED_INTEGER_P(a, b, min, max) ( \
+    ((a) > 0) == ((b) > 0) && ((a) > 0 ? (max) - (a) < (b) : (min) - (a) > (b)))
+
 #ifdef HAVE_UINT128_T
 # define bit_length(x) \
     (unsigned int) \

data/ext/bigdecimal/extconf.rb

@@ -36,17 +36,10 @@ if have_header("intrin.h")
   have_func("_BitScanReverse64", "intrin.h")
 end
 
-have_func("labs", "stdlib.h")
-have_func("llabs", "stdlib.h")
-have_func("finite", "math.h")
-have_func("isfinite", "math.h")
-
 have_header("ruby/atomic.h")
 have_header("ruby/internal/has/builtin.h")
 have_header("ruby/internal/static_assert.h")
 
-have_func("rb_rational_num", "ruby.h")
-have_func("rb_rational_den", "ruby.h")
 have_func("rb_complex_real", "ruby.h")
 have_func("rb_complex_imag", "ruby.h")
 have_func("rb_opts_exception_p", "ruby.h")
@@ -59,6 +52,9 @@ else
   bigdecimal_rb = "$(srcdir)/../../lib/bigdecimal.rb"
 end
 
+$defs.push '-DBIGDECIMAL_USE_DECDIG_UINT16_T' if ENV['BIGDECIMAL_USE_DECDIG_UINT16_T'] == 'true'
+$defs.push '-DBIGDECIMAL_USE_VP_TEST_METHODS' if ENV['BIGDECIMAL_USE_VP_TEST_METHODS'] == 'true'
+
 create_makefile('bigdecimal') {|mf|
   mf << "BIGDECIMAL_RB = #{bigdecimal_rb}\n"
 }

data/ext/bigdecimal/missing.h

@@ -8,14 +8,6 @@ extern "C" {
 #endif
 #endif
 
-#ifdef HAVE_STDLIB_H
-# include <stdlib.h>
-#endif
-
-#ifdef HAVE_MATH_H
-# include <math.h>
-#endif
-
 #ifndef RB_UNUSED_VAR
 # if defined(_MSC_VER) && _MSC_VER >= 1911
 #  define RB_UNUSED_VAR(x) x [[maybe_unused]]
@@ -55,97 +47,13 @@ extern "C" {
 
 /* bool */
 
-#if defined(__bool_true_false_are_defined)
-# /* Take that. */
-
-#elif defined(HAVE_STDBOOL_H)
+#ifndef __bool_true_false_are_defined
 # include <stdbool.h>
-
-#else
-typedef unsigned char _Bool;
-# define bool _Bool
-# define true  ((_Bool)+1)
-# define false ((_Bool)-1)
-# define __bool_true_false_are_defined
-#endif
-
-/* abs */
-
-#ifndef HAVE_LABS
-static inline long
-labs(long const x)
-{
-    if (x < 0) return -x;
-    return x;
-}
-#endif
-
-#ifndef HAVE_LLABS
-static inline LONG_LONG
-llabs(LONG_LONG const x)
-{
-    if (x < 0) return -x;
-    return x;
-}
-#endif
-
-#ifdef vabs
-# undef vabs
-#endif
-#if SIZEOF_VALUE <= SIZEOF_INT
-# define vabs abs
-#elif SIZEOF_VALUE <= SIZEOF_LONG
-# define vabs labs
-#elif SIZEOF_VALUE <= SIZEOF_LONG_LONG
-# define vabs llabs
-#endif
-
-/* finite */
-
-#ifndef HAVE_FINITE
-static int
-finite(double)
-{
-    return !isnan(n) && !isinf(n);
-}
-#endif
-
-#ifndef isfinite
-# ifndef HAVE_ISFINITE
-#  define HAVE_ISFINITE 1
-#  define isfinite(x) finite(x)
-# endif
 #endif
 
 /* dtoa */
 char *BigDecimal_dtoa(double d_, int mode, int ndigits, int *decpt, int *sign, char **rve);
 
-/* rational */
-
-#ifndef HAVE_RB_RATIONAL_NUM
-static inline VALUE
-rb_rational_num(VALUE rat)
-{
-#ifdef RRATIONAL
-    return RRATIONAL(rat)->num;
-#else
-    return rb_funcall(rat, rb_intern("numerator"), 0);
-#endif
-}
-#endif
-
-#ifndef HAVE_RB_RATIONAL_DEN
-static inline VALUE
-rb_rational_den(VALUE rat)
-{
-#ifdef RRATIONAL
-    return RRATIONAL(rat)->den;
-#else
-    return rb_funcall(rat, rb_intern("denominator"), 0);
-#endif
-}
-#endif
-
 /* complex */
 
 #ifndef HAVE_RB_COMPLEX_REAL

data/lib/bigdecimal/math.rb

@@ -61,7 +61,8 @@ module BigMath
     one  = BigDecimal("1")
     two  = BigDecimal("2")
     x = -x if neg = x < 0
-    if x > (twopi = two * BigMath.PI(prec))
+    if x > 6
+      twopi = two * BigMath.PI(prec + x.exponent)
       if x > 30
         x %= twopi
       else
@@ -84,6 +85,7 @@ module BigMath
       d   = sign * x1.div(z,m)
       y  += d
     end
+    y = BigDecimal("1") if y > 1
     neg ? -y : y
   end
 
@@ -105,7 +107,8 @@ module BigMath
     one  = BigDecimal("1")
     two  = BigDecimal("2")
     x = -x if x < 0
-    if x > (twopi = two * BigMath.PI(prec))
+    if x > 6
+      twopi = two * BigMath.PI(prec + x.exponent)
       if x > 30
         x %= twopi
       else
@@ -128,7 +131,7 @@ module BigMath
       d   = sign * x1.div(z,m)
       y  += d
     end
-    y
+    y < -1 ? BigDecimal("-1") : y > 1 ? BigDecimal("1") : y
   end
 
   # call-seq:
@@ -149,9 +152,9 @@ module BigMath
     x = -x if neg = x < 0
     return pi.div(neg ? -2 : 2, prec) if x.infinite?
     return pi / (neg ? -4 : 4) if x.round(prec) == 1
-    x = BigDecimal("1").div(x, prec) if inv = x > 1
-    x = (-1 + sqrt(1 + x**2, prec))/x if dbl = x > 0.5
-    n    = prec + BigDecimal.double_fig
+    n = prec + BigDecimal.double_fig
+    x = BigDecimal("1").div(x, n) if inv = x > 1
+    x = (-1 + sqrt(1 + x.mult(x, n), n)).div(x, n) if dbl = x > 0.5
     y = x
     d = y
     t = x

data/lib/bigdecimal.rb

@@ -1,5 +1,329 @@
 if RUBY_ENGINE == 'jruby'
   JRuby::Util.load_ext("org.jruby.ext.bigdecimal.BigDecimalLibrary")
+  return
 else
   require 'bigdecimal.so'
 end
+
+class BigDecimal
+  module Internal # :nodoc:
+
+    # Coerce x to BigDecimal with the specified precision.
+    # TODO: some methods (example: BigMath.exp) require more precision than specified to coerce.
+    def self.coerce_to_bigdecimal(x, prec, method_name) # :nodoc:
+      case x
+      when BigDecimal
+        return x
+      when Integer, Float
+        return BigDecimal(x)
+      when Rational
+        return BigDecimal(x, [prec, 2 * BigDecimal.double_fig].max)
+      end
+      raise ArgumentError, "#{x.inspect} can't be coerced into BigDecimal"
+    end
+
+    def self.validate_prec(prec, method_name, accept_zero: false) # :nodoc:
+      raise ArgumentError, 'precision must be an Integer' unless Integer === prec
+      if accept_zero
+        raise ArgumentError, "Negative precision for #{method_name}" if prec < 0
+      else
+        raise ArgumentError, "Zero or negative precision for #{method_name}" if prec <= 0
+      end
+    end
+
+    def self.infinity_computation_result # :nodoc:
+      if BigDecimal.mode(BigDecimal::EXCEPTION_ALL).anybits?(BigDecimal::EXCEPTION_INFINITY)
+        raise FloatDomainError, "Computation results in 'Infinity'"
+      end
+      BigDecimal::INFINITY
+    end
+
+    def self.nan_computation_result # :nodoc:
+      if BigDecimal.mode(BigDecimal::EXCEPTION_ALL).anybits?(BigDecimal::EXCEPTION_NaN)
+        raise FloatDomainError, "Computation results to 'NaN'"
+      end
+      BigDecimal::NAN
+    end
+  end
+
+  #  call-seq:
+  #    self ** other -> bigdecimal
+  #
+  #  Returns the \BigDecimal value of +self+ raised to power +other+:
+  #
+  #    b = BigDecimal('3.14')
+  #    b ** 2              # => 0.98596e1
+  #    b ** 2.0            # => 0.98596e1
+  #    b ** Rational(2, 1) # => 0.98596e1
+  #
+  #  Related: BigDecimal#power.
+  #
+  def **(y)
+    case y
+    when BigDecimal, Integer, Float, Rational
+      power(y)
+    when nil
+      raise TypeError, 'wrong argument type NilClass'
+    else
+      x, y = y.coerce(self)
+      x**y
+    end
+  end
+
+  # call-seq:
+  #   power(n)
+  #   power(n, prec)
+  #
+  # Returns the value raised to the power of n.
+  #
+  # Also available as the operator **.
+  #
+  def power(y, prec = nil)
+    Internal.validate_prec(prec, :power) if prec
+    x = self
+    y = Internal.coerce_to_bigdecimal(y, prec || n_significant_digits, :power)
+
+    return Internal.nan_computation_result if x.nan? || y.nan?
+    return BigDecimal(1) if y.zero?
+
+    if y.infinite?
+      if x < 0
+        return BigDecimal(0) if x < -1 && y.negative?
+        return BigDecimal(0) if x > -1 && y.positive?
+        raise Math::DomainError, 'Result undefined for negative base raised to infinite power'
+      elsif x < 1
+        return y.positive? ? BigDecimal(0) : BigDecimal::Internal.infinity_computation_result
+      elsif x == 1
+        return BigDecimal(1)
+      else
+        return y.positive? ? BigDecimal::Internal.infinity_computation_result : BigDecimal(0)
+      end
+    end
+
+    if x.infinite? && y < 0
+      # Computation result will be +0 or -0. Avoid overflow.
+      neg = x < 0 && y.frac.zero? && y % 2 == 1
+      return neg ? -BigDecimal(0) : BigDecimal(0)
+    end
+
+    if x.zero?
+      return BigDecimal(1) if y.zero?
+      return BigDecimal(0) if y > 0
+      if y.frac.zero? && y % 2 == 1 && x.sign == -1
+        return -BigDecimal::Internal.infinity_computation_result
+      else
+        return BigDecimal::Internal.infinity_computation_result
+      end
+    elsif x < 0
+      if y.frac.zero?
+        if y % 2 == 0
+          return (-x).power(y, prec)
+        else
+          return -(-x).power(y, prec)
+        end
+      else
+        raise Math::DomainError, 'Computation results in complex number'
+      end
+    elsif x == 1
+      return BigDecimal(1)
+    end
+
+    prec ||= BigDecimal.limit.nonzero?
+    frac_part = y.frac
+
+    if frac_part.zero? && !prec
+      # Infinite precision calculation for `x ** int` and `x.power(int)`
+      int_part = y.fix.to_i
+      int_part = -int_part if (neg = int_part < 0)
+      ans = BigDecimal(1)
+      n = 1
+      xn = x
+      while true
+        ans *= xn if int_part.allbits?(n)
+        n <<= 1
+        break if n > int_part
+        xn *= xn
+        # Detect overflow/underflow before consuming infinite memory
+        if (xn.exponent.abs - 1) * int_part / n >= 0x7FFFFFFFFFFFFFFF
+          return ((xn.exponent > 0) ^ neg ? BigDecimal::Internal.infinity_computation_result : BigDecimal(0)) * (int_part.even? || x > 0 ? 1 : -1)
+        end
+      end
+      return neg ? BigDecimal(1) / ans : ans
+    end
+
+    prec ||= [x.n_significant_digits, y.n_significant_digits, BigDecimal.double_fig].max + BigDecimal.double_fig
+
+    if y < 0
+      inv = x.power(-y, prec)
+      return BigDecimal(0) if inv.infinite?
+      return BigDecimal::Internal.infinity_computation_result if inv.zero?
+      return BigDecimal(1).div(inv, prec)
+    end
+
+    int_part = y.fix.to_i
+    prec2 = prec + BigDecimal.double_fig
+    pow_prec = prec2 + (int_part > 0 ? y.exponent : 0)
+    ans = BigDecimal(1)
+    n = 1
+    xn = x
+    while true
+      ans = ans.mult(xn, pow_prec) if int_part.allbits?(n)
+      n <<= 1
+      break if n > int_part
+      xn = xn.mult(xn, pow_prec)
+    end
+    unless frac_part.zero?
+      ans = ans.mult(BigMath.exp(BigMath.log(x, prec2).mult(frac_part, prec2), prec2), prec2)
+    end
+    ans.mult(1, prec)
+  end
+
+  # Returns the square root of the value.
+  #
+  # Result has at least prec significant digits.
+  #
+  def sqrt(prec)
+    Internal.validate_prec(prec, :sqrt, accept_zero: true)
+    return Internal.infinity_computation_result if infinite? == 1
+
+    raise FloatDomainError, 'sqrt of negative value' if self < 0
+    raise FloatDomainError, "sqrt of 'NaN'(Not a Number)" if nan?
+    return self if zero?
+
+    limit = BigDecimal.limit.nonzero? if prec == 0
+
+    # BigDecimal#sqrt calculates at least n_significant_digits precision.
+    # This feature maybe problematic for some cases.
+    n_digits = n_significant_digits
+    prec = [prec, n_digits].max
+
+    ex = exponent / 2
+    x = _decimal_shift(-2 * ex)
+    y = BigDecimal(Math.sqrt(x.to_f))
+    precs = [prec + BigDecimal.double_fig]
+    precs << 2 + precs.last / 2 while precs.last > BigDecimal.double_fig
+    precs.reverse_each do |p|
+      y = y.add(x.div(y, p), p).div(2, p)
+    end
+    y = y.mult(1, limit) if limit
+    y._decimal_shift(ex)
+  end
+end
+
+# Core BigMath methods for BigDecimal (log, exp) are defined here.
+# Other methods (sin, cos, atan) are defined in 'bigdecimal/math.rb'.
+module BigMath
+
+  # call-seq:
+  #   BigMath.log(decimal, numeric)    -> BigDecimal
+  #
+  # Computes the natural logarithm of +decimal+ to the specified number of
+  # digits of precision, +numeric+.
+  #
+  # If +decimal+ is zero or negative, raises Math::DomainError.
+  #
+  # If +decimal+ is positive infinity, returns Infinity.
+  #
+  # If +decimal+ is NaN, returns NaN.
+  #
+  def self.log(x, prec)
+    BigDecimal::Internal.validate_prec(prec, :log)
+    raise Math::DomainError, 'Complex argument for BigMath.log' if Complex === x
+
+    x = BigDecimal::Internal.coerce_to_bigdecimal(x, prec, :log)
+    return BigDecimal::Internal.nan_computation_result if x.nan?
+    raise Math::DomainError, 'Zero or negative argument for log' if x <= 0
+    return BigDecimal::Internal.infinity_computation_result if x.infinite?
+    return BigDecimal(0) if x == 1
+
+    BigDecimal.save_limit do
+      BigDecimal.limit(0)
+      if x > 10 || x < 0.1
+        log10 = log(BigDecimal(10), prec)
+        exponent = x.exponent
+        x = x._decimal_shift(-exponent)
+        if x < 0.3
+          x *= 10
+          exponent -= 1
+        end
+        return log10 * exponent + log(x, prec)
+      end
+
+      x_minus_one_exponent = (x - 1).exponent
+      prec += BigDecimal.double_fig
+
+      # log(x) = log(sqrt(sqrt(sqrt(sqrt(x))))) * 2**sqrt_steps
+      sqrt_steps = [Integer.sqrt(prec) + 3 * x_minus_one_exponent, 0].max
+
+      lg2 = 0.3010299956639812
+      prec2 = prec + [-x_minus_one_exponent, 0].max + (sqrt_steps * lg2).ceil
+
+      sqrt_steps.times do
+        x = x.sqrt(prec2)
+
+        # Workaround for https://github.com/ruby/bigdecimal/issues/354
+        x = x.mult(1, prec2 + BigDecimal.double_fig)
+      end
+
+      # Taylor series for log(x) around 1
+      # log(x) = -log((1 + X) / (1 - X)) where X = (x - 1) / (x + 1)
+      # log(x) = 2 * (X + X**3 / 3 + X**5 / 5 + X**7 / 7 + ...)
+      x = (x - 1).div(x + 1, prec2)
+      y = x
+      x2 = x.mult(x, prec)
+      1.step do |i|
+        n = prec + x.exponent - y.exponent + x2.exponent
+        break if n <= 0 || x.zero?
+        x = x.mult(x2.round(n - x2.exponent), n)
+        y = y.add(x.div(2 * i + 1, n), prec)
+      end
+
+      y.mult(2 ** (sqrt_steps + 1), prec)
+    end
+  end
+
+  # call-seq:
+  #   BigMath.exp(decimal, numeric)    -> BigDecimal
+  #
+  # Computes the value of e (the base of natural logarithms) raised to the
+  # power of +decimal+, to the specified number of digits of precision.
+  #
+  # If +decimal+ is infinity, returns Infinity.
+  #
+  # If +decimal+ is NaN, returns NaN.
+  #
+  def self.exp(x, prec)
+    BigDecimal::Internal.validate_prec(prec, :exp)
+    x = BigDecimal::Internal.coerce_to_bigdecimal(x, prec, :exp)
+    return BigDecimal::Internal.nan_computation_result if x.nan?
+    return x.positive? ? BigDecimal::Internal.infinity_computation_result : BigDecimal(0) if x.infinite?
+    return BigDecimal(1) if x.zero?
+    return BigDecimal(1).div(exp(-x, prec), prec) if x < 0
+
+    # exp(x * 10**cnt) = exp(x)**(10**cnt)
+    cnt = x > 1 ? x.exponent : 0
+    prec2 = prec + BigDecimal.double_fig + cnt
+    x = x._decimal_shift(-cnt)
+    xn = BigDecimal(1)
+    y = BigDecimal(1)
+
+    # Taylor series for exp(x) around 0
+    1.step do |i|
+      n = prec2 + xn.exponent
+      break if n <= 0 || xn.zero?
+      x = x.mult(1, n)
+      xn = xn.mult(x, n).div(i, n)
+      y = y.add(xn, prec2)
+    end
+
+    # calculate exp(x * 10**cnt) from exp(x)
+    # exp(x * 10**k) = exp(x * 10**(k - 1)) ** 10
+    cnt.times do
+      y2 = y.mult(y, prec2)
+      y5 = y2.mult(y2, prec2).mult(y, prec2)
+      y = y5.mult(y5, prec2)
+    end
+
+    y.mult(1, prec)
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: bigdecimal
 version: !ruby/object:Gem::Version
-  version: 3.2.2
+  version: 3.2.3
 platform: ruby
 authors:
 - Kenta Murata