bigdecimal-math_r 0.2.0 → 0.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c1b4b2588f0037d9060416ef581b7d8a6234f77e04381e95dd9aa72e5019ef6b
-  data.tar.gz: ffeef816a17a3f72ca5b4b7857d6b613946ff7250a53c16092ece0036f43ed4c
+  metadata.gz: 719ac1d5b1b20031ea157c824a660307e45adf15bf00edd6f906eaef31e8ef47
+  data.tar.gz: 4340bfae2018a9c332991f5c5e0ab4833f0ad914a15a05729ae68e07833a25fd
 SHA512:
-  metadata.gz: 6d2595bdf41efbfb3c9afcada58843480e5f5d3850230a4351a7aea9c8405b39614e11f93944ea8e918b0f20eec0485d4ffe872d252bfa33e7a6812f8dba3892
-  data.tar.gz: 0afa957c44af99a146f1b14b5545283b62ad924aa7040547933c56cbf6a68e82e083dd460ce8bdfd37aa6e9b71a21c6a0b35537f91fcaaf7c51d6dadffc7097f
+  metadata.gz: 7eb916c9ab6c4f2288c7b8a5c9d36dfe5879bf547082fba2be2e4ea01925e97fd5de4f7445d0d28dee03faa457502d8a86107ac71d5c417d1508cf8a2e4a44dd
+  data.tar.gz: 2fcc65443645680121c138272d4825d9707fa9296936b114ab2e630f49213f0710ada866c3c080bc9c38a332a7e9f5cdefb24bac2e0c528efec910cbc35cb6ef

data/README.md

@@ -4,23 +4,76 @@ This is a math module that using the BigDecimal class. Multiple-precision arithm
 
 ## Installation
 
-TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG` with your gem name right after releasing it to RubyGems.org. Please do not do it earlier due to security reasons. Alternatively, replace this section with instructions to install your gem from git if you don't plan to release to RubyGems.org.
-
-Install the gem and add to the application's Gemfile by executing:
+It doesn't use any external libraries that have dependencies. Use only the BigDecimal class.  
 
 ```bash
-bundle add UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+gem install bigdecimal-math_r
 ```
 
-If bundler is not being used to manage dependencies, install the gem by executing:
+## Usage
 
-```bash
-gem install UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+When it is called, the BigDecimal class is also called.
+
+```Ruby
+require 'bigdecimal/math_r'
 ```
 
-## Usage
+The functions at the top level `BigMathR` of the module, are mathematical constants in uppercase letters, and mathematical functions in lowercase.  
+Mathematical functions are compatible with both real and complex solutions.  
 
-TODO: Write usage instructions here
+Constants:  
+```
+:E (Constant e), 
+:LOG2 (Natural logarithm of 2)
+:LOG_PI (Natural logarithm of pi)
+:LOG10 (Natural logarithm of 10)
+:SQRT2 (Square root of 2)
+:SQRT3 (Square root of 3)
+:PI (Constant pi)
+```
+Functions:  
+```
+:exp (Exponential function)
+:exp2 (Base-2 (Binary) exponent)
+
+:log (Natural logarithm)
+:log2 (Binary logarithm)
+:log10 (Common logarithm)
+:log1p  (log(1+x))
+
+:hypot  (Hypotenuse)
+
+:sqrt (Square root)
+:cbrt (Cubic root)
+
+:sin (Sine)
+:cos (Cosine)
+:tan (Tangent)
+:sec (Secant)
+:csc (Cosecant)
+:cot (Cotangent)
+
+:sinh (Hyperbolic sine)
+:cosh (Hyperbolic cosine)
+:tanh (Hyperbolic tangent)
+:csch (Hyperbolic cosecant)
+:sech (Hyperbolic secant)
+:coth (Hyperbolic cotangent)
+
+:asin (Inverse Sine)
+:acos (Inverse Cosine)
+:atan, :atan2 (Inverse Tangent)
+:acsc (Inverse Cosecant)
+:asec (Inverse Secant)
+:acot (Inverse Cotangent)
+
+:acosh (Inverse Hyperbolic Sine)
+:asinh (Inverse Hyperbolic Cosine)
+:atanh (Inverse Hyperbolic Tangent)
+:acsch (Inverse Hyperbolic Cosecant)
+:asech (Inverse Hyperbolic Secant)
+:acoth (Inverse Hyperbolic Cotangent)
+```
 
 ## Development
 
