diff options
Diffstat (limited to 'complex.c')
| -rw-r--r-- | complex.c | 2974 |
1 files changed, 1769 insertions, 1205 deletions
@@ -5,33 +5,51 @@ which is written in ruby. */ -#include "ruby.h" -#include "internal.h" +#include "ruby/internal/config.h" + +#if defined _MSC_VER +/* Microsoft Visual C does not define M_PI and others by default */ +# define _USE_MATH_DEFINES 1 +#endif + +#include <ctype.h> #include <math.h> -#define NDEBUG -#include <assert.h> +#include "id.h" +#include "internal.h" +#include "internal/array.h" +#include "internal/class.h" +#include "internal/complex.h" +#include "internal/math.h" +#include "internal/numeric.h" +#include "internal/object.h" +#include "internal/rational.h" +#include "internal/string.h" +#include "ruby_assert.h" #define ZERO INT2FIX(0) #define ONE INT2FIX(1) #define TWO INT2FIX(2) +#if USE_FLONUM +#define RFLOAT_0 DBL2NUM(0) +#else +static VALUE RFLOAT_0; +#endif VALUE rb_cComplex; -static ID id_abs, id_abs2, id_arg, id_cmp, id_conj, id_convert, - id_denominator, id_divmod, id_eqeq_p, id_expt, id_fdiv, id_floor, - id_idiv, id_imag, id_inspect, id_negate, id_numerator, id_quo, - id_real, id_real_p, id_to_f, id_to_i, id_to_r, id_to_s, - id_i_real, id_i_imag; - -#define f_boolcast(x) ((x) ? Qtrue : Qfalse) - -#define binop(n,op) \ -inline static VALUE \ -f_##n(VALUE x, VALUE y)\ -{\ - return rb_funcall(x, (op), 1, y);\ -} +static ID id_abs, id_arg, + id_denominator, id_numerator, + id_real_p, id_i_real, id_i_imag, + id_finite_p, id_infinite_p, id_rationalize, + id_PI; +#define id_to_i idTo_i +#define id_to_r idTo_r +#define id_negate idUMinus +#define id_expt idPow +#define id_to_f idTo_f +#define id_quo idQuo +#define id_fdiv idFdiv #define fun1(n) \ inline static VALUE \ @@ -47,276 +65,339 @@ f_##n(VALUE x, VALUE y)\ return rb_funcall(x, id_##n, 1, y);\ } -#define math1(n) \ -inline static VALUE \ -m_##n(VALUE x)\ -{\ - return rb_funcall(rb_mMath, id_##n, 1, x);\ -} - -#define math2(n) \ -inline static VALUE \ -m_##n(VALUE x, VALUE y)\ -{\ - return rb_funcall(rb_mMath, id_##n, 2, x, y);\ -} - #define PRESERVE_SIGNEDZERO inline static VALUE f_add(VALUE x, VALUE y) { -#ifndef PRESERVE_SIGNEDZERO - if (FIXNUM_P(y) && FIX2LONG(y) == 0) - return x; - else if (FIXNUM_P(x) && FIX2LONG(x) == 0) - return y; -#endif + if (RB_INTEGER_TYPE_P(x) && + LIKELY(rb_method_basic_definition_p(rb_cInteger, idPLUS))) { + if (FIXNUM_ZERO_P(x)) + return y; + if (FIXNUM_ZERO_P(y)) + return x; + return rb_int_plus(x, y); + } + else if (RB_FLOAT_TYPE_P(x) && + LIKELY(rb_method_basic_definition_p(rb_cFloat, idPLUS))) { + if (FIXNUM_ZERO_P(y)) + return x; + return rb_float_plus(x, y); + } + else if (RB_TYPE_P(x, T_RATIONAL) && + LIKELY(rb_method_basic_definition_p(rb_cRational, idPLUS))) { + if (FIXNUM_ZERO_P(y)) + return x; + return rb_rational_plus(x, y); + } + return rb_funcall(x, '+', 1, y); } inline static VALUE -f_cmp(VALUE x, VALUE y) +f_div(VALUE x, VALUE y) +{ + if (FIXNUM_P(y) && FIX2LONG(y) == 1) + return x; + return rb_funcall(x, '/', 1, y); +} + +inline static int +f_gt_p(VALUE x, VALUE y) { - if (FIXNUM_P(x) && FIXNUM_P(y)) { - long c = FIX2LONG(x) - FIX2LONG(y); - if (c > 0) - c = 1; - else if (c < 0) - c = -1; - return INT2FIX(c); + if (RB_INTEGER_TYPE_P(x)) { + if (FIXNUM_P(x) && FIXNUM_P(y)) + return (SIGNED_VALUE)x > (SIGNED_VALUE)y; + return RTEST(rb_int_gt(x, y)); } - return rb_funcall(x, id_cmp, 1, y); + else if (RB_FLOAT_TYPE_P(x)) + return RTEST(rb_float_gt(x, y)); + else if (RB_TYPE_P(x, T_RATIONAL)) { + int const cmp = rb_cmpint(rb_rational_cmp(x, y), x, y); + return cmp > 0; + } + return RTEST(rb_funcall(x, '>', 1, y)); } inline static VALUE -f_div(VALUE x, VALUE y) +f_mul(VALUE x, VALUE y) { - if (FIXNUM_P(y) && FIX2LONG(y) == 1) - return x; - return rb_funcall(x, '/', 1, y); + if (RB_INTEGER_TYPE_P(x) && + LIKELY(rb_method_basic_definition_p(rb_cInteger, idMULT))) { + if (FIXNUM_ZERO_P(y)) + return ZERO; + if (FIXNUM_ZERO_P(x) && RB_INTEGER_TYPE_P(y)) + return ZERO; + if (x == ONE) return y; + if (y == ONE) return x; + return rb_int_mul(x, y); + } + else if (RB_FLOAT_TYPE_P(x) && + LIKELY(rb_method_basic_definition_p(rb_cFloat, idMULT))) { + if (y == ONE) return x; + return rb_float_mul(x, y); + } + else if (RB_TYPE_P(x, T_RATIONAL) && + LIKELY(rb_method_basic_definition_p(rb_cRational, idMULT))) { + if (y == ONE) return x; + return rb_rational_mul(x, y); + } + else if (LIKELY(rb_method_basic_definition_p(CLASS_OF(x), idMULT))) { + if (y == ONE) return x; + } + return rb_funcall(x, '*', 1, y); } inline static VALUE -f_gt_p(VALUE x, VALUE y) +f_sub(VALUE x, VALUE y) { - if (FIXNUM_P(x) && FIXNUM_P(y)) - return f_boolcast(FIX2LONG(x) > FIX2LONG(y)); - return rb_funcall(x, '>', 1, y); + if (FIXNUM_ZERO_P(y) && + LIKELY(rb_method_basic_definition_p(CLASS_OF(x), idMINUS))) { + return x; + } + return rb_funcall(x, '-', 1, y); } inline static VALUE -f_lt_p(VALUE x, VALUE y) +f_abs(VALUE x) { - if (FIXNUM_P(x) && FIXNUM_P(y)) - return f_boolcast(FIX2LONG(x) < FIX2LONG(y)); - return rb_funcall(x, '<', 1, y); + if (RB_INTEGER_TYPE_P(x)) { + return rb_int_abs(x); + } + else if (RB_FLOAT_TYPE_P(x)) { + return rb_float_abs(x); + } + else if (RB_TYPE_P(x, T_RATIONAL)) { + return rb_rational_abs(x); + } + else if (RB_TYPE_P(x, T_COMPLEX)) { + return rb_complex_abs(x); + } + return rb_funcall(x, id_abs, 0); } -binop(mod, '%') +static VALUE numeric_arg(VALUE self); +static VALUE float_arg(VALUE self); inline static VALUE -f_mul(VALUE x, VALUE y) +f_arg(VALUE x) { -#ifndef PRESERVE_SIGNEDZERO - if (FIXNUM_P(y)) { - long iy = FIX2LONG(y); - if (iy == 0) { - if (FIXNUM_P(x) || RB_TYPE_P(x, T_BIGNUM)) - return ZERO; - } - else if (iy == 1) - return x; - } - else if (FIXNUM_P(x)) { - long ix = FIX2LONG(x); - if (ix == 0) { - if (FIXNUM_P(y) || RB_TYPE_P(y, T_BIGNUM)) - return ZERO; - } - else if (ix == 1) - return y; + if (RB_INTEGER_TYPE_P(x)) { + return numeric_arg(x); } -#endif - return rb_funcall(x, '*', 1, y); + else if (RB_FLOAT_TYPE_P(x)) { + return float_arg(x); + } + else if (RB_TYPE_P(x, T_RATIONAL)) { + return numeric_arg(x); + } + else if (RB_TYPE_P(x, T_COMPLEX)) { + return rb_complex_arg(x); + } + return rb_funcall(x, id_arg, 0); } inline static VALUE -f_sub(VALUE x, VALUE y) +f_numerator(VALUE x) { -#ifndef PRESERVE_SIGNEDZERO - if (FIXNUM_P(y) && FIX2LONG(y) == 0) - return x; -#endif - return rb_funcall(x, '-', 1, y); + if (RB_TYPE_P(x, T_RATIONAL)) { + return RRATIONAL(x)->num; + } + if (RB_FLOAT_TYPE_P(x)) { + return rb_float_numerator(x); + } + return x; +} + +inline static VALUE +f_denominator(VALUE x) +{ + if (RB_TYPE_P(x, T_RATIONAL)) { + return RRATIONAL(x)->den; + } + if (RB_FLOAT_TYPE_P(x)) { + return rb_float_denominator(x); + } + return INT2FIX(1); +} + +inline static VALUE +f_negate(VALUE x) +{ + if (RB_INTEGER_TYPE_P(x)) { + return rb_int_uminus(x); + } + else if (RB_FLOAT_TYPE_P(x)) { + return rb_float_uminus(x); + } + else if (RB_TYPE_P(x, T_RATIONAL)) { + return rb_rational_uminus(x); + } + else if (RB_TYPE_P(x, T_COMPLEX)) { + return rb_complex_uminus(x); + } + return rb_funcall(x, id_negate, 0); } -fun1(abs) -fun1(abs2) -fun1(arg) -fun1(conj) -fun1(denominator) -fun1(floor) -fun1(imag) -fun1(inspect) -fun1(negate) -fun1(numerator) -fun1(real) -fun1(real_p) +static bool nucomp_real_p(VALUE self); + +static inline bool +f_real_p(VALUE x) +{ + if (RB_INTEGER_TYPE_P(x)) { + return true; + } + else if (RB_FLOAT_TYPE_P(x)) { + return true; + } + else if (RB_TYPE_P(x, T_RATIONAL)) { + return true; + } + else if (RB_TYPE_P(x, T_COMPLEX)) { + return nucomp_real_p(x); + } + return rb_funcall(x, id_real_p, 0); +} inline static VALUE f_to_i(VALUE x) { if (RB_TYPE_P(x, T_STRING)) - return rb_str_to_inum(x, 10, 0); + return rb_str_to_inum(x, 10, 0); return rb_funcall(x, id_to_i, 0); } + inline static VALUE f_to_f(VALUE x) { if (RB_TYPE_P(x, T_STRING)) - return DBL2NUM(rb_str_to_dbl(x, 0)); + return DBL2NUM(rb_str_to_dbl(x, 0)); return rb_funcall(x, id_to_f, 0); } fun1(to_r) -fun1(to_s) -fun2(divmod) - -inline static VALUE +inline static int f_eqeq_p(VALUE x, VALUE y) { if (FIXNUM_P(x) && FIXNUM_P(y)) - return f_boolcast(FIX2LONG(x) == FIX2LONG(y)); - return rb_funcall(x, id_eqeq_p, 1, y); + return x == y; + else if (RB_FLOAT_TYPE_P(x) || RB_FLOAT_TYPE_P(y)) + return NUM2DBL(x) == NUM2DBL(y); + return (int)rb_equal(x, y); } fun2(expt) fun2(fdiv) -fun2(idiv) -fun2(quo) -inline static VALUE +static VALUE +f_quo(VALUE x, VALUE y) +{ + if (RB_INTEGER_TYPE_P(x)) + return rb_numeric_quo(x, y); + if (RB_FLOAT_TYPE_P(x)) + return rb_float_div(x, y); + if (RB_TYPE_P(x, T_RATIONAL)) + return rb_numeric_quo(x, y); + + return rb_funcallv(x, id_quo, 1, &y); +} + +inline static int f_negative_p(VALUE x) { - if (FIXNUM_P(x)) - return f_boolcast(FIX2LONG(x) < 0); - return rb_funcall(x, '<', 1, ZERO); + if (RB_INTEGER_TYPE_P(x)) + return INT_NEGATIVE_P(x); + else if (RB_FLOAT_TYPE_P(x)) + return RFLOAT_VALUE(x) < 0.0; + else if (RB_TYPE_P(x, T_RATIONAL)) + return INT_NEGATIVE_P(RRATIONAL(x)->num); + return rb_num_negative_p(x); } #define f_positive_p(x) (!f_negative_p(x)) -inline static VALUE +inline static bool f_zero_p(VALUE x) { - switch (TYPE(x)) { - case T_FIXNUM: - return f_boolcast(FIX2LONG(x) == 0); - case T_BIGNUM: - return Qfalse; - case T_RATIONAL: - { - VALUE num = RRATIONAL(x)->num; - - return f_boolcast(FIXNUM_P(num) && FIX2LONG(num) == 0); - } + if (RB_FLOAT_TYPE_P(x)) { + return FLOAT_ZERO_P(x); } - return rb_funcall(x, id_eqeq_p, 1, ZERO); -} - -#define f_nonzero_p(x) (!f_zero_p(x)) - -inline static VALUE -f_one_p(VALUE x) -{ - switch (TYPE(x)) { - case T_FIXNUM: - return f_boolcast(FIX2LONG(x) == 1); - case T_BIGNUM: - return Qfalse; - case T_RATIONAL: - { - VALUE num = RRATIONAL(x)->num; - VALUE den = RRATIONAL(x)->den; - - return f_boolcast(FIXNUM_P(num) && FIX2LONG(num) == 1 && - FIXNUM_P(den) && FIX2LONG(den) == 1); - } + else if (RB_INTEGER_TYPE_P(x)) { + return FIXNUM_ZERO_P(x); } - return rb_funcall(x, id_eqeq_p, 1, ONE); -} - -inline static VALUE -f_kind_of_p(VALUE x, VALUE c) -{ - return rb_obj_is_kind_of(x, c); + else if (RB_TYPE_P(x, T_RATIONAL)) { + const VALUE num = RRATIONAL(x)->num; + return FIXNUM_ZERO_P(num); + } + return rb_equal(x, ZERO) != 0; } -inline static VALUE -k_numeric_p(VALUE x) -{ - return f_kind_of_p(x, rb_cNumeric); -} +#define f_nonzero_p(x) (!f_zero_p(x)) -inline static VALUE -k_integer_p(VALUE x) +static inline bool +always_finite_type_p(VALUE x) { - return f_kind_of_p(x, rb_cInteger); + if (FIXNUM_P(x)) return true; + if (FLONUM_P(x)) return true; /* Infinity can't be a flonum */ + return (RB_INTEGER_TYPE_P(x) || RB_TYPE_P(x, T_RATIONAL)); } -inline static VALUE -k_fixnum_p(VALUE x) -{ - return f_kind_of_p(x, rb_cFixnum); -} - -inline static VALUE -k_bignum_p(VALUE x) +inline static int +f_finite_p(VALUE x) { - return f_kind_of_p(x, rb_cBignum); + if (always_finite_type_p(x)) { + return TRUE; + } + else if (RB_FLOAT_TYPE_P(x)) { + return isfinite(RFLOAT_VALUE(x)); + } + return RTEST(rb_funcallv(x, id_finite_p, 0, 0)); } -inline static VALUE -k_float_p(VALUE x) +inline static int +f_infinite_p(VALUE x) { - return f_kind_of_p(x, rb_cFloat); + if (always_finite_type_p(x)) { + return FALSE; + } + else if (RB_FLOAT_TYPE_P(x)) { + return isinf(RFLOAT_VALUE(x)); + } + return RTEST(rb_funcallv(x, id_infinite_p, 0, 0)); } -inline static VALUE -k_rational_p(VALUE x) +inline static int +f_kind_of_p(VALUE x, VALUE c) { - return f_kind_of_p(x, rb_cRational); + return (int)rb_obj_is_kind_of(x, c); } -inline static VALUE -k_complex_p(VALUE x) +inline static int +k_numeric_p(VALUE x) { - return f_kind_of_p(x, rb_cComplex); + return f_kind_of_p(x, rb_cNumeric); } -#define k_exact_p(x) (!k_float_p(x)) -#define k_inexact_p(x) k_float_p(x) +#define k_exact_p(x) (!RB_FLOAT_TYPE_P(x)) #define k_exact_zero_p(x) (k_exact_p(x) && f_zero_p(x)) -#define k_exact_one_p(x) (k_exact_p(x) && f_one_p(x)) #define get_dat1(x) \ - struct RComplex *dat;\ - dat = ((struct RComplex *)(x)) + struct RComplex *dat = RCOMPLEX(x) #define get_dat2(x,y) \ - struct RComplex *adat, *bdat;\ - adat = ((struct RComplex *)(x));\ - bdat = ((struct RComplex *)(y)) + struct RComplex *adat = RCOMPLEX(x), *bdat = RCOMPLEX(y) inline static VALUE nucomp_s_new_internal(VALUE klass, VALUE real, VALUE imag) { - NEWOBJ_OF(obj, struct RComplex, klass, T_COMPLEX); + NEWOBJ_OF(obj, struct RComplex, klass, + T_COMPLEX | (RGENGC_WB_PROTECTED_COMPLEX ? FL_WB_PROTECTED : 0), sizeof(struct RComplex), 0); - obj->real = real; - obj->imag = imag; + RCOMPLEX_SET_REAL(obj, real); + RCOMPLEX_SET_IMAG(obj, imag); + OBJ_FREEZE((VALUE)obj); return (VALUE)obj; } @@ -327,120 +408,86 @@ nucomp_s_alloc(VALUE klass) return nucomp_s_new_internal(klass, ZERO, ZERO); } -#if 0 -static VALUE -nucomp_s_new_bang(int argc, VALUE *argv, VALUE klass) -{ - VALUE real, imag; - - switch (rb_scan_args(argc, argv, "11", &real, &imag)) { - case 1: - if (!k_numeric_p(real)) - real = f_to_i(real); - imag = ZERO; - break; - default: - if (!k_numeric_p(real)) - real = f_to_i(real); - if (!k_numeric_p(imag)) - imag = f_to_i(imag); - break; - } - - return nucomp_s_new_internal(klass, real, imag); -} -#endif - inline static VALUE f_complex_new_bang1(VALUE klass, VALUE x) { - assert(!k_complex_p(x)); + RUBY_ASSERT(!RB_TYPE_P(x, T_COMPLEX)); return nucomp_s_new_internal(klass, x, ZERO); } inline static VALUE f_complex_new_bang2(VALUE klass, VALUE x, VALUE y) { - assert(!k_complex_p(x)); - assert(!k_complex_p(y)); + RUBY_ASSERT(!RB_TYPE_P(x, T_COMPLEX)); + RUBY_ASSERT(!RB_TYPE_P(y, T_COMPLEX)); return nucomp_s_new_internal(klass, x, y); } -#ifdef CANONICALIZATION_FOR_MATHN -#define CANON -#endif - -#ifdef CANON -static int canonicalization = 0; - -RUBY_FUNC_EXPORTED void -nucomp_canonicalization(int f) -{ - canonicalization = f; -} -#endif - -inline static void +WARN_UNUSED_RESULT(inline static VALUE nucomp_real_check(VALUE num)); +inline static VALUE nucomp_real_check(VALUE num) { - switch (TYPE(num)) { - case T_FIXNUM: - case T_BIGNUM: - case T_FLOAT: - case T_RATIONAL: - break; - default: - if (!k_numeric_p(num) || !f_real_p(num)) - rb_raise(rb_eTypeError, "not a real"); + if (!RB_INTEGER_TYPE_P(num) && + !RB_FLOAT_TYPE_P(num) && + !RB_TYPE_P(num, T_RATIONAL)) { + if (RB_TYPE_P(num, T_COMPLEX) && nucomp_real_p(num)) { + VALUE real = RCOMPLEX(num)->real; + RUBY_ASSERT(!RB_TYPE_P(real, T_COMPLEX)); + return real; + } + if (!k_numeric_p(num) || !f_real_p(num)) + rb_raise(rb_eTypeError, "not a real"); } + return num; } inline static VALUE nucomp_s_canonicalize_internal(VALUE klass, VALUE real, VALUE imag) { -#ifdef CANON -#define CL_CANON -#ifdef CL_CANON - if (k_exact_zero_p(imag) && canonicalization) - return real; -#else - if (f_zero_p(imag) && canonicalization) - return real; -#endif -#endif - if (f_real_p(real) && f_real_p(imag)) - return nucomp_s_new_internal(klass, real, imag); - else if (f_real_p(real)) { - get_dat1(imag); + int complex_r, complex_i; + complex_r = RB_TYPE_P(real, T_COMPLEX); + complex_i = RB_TYPE_P(imag, T_COMPLEX); + if (!complex_r && !complex_i) { + return nucomp_s_new_internal(klass, real, imag); + } + else if (!complex_r) { + get_dat1(imag); - return nucomp_s_new_internal(klass, - f_sub(real, dat->imag), - f_add(ZERO, dat->real)); + return nucomp_s_new_internal(klass, + f_sub(real, dat->imag), + f_add(ZERO, dat->real)); } - else if (f_real_p(imag)) { - get_dat1(real); + else if (!complex_i) { + get_dat1(real); - return nucomp_s_new_internal(klass, - dat->real, - f_add(dat->imag, imag)); + return nucomp_s_new_internal(klass, + dat->real, + f_add(dat->imag, imag)); } else { - get_dat2(real, imag); + get_dat2(real, imag); - return nucomp_s_new_internal(klass, - f_sub(adat->real, bdat->imag), - f_add(adat->imag, bdat->real)); + return nucomp_s_new_internal(klass, + f_sub(adat->real, bdat->imag), + f_add(adat->imag, bdat->real)); } } /* * call-seq: - * Complex.rect(real[, imag]) -> complex - * Complex.rectangular(real[, imag]) -> complex + * Complex.rect(real, imag = 0) -> complex * - * Returns a complex object which denotes the given rectangular form. + * Returns a new \Complex object formed from the arguments, + * each of which must be an instance of Numeric, + * or an instance of one of its subclasses: + * \Complex, Float, Integer, Rational; + * see {Rectangular Coordinates}[rdoc-ref:Complex@Rectangular+Coordinates]: * - * Complex.rectangular(1, 2) #=> (1+2i) + * Complex.rect(3) # => (3+0i) + * Complex.rect(3, Math::PI) # => (3+3.141592653589793i) + * Complex.rect(-3, -Math::PI) # => (-3-3.141592653589793i) + * + * \Complex.rectangular is an alias for \Complex.rect. */ static VALUE nucomp_s_new(int argc, VALUE *argv, VALUE klass) @@ -449,69 +496,99 @@ nucomp_s_new(int argc, VALUE *argv, VALUE klass) switch (rb_scan_args(argc, argv, "11", &real, &imag)) { case 1: - nucomp_real_check(real); - imag = ZERO; - break; + real = nucomp_real_check(real); + imag = ZERO; + break; default: - nucomp_real_check(real); - nucomp_real_check(imag); - break; + real = nucomp_real_check(real); + imag = nucomp_real_check(imag); + break; } - return nucomp_s_canonicalize_internal(klass, real, imag); -} - -inline static VALUE -f_complex_new1(VALUE klass, VALUE x) -{ - assert(!k_complex_p(x)); - return nucomp_s_canonicalize_internal(klass, x, ZERO); + return nucomp_s_new_internal(klass, real, imag); } inline static VALUE f_complex_new2(VALUE klass, VALUE x, VALUE y) { - assert(!k_complex_p(x)); + if (RB_TYPE_P(x, T_COMPLEX)) { + get_dat1(x); + x = dat->real; + y = f_add(dat->imag, y); + } return nucomp_s_canonicalize_internal(klass, x, y); } +static VALUE nucomp_convert(VALUE klass, VALUE a1, VALUE a2, int raise); +static VALUE nucomp_s_convert(int argc, VALUE *argv, VALUE klass); + /* * call-seq: - * Complex(x[, y]) -> numeric - * - * Returns x+i*y; - * - * Complex(1, 2) #=> (1+2i) - * Complex('1+2i') #=> (1+2i) - * Complex(nil) #=> TypeError - * Complex(1, nil) #=> TypeError - * - * Syntax of string form: - * - * string form = extra spaces , complex , extra spaces ; - * complex = real part | [ sign ] , imaginary part - * | real part , sign , imaginary part - * | rational , "@" , rational ; - * real part = rational ; - * imaginary part = imaginary unit | unsigned rational , imaginary unit ; - * rational = [ sign ] , unsigned rational ; - * unsigned rational = numerator | numerator , "/" , denominator ; - * numerator = integer part | fractional part | integer part , fractional part ; - * denominator = digits ; - * integer part = digits ; - * fractional part = "." , digits , [ ( "e" | "E" ) , [ sign ] , digits ] ; - * imaginary unit = "i" | "I" | "j" | "J" ; - * sign = "-" | "+" ; - * digits = digit , { digit | "_" , digit }; - * digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ; - * extra spaces = ? \s* ? ; - * - * See String#to_c. + * Complex(real, imag = 0, exception: true) -> complex or nil + * Complex(s, exception: true) -> complex or nil + * + * Returns a new \Complex object if the arguments are valid; + * otherwise raises an exception if +exception+ is +true+; + * otherwise returns +nil+. + * + * With Numeric arguments +real+ and +imag+, + * returns <tt>Complex.rect(real, imag)</tt> if the arguments are valid. + * + * With string argument +s+, returns a new \Complex object if the argument is valid; + * the string may have: + * + * - One or two numeric substrings, + * each of which specifies a Complex, Float, Integer, Numeric, or Rational value, + * specifying {rectangular coordinates}[rdoc-ref:Complex@Rectangular+Coordinates]: + * + * - Sign-separated real and imaginary numeric substrings + * (with trailing character <tt>'i'</tt>): + * + * Complex('1+2i') # => (1+2i) + * Complex('+1+2i') # => (1+2i) + * Complex('+1-2i') # => (1-2i) + * Complex('-1+2i') # => (-1+2i) + * Complex('-1-2i') # => (-1-2i) + * + * - Real-only numeric string (without trailing character <tt>'i'</tt>): + * + * Complex('1') # => (1+0i) + * Complex('+1') # => (1+0i) + * Complex('-1') # => (-1+0i) + * + * - Imaginary-only numeric string (with trailing character <tt>'i'</tt>): + * + * Complex('1i') # => (0+1i) + * Complex('+1i') # => (0+1i) + * Complex('-1i') # => (0-1i) + * + * - At-sign separated real and imaginary rational substrings, + * each of which specifies a Rational value, + * specifying {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates]: + * + * Complex('1/2@3/4') # => (0.36584443443691045+0.34081938001166706i) + * Complex('+1/2@+3/4') # => (0.36584443443691045+0.34081938001166706i) + * Complex('+1/2@-3/4') # => (0.36584443443691045-0.34081938001166706i) + * Complex('-1/2@+3/4') # => (-0.36584443443691045-0.34081938001166706i) + * Complex('-1/2@-3/4') # => (-0.36584443443691045+0.34081938001166706i) + * */ static VALUE nucomp_f_complex(int argc, VALUE *argv, VALUE klass) { - return rb_funcall2(rb_cComplex, id_convert, argc, argv); + VALUE a1, a2, opts = Qnil; + int raise = TRUE; + + if (rb_scan_args(argc, argv, "11:", &a1, &a2, &opts) == 1) { + a2 = Qundef; + } + if (!NIL_P(opts)) { + raise = rb_opts_exception_p(opts, raise); + } + if (argc > 0 && CLASS_OF(a1) == rb_cComplex && UNDEF_P(a2)) { + return a1; + } + return nucomp_convert(rb_cComplex, a1, a2, raise); } #define imp1(n) \ @@ -521,20 +598,9 @@ m_##n##_bang(VALUE x)\ return rb_math_##n(x);\ } -#define imp2(n) \ -inline static VALUE \ -m_##n##_bang(VALUE x, VALUE y)\ -{\ - return rb_math_##n(x, y);\ -} - -imp2(atan2) imp1(cos) imp1(cosh) imp1(exp) -imp2(hypot) - -#define m_hypot(x,y) m_hypot_bang((x),(y)) static VALUE m_log_bang(VALUE x) @@ -544,112 +610,165 @@ m_log_bang(VALUE x) imp1(sin) imp1(sinh) -imp1(sqrt) static VALUE m_cos(VALUE x) { - if (f_real_p(x)) - return m_cos_bang(x); + if (!RB_TYPE_P(x, T_COMPLEX)) + return m_cos_bang(x); { - get_dat1(x); - return f_complex_new2(rb_cComplex, - f_mul(m_cos_bang(dat->real), - m_cosh_bang(dat->imag)), - f_mul(f_negate(m_sin_bang(dat->real)), - m_sinh_bang(dat->imag))); + get_dat1(x); + return f_complex_new2(rb_cComplex, + f_mul(m_cos_bang(dat->real), + m_cosh_bang(dat->imag)), + f_mul(f_negate(m_sin_bang(dat->real)), + m_sinh_bang(dat->imag))); } } static VALUE m_sin(VALUE x) { - if (f_real_p(x)) - return m_sin_bang(x); + if (!RB_TYPE_P(x, T_COMPLEX)) + return m_sin_bang(x); { - get_dat1(x); - return f_complex_new2(rb_cComplex, - f_mul(m_sin_bang(dat->real), - m_cosh_bang(dat->imag)), - f_mul(m_cos_bang(dat->real), - m_sinh_bang(dat->imag))); + get_dat1(x); + return f_complex_new2(rb_cComplex, + f_mul(m_sin_bang(dat->real), + m_cosh_bang(dat->imag)), + f_mul(m_cos_bang(dat->real), + m_sinh_bang(dat->imag))); } } -#if 0 static VALUE -m_sqrt(VALUE x) +f_complex_polar_real(VALUE klass, VALUE x, VALUE y) { - if (f_real_p(x)) { - if (f_positive_p(x)) - return m_sqrt_bang(x); - return f_complex_new2(rb_cComplex, ZERO, m_sqrt_bang(f_negate(x))); + if (f_zero_p(x) || f_zero_p(y)) { + return nucomp_s_new_internal(klass, x, RFLOAT_0); } - else { - get_dat1(x); - - if (f_negative_p(dat->imag)) - return f_conj(m_sqrt(f_conj(x))); - else { - VALUE a = f_abs(x); - return f_complex_new2(rb_cComplex, - m_sqrt_bang(f_div(f_add(a, dat->real), TWO)), - m_sqrt_bang(f_div(f_sub(a, dat->real), TWO))); - } + if (RB_FLOAT_TYPE_P(y)) { + const double arg = RFLOAT_VALUE(y); + if (arg == M_PI) { + x = f_negate(x); + y = RFLOAT_0; + } + else if (arg == M_PI_2) { + y = x; + x = RFLOAT_0; + } + else if (arg == M_PI_2+M_PI) { + y = f_negate(x); + x = RFLOAT_0; + } + else if (RB_FLOAT_TYPE_P(x)) { + const double abs = RFLOAT_VALUE(x); + const double real = abs * cos(arg), imag = abs * sin(arg); + x = DBL2NUM(real); + y = DBL2NUM(imag); + } + else { + const double ax = sin(arg), ay = cos(arg); + y = f_mul(x, DBL2NUM(ax)); + x = f_mul(x, DBL2NUM(ay)); + } + return nucomp_s_new_internal(klass, x, y); } + return nucomp_s_canonicalize_internal(klass, + f_mul(x, m_cos(y)), + f_mul(x, m_sin(y))); } -#endif -inline static VALUE +static VALUE f_complex_polar(VALUE klass, VALUE x, VALUE y) { - assert(!k_complex_p(x)); - assert(!k_complex_p(y)); - return nucomp_s_canonicalize_internal(klass, - f_mul(x, m_cos(y)), - f_mul(x, m_sin(y))); + x = nucomp_real_check(x); + y = nucomp_real_check(y); + return f_complex_polar_real(klass, x, y); +} + +#ifdef HAVE___COSPI +# define cospi(x) __cospi(x) +#else +# define cospi(x) cos((x) * M_PI) +#endif +#ifdef HAVE___SINPI +# define sinpi(x) __sinpi(x) +#else +# define sinpi(x) sin((x) * M_PI) +#endif +/* returns a Complex or Float of ang*PI-rotated abs */ +VALUE +rb_dbl_complex_new_polar_pi(double abs, double ang) +{ + double fi; + const double fr = modf(ang, &fi); + int pos = fr == +0.5; + + if (pos || fr == -0.5) { + if ((modf(fi / 2.0, &fi) != fr) ^ pos) abs = -abs; + return rb_complex_new(RFLOAT_0, DBL2NUM(abs)); + } + else if (fr == 0.0) { + if (modf(fi / 2.0, &fi) != 0.0) abs = -abs; + return DBL2NUM(abs); + } + else { + const double real = abs * cospi(ang), imag = abs * sinpi(ang); + return rb_complex_new(DBL2NUM(real), DBL2NUM(imag)); + } } /* * call-seq: - * Complex.polar(abs[, arg]) -> complex + * Complex.polar(abs, arg = 0) -> complex + * + * Returns a new \Complex object formed from the arguments, + * each of which must be an instance of Numeric, + * or an instance of one of its subclasses: + * \Complex, Float, Integer, Rational. + * Argument +arg+ is given in radians; + * see {Polar Coordinates}[rdoc-ref:Complex@Polar+Coordinates]: * - * Returns a complex object which denotes the given polar form. + * Complex.polar(3) # => (3+0i) + * Complex.polar(3, 2.0) # => (-1.2484405096414273+2.727892280477045i) + * Complex.polar(-3, -2.0) # => (1.2484405096414273+2.727892280477045i) * - * Complex.polar(3, 0) #=> (3.0+0.0i) - * Complex.polar(3, Math::PI/2) #=> (1.836909530733566e-16+3.0i) - * Complex.polar(3, Math::PI) #=> (-3.0+3.673819061467132e-16i) - * Complex.polar(3, -Math::PI/2) #=> (1.836909530733566e-16-3.0i) */ static VALUE nucomp_s_polar(int argc, VALUE *argv, VALUE klass) { VALUE abs, arg; - switch (rb_scan_args(argc, argv, "11", &abs, &arg)) { - case 1: - nucomp_real_check(abs); - arg = ZERO; - break; - default: - nucomp_real_check(abs); - nucomp_real_check(arg); - break; + argc = rb_scan_args(argc, argv, "11", &abs, &arg); + abs = nucomp_real_check(abs); + if (argc == 2) { + arg = nucomp_real_check(arg); } - return f_complex_polar(klass, abs, arg); + else { + arg = ZERO; + } + return f_complex_polar_real(klass, abs, arg); } /* * call-seq: - * cmp.real -> real + * real -> numeric + * + * Returns the real value for +self+: * - * Returns the real part. + * Complex.rect(7).real # => 7 + * Complex.rect(9, -4).real # => 9 + * + * If +self+ was created with + * {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.polar(1, Math::PI/4).real # => 0.7071067811865476 # Square root of 2. * - * Complex(7).real #=> 7 - * Complex(9, -4).real #=> 9 */ -static VALUE -nucomp_real(VALUE self) +VALUE +rb_complex_real(VALUE self) { get_dat1(self); return dat->real; @@ -657,16 +776,22 @@ nucomp_real(VALUE self) /* * call-seq: - * cmp.imag -> real - * cmp.imaginary -> real + * imag -> numeric * - * Returns the imaginary part. + * Returns the imaginary value for +self+: + * + * Complex.rect(7).imag # => 0 + * Complex.rect(9, -4).imag # => -4 + * + * If +self+ was created with + * {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.polar(1, Math::PI/4).imag # => 0.7071067811865476 # Square root of 2. * - * Complex(7).imaginary #=> 0 - * Complex(9, -4).imaginary #=> -4 */ -static VALUE -nucomp_imag(VALUE self) +VALUE +rb_complex_imag(VALUE self) { get_dat1(self); return dat->imag; @@ -674,164 +799,198 @@ nucomp_imag(VALUE self) /* * call-seq: - * -cmp -> complex + * -self -> complex * - * Returns negation of the value. + * Returns +self+, negated, which is the negation of each of its parts: + * + * -Complex.rect(1, 2) # => (-1-2i) + * -Complex.rect(-1, -2) # => (1+2i) * - * -Complex(1, 2) #=> (-1-2i) */ -static VALUE -nucomp_negate(VALUE self) +VALUE +rb_complex_uminus(VALUE self) { - get_dat1(self); - return f_complex_new2(CLASS_OF(self), - f_negate(dat->real), f_negate(dat->imag)); + get_dat1(self); + return f_complex_new2(CLASS_OF(self), + f_negate(dat->real), f_negate(dat->imag)); } -inline static VALUE -f_addsub(VALUE self, VALUE other, - VALUE (*func)(VALUE, VALUE), ID id) +/* + * call-seq: + * self + other -> numeric + * + * Returns the sum of +self+ and +other+: + * + * Complex(1, 2) + 0 # => (1+2i) + * Complex(1, 2) + 1 # => (2+2i) + * Complex(1, 2) + -1 # => (0+2i) + * + * Complex(1, 2) + 1.0 # => (2.0+2i) + * + * Complex(1, 2) + Complex(2, 1) # => (3+3i) + * Complex(1, 2) + Complex(2.0, 1.0) # => (3.0+3.0i) + * + * Complex(1, 2) + Rational(1, 1) # => ((2/1)+2i) + * Complex(1, 2) + Rational(1, 2) # => ((3/2)+2i) + * + * For a computation involving Floats, the result may be inexact (see Float#+): + * + * Complex(1, 2) + 3.14 # => (4.140000000000001+2i) + */ +VALUE +rb_complex_plus(VALUE self, VALUE other) { - if (k_complex_p(other)) { - VALUE real, imag; + if (RB_TYPE_P(other, T_COMPLEX)) { + VALUE real, imag; - get_dat2(self, other); + get_dat2(self, other); - real = (*func)(adat->real, bdat->real); - imag = (*func)(adat->imag, bdat->imag); + real = f_add(adat->real, bdat->real); + imag = f_add(adat->imag, bdat->imag); - return f_complex_new2(CLASS_OF(self), real, imag); + return f_complex_new2(CLASS_OF(self), real, imag); } if (k_numeric_p(other) && f_real_p(other)) { - get_dat1(self); + get_dat1(self); - return f_complex_new2(CLASS_OF(self), - (*func)(dat->real, other), dat->imag); + return f_complex_new2(CLASS_OF(self), + f_add(dat->real, other), dat->imag); } - return rb_num_coerce_bin(self, other, id); + return rb_num_coerce_bin(self, other, '+'); } /* * call-seq: - * cmp + numeric -> complex + * self - other -> complex * - * Performs addition. + * Returns the difference of +self+ and +other+: + * + * Complex.rect(2, 3) - Complex.rect(2, 3) # => (0+0i) + * Complex.rect(900) - Complex.rect(1) # => (899+0i) + * Complex.rect(-2, 9) - Complex.rect(-9, 2) # => (7+7i) + * Complex.rect(9, 8) - 4 # => (5+8i) + * Complex.rect(20, 9) - 9.8 # => (10.2+9i) * - * Complex(2, 3) + Complex(2, 3) #=> (4+6i) - * Complex(900) + Complex(1) #=> (901+0i) - * Complex(-2, 9) + Complex(-9, 2) #=> (-11+11i) - * Complex(9, 8) + 4 #=> (13+8i) - * Complex(20, 9) + 9.8 #=> (29.8+9i) */ -static VALUE -nucomp_add(VALUE self, VALUE other) +VALUE +rb_complex_minus(VALUE self, VALUE other) { - return f_addsub(self, other, f_add, '+'); + if (RB_TYPE_P(other, T_COMPLEX)) { + VALUE real, imag; + + get_dat2(self, other); + + real = f_sub(adat->real, bdat->real); + imag = f_sub(adat->imag, bdat->imag); + + return f_complex_new2(CLASS_OF(self), real, imag); + } + if (k_numeric_p(other) && f_real_p(other)) { + get_dat1(self); + + return f_complex_new2(CLASS_OF(self), + f_sub(dat->real, other), dat->imag); + } + return rb_num_coerce_bin(self, other, '-'); } -/* - * call-seq: - * cmp - numeric -> complex - * - * Performs subtraction. - * - * Complex(2, 3) - Complex(2, 3) #=> (0+0i) - * Complex(900) - Complex(1) #=> (899+0i) - * Complex(-2, 9) - Complex(-9, 2) #=> (7+7i) - * Complex(9, 8) - 4 #=> (5+8i) - * Complex(20, 9) - 9.8 #=> (10.2+9i) - */ static VALUE -nucomp_sub(VALUE self, VALUE other) +safe_mul(VALUE a, VALUE b, bool az, bool bz) { - return f_addsub(self, other, f_sub, '-'); + double v; + if (!az && bz && RB_FLOAT_TYPE_P(a) && (v = RFLOAT_VALUE(a), !isnan(v))) { + a = signbit(v) ? DBL2NUM(-1.0) : DBL2NUM(1.0); + } + if (!bz && az && RB_FLOAT_TYPE_P(b) && (v = RFLOAT_VALUE(b), !isnan(v))) { + b = signbit(v) ? DBL2NUM(-1.0) : DBL2NUM(1.0); + } + return f_mul(a, b); +} + +static void +comp_mul(VALUE areal, VALUE aimag, VALUE breal, VALUE bimag, VALUE *real, VALUE *imag) +{ + bool arzero = f_zero_p(areal); + bool aizero = f_zero_p(aimag); + bool brzero = f_zero_p(breal); + bool bizero = f_zero_p(bimag); + *real = f_sub(safe_mul(areal, breal, arzero, brzero), + safe_mul(aimag, bimag, aizero, bizero)); + *imag = f_add(safe_mul(areal, bimag, arzero, bizero), + safe_mul(aimag, breal, aizero, brzero)); } /* * call-seq: - * cmp * numeric -> complex + * self * other -> numeric * - * Performs multiplication. + * Returns the numeric product of +self+ and +other+: + * + * Complex.rect(9, 8) * 4 # => (36+32i) + * Complex.rect(20, 9) * 9.8 # => (196.0+88.2i) + * Complex.rect(2, 3) * Complex.rect(2, 3) # => (-5+12i) + * Complex.rect(900) * Complex.rect(1) # => (900+0i) + * Complex.rect(-2, 9) * Complex.rect(-9, 2) # => (0-85i) + * Complex.rect(9, 8) * Rational(2, 3) # => ((6/1)+(16/3)*i) * - * Complex(2, 3) * Complex(2, 3) #=> (-5+12i) - * Complex(900) * Complex(1) #=> (900+0i) - * Complex(-2, 9) * Complex(-9, 2) #=> (0-85i) - * Complex(9, 8) * 4 #=> (36+32i) - * Complex(20, 9) * 9.8 #=> (196.0+88.2i) */ -static VALUE -nucomp_mul(VALUE self, VALUE other) +VALUE +rb_complex_mul(VALUE self, VALUE other) { - if (k_complex_p(other)) { - VALUE real, imag; - - get_dat2(self, other); + if (RB_TYPE_P(other, T_COMPLEX)) { + VALUE real, imag; + get_dat2(self, other); - real = f_sub(f_mul(adat->real, bdat->real), - f_mul(adat->imag, bdat->imag)); - imag = f_add(f_mul(adat->real, bdat->imag), - f_mul(adat->imag, bdat->real)); + comp_mul(adat->real, adat->imag, bdat->real, bdat->imag, &real, &imag); - return f_complex_new2(CLASS_OF(self), real, imag); + return f_complex_new2(CLASS_OF(self), real, imag); } if (k_numeric_p(other) && f_real_p(other)) { - get_dat1(self); + get_dat1(self); - return f_complex_new2(CLASS_OF(self), - f_mul(dat->real, other), - f_mul(dat->imag, other)); + return f_complex_new2(CLASS_OF(self), + f_mul(dat->real, other), + f_mul(dat->imag, other)); } return rb_num_coerce_bin(self, other, '*'); } inline static VALUE f_divide(VALUE self, VALUE other, - VALUE (*func)(VALUE, VALUE), ID id) -{ - if (k_complex_p(other)) { - int flo; - get_dat2(self, other); - - flo = (k_float_p(adat->real) || k_float_p(adat->imag) || - k_float_p(bdat->real) || k_float_p(bdat->imag)); - - if (f_gt_p(f_abs(bdat->real), f_abs(bdat->imag))) { - VALUE r, n; - - r = (*func)(bdat->imag, bdat->real); - n = f_mul(bdat->real, f_add(ONE, f_mul(r, r))); - if (flo) - return f_complex_new2(CLASS_OF(self), - (*func)(self, n), - (*func)(f_negate(f_mul(self, r)), n)); - return f_complex_new2(CLASS_OF(self), - (*func)(f_add(adat->real, - f_mul(adat->imag, r)), n), - (*func)(f_sub(adat->imag, - f_mul(adat->real, r)), n)); - } - else { - VALUE r, n; - - r = (*func)(bdat->real, bdat->imag); - n = f_mul(bdat->imag, f_add(ONE, f_mul(r, r))); - if (flo) - return f_complex_new2(CLASS_OF(self), - (*func)(f_mul(self, r), n), - (*func)(f_negate(self), n)); - return f_complex_new2(CLASS_OF(self), - (*func)(f_add(f_mul(adat->real, r), - adat->imag), n), - (*func)(f_sub(f_mul(adat->imag, r), - adat->real), n)); - } + VALUE (*func)(VALUE, VALUE), ID id) +{ + if (RB_TYPE_P(other, T_COMPLEX)) { + VALUE r, n, x, y; + int flo; + get_dat2(self, other); + + flo = (RB_FLOAT_TYPE_P(adat->real) || RB_FLOAT_TYPE_P(adat->imag) || + RB_FLOAT_TYPE_P(bdat->real) || RB_FLOAT_TYPE_P(bdat->imag)); + + if (f_gt_p(f_abs(bdat->real), f_abs(bdat->imag))) { + r = (*func)(bdat->imag, bdat->real); + n = f_mul(bdat->real, f_add(ONE, f_mul(r, r))); + x = (*func)(f_add(adat->real, f_mul(adat->imag, r)), n); + y = (*func)(f_sub(adat->imag, f_mul(adat->real, r)), n); + } + else { + r = (*func)(bdat->real, bdat->imag); + n = f_mul(bdat->imag, f_add(ONE, f_mul(r, r))); + x = (*func)(f_add(f_mul(adat->real, r), adat->imag), n); + y = (*func)(f_sub(f_mul(adat->imag, r), adat->real), n); + } + if (!flo) { + x = rb_rational_canonicalize(x); + y = rb_rational_canonicalize(y); + } + return f_complex_new2(CLASS_OF(self), x, y); } if (k_numeric_p(other) && f_real_p(other)) { - get_dat1(self); - - return f_complex_new2(CLASS_OF(self), - (*func)(dat->real, other), - (*func)(dat->imag, other)); + VALUE x, y; + get_dat1(self); + x = rb_rational_canonicalize((*func)(dat->real, other)); + y = rb_rational_canonicalize((*func)(dat->imag, other)); + return f_complex_new2(CLASS_OF(self), x, y); } return rb_num_coerce_bin(self, other, id); } @@ -840,32 +999,33 @@ f_divide(VALUE self, VALUE other, /* * call-seq: - * cmp / numeric -> complex - * cmp.quo(numeric) -> complex + * self / other -> complex + * + * Returns the quotient of +self+ and +other+: * - * Performs division. + * Complex.rect(2, 3) / Complex.rect(2, 3) # => (1+0i) + * Complex.rect(900) / Complex.rect(1) # => (900+0i) + * Complex.rect(-2, 9) / Complex.rect(-9, 2) # => ((36/85)-(77/85)*i) + * Complex.rect(9, 8) / 4 # => ((9/4)+2i) + * Complex.rect(20, 9) / 9.8 # => (2.0408163265306123+0.9183673469387754i) * - * Complex(2, 3) / Complex(2, 3) #=> ((1/1)+(0/1)*i) - * Complex(900) / Complex(1) #=> ((900/1)+(0/1)*i) - * Complex(-2, 9) / Complex(-9, 2) #=> ((36/85)-(77/85)*i) - * Complex(9, 8) / 4 #=> ((9/4)+(2/1)*i) - * Complex(20, 9) / 9.8 #=> (2.0408163265306123+0.9183673469387754i) */ -static VALUE -nucomp_div(VALUE self, VALUE other) +VALUE +rb_complex_div(VALUE self, VALUE other) { return f_divide(self, other, f_quo, id_quo); } -#define nucomp_quo nucomp_div +#define nucomp_quo rb_complex_div /* * call-seq: - * cmp.fdiv(numeric) -> complex + * fdiv(numeric) -> new_complex * - * Performs division as each part is a float, never returns a float. + * Returns <tt>Complex.rect(self.real/numeric, self.imag/numeric)</tt>: + * + * Complex.rect(11, 22).fdiv(3) # => (3.6666666666666665+7.333333333333333i) * - * Complex(11, 22).fdiv(3) #=> (3.6666666666666665+7.333333333333333i) */ static VALUE nucomp_fdiv(VALUE self, VALUE other) @@ -879,209 +1039,394 @@ f_reciprocal(VALUE x) return f_quo(ONE, x); } +static VALUE +zero_for(VALUE x) +{ + if (RB_FLOAT_TYPE_P(x)) + return DBL2NUM(0); + if (RB_TYPE_P(x, T_RATIONAL)) + return rb_rational_new(INT2FIX(0), INT2FIX(1)); + + return INT2FIX(0); +} + +static VALUE +complex_pow_for_special_angle(VALUE self, VALUE other) +{ + if (!rb_integer_type_p(other)) { + return Qundef; + } + + get_dat1(self); + VALUE x = Qundef; + int dir; + if (f_zero_p(dat->imag)) { + x = dat->real; + dir = 0; + } + else if (f_zero_p(dat->real)) { + x = dat->imag; + dir = 2; + } + else if (f_eqeq_p(dat->real, dat->imag)) { + x = dat->real; + dir = 1; + } + else if (f_eqeq_p(dat->real, f_negate(dat->imag))) { + x = dat->imag; + dir = 3; + } + else { + dir = 0; + } + + if (UNDEF_P(x)) return x; + + if (f_negative_p(x)) { + x = f_negate(x); + dir += 4; + } + + VALUE zx; + if (dir % 2 == 0) { + zx = rb_num_pow(x, other); + } + else { + zx = rb_num_pow( + rb_funcall(rb_int_mul(TWO, x), '*', 1, x), + rb_int_div(other, TWO) + ); + if (rb_int_odd_p(other)) { + zx = rb_funcall(zx, '*', 1, x); + } + } + static const int dirs[][2] = { + {1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1} + }; + int z_dir = FIX2INT(rb_int_modulo(rb_int_mul(INT2FIX(dir), other), INT2FIX(8))); + + VALUE zr = Qfalse, zi = Qfalse; + switch (dirs[z_dir][0]) { + case 0: zr = zero_for(zx); break; + case 1: zr = zx; break; + case -1: zr = f_negate(zx); break; + } + switch (dirs[z_dir][1]) { + case 0: zi = zero_for(zx); break; + case 1: zi = zx; break; + case -1: zi = f_negate(zx); break; + } + return nucomp_s_new_internal(CLASS_OF(self), zr, zi); +} + + /* * call-seq: - * cmp ** numeric -> complex + * self ** exponent -> complex * - * Performs exponentiation. + * Returns +self+ raised to the power +exponent+: + * + * Complex.rect(0, 1) ** 2 # => (-1+0i) + * Complex.rect(-8) ** Rational(1, 3) # => (1.0000000000000002+1.7320508075688772i) * - * Complex('i') ** 2 #=> (-1+0i) - * Complex(-8) ** Rational(1, 3) #=> (1.0000000000000002+1.7320508075688772i) */ -static VALUE -nucomp_expt(VALUE self, VALUE other) +VALUE +rb_complex_pow(VALUE self, VALUE other) { if (k_numeric_p(other) && k_exact_zero_p(other)) - return f_complex_new_bang1(CLASS_OF(self), ONE); + return f_complex_new_bang1(CLASS_OF(self), ONE); - if (k_rational_p(other) && f_one_p(f_denominator(other))) - other = f_numerator(other); /* c14n */ + if (RB_TYPE_P(other, T_RATIONAL) && RRATIONAL(other)->den == LONG2FIX(1)) + other = RRATIONAL(other)->num; /* c14n */ - if (k_complex_p(other)) { - get_dat1(other); + if (RB_TYPE_P(other, T_COMPLEX)) { + get_dat1(other); - if (k_exact_zero_p(dat->imag)) - other = dat->real; /* c14n */ + if (k_exact_zero_p(dat->imag)) + other = dat->real; /* c14n */ } - if (k_complex_p(other)) { - VALUE r, theta, nr, ntheta; - - get_dat1(other); - - r = f_abs(self); - theta = f_arg(self); - - nr = m_exp_bang(f_sub(f_mul(dat->real, m_log_bang(r)), - f_mul(dat->imag, theta))); - ntheta = f_add(f_mul(theta, dat->real), - f_mul(dat->imag, m_log_bang(r))); - return f_complex_polar(CLASS_OF(self), nr, ntheta); + if (other == ONE) { + get_dat1(self); + return nucomp_s_new_internal(CLASS_OF(self), dat->real, dat->imag); } - if (k_fixnum_p(other)) { - if (f_gt_p(other, ZERO)) { - VALUE x, z; - long n; - x = self; - z = x; - n = FIX2LONG(other) - 1; + VALUE result = complex_pow_for_special_angle(self, other); + if (!UNDEF_P(result)) return result; - while (n) { - long q, r; + if (RB_TYPE_P(other, T_COMPLEX)) { + VALUE r, theta, nr, ntheta; - while (1) { - get_dat1(x); + get_dat1(other); - q = n / 2; - r = n % 2; + r = f_abs(self); + theta = f_arg(self); - if (r) - break; - - x = nucomp_s_new_internal(CLASS_OF(self), - f_sub(f_mul(dat->real, dat->real), - f_mul(dat->imag, dat->imag)), - f_mul(f_mul(TWO, dat->real), dat->imag)); - n = q; - } - z = f_mul(z, x); - n--; - } - return z; - } - return f_expt(f_reciprocal(self), f_negate(other)); + nr = m_exp_bang(f_sub(f_mul(dat->real, m_log_bang(r)), + f_mul(dat->imag, theta))); + ntheta = f_add(f_mul(theta, dat->real), + f_mul(dat->imag, m_log_bang(r))); + return f_complex_polar(CLASS_OF(self), nr, ntheta); + } + if (FIXNUM_P(other)) { + long n = FIX2LONG(other); + if (n == 0) { + return nucomp_s_new_internal(CLASS_OF(self), ONE, ZERO); + } + if (n < 0) { + self = f_reciprocal(self); + other = rb_int_uminus(other); + n = -n; + } + { + get_dat1(self); + VALUE xr = dat->real, xi = dat->imag, zr = xr, zi = xi; + + if (f_zero_p(xi)) { + zr = rb_num_pow(zr, other); + } + else if (f_zero_p(xr)) { + zi = rb_num_pow(zi, other); + if (n & 2) zi = f_negate(zi); + if (!(n & 1)) { + VALUE tmp = zr; + zr = zi; + zi = tmp; + } + } + else { + while (--n) { + long q, r; + + for (; q = n / 2, r = n % 2, r == 0; n = q) { + VALUE tmp = f_sub(f_mul(xr, xr), f_mul(xi, xi)); + xi = f_mul(f_mul(TWO, xr), xi); + xr = tmp; + } + comp_mul(zr, zi, xr, xi, &zr, &zi); + } + } + return nucomp_s_new_internal(CLASS_OF(self), zr, zi); + } } if (k_numeric_p(other) && f_real_p(other)) { - VALUE r, theta; + VALUE r, theta; - if (k_bignum_p(other)) - rb_warn("in a**b, b may be too big"); + if (RB_BIGNUM_TYPE_P(other)) + rb_warn("in a**b, b may be too big"); - r = f_abs(self); - theta = f_arg(self); + r = f_abs(self); + theta = f_arg(self); - return f_complex_polar(CLASS_OF(self), f_expt(r, other), - f_mul(theta, other)); + return f_complex_polar(CLASS_OF(self), f_expt(r, other), + f_mul(theta, other)); } return rb_num_coerce_bin(self, other, id_expt); } /* * call-seq: - * cmp == object -> true or false + * self == other -> true or false + * + * Returns whether both <tt>self.real == other.real</tt> + * and <tt>self.imag == other.imag</tt>: * - * Returns true if cmp equals object numerically. + * Complex.rect(2, 3) == Complex.rect(2.0, 3.0) # => true * - * Complex(2, 3) == Complex(2, 3) #=> true - * Complex(5) == 5 #=> true - * Complex(0) == 0.0 #=> true - * Complex('1/3') == 0.33 #=> false - * Complex('1/2') == '1/2' #=> false */ static VALUE nucomp_eqeq_p(VALUE self, VALUE other) { - if (k_complex_p(other)) { - get_dat2(self, other); + if (RB_TYPE_P(other, T_COMPLEX)) { + get_dat2(self, other); - return f_boolcast(f_eqeq_p(adat->real, bdat->real) && - f_eqeq_p(adat->imag, bdat->imag)); + return RBOOL(f_eqeq_p(adat->real, bdat->real) && + f_eqeq_p(adat->imag, bdat->imag)); } if (k_numeric_p(other) && f_real_p(other)) { - get_dat1(self); + get_dat1(self); - return f_boolcast(f_eqeq_p(dat->real, other) && f_zero_p(dat->imag)); + return RBOOL(f_eqeq_p(dat->real, other) && f_zero_p(dat->imag)); } - return f_eqeq_p(other, self); + return RBOOL(f_eqeq_p(other, self)); +} + +static bool +nucomp_real_p(VALUE self) +{ + get_dat1(self); + return f_zero_p(dat->imag); +} + +/* + * call-seq: + * self <=> other -> -1, 0, 1, or nil + * + * Compares +self+ and +other+. + * + * Returns: + * + * - <tt>self.real <=> other.real</tt> if both of the following are true: + * + * - <tt>self.imag == 0</tt>. + * - <tt>other.imag == 0</tt> (always true if +other+ is numeric but not complex). + * + * - +nil+ otherwise. + * + * Examples: + * + * Complex.rect(2) <=> 3 # => -1 + * Complex.rect(2) <=> 2 # => 0 + * Complex.rect(2) <=> 1 # => 1 + * Complex.rect(2, 1) <=> 1 # => nil # self.imag not zero. + * Complex.rect(1) <=> Complex.rect(1, 1) # => nil # object.imag not zero. + * Complex.rect(1) <=> 'Foo' # => nil # object.imag not defined. + * + * \Class \Complex includes module Comparable, + * each of whose methods uses Complex#<=> for comparison. + */ +static VALUE +nucomp_cmp(VALUE self, VALUE other) +{ + if (!k_numeric_p(other)) { + return rb_num_coerce_cmp(self, other, idCmp); + } + if (!nucomp_real_p(self)) { + return Qnil; + } + if (RB_TYPE_P(other, T_COMPLEX)) { + if (nucomp_real_p(other)) { + get_dat2(self, other); + return rb_funcall(adat->real, idCmp, 1, bdat->real); + } + } + else { + get_dat1(self); + if (f_real_p(other)) { + return rb_funcall(dat->real, idCmp, 1, other); + } + else { + return rb_num_coerce_cmp(dat->real, other, idCmp); + } + } + return Qnil; } /* :nodoc: */ static VALUE nucomp_coerce(VALUE self, VALUE other) { - if (k_numeric_p(other) && f_real_p(other)) - return rb_assoc_new(f_complex_new_bang1(CLASS_OF(self), other), self); if (RB_TYPE_P(other, T_COMPLEX)) - return rb_assoc_new(other, self); + return rb_assoc_new(other, self); + if (k_numeric_p(other) && f_real_p(other)) + return rb_assoc_new(f_complex_new_bang1(CLASS_OF(self), other), self); - rb_raise(rb_eTypeError, "%s can't be coerced into %s", - rb_obj_classname(other), rb_obj_classname(self)); + rb_raise(rb_eTypeError, "%"PRIsVALUE" can't be coerced into %"PRIsVALUE, + rb_obj_class(other), rb_obj_class(self)); return Qnil; } /* * call-seq: - * cmp.abs -> real - * cmp.magnitude -> real + * abs -> float + * + * Returns the absolute value (magnitude) for +self+; + * see {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates]: * - * Returns the absolute part of its polar form. + * Complex.polar(-1, 0).abs # => 1.0 + * + * If +self+ was created with + * {rectangular coordinates}[rdoc-ref:Complex@Rectangular+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.rectangular(1, 1).abs # => 1.4142135623730951 # The square root of 2. * - * Complex(-1).abs #=> 1 - * Complex(3.0, -4.0).abs #=> 5.0 */ -static VALUE -nucomp_abs(VALUE self) +VALUE +rb_complex_abs(VALUE self) { get_dat1(self); if (f_zero_p(dat->real)) { - VALUE a = f_abs(dat->imag); - if (k_float_p(dat->real) && !k_float_p(dat->imag)) - a = f_to_f(a); - return a; + VALUE a = f_abs(dat->imag); + if (RB_FLOAT_TYPE_P(dat->real) && !RB_FLOAT_TYPE_P(dat->imag)) + a = f_to_f(a); + return a; } if (f_zero_p(dat->imag)) { - VALUE a = f_abs(dat->real); - if (!k_float_p(dat->real) && k_float_p(dat->imag)) - a = f_to_f(a); - return a; + VALUE a = f_abs(dat->real); + if (!RB_FLOAT_TYPE_P(dat->real) && RB_FLOAT_TYPE_P(dat->imag)) + a = f_to_f(a); + return a; } - return m_hypot(dat->real, dat->imag); + return rb_math_hypot(dat->real, dat->imag); } /* * call-seq: - * cmp.abs2 -> real + * abs2 -> float * - * Returns square of the absolute value. + * Returns square of the absolute value (magnitude) for +self+; + * see {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates]: + * + * Complex.polar(2, 2).abs2 # => 4.0 + * + * If +self+ was created with + * {rectangular coordinates}[rdoc-ref:Complex@Rectangular+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.rectangular(1.0/3, 1.0/3).abs2 # => 0.2222222222222222 * - * Complex(-1).abs2 #=> 1 - * Complex(3.0, -4.0).abs2 #=> 25.0 */ static VALUE nucomp_abs2(VALUE self) { get_dat1(self); return f_add(f_mul(dat->real, dat->real), - f_mul(dat->imag, dat->imag)); + f_mul(dat->imag, dat->imag)); } /* * call-seq: - * cmp.arg -> float - * cmp.angle -> float - * cmp.phase -> float + * arg -> float + * + * Returns the argument (angle) for +self+ in radians; + * see {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates]: + * + * Complex.polar(3, Math::PI/2).arg # => 1.57079632679489660 * - * Returns the angle part of its polar form. + * If +self+ was created with + * {rectangular coordinates}[rdoc-ref:Complex@Rectangular+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.polar(1, 1.0/3).arg # => 0.33333333333333326 * - * Complex.polar(3, Math::PI/2).arg #=> 1.5707963267948966 */ -static VALUE -nucomp_arg(VALUE self) +VALUE +rb_complex_arg(VALUE self) { get_dat1(self); - return m_atan2_bang(dat->imag, dat->real); + return rb_math_atan2(dat->imag, dat->real); } /* * call-seq: - * cmp.rect -> array - * cmp.rectangular -> array + * rect -> array + * + * Returns the array <tt>[self.real, self.imag]</tt>: * - * Returns an array; [cmp.real, cmp.imag]. + * Complex.rect(1, 2).rect # => [1, 2] * - * Complex(1, 2).rectangular #=> [1, 2] + * See {Rectangular Coordinates}[rdoc-ref:Complex@Rectangular+Coordinates]. + * + * If +self+ was created with + * {polar coordinates}[rdoc-ref:Complex@Polar+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.polar(1.0, 1.0).rect # => [0.5403023058681398, 0.8414709848078965] + * + * + * Complex#rectangular is an alias for Complex#rect. */ static VALUE nucomp_rect(VALUE self) @@ -1092,11 +1437,20 @@ nucomp_rect(VALUE self) /* * call-seq: - * cmp.polar -> array + * polar -> array + * + * Returns the array <tt>[self.abs, self.arg]</tt>: * - * Returns an array; [cmp.abs, cmp.arg]. + * Complex.polar(1, 2).polar # => [1.0, 2.0] + * + * See {Polar Coordinates}[rdoc-ref:Complex@Polar+Coordinates]. + * + * If +self+ was created with + * {rectangular coordinates}[rdoc-ref:Complex@Rectangular+Coordinates], the returned value + * is computed, and may be inexact: + * + * Complex.rect(1, 1).polar # => [1.4142135623730951, 0.7853981633974483] * - * Complex(1, 2).polar #=> [2.23606797749979, 1.1071487177940904] */ static VALUE nucomp_polar(VALUE self) @@ -1106,65 +1460,45 @@ nucomp_polar(VALUE self) /* * call-seq: - * cmp.conj -> complex - * cmp.conjugate -> complex + * conj -> complex + * + * Returns the conjugate of +self+, <tt>Complex.rect(self.imag, self.real)</tt>: * - * Returns the complex conjugate. + * Complex.rect(1, 2).conj # => (1-2i) * - * Complex(1, 2).conjugate #=> (1-2i) */ -static VALUE -nucomp_conj(VALUE self) +VALUE +rb_complex_conjugate(VALUE self) { get_dat1(self); return f_complex_new2(CLASS_OF(self), dat->real, f_negate(dat->imag)); } -#if 0 -/* :nodoc: */ -static VALUE -nucomp_true(VALUE self) -{ - return Qtrue; -} -#endif - /* * call-seq: - * cmp.real? -> false + * real? -> false * - * Returns false. + * Returns +false+; for compatibility with Numeric#real?. */ static VALUE -nucomp_false(VALUE self) +nucomp_real_p_m(VALUE self) { return Qfalse; } -#if 0 -/* :nodoc: */ -static VALUE -nucomp_exact_p(VALUE self) -{ - get_dat1(self); - return f_boolcast(k_exact_p(dat->real) && k_exact_p(dat->imag)); -} - -/* :nodoc: */ -static VALUE -nucomp_inexact_p(VALUE self) -{ - return f_boolcast(!nucomp_exact_p(self)); -} -#endif - /* * call-seq: - * cmp.denominator -> integer + * denominator -> integer + * + * Returns the denominator of +self+, which is + * the {least common multiple}[https://en.wikipedia.org/wiki/Least_common_multiple] + * of <tt>self.real.denominator</tt> and <tt>self.imag.denominator</tt>: + * + * Complex.rect(Rational(1, 2), Rational(2, 3)).denominator # => 6 * - * Returns the denominator (lcm of both denominator - real and imag). + * Note that <tt>n.denominator</tt> of a non-rational numeric is +1+. * - * See numerator. + * Related: Complex#numerator. */ static VALUE nucomp_denominator(VALUE self) @@ -1175,21 +1509,23 @@ nucomp_denominator(VALUE self) /* * call-seq: - * cmp.numerator -> numeric + * numerator -> new_complex * - * Returns the numerator. + * Returns the \Complex object created from the numerators + * of the real and imaginary parts of +self+, + * after converting each part to the + * {lowest common denominator}[https://en.wikipedia.org/wiki/Lowest_common_denominator] + * of the two: * - * 1 2 3+4i <- numerator - * - + -i -> ---- - * 2 3 6 <- denominator + * c = Complex.rect(Rational(2, 3), Rational(3, 4)) # => ((2/3)+(3/4)*i) + * c.numerator # => (8+9i) * - * c = Complex('1/2+2/3i') #=> ((1/2)+(2/3)*i) - * n = c.numerator #=> (3+4i) - * d = c.denominator #=> 6 - * n / d #=> ((1/2)+(2/3)*i) - * Complex(Rational(n.real, d), Rational(n.imag, d)) - * #=> ((1/2)+(2/3)*i) - * See denominator. + * In this example, the lowest common denominator of the two parts is 12; + * the two converted parts may be thought of as \Rational(8, 12) and \Rational(9, 12), + * whose numerators, respectively, are 8 and 9; + * so the returned value of <tt>c.numerator</tt> is <tt>Complex.rect(8, 9)</tt>. + * + * Related: Complex#denominator. */ static VALUE nucomp_numerator(VALUE self) @@ -1198,17 +1534,17 @@ nucomp_numerator(VALUE self) get_dat1(self); - cd = f_denominator(self); + cd = nucomp_denominator(self); return f_complex_new2(CLASS_OF(self), - f_mul(f_numerator(dat->real), - f_div(cd, f_denominator(dat->real))), - f_mul(f_numerator(dat->imag), - f_div(cd, f_denominator(dat->imag)))); + f_mul(f_numerator(dat->real), + f_div(cd, f_denominator(dat->real))), + f_mul(f_numerator(dat->imag), + f_div(cd, f_denominator(dat->imag)))); } /* :nodoc: */ -static VALUE -nucomp_hash(VALUE self) +st_index_t +rb_complex_hash(VALUE self) { st_index_t v, h[2]; VALUE n; @@ -1219,61 +1555,73 @@ nucomp_hash(VALUE self) n = rb_hash(dat->imag); h[1] = NUM2LONG(n); v = rb_memhash(h, sizeof(h)); - return LONG2FIX(v); + return v; +} + +/* + * :call-seq: + * hash -> integer + * + * Returns the integer hash value for +self+. + * + * Two \Complex objects created from the same values will have the same hash value + * (and will compare using #eql?): + * + * Complex.rect(1, 2).hash == Complex.rect(1, 2).hash # => true + * + */ +static VALUE +nucomp_hash(VALUE self) +{ + return ST2FIX(rb_complex_hash(self)); } /* :nodoc: */ static VALUE nucomp_eql_p(VALUE self, VALUE other) { - if (k_complex_p(other)) { - get_dat2(self, other); + if (RB_TYPE_P(other, T_COMPLEX)) { + get_dat2(self, other); - return f_boolcast((CLASS_OF(adat->real) == CLASS_OF(bdat->real)) && - (CLASS_OF(adat->imag) == CLASS_OF(bdat->imag)) && - f_eqeq_p(self, other)); + return RBOOL((CLASS_OF(adat->real) == CLASS_OF(bdat->real)) && + (CLASS_OF(adat->imag) == CLASS_OF(bdat->imag)) && + f_eqeq_p(self, other)); } return Qfalse; } -inline static VALUE +inline static int f_signbit(VALUE x) { -#if defined(HAVE_SIGNBIT) && defined(__GNUC__) && defined(__sun) && \ - !defined(signbit) - extern int signbit(double); -#endif - switch (TYPE(x)) { - case T_FLOAT: { - double f = RFLOAT_VALUE(x); - return f_boolcast(!isnan(f) && signbit(f)); - } + if (RB_FLOAT_TYPE_P(x)) { + double f = RFLOAT_VALUE(x); + return !isnan(f) && signbit(f); } return f_negative_p(x); } -inline static VALUE +inline static int f_tpositive_p(VALUE x) { - return f_boolcast(!f_signbit(x)); + return !f_signbit(x); } static VALUE -f_format(VALUE self, VALUE (*func)(VALUE)) +f_format(VALUE self, VALUE s, VALUE (*func)(VALUE)) { - VALUE s, impos; + int impos; get_dat1(self); impos = f_tpositive_p(dat->imag); - s = (*func)(dat->real); + rb_str_concat(s, (*func)(dat->real)); rb_str_cat2(s, !impos ? "-" : "+"); rb_str_concat(s, (*func)(f_abs(dat->imag))); if (!rb_isdigit(RSTRING_PTR(s)[RSTRING_LEN(s) - 1])) - rb_str_cat2(s, "*"); + rb_str_cat2(s, "*"); rb_str_cat2(s, "i"); return s; @@ -1281,33 +1629,35 @@ f_format(VALUE self, VALUE (*func)(VALUE)) /* * call-seq: - * cmp.to_s -> string + * to_s -> string + * + * Returns a string representation of +self+: * - * Returns the value as a string. + * Complex.rect(2).to_s # => "2+0i" + * Complex.rect(-8, 6).to_s # => "-8+6i" + * Complex.rect(0, Rational(1, 2)).to_s # => "0+1/2i" + * Complex.rect(0, Float::INFINITY).to_s # => "0+Infinity*i" + * Complex.rect(Float::NAN, Float::NAN).to_s # => "NaN+NaN*i" * - * Complex(2).to_s #=> "2+0i" - * Complex('-8/6').to_s #=> "-4/3+0i" - * Complex('1/2i').to_s #=> "0+1/2i" - * Complex(0, Float::INFINITY).to_s #=> "0+Infinity*i" - * Complex(Float::NAN, Float::NAN).to_s #=> "NaN+NaN*i" */ static VALUE nucomp_to_s(VALUE self) { - return f_format(self, f_to_s); + return f_format(self, rb_usascii_str_new2(""), rb_String); } /* * call-seq: - * cmp.inspect -> string + * inspect -> string * - * Returns the value as a string for inspection. + * Returns a string representation of +self+: + * + * Complex.rect(2).inspect # => "(2+0i)" + * Complex.rect(-8, 6).inspect # => "(-8+6i)" + * Complex.rect(0, Rational(1, 2)).inspect # => "(0+(1/2)*i)" + * Complex.rect(0, Float::INFINITY).inspect # => "(0+Infinity*i)" + * Complex.rect(Float::NAN, Float::NAN).inspect # => "(NaN+NaN*i)" * - * Complex(2).inspect #=> "(2+0i)" - * Complex('-8/6').inspect #=> "((-4/3)+0i)" - * Complex('1/2i').inspect #=> "(0+(1/2)*i)" - * Complex(0, Float::INFINITY).inspect #=> "(0+Infinity*i)" - * Complex(Float::NAN, Float::NAN).inspect #=> "(NaN+NaN*i)" */ static VALUE nucomp_inspect(VALUE self) @@ -1315,12 +1665,57 @@ nucomp_inspect(VALUE self) VALUE s; s = rb_usascii_str_new2("("); - rb_str_concat(s, f_format(self, f_inspect)); + f_format(self, s, rb_inspect); rb_str_cat2(s, ")"); return s; } +#define FINITE_TYPE_P(v) (RB_INTEGER_TYPE_P(v) || RB_TYPE_P(v, T_RATIONAL)) + +/* + * call-seq: + * finite? -> true or false + * + * Returns +true+ if both <tt>self.real.finite?</tt> and <tt>self.imag.finite?</tt> + * are true, +false+ otherwise: + * + * Complex.rect(1, 1).finite? # => true + * Complex.rect(Float::INFINITY, 0).finite? # => false + * + * Related: Numeric#finite?, Float#finite?. + */ +static VALUE +rb_complex_finite_p(VALUE self) +{ + get_dat1(self); + + return RBOOL(f_finite_p(dat->real) && f_finite_p(dat->imag)); +} + +/* + * call-seq: + * infinite? -> 1 or nil + * + * Returns +1+ if either <tt>self.real.infinite?</tt> or <tt>self.imag.infinite?</tt> + * is true, +nil+ otherwise: + * + * Complex.rect(Float::INFINITY, 0).infinite? # => 1 + * Complex.rect(1, 1).infinite? # => nil + * + * Related: Numeric#infinite?, Float#infinite?. + */ +static VALUE +rb_complex_infinite_p(VALUE self) +{ + get_dat1(self); + + if (!f_infinite_p(dat->real) && !f_infinite_p(dat->imag)) { + return Qnil; + } + return ONE; +} + /* :nodoc: */ static VALUE nucomp_dumper(VALUE self) @@ -1334,8 +1729,9 @@ nucomp_loader(VALUE self, VALUE a) { get_dat1(self); - dat->real = rb_ivar_get(a, id_i_real); - dat->imag = rb_ivar_get(a, id_i_imag); + RCOMPLEX_SET_REAL(dat, rb_ivar_get(a, id_i_real)); + RCOMPLEX_SET_IMAG(dat, rb_ivar_get(a, id_i_imag)); + OBJ_FREEZE(self); return self; } @@ -1358,14 +1754,12 @@ nucomp_marshal_load(VALUE self, VALUE a) { Check_Type(a, T_ARRAY); if (RARRAY_LEN(a) != 2) - rb_raise(rb_eArgError, "marshaled complex must have an array whose length is 2 but %ld", RARRAY_LEN(a)); - rb_ivar_set(self, id_i_real, RARRAY_PTR(a)[0]); - rb_ivar_set(self, id_i_imag, RARRAY_PTR(a)[1]); + rb_raise(rb_eArgError, "marshaled complex must have an array whose length is 2 but %ld", RARRAY_LEN(a)); + rb_ivar_set(self, id_i_real, RARRAY_AREF(a, 0)); + rb_ivar_set(self, id_i_imag, RARRAY_AREF(a, 1)); return self; } -/* --- */ - VALUE rb_complex_raw(VALUE x, VALUE y) { @@ -1379,13 +1773,11 @@ rb_complex_new(VALUE x, VALUE y) } VALUE -rb_complex_polar(VALUE x, VALUE y) +rb_complex_new_polar(VALUE x, VALUE y) { return f_complex_polar(rb_cComplex, x, y); } -static VALUE nucomp_s_convert(int argc, VALUE *argv, VALUE klass); - VALUE rb_Complex(VALUE x, VALUE y) { @@ -1395,116 +1787,145 @@ rb_Complex(VALUE x, VALUE y) return nucomp_s_convert(2, a, rb_cComplex); } +VALUE +rb_dbl_complex_new(double real, double imag) +{ + return rb_complex_raw(DBL2NUM(real), DBL2NUM(imag)); +} + /* * call-seq: - * cmp.to_i -> integer + * to_i -> integer + * + * Returns the value of <tt>self.real</tt> as an Integer, if possible: * - * Returns the value as an integer if possible (the imaginary part - * should be exactly zero). + * Complex.rect(1, 0).to_i # => 1 + * Complex.rect(1, Rational(0, 1)).to_i # => 1 * - * Complex(1, 0).to_i #=> 1 - * Complex(1, 0.0).to_i # RangeError - * Complex(1, 2).to_i # RangeError + * Raises RangeError if <tt>self.imag</tt> is not exactly zero + * (either <tt>Integer(0)</tt> or <tt>Rational(0, n)</tt>). */ static VALUE nucomp_to_i(VALUE self) { get_dat1(self); - if (k_inexact_p(dat->imag) || f_nonzero_p(dat->imag)) { - VALUE s = f_to_s(self); - rb_raise(rb_eRangeError, "can't convert %s into Integer", - StringValuePtr(s)); + if (!k_exact_zero_p(dat->imag)) { + rb_raise(rb_eRangeError, "can't convert %"PRIsVALUE" into Integer", + self); } return f_to_i(dat->real); } /* * call-seq: - * cmp.to_f -> float + * to_f -> float * - * Returns the value as a float if possible (the imaginary part should - * be exactly zero). + * Returns the value of <tt>self.real</tt> as a Float, if possible: * - * Complex(1, 0).to_f #=> 1.0 - * Complex(1, 0.0).to_f # RangeError - * Complex(1, 2).to_f # RangeError + * Complex.rect(1, 0).to_f # => 1.0 + * Complex.rect(1, Rational(0, 1)).to_f # => 1.0 + * + * Raises RangeError if <tt>self.imag</tt> is not exactly zero + * (either <tt>Integer(0)</tt> or <tt>Rational(0, n)</tt>). */ static VALUE nucomp_to_f(VALUE self) { get_dat1(self); - if (k_inexact_p(dat->imag) || f_nonzero_p(dat->imag)) { - VALUE s = f_to_s(self); - rb_raise(rb_eRangeError, "can't convert %s into Float", - StringValuePtr(s)); + if (!k_exact_zero_p(dat->imag)) { + rb_raise(rb_eRangeError, "can't convert %"PRIsVALUE" into Float", + self); } return f_to_f(dat->real); } /* * call-seq: - * cmp.to_r -> rational + * to_r -> rational + * + * Returns the value of <tt>self.real</tt> as a Rational, if possible: * - * Returns the value as a rational if possible (the imaginary part - * should be exactly zero). + * Complex.rect(1, 0).to_r # => (1/1) + * Complex.rect(1, Rational(0, 1)).to_r # => (1/1) + * Complex.rect(1, 0.0).to_r # => (1/1) * - * Complex(1, 0).to_r #=> (1/1) - * Complex(1, 0.0).to_r # RangeError - * Complex(1, 2).to_r # RangeError + * Raises RangeError if <tt>self.imag</tt> is not exactly zero + * (either <tt>Integer(0)</tt> or <tt>Rational(0, n)</tt>) + * and <tt>self.imag.to_r</tt> is not exactly zero. * - * See rationalize. + * Related: Complex#rationalize. */ static VALUE nucomp_to_r(VALUE self) { get_dat1(self); - if (k_inexact_p(dat->imag) || f_nonzero_p(dat->imag)) { - VALUE s = f_to_s(self); - rb_raise(rb_eRangeError, "can't convert %s into Rational", - StringValuePtr(s)); + if (RB_FLOAT_TYPE_P(dat->imag) && FLOAT_ZERO_P(dat->imag)) { + /* Do nothing here */ + } + else if (!k_exact_zero_p(dat->imag)) { + VALUE imag = rb_check_convert_type_with_id(dat->imag, T_RATIONAL, "Rational", idTo_r); + if (NIL_P(imag) || !k_exact_zero_p(imag)) { + rb_raise(rb_eRangeError, "can't convert %"PRIsVALUE" into Rational", + self); + } } return f_to_r(dat->real); } /* * call-seq: - * cmp.rationalize([eps]) -> rational - * - * Returns the value as a rational if possible (the imaginary part - * should be exactly zero). - * - * Complex(1.0/3, 0).rationalize #=> (1/3) - * Complex(1, 0.0).rationalize # RangeError - * Complex(1, 2).rationalize # RangeError - * - * See to_r. + * rationalize(epsilon = nil) -> rational + * + * Returns a Rational object whose value is exactly or approximately + * equivalent to that of <tt>self.real</tt>. + * + * With no argument +epsilon+ given, returns a \Rational object + * whose value is exactly equal to that of <tt>self.real.rationalize</tt>: + * + * Complex.rect(1, 0).rationalize # => (1/1) + * Complex.rect(1, Rational(0, 1)).rationalize # => (1/1) + * Complex.rect(3.14159, 0).rationalize # => (314159/100000) + * + * With argument +epsilon+ given, returns a \Rational object + * whose value is exactly or approximately equal to that of <tt>self.real</tt> + * to the given precision: + * + * Complex.rect(3.14159, 0).rationalize(0.1) # => (16/5) + * Complex.rect(3.14159, 0).rationalize(0.01) # => (22/7) + * Complex.rect(3.14159, 0).rationalize(0.001) # => (201/64) + * Complex.rect(3.14159, 0).rationalize(0.0001) # => (333/106) + * Complex.rect(3.14159, 0).rationalize(0.00001) # => (355/113) + * Complex.rect(3.14159, 0).rationalize(0.000001) # => (7433/2366) + * Complex.rect(3.14159, 0).rationalize(0.0000001) # => (9208/2931) + * Complex.rect(3.14159, 0).rationalize(0.00000001) # => (47460/15107) + * Complex.rect(3.14159, 0).rationalize(0.000000001) # => (76149/24239) + * Complex.rect(3.14159, 0).rationalize(0.0000000001) # => (314159/100000) + * Complex.rect(3.14159, 0).rationalize(0.0) # => (3537115888337719/1125899906842624) + * + * Related: Complex#to_r. */ static VALUE nucomp_rationalize(int argc, VALUE *argv, VALUE self) { get_dat1(self); - rb_scan_args(argc, argv, "01", NULL); + rb_check_arity(argc, 0, 1); - if (k_inexact_p(dat->imag) || f_nonzero_p(dat->imag)) { - VALUE s = f_to_s(self); - rb_raise(rb_eRangeError, "can't convert %s into Rational", - StringValuePtr(s)); + if (!k_exact_zero_p(dat->imag)) { + rb_raise(rb_eRangeError, "can't convert %"PRIsVALUE" into Rational", + self); } - return rb_funcall2(dat->real, rb_intern("rationalize"), argc, argv); + return rb_funcallv(dat->real, id_rationalize, argc, argv); } /* * call-seq: - * complex.to_c -> self + * to_c -> self * - * Returns self. - * - * Complex(2).to_c #=> (2+0i) - * Complex(-8, 6).to_c #=> (-8+6i) + * Returns +self+. */ static VALUE nucomp_to_c(VALUE self) @@ -1514,21 +1935,9 @@ nucomp_to_c(VALUE self) /* * call-seq: - * nil.to_c -> (0+0i) - * - * Returns zero as a complex. - */ -static VALUE -nilclass_to_c(VALUE self) -{ - return rb_complex_new1(INT2FIX(0)); -} - -/* - * call-seq: - * num.to_c -> complex + * to_c -> complex * - * Returns the value as a complex. + * Returns +self+ as a Complex object. */ static VALUE numeric_to_c(VALUE self) @@ -1536,8 +1945,6 @@ numeric_to_c(VALUE self) return rb_complex_new1(self); } -#include <ctype.h> - inline static int issign(int c) { @@ -1546,14 +1953,14 @@ issign(int c) static int read_sign(const char **s, - char **b) + char **b) { int sign = '?'; if (issign(**s)) { - sign = **b = **s; - (*s)++; - (*b)++; + sign = **b = **s; + (*s)++; + (*b)++; } return sign; } @@ -1566,32 +1973,32 @@ isdecimal(int c) static int read_digits(const char **s, int strict, - char **b) + char **b) { int us = 1; if (!isdecimal(**s)) - return 0; + return 0; while (isdecimal(**s) || **s == '_') { - if (**s == '_') { - if (strict) { - if (us) - return 0; - } - us = 1; - } - else { - **b = **s; - (*b)++; - us = 0; - } - (*s)++; + if (**s == '_') { + if (us) { + if (strict) return 0; + break; + } + us = 1; + } + else { + **b = **s; + (*b)++; + us = 0; + } + (*s)++; } if (us) - do { - (*s)--; - } while (**s == '_'); + do { + (*s)--; + } while (**s == '_'); return 1; } @@ -1603,70 +2010,70 @@ islettere(int c) static int read_num(const char **s, int strict, - char **b) + char **b) { if (**s != '.') { - if (!read_digits(s, strict, b)) - return 0; + if (!read_digits(s, strict, b)) + return 0; } if (**s == '.') { - **b = **s; - (*s)++; - (*b)++; - if (!read_digits(s, strict, b)) { - (*b)--; - return 0; - } + **b = **s; + (*s)++; + (*b)++; + if (!read_digits(s, strict, b)) { + (*b)--; + return 0; + } } if (islettere(**s)) { - **b = **s; - (*s)++; - (*b)++; - read_sign(s, b); - if (!read_digits(s, strict, b)) { - (*b)--; - return 0; - } + **b = **s; + (*s)++; + (*b)++; + read_sign(s, b); + if (!read_digits(s, strict, b)) { + (*b)--; + return 0; + } } return 1; } inline static int read_den(const char **s, int strict, - char **b) + char **b) { if (!read_digits(s, strict, b)) - return 0; + return 0; return 1; } static int read_rat_nos(const char **s, int strict, - char **b) + char **b) { if (!read_num(s, strict, b)) - return 0; + return 0; if (**s == '/') { - **b = **s; - (*s)++; - (*b)++; - if (!read_den(s, strict, b)) { - (*b)--; - return 0; - } + **b = **s; + (*s)++; + (*b)++; + if (!read_den(s, strict, b)) { + (*b)--; + return 0; + } } return 1; } static int read_rat(const char **s, int strict, - char **b) + char **b) { read_sign(s, b); if (!read_rat_nos(s, strict, b)) - return 0; + return 0; return 1; } @@ -1674,24 +2081,22 @@ inline static int isimagunit(int c) { return (c == 'i' || c == 'I' || - c == 'j' || c == 'J'); + c == 'j' || c == 'J'); } -VALUE rb_cstr_to_rat(const char *, int); - static VALUE str2num(char *s) { if (strchr(s, '/')) - return rb_cstr_to_rat(s, 0); + return rb_cstr_to_rat(s, 0); if (strpbrk(s, ".eE")) - return DBL2NUM(rb_cstr_to_dbl(s, 0)); + return DBL2NUM(rb_cstr_to_dbl(s, 0)); return rb_cstr_to_inum(s, 10, 0); } static int read_comp(const char **s, int strict, - VALUE *ret, char **b) + VALUE *ret, char **b) { char *bb; int sign; @@ -1702,72 +2107,72 @@ read_comp(const char **s, int strict, sign = read_sign(s, b); if (isimagunit(**s)) { - (*s)++; - num = INT2FIX((sign == '-') ? -1 : + 1); - *ret = rb_complex_new2(ZERO, num); - return 1; /* e.g. "i" */ + (*s)++; + num = INT2FIX((sign == '-') ? -1 : + 1); + *ret = rb_complex_new2(ZERO, num); + return 1; /* e.g. "i" */ } if (!read_rat_nos(s, strict, b)) { - **b = '\0'; - num = str2num(bb); - *ret = rb_complex_new2(num, ZERO); - return 0; /* e.g. "-" */ + **b = '\0'; + num = str2num(bb); + *ret = rb_complex_new2(num, ZERO); + return 0; /* e.g. "-" */ } **b = '\0'; num = str2num(bb); if (isimagunit(**s)) { - (*s)++; - *ret = rb_complex_new2(ZERO, num); - return 1; /* e.g. "3i" */ + (*s)++; + *ret = rb_complex_new2(ZERO, num); + return 1; /* e.g. "3i" */ } if (**s == '@') { - int st; - - (*s)++; - bb = *b; - st = read_rat(s, strict, b); - **b = '\0'; - if (strlen(bb) < 1 || - !isdecimal(*(bb + strlen(bb) - 1))) { - *ret = rb_complex_new2(num, ZERO); - return 0; /* e.g. "1@-" */ - } - num2 = str2num(bb); - *ret = rb_complex_polar(num, num2); - if (!st) - return 0; /* e.g. "1@2." */ - else - return 1; /* e.g. "1@2" */ + int st; + + (*s)++; + bb = *b; + st = read_rat(s, strict, b); + **b = '\0'; + if (strlen(bb) < 1 || + !isdecimal(*(bb + strlen(bb) - 1))) { + *ret = rb_complex_new2(num, ZERO); + return 0; /* e.g. "1@-" */ + } + num2 = str2num(bb); + *ret = rb_complex_new_polar(num, num2); + if (!st) + return 0; /* e.g. "1@2." */ + else + return 1; /* e.g. "1@2" */ } if (issign(**s)) { - bb = *b; - sign = read_sign(s, b); - if (isimagunit(**s)) - num2 = INT2FIX((sign == '-') ? -1 : + 1); - else { - if (!read_rat_nos(s, strict, b)) { - *ret = rb_complex_new2(num, ZERO); - return 0; /* e.g. "1+xi" */ - } - **b = '\0'; - num2 = str2num(bb); - } - if (!isimagunit(**s)) { - *ret = rb_complex_new2(num, ZERO); - return 0; /* e.g. "1+3x" */ - } - (*s)++; - *ret = rb_complex_new2(num, num2); - return 1; /* e.g. "1+2i" */ + bb = *b; + sign = read_sign(s, b); + if (isimagunit(**s)) + num2 = INT2FIX((sign == '-') ? -1 : + 1); + else { + if (!read_rat_nos(s, strict, b)) { + *ret = rb_complex_new2(num, ZERO); + return 0; /* e.g. "1+xi" */ + } + **b = '\0'; + num2 = str2num(bb); + } + if (!isimagunit(**s)) { + *ret = rb_complex_new2(num, ZERO); + return 0; /* e.g. "1+3x" */ + } + (*s)++; + *ret = rb_complex_new2(num, num2); + return 1; /* e.g. "1+2i" */ } /* !(@, - or +) */ { - *ret = rb_complex_new2(num, ZERO); - return 1; /* e.g. "3" */ + *ret = rb_complex_new2(num, ZERO); + return 1; /* e.g. "3" */ } } @@ -1775,12 +2180,11 @@ inline static void skip_ws(const char **s) { while (isspace((unsigned char)**s)) - (*s)++; + (*s)++; } static int -parse_comp(const char *s, int strict, - VALUE *num) +parse_comp(const char *s, int strict, VALUE *num) { char *buf, *b; VALUE tmp; @@ -1791,14 +2195,14 @@ parse_comp(const char *s, int strict, skip_ws(&s); if (!read_comp(&s, strict, num, &b)) { - ret = 0; + ret = 0; } else { - skip_ws(&s); + skip_ws(&s); - if (strict) - if (*s != '\0') - ret = 0; + if (strict) + if (*s != '\0') + ret = 0; } ALLOCV_END(tmp); @@ -1806,31 +2210,24 @@ parse_comp(const char *s, int strict, } static VALUE -string_to_c_strict(VALUE self) +string_to_c_strict(VALUE self, int raise) { char *s; VALUE num; rb_must_asciicompat(self); - s = RSTRING_PTR(self); - - if (!s || memchr(s, '\0', RSTRING_LEN(self))) - rb_raise(rb_eArgError, "string contains null byte"); - - if (s && s[RSTRING_LEN(self)]) { - rb_str_modify(self); - s = RSTRING_PTR(self); - s[RSTRING_LEN(self)] = '\0'; + if (raise) { + s = StringValueCStr(self); + } + else if (!(s = rb_str_to_cstr(self))) { + return Qnil; } - if (!s) - s = (char *)""; - - if (!parse_comp(s, 1, &num)) { - VALUE ins = f_inspect(self); - rb_raise(rb_eArgError, "invalid value for convert(): %s", - StringValuePtr(ins)); + if (!parse_comp(s, TRUE, &num)) { + if (!raise) return Qnil; + rb_raise(rb_eArgError, "invalid value for convert(): %+"PRIsVALUE, + self); } return num; @@ -1838,167 +2235,274 @@ string_to_c_strict(VALUE self) /* * call-seq: - * str.to_c -> complex - * - * Returns a complex which denotes the string form. The parser - * ignores leading whitespaces and trailing garbage. Any digit - * sequences can be separated by an underscore. Returns zero for null - * or garbage string. - * - * '9'.to_c #=> (9+0i) - * '2.5'.to_c #=> (2.5+0i) - * '2.5/1'.to_c #=> ((5/2)+0i) - * '-3/2'.to_c #=> ((-3/2)+0i) - * '-i'.to_c #=> (0-1i) - * '45i'.to_c #=> (0+45i) - * '3-4i'.to_c #=> (3-4i) - * '-4e2-4e-2i'.to_c #=> (-400.0-0.04i) - * '-0.0-0.0i'.to_c #=> (-0.0-0.0i) - * '1/2+3/4i'.to_c #=> ((1/2)+(3/4)*i) - * 'ruby'.to_c #=> (0+0i) - * - * See Kernel.Complex. + * to_c -> complex + * + * Returns a Complex object: + * parses the leading substring of +self+ + * to extract two numeric values that become the coordinates of the complex object. + * + * The substring is interpreted as containing + * either rectangular coordinates (real and imaginary parts) + * or polar coordinates (magnitude and angle parts), + * depending on an included or implied "separator" character: + * + * - <tt>'+'</tt>, <tt>'-'</tt>, or no separator: rectangular coordinates. + * - <tt>'@'</tt>: polar coordinates. + * + * <b>In Brief</b> + * + * In these examples, we use method Complex#rect to display rectangular coordinates, + * and method Complex#polar to display polar coordinates. + * + * # Rectangular coordinates. + * + * # Real-only: no separator; imaginary part is zero. + * '9'.to_c.rect # => [9, 0] # Integer. + * '-9'.to_c.rect # => [-9, 0] # Integer (negative). + * '2.5'.to_c.rect # => [2.5, 0] # Float. + * '1.23e-14'.to_c.rect # => [1.23e-14, 0] # Float with exponent. + * '2.5/1'.to_c.rect # => [(5/2), 0] # Rational. + * + * # Some things are ignored. + * 'foo1'.to_c.rect # => [0, 0] # Unparsed entire substring. + * '1foo'.to_c.rect # => [1, 0] # Unparsed trailing substring. + * ' 1 '.to_c.rect # => [1, 0] # Leading and trailing whitespace. + * * + * # Imaginary only: trailing 'i' required; real part is zero. + * '9i'.to_c.rect # => [0, 9] + * '-9i'.to_c.rect # => [0, -9] + * '2.5i'.to_c.rect # => [0, 2.5] + * '1.23e-14i'.to_c.rect # => [0, 1.23e-14] + * '2.5/1i'.to_c.rect # => [0, (5/2)] + * + * # Real and imaginary; '+' or '-' separator; trailing 'i' required. + * '2+3i'.to_c.rect # => [2, 3] + * '-2-3i'.to_c.rect # => [-2, -3] + * '2.5+3i'.to_c.rect # => [2.5, 3] + * '2.5+3/2i'.to_c.rect # => [2.5, (3/2)] + * + * # Polar coordinates; '@' separator; magnitude required. + * '1.0@0'.to_c.polar # => [1.0, 0.0] + * '1.0@'.to_c.polar # => [1.0, 0.0] + * "1.0@#{Math::PI}".to_c.polar # => [1.0, 3.141592653589793] + * "1.0@#{Math::PI/2}".to_c.polar # => [1.0, 1.5707963267948966] + * + * <b>Parsed Values</b> + * + * The parsing may be thought of as searching for numeric literals + * embedded in the substring. + * + * This section shows how the method parses numeric values from leading substrings. + * The examples show real-only or imaginary-only parsing; + * the parsing is the same for each part. + * + * '1foo'.to_c # => (1+0i) # Ignores trailing unparsed characters. + * ' 1 '.to_c # => (1+0i) # Ignores leading and trailing whitespace. + * 'x1'.to_c # => (0+0i) # Finds no leading numeric. + * + * # Integer literal embedded in the substring. + * '1'.to_c # => (1+0i) + * '-1'.to_c # => (-1+0i) + * '1i'.to_c # => (0+1i) + * + * # Integer literals that don't work. + * '0b100'.to_c # => (0+0i) # Not parsed as binary. + * '0o100'.to_c # => (0+0i) # Not parsed as octal. + * '0d100'.to_c # => (0+0i) # Not parsed as decimal. + * '0x100'.to_c # => (0+0i) # Not parsed as hexadecimal. + * '010'.to_c # => (10+0i) # Not parsed as octal. + * + * # Float literals: + * '3.14'.to_c # => (3.14+0i) + * '3.14i'.to_c # => (0+3.14i) + * '1.23e4'.to_c # => (12300.0+0i) + * '1.23e+4'.to_c # => (12300.0+0i) + * '1.23e-4'.to_c # => (0.000123+0i) + * + * # Rational literals: + * '1/2'.to_c # => ((1/2)+0i) + * '-1/2'.to_c # => ((-1/2)+0i) + * '1/2r'.to_c # => ((1/2)+0i) + * '-1/2r'.to_c # => ((-1/2)+0i) + * + * <b>Rectangular Coordinates</b> + * + * With separator <tt>'+'</tt> or <tt>'-'</tt>, + * or with no separator, + * interprets the values as rectangular coordinates: real and imaginary. + * + * With no separator, assigns a single value to either the real or the imaginary part: + * + * ''.to_c # => (0+0i) # Defaults to zero. + * '1'.to_c # => (1+0i) # Real (no trailing 'i'). + * '1i'.to_c # => (0+1i) # Imaginary (trailing 'i'). + * 'i'.to_c # => (0+1i) # Special case (imaginary 1). + * + * With separator <tt>'+'</tt>, both parts positive (or zero): + * + * # Without trailing 'i'. + * '+'.to_c # => (0+0i) # No values: defaults to zero. + * '+1'.to_c # => (1+0i) # Value after '+': real only. + * '1+'.to_c # => (1+0i) # Value before '+': real only. + * '2+1'.to_c # => (2+0i) # Values before and after '+': real and imaginary. + * # With trailing 'i'. + * '+1i'.to_c # => (0+1i) # Value after '+': imaginary only. + * '2+i'.to_c # => (2+1i) # Value before '+': real and imaginary 1. + * '2+1i'.to_c # => (2+1i) # Values before and after '+': real and imaginary. + * + * With separator <tt>'-'</tt>, negative imaginary part: + * + * # Without trailing 'i'. + * '-'.to_c # => (0+0i) # No values: defaults to zero. + * '-1'.to_c # => (-1+0i) # Value after '-': negative real, zero imaginary. + * '1-'.to_c # => (1+0i) # Value before '-': positive real, zero imaginary. + * '2-1'.to_c # => (2+0i) # Values before and after '-': positive real, zero imaginary. + * # With trailing 'i'. + * '-1i'.to_c # => (0-1i) # Value after '-': negative real, zero imaginary. + * '2-i'.to_c # => (2-1i) # Value before '-': positive real, negative imaginary. + * '2-1i'.to_c # => (2-1i) # Values before and after '-': positive real, negative imaginary. + * + * Note that the suffixed character <tt>'i'</tt> + * may instead be one of <tt>'I'</tt>, <tt>'j'</tt>, or <tt>'J'</tt>, + * with the same effect. + * + * <b>Polar Coordinates</b> + * + * With separator <tt>'@'</tt>) + * interprets the values as polar coordinates: magnitude and angle. + * + * '2@'.to_c.polar # => [2, 0.0] # Value before '@': magnitude only. + * # Values before and after '@': magnitude and angle. + * '2@1'.to_c.polar # => [2.0, 1.0] + * "1.0@#{Math::PI/2}".to_c # => (0.0+1i) + * "1.0@#{Math::PI}".to_c # => (-1+0.0i) + * # Magnitude not given: defaults to zero. + * '@'.to_c.polar # => [0, 0.0] + * '@1'.to_c.polar # => [0, 0.0] + * + * '1.0@0'.to_c # => (1+0.0i) + * + * Note that in all cases, the suffixed character <tt>'i'</tt> + * may instead be one of <tt>'I'</tt>, <tt>'j'</tt>, <tt>'J'</tt>, + * with the same effect. + * + * See {Converting to Non-String}[rdoc-ref:String@Converting+to+Non--5CString]. */ static VALUE string_to_c(VALUE self) { - char *s; VALUE num; rb_must_asciicompat(self); - s = RSTRING_PTR(self); - - if (s && s[RSTRING_LEN(self)]) { - rb_str_modify(self); - s = RSTRING_PTR(self); - s[RSTRING_LEN(self)] = '\0'; - } - - if (!s) - s = (char *)""; - - (void)parse_comp(s, 0, &num); + (void)parse_comp(rb_str_fill_terminator(self, 1), FALSE, &num); return num; } static VALUE -nucomp_s_convert(int argc, VALUE *argv, VALUE klass) +to_complex(VALUE val) { - VALUE a1, a2, backref; - - rb_scan_args(argc, argv, "11", &a1, &a2); - - if (NIL_P(a1) || (argc == 2 && NIL_P(a2))) - rb_raise(rb_eTypeError, "can't convert nil into Complex"); - - backref = rb_backref_get(); - rb_match_busy(backref); + return rb_convert_type(val, T_COMPLEX, "Complex", "to_c"); +} - switch (TYPE(a1)) { - case T_FIXNUM: - case T_BIGNUM: - case T_FLOAT: - break; - case T_STRING: - a1 = string_to_c_strict(a1); - break; +static VALUE +nucomp_convert(VALUE klass, VALUE a1, VALUE a2, int raise) +{ + if (NIL_P(a1) || NIL_P(a2)) { + if (!raise) return Qnil; + rb_raise(rb_eTypeError, "can't convert nil into Complex"); } - switch (TYPE(a2)) { - case T_FIXNUM: - case T_BIGNUM: - case T_FLOAT: - break; - case T_STRING: - a2 = string_to_c_strict(a2); - break; + if (RB_TYPE_P(a1, T_STRING)) { + a1 = string_to_c_strict(a1, raise); + if (NIL_P(a1)) return Qnil; } - rb_backref_set(backref); + if (RB_TYPE_P(a2, T_STRING)) { + a2 = string_to_c_strict(a2, raise); + if (NIL_P(a2)) return Qnil; + } - switch (TYPE(a1)) { - case T_COMPLEX: - { - get_dat1(a1); + if (RB_TYPE_P(a1, T_COMPLEX)) { + { + get_dat1(a1); - if (k_exact_zero_p(dat->imag)) - a1 = dat->real; - } + if (k_exact_zero_p(dat->imag)) + a1 = dat->real; + } } - switch (TYPE(a2)) { - case T_COMPLEX: - { - get_dat1(a2); + if (RB_TYPE_P(a2, T_COMPLEX)) { + { + get_dat1(a2); - if (k_exact_zero_p(dat->imag)) - a2 = dat->real; - } + if (k_exact_zero_p(dat->imag)) + a2 = dat->real; + } } - switch (TYPE(a1)) { - case T_COMPLEX: - if (argc == 1 || (k_exact_zero_p(a2))) - return a1; + if (RB_TYPE_P(a1, T_COMPLEX)) { + if (UNDEF_P(a2) || (k_exact_zero_p(a2))) + return a1; } - if (argc == 1) { - if (k_numeric_p(a1) && !f_real_p(a1)) - return a1; - /* should raise exception for consistency */ - if (!k_numeric_p(a1)) - return rb_convert_type(a1, T_COMPLEX, "Complex", "to_c"); + if (UNDEF_P(a2)) { + if (k_numeric_p(a1) && !f_real_p(a1)) + return a1; + /* should raise exception for consistency */ + if (!k_numeric_p(a1)) { + if (!raise) { + a1 = rb_protect(to_complex, a1, NULL); + rb_set_errinfo(Qnil); + return a1; + } + return to_complex(a1); + } } else { - if ((k_numeric_p(a1) && k_numeric_p(a2)) && - (!f_real_p(a1) || !f_real_p(a2))) - return f_add(a1, - f_mul(a2, - f_complex_new_bang2(rb_cComplex, ZERO, ONE))); + if ((k_numeric_p(a1) && k_numeric_p(a2)) && + (!f_real_p(a1) || !f_real_p(a2))) + return f_add(a1, + f_mul(a2, + f_complex_new_bang2(rb_cComplex, ZERO, ONE))); } { - VALUE argv2[2]; - argv2[0] = a1; - argv2[1] = a2; - return nucomp_s_new(argc, argv2, klass); + int argc; + VALUE argv2[2]; + argv2[0] = a1; + if (UNDEF_P(a2)) { + argv2[1] = Qnil; + argc = 1; + } + else { + if (!raise && !RB_INTEGER_TYPE_P(a2) && !RB_FLOAT_TYPE_P(a2) && !RB_TYPE_P(a2, T_RATIONAL)) + return Qnil; + argv2[1] = a2; + argc = 2; + } + return nucomp_s_new(argc, argv2, klass); } } -/* --- */ - -/* - * call-seq: - * num.real -> self - * - * Returns self. - */ static VALUE -numeric_real(VALUE self) +nucomp_s_convert(int argc, VALUE *argv, VALUE klass) { - return self; -} + VALUE a1, a2; -/* - * call-seq: - * num.imag -> 0 - * num.imaginary -> 0 - * - * Returns zero. - */ -static VALUE -numeric_imag(VALUE self) -{ - return INT2FIX(0); + if (rb_scan_args(argc, argv, "11", &a1, &a2) == 1) { + a2 = Qundef; + } + + return nucomp_convert(klass, a1, a2, TRUE); } /* * call-seq: - * num.abs2 -> real + * abs2 -> real * - * Returns square of self. + * Returns the square of +self+. */ static VALUE numeric_abs2(VALUE self) @@ -2006,29 +2510,25 @@ numeric_abs2(VALUE self) return f_mul(self, self); } -#define id_PI rb_intern("PI") - /* * call-seq: - * num.arg -> 0 or float - * num.angle -> 0 or float - * num.phase -> 0 or float + * arg -> 0 or Math::PI * - * Returns 0 if the value is positive, pi otherwise. + * Returns zero if +self+ is positive, Math::PI otherwise. */ static VALUE numeric_arg(VALUE self) { if (f_positive_p(self)) - return INT2FIX(0); - return rb_const_get(rb_mMath, id_PI); + return INT2FIX(0); + return DBL2NUM(M_PI); } /* * call-seq: - * num.rect -> array + * rect -> array * - * Returns an array; [num, 0]. + * Returns array <tt>[self, 0]</tt>. */ static VALUE numeric_rect(VALUE self) @@ -2038,126 +2538,205 @@ numeric_rect(VALUE self) /* * call-seq: - * num.polar -> array + * polar -> array * - * Returns an array; [num.abs, num.arg]. + * Returns array <tt>[self.abs, self.arg]</tt>. */ static VALUE numeric_polar(VALUE self) { - return rb_assoc_new(f_abs(self), f_arg(self)); -} + VALUE abs, arg; -/* - * call-seq: - * num.conj -> self - * num.conjugate -> self - * - * Returns self. - */ -static VALUE -numeric_conj(VALUE self) -{ - return self; + if (RB_INTEGER_TYPE_P(self)) { + abs = rb_int_abs(self); + arg = numeric_arg(self); + } + else if (RB_FLOAT_TYPE_P(self)) { + abs = rb_float_abs(self); + arg = float_arg(self); + } + else if (RB_TYPE_P(self, T_RATIONAL)) { + abs = rb_rational_abs(self); + arg = numeric_arg(self); + } + else { + abs = f_abs(self); + arg = f_arg(self); + } + return rb_assoc_new(abs, arg); } /* * call-seq: - * flo.arg -> 0 or float - * flo.angle -> 0 or float - * flo.phase -> 0 or float + * arg -> 0 or Math::PI * - * Returns 0 if the value is positive, pi otherwise. + * Returns 0 if +self+ is positive, Math::PI otherwise. */ static VALUE float_arg(VALUE self) { if (isnan(RFLOAT_VALUE(self))) - return self; + return self; if (f_tpositive_p(self)) - return INT2FIX(0); + return INT2FIX(0); return rb_const_get(rb_mMath, id_PI); } /* - * A complex number can be represented as a paired real number with - * imaginary unit; a+bi. Where a is real part, b is imaginary part - * and i is imaginary unit. Real a equals complex a+0i - * mathematically. + * A \Complex object houses a pair of values, + * given when the object is created as either <i>rectangular coordinates</i> + * or <i>polar coordinates</i>. + * + * == Rectangular Coordinates + * + * The rectangular coordinates of a complex number + * are called the _real_ and _imaginary_ parts; + * see {Complex number definition}[https://en.wikipedia.org/wiki/Complex_number#Definition_and_basic_operations]. + * + * You can create a \Complex object from rectangular coordinates with: + * + * - A {complex literal}[rdoc-ref:syntax/literals.rdoc@Complex+Literals]. + * - Method Complex.rect. + * - Method Kernel#Complex, either with numeric arguments or with certain string arguments. + * - Method String#to_c, for certain strings. + * + * Note that each of the stored parts may be a an instance one of the classes + * Complex, Float, Integer, or Rational; + * they may be retrieved: + * + * - Separately, with methods Complex#real and Complex#imaginary. + * - Together, with method Complex#rect. + * + * The corresponding (computed) polar values may be retrieved: + * + * - Separately, with methods Complex#abs and Complex#arg. + * - Together, with method Complex#polar. + * + * == Polar Coordinates + * + * The polar coordinates of a complex number + * are called the _absolute_ and _argument_ parts; + * see {Complex polar plane}[https://en.wikipedia.org/wiki/Complex_number#Polar_form]. + * + * In this class, the argument part + * in expressed {radians}[https://en.wikipedia.org/wiki/Radian] + * (not {degrees}[https://en.wikipedia.org/wiki/Degree_(angle)]). * - * In ruby, you can create complex object with Complex, Complex::rect, - * Complex::polar or to_c method. + * You can create a \Complex object from polar coordinates with: * - * Complex(1) #=> (1+0i) - * Complex(2, 3) #=> (2+3i) - * Complex.polar(2, 3) #=> (-1.9799849932008908+0.2822400161197344i) - * 3.to_c #=> (3+0i) + * - Method Complex.polar. + * - Method Kernel#Complex, with certain string arguments. + * - Method String#to_c, for certain strings. * - * You can also create complex object from floating-point numbers or - * strings. + * Note that each of the stored parts may be a an instance one of the classes + * Complex, Float, Integer, or Rational; + * they may be retrieved: * - * Complex(0.3) #=> (0.3+0i) - * Complex('0.3-0.5i') #=> (0.3-0.5i) - * Complex('2/3+3/4i') #=> ((2/3)+(3/4)*i) - * Complex('1@2') #=> (-0.4161468365471424+0.9092974268256817i) + * - Separately, with methods Complex#abs and Complex#arg. + * - Together, with method Complex#polar. * - * 0.3.to_c #=> (0.3+0i) - * '0.3-0.5i'.to_c #=> (0.3-0.5i) - * '2/3+3/4i'.to_c #=> ((2/3)+(3/4)*i) - * '1@2'.to_c #=> (-0.4161468365471424+0.9092974268256817i) + * The corresponding (computed) rectangular values may be retrieved: * - * A complex object is either an exact or an inexact number. + * - Separately, with methods Complex#real and Complex#imag. + * - Together, with method Complex#rect. + * + * == What's Here + * + * First, what's elsewhere: + * + * - Class \Complex inherits (directly or indirectly) + * from classes {Numeric}[rdoc-ref:Numeric@What-27s+Here] + * and {Object}[rdoc-ref:Object@What-27s+Here]. + * - Includes (indirectly) module {Comparable}[rdoc-ref:Comparable@What-27s+Here]. + * + * Here, class \Complex has methods for: + * + * === Creating \Complex Objects + * + * - ::polar: Returns a new \Complex object based on given polar coordinates. + * - ::rect (and its alias ::rectangular): + * Returns a new \Complex object based on given rectangular coordinates. + * + * === Querying + * + * - #abs (and its alias #magnitude): Returns the absolute value for +self+. + * - #arg (and its aliases #angle and #phase): + * Returns the argument (angle) for +self+ in radians. + * - #denominator: Returns the denominator of +self+. + * - #finite?: Returns whether both +self.real+ and +self.image+ are finite. + * - #hash: Returns the integer hash value for +self+. + * - #imag (and its alias #imaginary): Returns the imaginary value for +self+. + * - #infinite?: Returns whether +self.real+ or +self.image+ is infinite. + * - #numerator: Returns the numerator of +self+. + * - #polar: Returns the array <tt>[self.abs, self.arg]</tt>. + * - #inspect: Returns a string representation of +self+. + * - #real: Returns the real value for +self+. + * - #real?: Returns +false+; for compatibility with Numeric#real?. + * - #rect (and its alias #rectangular): + * Returns the array <tt>[self.real, self.imag]</tt>. + * + * === Comparing + * + * - #<=>: Returns whether +self+ is less than, equal to, or greater than the given argument. + * - #==: Returns whether +self+ is equal to the given argument. + * + * === Converting + * + * - #rationalize: Returns a Rational object whose value is exactly + * or approximately equivalent to that of <tt>self.real</tt>. + * - #to_c: Returns +self+. + * - #to_d: Returns the value as a BigDecimal object. + * - #to_f: Returns the value of <tt>self.real</tt> as a Float, if possible. + * - #to_i: Returns the value of <tt>self.real</tt> as an Integer, if possible. + * - #to_r: Returns the value of <tt>self.real</tt> as a Rational, if possible. + * - #to_s: Returns a string representation of +self+. + * + * === Performing Complex Arithmetic + * + * - #*: Returns the product of +self+ and the given numeric. + * - #**: Returns +self+ raised to power of the given numeric. + * - #+: Returns the sum of +self+ and the given numeric. + * - #-: Returns the difference of +self+ and the given numeric. + * - #-@: Returns the negation of +self+. + * - #/: Returns the quotient of +self+ and the given numeric. + * - #abs2: Returns square of the absolute value (magnitude) for +self+. + * - #conj (and its alias #conjugate): Returns the conjugate of +self+. + * - #fdiv: Returns <tt>Complex.rect(self.real/numeric, self.imag/numeric)</tt>. + * + * === Working with JSON + * + * - ::json_create: Returns a new \Complex object, + * deserialized from the given serialized hash. + * - #as_json: Returns a serialized hash constructed from +self+. + * - #to_json: Returns a JSON string representing +self+. + * + * These methods are provided by the {JSON gem}[https://github.com/ruby/json]. To make these methods available: + * + * require 'json/add/complex' * - * Complex(1, 1) / 2 #=> ((1/2)+(1/2)*i) - * Complex(1, 1) / 2.0 #=> (0.5+0.5i) */ void Init_Complex(void) { VALUE compat; -#undef rb_intern -#define rb_intern(str) rb_intern_const(str) - - assert(fprintf(stderr, "assert() is now active\n")); - - id_abs = rb_intern("abs"); - id_abs2 = rb_intern("abs2"); - id_arg = rb_intern("arg"); - id_cmp = rb_intern("<=>"); - id_conj = rb_intern("conj"); - id_convert = rb_intern("convert"); - id_denominator = rb_intern("denominator"); - id_divmod = rb_intern("divmod"); - id_eqeq_p = rb_intern("=="); - id_expt = rb_intern("**"); - id_fdiv = rb_intern("fdiv"); - id_floor = rb_intern("floor"); - id_idiv = rb_intern("div"); - id_imag = rb_intern("imag"); - id_inspect = rb_intern("inspect"); - id_negate = rb_intern("-@"); - id_numerator = rb_intern("numerator"); - id_quo = rb_intern("quo"); - id_real = rb_intern("real"); - id_real_p = rb_intern("real?"); - id_to_f = rb_intern("to_f"); - id_to_i = rb_intern("to_i"); - id_to_r = rb_intern("to_r"); - id_to_s = rb_intern("to_s"); - id_i_real = rb_intern("@real"); - id_i_imag = rb_intern("@image"); /* @image, not @imag */ + id_abs = rb_intern_const("abs"); + id_arg = rb_intern_const("arg"); + id_denominator = rb_intern_const("denominator"); + id_numerator = rb_intern_const("numerator"); + id_real_p = rb_intern_const("real?"); + id_i_real = rb_intern_const("@real"); + id_i_imag = rb_intern_const("@image"); /* @image, not @imag */ + id_finite_p = rb_intern_const("finite?"); + id_infinite_p = rb_intern_const("infinite?"); + id_rationalize = rb_intern_const("rationalize"); + id_PI = rb_intern_const("PI"); rb_cComplex = rb_define_class("Complex", rb_cNumeric); rb_define_alloc_func(rb_cComplex, nucomp_s_alloc); rb_undef_method(CLASS_OF(rb_cComplex), "allocate"); -#if 0 - rb_define_private_method(CLASS_OF(rb_cComplex), "new!", nucomp_s_new_bang, -1); - rb_define_private_method(CLASS_OF(rb_cComplex), "new", nucomp_s_new, -1); -#else rb_undef_method(CLASS_OF(rb_cComplex), "new"); -#endif rb_define_singleton_method(rb_cComplex, "rectangular", nucomp_s_new, -1); rb_define_singleton_method(rb_cComplex, "rect", nucomp_s_new, -1); @@ -2165,13 +2744,8 @@ Init_Complex(void) rb_define_global_function("Complex", nucomp_f_complex, -1); + rb_undef_methods_from(rb_cComplex, RCLASS_ORIGIN(rb_mComparable)); rb_undef_method(rb_cComplex, "%"); - rb_undef_method(rb_cComplex, "<"); - rb_undef_method(rb_cComplex, "<="); - rb_undef_method(rb_cComplex, "<=>"); - rb_undef_method(rb_cComplex, ">"); - rb_undef_method(rb_cComplex, ">="); - rb_undef_method(rb_cComplex, "between?"); rb_undef_method(rb_cComplex, "div"); rb_undef_method(rb_cComplex, "divmod"); rb_undef_method(rb_cComplex, "floor"); @@ -2183,47 +2757,36 @@ Init_Complex(void) rb_undef_method(rb_cComplex, "truncate"); rb_undef_method(rb_cComplex, "i"); -#if 0 /* NUBY */ - rb_undef_method(rb_cComplex, "//"); -#endif - - rb_define_method(rb_cComplex, "real", nucomp_real, 0); - rb_define_method(rb_cComplex, "imaginary", nucomp_imag, 0); - rb_define_method(rb_cComplex, "imag", nucomp_imag, 0); + rb_define_method(rb_cComplex, "real", rb_complex_real, 0); + rb_define_method(rb_cComplex, "imaginary", rb_complex_imag, 0); + rb_define_method(rb_cComplex, "imag", rb_complex_imag, 0); - rb_define_method(rb_cComplex, "-@", nucomp_negate, 0); - rb_define_method(rb_cComplex, "+", nucomp_add, 1); - rb_define_method(rb_cComplex, "-", nucomp_sub, 1); - rb_define_method(rb_cComplex, "*", nucomp_mul, 1); - rb_define_method(rb_cComplex, "/", nucomp_div, 1); + rb_define_method(rb_cComplex, "-@", rb_complex_uminus, 0); + rb_define_method(rb_cComplex, "+", rb_complex_plus, 1); + rb_define_method(rb_cComplex, "-", rb_complex_minus, 1); + rb_define_method(rb_cComplex, "*", rb_complex_mul, 1); + rb_define_method(rb_cComplex, "/", rb_complex_div, 1); rb_define_method(rb_cComplex, "quo", nucomp_quo, 1); rb_define_method(rb_cComplex, "fdiv", nucomp_fdiv, 1); - rb_define_method(rb_cComplex, "**", nucomp_expt, 1); + rb_define_method(rb_cComplex, "**", rb_complex_pow, 1); rb_define_method(rb_cComplex, "==", nucomp_eqeq_p, 1); + rb_define_method(rb_cComplex, "<=>", nucomp_cmp, 1); rb_define_method(rb_cComplex, "coerce", nucomp_coerce, 1); - rb_define_method(rb_cComplex, "abs", nucomp_abs, 0); - rb_define_method(rb_cComplex, "magnitude", nucomp_abs, 0); + rb_define_method(rb_cComplex, "abs", rb_complex_abs, 0); + rb_define_method(rb_cComplex, "magnitude", rb_complex_abs, 0); rb_define_method(rb_cComplex, "abs2", nucomp_abs2, 0); - rb_define_method(rb_cComplex, "arg", nucomp_arg, 0); - rb_define_method(rb_cComplex, "angle", nucomp_arg, 0); - rb_define_method(rb_cComplex, "phase", nucomp_arg, 0); + rb_define_method(rb_cComplex, "arg", rb_complex_arg, 0); + rb_define_method(rb_cComplex, "angle", rb_complex_arg, 0); + rb_define_method(rb_cComplex, "phase", rb_complex_arg, 0); rb_define_method(rb_cComplex, "rectangular", nucomp_rect, 0); rb_define_method(rb_cComplex, "rect", nucomp_rect, 0); rb_define_method(rb_cComplex, "polar", nucomp_polar, 0); - rb_define_method(rb_cComplex, "conjugate", nucomp_conj, 0); - rb_define_method(rb_cComplex, "conj", nucomp_conj, 0); -#if 0 - rb_define_method(rb_cComplex, "~", nucomp_conj, 0); /* gcc */ -#endif + rb_define_method(rb_cComplex, "conjugate", rb_complex_conjugate, 0); + rb_define_method(rb_cComplex, "conj", rb_complex_conjugate, 0); - rb_define_method(rb_cComplex, "real?", nucomp_false, 0); -#if 0 - rb_define_method(rb_cComplex, "complex?", nucomp_true, 0); - rb_define_method(rb_cComplex, "exact?", nucomp_exact_p, 0); - rb_define_method(rb_cComplex, "inexact?", nucomp_inexact_p, 0); -#endif + rb_define_method(rb_cComplex, "real?", nucomp_real_p_m, 0); rb_define_method(rb_cComplex, "numerator", nucomp_numerator, 0); rb_define_method(rb_cComplex, "denominator", nucomp_denominator, 0); @@ -2234,30 +2797,29 @@ Init_Complex(void) rb_define_method(rb_cComplex, "to_s", nucomp_to_s, 0); rb_define_method(rb_cComplex, "inspect", nucomp_inspect, 0); + rb_undef_method(rb_cComplex, "positive?"); + rb_undef_method(rb_cComplex, "negative?"); + + rb_define_method(rb_cComplex, "finite?", rb_complex_finite_p, 0); + rb_define_method(rb_cComplex, "infinite?", rb_complex_infinite_p, 0); + rb_define_private_method(rb_cComplex, "marshal_dump", nucomp_marshal_dump, 0); + /* :nodoc: */ compat = rb_define_class_under(rb_cComplex, "compatible", rb_cObject); rb_define_private_method(compat, "marshal_load", nucomp_marshal_load, 1); rb_marshal_define_compat(rb_cComplex, compat, nucomp_dumper, nucomp_loader); - /* --- */ - rb_define_method(rb_cComplex, "to_i", nucomp_to_i, 0); rb_define_method(rb_cComplex, "to_f", nucomp_to_f, 0); rb_define_method(rb_cComplex, "to_r", nucomp_to_r, 0); rb_define_method(rb_cComplex, "rationalize", nucomp_rationalize, -1); rb_define_method(rb_cComplex, "to_c", nucomp_to_c, 0); - rb_define_method(rb_cNilClass, "to_c", nilclass_to_c, 0); rb_define_method(rb_cNumeric, "to_c", numeric_to_c, 0); rb_define_method(rb_cString, "to_c", string_to_c, 0); rb_define_private_method(CLASS_OF(rb_cComplex), "convert", nucomp_s_convert, -1); - /* --- */ - - rb_define_method(rb_cNumeric, "real", numeric_real, 0); - rb_define_method(rb_cNumeric, "imaginary", numeric_imag, 0); - rb_define_method(rb_cNumeric, "imag", numeric_imag, 0); rb_define_method(rb_cNumeric, "abs2", numeric_abs2, 0); rb_define_method(rb_cNumeric, "arg", numeric_arg, 0); rb_define_method(rb_cNumeric, "angle", numeric_arg, 0); @@ -2265,22 +2827,24 @@ Init_Complex(void) rb_define_method(rb_cNumeric, "rectangular", numeric_rect, 0); rb_define_method(rb_cNumeric, "rect", numeric_rect, 0); rb_define_method(rb_cNumeric, "polar", numeric_polar, 0); - rb_define_method(rb_cNumeric, "conjugate", numeric_conj, 0); - rb_define_method(rb_cNumeric, "conj", numeric_conj, 0); rb_define_method(rb_cFloat, "arg", float_arg, 0); rb_define_method(rb_cFloat, "angle", float_arg, 0); rb_define_method(rb_cFloat, "phase", float_arg, 0); /* - * The imaginary unit. + * Equivalent + * to <tt>Complex.rect(0, 1)</tt>: + * + * Complex::I # => (0+1i) + * */ rb_define_const(rb_cComplex, "I", - f_complex_new_bang2(rb_cComplex, ZERO, ONE)); -} + f_complex_new_bang2(rb_cComplex, ZERO, ONE)); -/* -Local variables: -c-file-style: "ruby" -End: -*/ +#if !USE_FLONUM + rb_vm_register_global_object(RFLOAT_0 = DBL2NUM(0.0)); +#endif + + rb_provide("complex.so"); /* for backward compatibility */ +} |