@@ -30,7 +83,7 @@ To install this gem onto your local machine, run `bundle exec rake install`. To
 
 ## Contributing
 
-Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/bigdecimal-math_r. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/bigdecimal-math_r/blob/main/CODE_OF_CONDUCT.md).
+Bug reports and pull requests are welcome on GitHub at https://github.com/tribusonz-2/bigdecimal-math_r. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/tribusonz-2/bigdecimal-math_r/blob/main/CODE_OF_CONDUCT.md).
 
 ## License
 

data/changelog.md

@@ -7,6 +7,24 @@ The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/) a
 
 ## [Unreleased]
 
+## [0.2.1] - 2025-05-XX
+
+### Changed
+- `atan_branch()` limit a calculation range in $0 \lt x \lt \frac{1}{2}$ .
+
+### Fixed
+- `cpow_formula()` return complex solution when left hand side is in negative real number.
+- `acsch_branch()` had a domain.
+- `sqrt_branch()` API did not perform an implicit type conversion.
+- The global constant was set when the library was loaded.
+- `log*_edf()` was not defined in the sub-module `Log`.
+
+### Added
+- Add API `rb_num_domain_p()`. This query whether an argument is in the domain.
+- Add minitest.
+
+## [0.2.0] - 2025-05-XX
+
 ### Changed
 - Rename `BigMathR::PowerRoot` to `BigMathR::Power`
 

data/ext/bigdecimal/math_r/api/numeric/domain_p.h

@@ -0,0 +1,7 @@
+bool
+rb_num_domain_p(VALUE range, VALUE x)
+{
+	const ID cover_p = rb_intern("cover?");
+	VALUE ans = rb_funcall(range, cover_p, 1, x);
+	return ans == Qtrue ? true : false;
+}

data/ext/bigdecimal/math_r/internal/algo/bigmath/acos/branch.h

@@ -2,21 +2,28 @@ VALUE
 acos_branch(VALUE x, VALUE prec, bigmath_func1 acos_cb)
 {
 	const ID leq = rb_intern("<=");
-	VALUE y = Qundef, p001 = rb_BigDecimal1(rb_str_new_cstr("0.001"));
+	VALUE y = Qundef;
+	VALUE p001 = rb_BigDecimal1(rb_str_new_cstr("0.001"));
+	VALUE domain = rb_range_new(INT2FIX(0), INT2FIX(1), true);
+
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
 	if (!rb_num_finite_p(x))
 		y = x;
 	else
 	{
-		VALUE absx = rb_num_negative_p(x) ? rb_num_uminus(x) : x;
+		VALUE absx = rb_num_abs(x);
 		if (RTEST(rb_num_coerce_cmp(absx, p001, leq)))
 		{
 			y = acos_ser(x, prec);
 		}
-		else if (RTEST(rb_num_coerce_cmp(absx, BIG_ONE, leq)))
+		else if (rb_num_domain_p(domain, absx))
 		{
-			y = acos_cb(x, prec);
+			if (rb_num_equal_p(absx, INT2FIX(1)))
+				y = rb_num_negative_p(x) ? 
+					rb_bigmath_const_pi(prec) : BIG_ZERO;
+			else
+				y = acos_cb(x, prec);
 		}
 		else
 			y = BIG_NAN;

data/ext/bigdecimal/math_r/internal/algo/bigmath/acosh/branch.h

@@ -1,15 +1,15 @@
 VALUE
 acosh_branch(VALUE x, VALUE prec, bigmath_func1 acosh_cb)
 {
-	const ID geq = rb_intern(">=");
 	VALUE y = Qundef;
+	VALUE domain = rb_range_new(INT2FIX(1), DBL2NUM(HUGE_VAL), false);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 	if (rb_num_positive_p(x))
 	{
 		if (rb_num_infinite_p(x) == 1)
 			y = BIG_INF;
-		else if (RTEST(rb_num_coerce_cmp(x, BIG_ONE, geq)))
+		else if (rb_num_domain_p(domain, x))
 			y = acosh_cb(x, prec);
 	}
 	if (y == Qundef)

data/ext/bigdecimal/math_r/internal/algo/bigmath/acoth/branch.h

@@ -1,8 +1,9 @@
 VALUE
 acoth_branch(VALUE x, VALUE prec, bigmath_func1 acoth_cb)
 {
-	VALUE y;
-	const ID leq = rb_intern("<=");
+	VALUE y = Qundef;
+	VALUE p_domain = rb_range_new(INT2FIX(1), DBL2NUM(HUGE_VAL), false);
+	VALUE m_domain = rb_range_new(DBL2NUM(-HUGE_VAL), INT2FIX(-1), true);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
@@ -10,8 +11,7 @@ acoth_branch(VALUE x, VALUE prec, bigmath_func1 acoth_cb)
 		y = BIG_INF;
 	else if (rb_num_equal_p(x, BIG_MINUS_ONE))
 		y = BIG_MINUS_INF;
-	else if (RTEST(rb_num_coerce_cmp(x, BIG_MINUS_ONE, leq)) ||
-	         RTEST(rb_num_coerce_cmp(BIG_ONE, x, leq)))
+	else if (rb_num_domain_p(p_domain, x) || rb_num_domain_p(m_domain, x))
 		y = acoth_cb(x, prec);
 	else
 		y = BIG_NAN;

data/ext/bigdecimal/math_r/internal/algo/bigmath/acsc/branch.h

@@ -1,9 +1,9 @@
 VALUE
 acsc_branch(VALUE x, VALUE prec, bigmath_func1 acsc_cb)
 {
-	const ID leq = rb_intern("<=");
-	const ID geq = rb_intern(">=");
 	VALUE y = Qundef;
+	VALUE p_domain = rb_range_new(INT2FIX(1), DBL2NUM(HUGE_VAL), false);
+	VALUE m_domain = rb_range_new(DBL2NUM(-HUGE_VAL), INT2FIX(-1), true);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
@@ -11,8 +11,7 @@ acsc_branch(VALUE x, VALUE prec, bigmath_func1 acsc_cb)
 		y = BIG_NAN;
 	else if (rb_num_infinite_p(x) != 0)
 		y = BIG_ONE;
-	else if (RTEST(rb_num_coerce_bin(x, INT2FIX(-1), leq)) ||
-	         RTEST(rb_num_coerce_bin(x, INT2FIX( 1), geq)))
+	else if (rb_num_domain_p(p_domain, x) || rb_num_domain_p(m_domain, x))
 		y = acsc_cb(x, prec);
 	else
 		y = BIG_NAN;

data/ext/bigdecimal/math_r/internal/algo/bigmath/acsch/branch.h

@@ -1,7 +1,6 @@
 VALUE
 acsch_branch(VALUE x, VALUE prec, bigmath_func1 acsch_cb)
 {
-	const ID leq = rb_intern("<=");
 	VALUE y = Qundef;
 	int sign;
 
@@ -10,16 +9,11 @@ acsch_branch(VALUE x, VALUE prec, bigmath_func1 acsch_cb)
 	if (rb_num_nan_p(x))
 		y = BIG_NAN;
 	else if ((sign = rb_num_infinite_p(x)) != 0)
-	{
 		y = sign == 1 ? BIG_ZERO : BIG_MINUS_ZERO;
-	}
-	else if (RTEST(rb_num_coerce_bin(x, BIG_MINUS_ONE, leq)) ||
-	         RTEST(rb_num_coerce_bin(BIG_ONE, x, leq)))
-	{
+	else if (rb_num_zero_p(x))
+		y = BIG_INF;
+	else 
 		y = acsch_cb(x, prec);
-	}
-	else
-		y = BIG_NAN;
 
 	return y;
 }

data/ext/bigdecimal/math_r/internal/algo/bigmath/asec/branch.h

@@ -1,10 +1,10 @@
 VALUE
 asec_branch(VALUE x, VALUE prec, bigmath_func1 asec_cb)
 {
-	const ID leq = rb_intern("<=");
-	const ID geq = rb_intern(">=");
 	const ID div = rb_intern("div");
 	VALUE y = Qundef;
+	VALUE p_domain = rb_range_new(INT2FIX(1), DBL2NUM(HUGE_VAL), false);
+	VALUE m_domain = rb_range_new(DBL2NUM(-HUGE_VAL), INT2FIX(-1), true);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
@@ -12,8 +12,11 @@ asec_branch(VALUE x, VALUE prec, bigmath_func1 asec_cb)
 		y = BIG_NAN;
 	else if (rb_num_infinite_p(x) != 0)
 		y = rb_funcall(rb_bigmath_const_pi(prec), div, 2, INT2FIX(2), prec);
-	else if (RTEST(rb_num_coerce_bin(x, INT2FIX(-1), leq)) ||
-	         RTEST(rb_num_coerce_bin(x, INT2FIX(1), geq)))
+	else if (rb_num_equal_p(x, INT2FIX(-1)))
+		y = rb_bigmath_const_pi(prec);
+	else if (rb_num_equal_p(x, INT2FIX(0)))
+		y = BIG_ZERO;
+	else if (rb_num_domain_p(p_domain, x) || rb_num_domain_p(m_domain, x))
 		y = asec_cb(x, prec);
 	else
 		y = BIG_NAN;

data/ext/bigdecimal/math_r/internal/algo/bigmath/asech/branch.h

@@ -1,16 +1,13 @@
 VALUE
 asech_branch(VALUE x, VALUE prec, bigmath_func1 asech_cb)
 {
-	const ID leq = rb_intern("<=");
 	VALUE y;
+	VALUE domain = rb_range_new(INT2FIX(0), INT2FIX(1), true);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
-	if (RTEST(rb_num_coerce_cmp(BIG_ZERO, x, leq)) &&
-	    RTEST(rb_num_coerce_cmp(x, BIG_ONE, leq)))
-	{
+	if (rb_num_domain_p(domain, x))
 		y = asech_cb(x, prec);
-	}
 	else
 		y = BIG_NAN;
 

data/ext/bigdecimal/math_r/internal/algo/bigmath/asin/branch.h

@@ -2,7 +2,9 @@ VALUE
 asin_branch(VALUE x, VALUE prec, bigmath_func1 asin_cb)
 {
 	const ID leq = rb_intern("<=");
-	VALUE y = Qundef, p001 = rb_BigDecimal1(rb_str_new_cstr("0.001"));
+	VALUE y = Qundef;
+	VALUE p001 = rb_BigDecimal1(rb_str_new_cstr("0.001"));
+	VALUE domain = rb_range_new(INT2FIX(-1), INT2FIX(1), true);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
@@ -13,7 +15,7 @@ asin_branch(VALUE x, VALUE prec, bigmath_func1 asin_cb)
 		VALUE absx = rb_num_negative_p(x) ? rb_num_uminus(x) : x;
 		if (RTEST(rb_num_coerce_cmp(absx, p001, leq)))
 			y = asin_ser(x, prec);
-		else if (RTEST(rb_num_coerce_cmp(absx, BIG_ONE, leq)))
+		else if (rb_num_domain_p(domain, x))
 			y = asin_cb(x, prec);
 		else
 			y = BIG_NAN;

data/ext/bigdecimal/math_r/internal/algo/bigmath/atan/branch.h

@@ -10,7 +10,7 @@ atan_branch(VALUE x, VALUE prec, bigmath_func1 atan_cb)
 	if (rb_num_zero_p(x))
 		y = BIG_ZERO;
 	else
-		y = atan_cb(x, prec);
+		y = rb_bigmath_atan_adopt(x, prec, atan_cb);
 
 	return y;
 }

data/ext/bigdecimal/math_r/internal/algo/bigmath/atan/ser_euler.h

@@ -1,6 +1,5 @@
-#if 1
-static VALUE
-atan_ser_euler_inline(VALUE x, VALUE prec)
+VALUE
+atan_ser_euler(VALUE x, VALUE prec)
 {
 	const ID add = rb_intern("add");
 	const ID mult = rb_intern("mult");
@@ -35,50 +34,3 @@ atan_ser_euler_inline(VALUE x, VALUE prec)
 	};
 	return rb_funcall(rb_funcall(y, div, 2, x, prec), mult, 2, s, prec);
 }
-#else
-static VALUE
-atan_ser_euler_inline(VALUE x, VALUE prec)
-{
-	const ID add = rb_intern("add");
-	const ID mult = rb_intern("mult");
-	const ID div = rb_intern("div");
-	VALUE n, m, wt, w, r, y, d;
-
-	if (rb_num_zero_p(x))
-		return BIG_ZERO;
-
-	n = rb_numdiff_make_n(prec);
-
-	wt = rb_funcall(
-		rb_funcall(x, mult, 2, x, n), div, 2,
-		rb_funcall(BIG_ONE, add, 2, rb_funcall(x, mult, 2, x, n),
-		n), n);
-	w = BIG_ONE;
-	r = BIG_ONE;
-	y = BIG_ZERO;
-	d = BIG_ONE;
-
-	while (rb_numdiff_condition_p(y, d, n, &m))
-	{
-		d = rb_funcall(r, mult, 2, w, m);
-		y = rb_funcall1(y, '+', d);
-		r = rb_funcall1(r, '*', LONG2NUM(++n));
-		r = rb_funcall1(r, '/', LONG2NUM(++n));
-		w = rb_funcall1(w, '*', wt);
-	}
-
-	RB_GC_GUARD(wt);
-	RB_GC_GUARD(w);
-	RB_GC_GUARD(r);
-	RB_GC_GUARD(y);
-	RB_GC_GUARD(d);
-
-	return rb_funcall(rb_funcall(wt, div, 2, x, prec), mult, 2, y, prec);
-}
-#endif
-
-VALUE
-atan_ser_euler(VALUE x, VALUE prec)
-{
-	return rb_bigmath_atan_adopt(x, prec, atan_ser_euler_inline);
-}

data/ext/bigdecimal/math_r/internal/algo/bigmath/atan/ser_usual.h

@@ -1,5 +1,5 @@
-static VALUE
-atan_ser_usual_inline(VALUE x, VALUE prec)
+VALUE
+atan_ser_usual(VALUE x, VALUE prec)
 {
 	const ID mult = rb_intern("mult");
 	const ID div = rb_intern("div");
@@ -32,10 +32,3 @@ atan_ser_usual_inline(VALUE x, VALUE prec)
 
 	return y;
 }
-
-
-VALUE
-atan_ser_usual(VALUE x, VALUE prec)
-{
-	return rb_bigmath_atan_adopt(x, prec, atan_ser_usual_inline);
-}

data/ext/bigdecimal/math_r/internal/algo/bigmath/atanh/branch.h

@@ -2,12 +2,13 @@ VALUE
 atanh_branch(VALUE x, VALUE prec, bigmath_func1 atanh_cb)
 {
 	const ID leq = rb_intern("<=");
-	VALUE y = Qundef, p0999 = rb_BigDecimal1(rb_str_new_cstr("0.999"));
+	VALUE y = Qundef;
+	VALUE p0999 = rb_BigDecimal1(rb_str_new_cstr("0.999"));
+	VALUE domain = rb_range_new(INT2FIX(-1), INT2FIX(1), true);
 
 	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
 
-	if (RTEST(rb_num_coerce_cmp(INT2FIX(-1), x, leq)) &&
-	    RTEST(rb_num_coerce_cmp(x, INT2FIX(1), leq)))
+	if (rb_num_domain_p(domain, x))
 	{
 		VALUE absx = rb_num_negative_p(x) ? rb_num_uminus(x) : x;
 		if (rb_num_equal_p(absx, INT2FIX(1)))

data/ext/bigdecimal/math_r/internal/algo/bigmath/cpow/formula.h

@@ -5,7 +5,8 @@ cpow_formula(VALUE z, VALUE w, VALUE prec)
 
 	rb_check_precise(prec);
 
-	if (rb_num_zero_p(rb_num_imag(z)) && rb_num_zero_p(rb_num_imag(w)))
+	if (rb_num_positive_p(rb_num_real(z)) &&
+	    rb_num_zero_p(rb_num_imag(z)) && rb_num_zero_p(rb_num_imag(w)))
 	{
 		a = pow_formula(rb_num_real(z), rb_num_real(w), prec);
 		a = rb_num_canonicalize(a, prec, ARG_COMPLEX, ARG_RAWVALUE);

data/ext/bigdecimal/math_r/internal/algo/bigmath/sqrt/branch.h

@@ -2,7 +2,8 @@ VALUE
 sqrt_branch(VALUE x, VALUE prec, bigmath_func1 sqrt_cb)
 {
 #define SWITCH_PRECISION_NUMBER 2253
-	rb_check_precise(prec);
+	x = rb_num_canonicalize(x, prec, ARG_REAL, ARG_RAWVALUE);
+
 	if (rb_num_negative_p(x))
 		return BIG_NAN;
 	else if (!rb_num_finite_p(x))

data/ext/bigdecimal/math_r/log.c

@@ -243,9 +243,9 @@ InitVM_Log(void)
 	rb_define_module_function(rb_mLog, "log_builtin", __impl_log_builtin, 2);
 	rb_define_module_function(rb_mLog, "log_ser_okumura", __impl_log_ser_okumura, 2);
 
-	rb_define_module_function(rb_mEDF, "log_edf", __impl_log_edf, 2);
-	rb_define_module_function(rb_mEDF, "log2_edf", __impl_log2_edf, 2);
-	rb_define_module_function(rb_mEDF, "log10_edf", __impl_log10_edf, 2);
+	rb_define_module_function(rb_mLog, "log_edf", __impl_log_edf, 2);
+	rb_define_module_function(rb_mLog, "log2_edf", __impl_log2_edf, 2);
+	rb_define_module_function(rb_mLog, "log10_edf", __impl_log10_edf, 2);
 
 	rb_define_module_function(rb_mLog, "log1p_ser_mercator", __impl_log1p_ser_mercator, 2);
 	rb_define_module_function(rb_mLog, "log1p_p_adic", __impl_log1p_p_adic, 2);

data/ext/bigdecimal/math_r/math_r/numeric.h

@@ -26,6 +26,7 @@ bool rb_num_nan_p(VALUE z);
 
 bool rb_num_numeric_p(VALUE self);
 
+bool rb_num_domain_p(VALUE range, VALUE x);
 
 /**
  * Rounds the argument +x+ to an arbitrary precision +prec+. <br>

data/ext/bigdecimal/math_r/math_r.c

@@ -7,6 +7,7 @@
 #include <ruby.h>
 #define DEFINE_SYMBOL
 #include "math_r/globals.h"
+#include "math_r/bigmath.h"
 
 void InitVM_Overrides(void);
 void InitVM_Const(void);
@@ -35,6 +36,14 @@ void InitVM_Solver(void);
 void
 Init_math_r(void)
 {
+	rb_gv_set(BIGMATH_PI, Qnil);
+	rb_gv_set(BIGMATH_E, Qnil);
+	rb_gv_set(BIGMATH_LOG2, Qnil);
+	rb_gv_set(BIGMATH_LOG10, Qnil);
+	rb_gv_set(BIGMATH_LOG_PI, Qnil);
+	rb_gv_set(BIGMATH_SQRT2, Qnil);
+	rb_gv_set(BIGMATH_SQRT3, Qnil);
+
 	mf_exp = rb_intern_const("exp");
 	mf_exp2 = rb_intern_const("exp2");
 	mf_expm1 = rb_intern_const("expm1");

data/ext/bigdecimal/math_r/solver.c

@@ -74,15 +74,15 @@ bigmath_func1 cb_casech;
 bigmath_func1 cb_acoth;
 bigmath_func1 cb_cacoth;
 
+bigmath_func1 cb_sqrt;
+bigmath_func1 cb_csqrt;
+bigmath_func1 cb_cbrt;
+bigmath_func1 cb_ccbrt;
+
+bigmath_func1 cb_erf;
+bigmath_func1 cb_erfc;
 
 
-static bool
-domain_p(VALUE range, VALUE x)
-{
-	const ID cover_p = rb_intern("cover?");
-	VALUE ans = rb_funcall(range, cover_p, 1, x);
-	return ans == Qtrue ? true : false;
-}
 
 static void
 rb_id_includes(int n, const ID *funcs, ID func)
@@ -867,7 +867,7 @@ solver_triginv(ID func, VALUE z, VALUE prec)
 			if (func == mf_asin)
 			{
 				VALUE domain = rb_range_new(INT2FIX(-1), INT2FIX(1), 0);
-				if (domain_p(domain, z))
+				if (rb_num_domain_p(domain, z))
 					w = asin_branch(z, prec, cb_asin);
 				else
 					w = asin_edom(z, prec);
@@ -875,7 +875,7 @@ solver_triginv(ID func, VALUE z, VALUE prec)
 			else if (func == mf_acos)
 			{
 				VALUE domain = rb_range_new(INT2FIX(-1), INT2FIX(1), 0);
-				if (domain_p(domain, z))
+				if (rb_num_domain_p(domain, z))
 					w = acos_branch(z, prec, cb_acos);
 				else
 					w = acos_edom(z, prec);
@@ -886,7 +886,7 @@ solver_triginv(ID func, VALUE z, VALUE prec)
 			{
 				VALUE m_domain = rb_range_new(BIG_MINUS_INF, BIG_MINUS_ONE, 0);
 				VALUE p_domain = rb_range_new(BIG_ONE, BIG_INF, 0);
-				if (domain_p(m_domain, z) || domain_p(p_domain, z))
+				if (rb_num_domain_p(m_domain, z) || rb_num_domain_p(p_domain, z))
 					w = acsc_branch(z, prec, cb_acsc);
 				else
 					w = acsc_edom(z, prec);
@@ -895,7 +895,7 @@ solver_triginv(ID func, VALUE z, VALUE prec)
 			{
 				VALUE m_domain = rb_range_new(BIG_MINUS_INF, BIG_MINUS_ONE, 0);
 				VALUE p_domain = rb_range_new(BIG_ONE, BIG_INF, 0);
-				if (domain_p(m_domain, z) || domain_p(p_domain, z))
+				if (rb_num_domain_p(m_domain, z) || rb_num_domain_p(p_domain, z))
 					w = asec_branch(z, prec, cb_asec);
 				else
 					w = asec_edom(z, prec);
@@ -1121,9 +1121,9 @@ solver_hyperbinv(ID func, VALUE z, VALUE prec)
 			{
 				VALUE m_domain = rb_range_new(BIG_MINUS_INF, BIG_MINUS_ONE, 0);
 				VALUE p_domain = rb_range_new(BIG_ONE, BIG_INF, 0);
-				if (domain_p(p_domain, z))
+				if (rb_num_domain_p(p_domain, z))
 					w = acosh_branch(z, prec, cb_acosh);
-				else if (domain_p(m_domain, z))
+				else if (rb_num_domain_p(m_domain, z))
 				{
 					z = rb_num_abs(z);
 					w = acosh_branch(z, prec, cb_acosh);
@@ -1135,7 +1135,7 @@ solver_hyperbinv(ID func, VALUE z, VALUE prec)
 			else if (func == mf_atanh)
 			{
 				VALUE domain = rb_range_new(INT2FIX(-1), INT2FIX(1), 0);
-				if (domain_p(domain, z))
+				if (rb_num_domain_p(domain, z))
 					w = atanh_branch(z, prec, cb_atanh);
 				else
 					w = atanh_edom(z, prec);
@@ -1148,9 +1148,9 @@ solver_hyperbinv(ID func, VALUE z, VALUE prec)
 			{
 				VALUE m_domain = rb_range_new(BIG_MINUS_ONE, BIG_ZERO, 0);
 				VALUE p_domain = rb_range_new(BIG_ZERO, BIG_ONE, 0);
-				if (domain_p(p_domain, z))
+				if (rb_num_domain_p(p_domain, z))
 					w = asech_branch(z, prec, cb_asech);
-				else if (domain_p(m_domain, z))
+				else if (rb_num_domain_p(m_domain, z))
 				{
 					w = asech_branch(z, prec, cb_asech);
 					w = rb_Complex(w, rb_bigmath_const_pi(prec));
@@ -1162,7 +1162,7 @@ solver_hyperbinv(ID func, VALUE z, VALUE prec)
 			{
 				VALUE m_domain = rb_range_new(BIG_MINUS_INF, BIG_MINUS_ONE, 0);
 				VALUE p_domain = rb_range_new(BIG_ONE, BIG_INF, 0);
-				if (domain_p(m_domain, z) || domain_p(p_domain, z))
+				if (rb_num_domain_p(m_domain, z) || rb_num_domain_p(p_domain, z))
 					w = acoth_branch(z, prec, cb_acoth);
 				else
 					w = acoth_edom(z, prec);
@@ -1337,12 +1337,12 @@ __impl_bigmath_sqrt(VALUE unused_obj, VALUE z, VALUE prec)
 		if (rb_num_negative_p(z))
 			w = sqrt_edom(z, prec);
 		else
-			w = sqrt_newton(z, prec);
+			w = cb_sqrt(z, prec);
 	}
 	else
 	{
 		z = rb_num_canonicalize(z, prec, ARG_COMPLEX, ARG_RAWVALUE);
-		w = csqrt_formula(z, prec);
+		w = cb_csqrt(z, prec);
 	}
 	return w;
 }
@@ -1374,16 +1374,58 @@ __impl_bigmath_cbrt(VALUE unused_obj, VALUE z, VALUE prec)
 	if (rb_num_real_p(z))
 	{
 		z = rb_num_canonicalize(z, prec, ARG_REAL, ARG_RAWVALUE);
-		w = cuberoot_newton(z, prec);
+		w = cb_cbrt(z, prec);
 	}
 	else
 	{
 		z = rb_num_canonicalize(z, prec, ARG_COMPLEX, ARG_RAWVALUE);
-		w = ccbrt_formula(z, prec);
+		w = cb_ccbrt(z, prec);
 	}
 	return w;
 }
 
+/**
+ *  Computes error function of +z+.
+ *  
+ *  @param z [Numeric] Numerical argument
+ *  @param prec [Integer] Arbitrary precision
+ *  @return [BigDecimal] Real solution
+ *  @raise [ArgumentError] Occurs when +prec+ is not a positive integer.
+ *  @raise [TypeError] Occurs when +z+ is not a numeric class.
+ *  @since 0.2.1
+ *  @example
+ *   BigMathR.erf(5, 20)
+ *   #=> 0.99999999999846254021e0
+ *   BigMathR.erf(5, 40)
+ *   #=> 0.9999999999984625402055719651498116565146e0
+ */
+static VALUE
+__impl_bigmath_erf(VALUE unused_obj, VALUE z, VALUE prec)
+{
+	return erf_branch(z, prec, cb_erf);
+}
+
+/**
+ *  Computes complementary error function of +z+.
+ *  
+ *  @param z [Numeric] Numerical argument
+ *  @param prec [Integer] Arbitrary precision
+ *  @return [BigDecimal] Real solution
+ *  @raise [ArgumentError] Occurs when +prec+ is not a positive integer.
+ *  @raise [TypeError] Occurs when +z+ is not a numeric class.
+ *  @since 0.2.1
+ *  @example
+ *   BigMathR.erfc(5, 20)
+ *   #=> 0.153745979e-11
+ *   BigMathR.erfc(5, 40)
+ *   #=> 0.15374597944280348501883434854e-11
+ */
+static VALUE
+__impl_bigmath_erfc(VALUE unused_obj, VALUE z, VALUE prec)
+{
+	return erfc_branch(z, prec, cb_erfc);
+}
+
 /**
  *  Document-module: BigMathR::Solver
  *  
@@ -1463,6 +1505,15 @@ InitVM_Solver(void)
 	cb_casech = casech_logrep;
 	cb_cacoth = cacoth_logrep;
 
+	cb_sqrt = sqrt_newton;
+	cb_csqrt = csqrt_formula;
+	cb_cbrt = cuberoot_newton;
+	cb_ccbrt = ccbrt_formula;
+
+	cb_erf = erf_algo911;
+	cb_erfc = erfc_algo911;
+
+
 	rb_define_singleton_method(rb_mSolver, "exp", __impl_solver_exp, 3);
 
 	rb_define_singleton_method(rb_mBigMathR, "exp", __impl_bigmath_exp, 2);
@@ -1513,4 +1564,7 @@ InitVM_Solver(void)
 
 	rb_define_singleton_method(rb_mBigMathR, "sqrt", __impl_bigmath_sqrt, 2);
 	rb_define_singleton_method(rb_mBigMathR, "cbrt", __impl_bigmath_cbrt, 2);
+
+	rb_define_singleton_method(rb_mBigMathR, "erf", __impl_bigmath_erf, 2);
+	rb_define_singleton_method(rb_mBigMathR, "erfc", __impl_bigmath_erfc, 2);
 }

data/lib/bigdecimal/math_r/version.rb

@@ -2,6 +2,6 @@
 
 module BigMathR
   # Module version.
-  VERSION = "0.2.0"
+  VERSION = "0.2.1"
 end
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: bigdecimal-math_r
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.1
 platform: ruby
 authors:
 - tribusonz-2
@@ -62,7 +62,6 @@ files:
 - ".ruby-version"
 - CODE_OF_CONDUCT.md
 - LICENSE
-- LICENSE.txt
 - README.md
 - Rakefile
 - changelog.md
@@ -118,6 +117,7 @@ files:
 - ext/bigdecimal/math_r/api/numeric/abs.h
 - ext/bigdecimal/math_r/api/numeric/canonicalize.h
 - ext/bigdecimal/math_r/api/numeric/cmpeql.h
+- ext/bigdecimal/math_r/api/numeric/domain_p.h
 - ext/bigdecimal/math_r/api/numeric/equal_p.h
 - ext/bigdecimal/math_r/api/numeric/finite_p.h
 - ext/bigdecimal/math_r/api/numeric/imag.h

data/LICENSE.txt

@@ -1,21 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2025 tribusonz-2
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.