2008-03-15 20:23:43 -04:00
|
|
|
/*
|
2012-11-17 19:26:15 -05:00
|
|
|
rational.c: Coded by Tadayoshi Funaba 2008-2012
|
2008-03-15 20:23:43 -04:00
|
|
|
|
|
|
|
This implementation is based on Keiju Ishitsuka's Rational library
|
|
|
|
which is written in ruby.
|
|
|
|
*/
|
|
|
|
|
2020-05-08 05:31:09 -04:00
|
|
|
#include "ruby/internal/config.h"
|
2019-12-04 03:16:30 -05:00
|
|
|
|
|
|
|
#include <ctype.h>
|
2008-04-01 08:21:33 -04:00
|
|
|
#include <float.h>
|
2019-12-04 03:16:30 -05:00
|
|
|
#include <math.h>
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-07-02 12:24:11 -04:00
|
|
|
#ifdef HAVE_IEEEFP_H
|
|
|
|
#include <ieeefp.h>
|
|
|
|
#endif
|
|
|
|
|
2022-05-09 02:57:09 -04:00
|
|
|
#if !defined(USE_GMP)
|
2013-09-06 08:07:08 -04:00
|
|
|
#if defined(HAVE_LIBGMP) && defined(HAVE_GMP_H)
|
2022-05-09 02:57:09 -04:00
|
|
|
# define USE_GMP 1
|
|
|
|
#else
|
|
|
|
# define USE_GMP 0
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#if USE_GMP
|
2013-09-06 08:07:08 -04:00
|
|
|
#include <gmp.h>
|
|
|
|
#endif
|
|
|
|
|
2019-12-04 03:16:30 -05:00
|
|
|
#include "id.h"
|
|
|
|
#include "internal.h"
|
2020-08-14 01:45:23 -04:00
|
|
|
#include "internal/array.h"
|
2019-12-04 03:16:30 -05:00
|
|
|
#include "internal/complex.h"
|
|
|
|
#include "internal/gc.h"
|
|
|
|
#include "internal/numeric.h"
|
|
|
|
#include "internal/object.h"
|
|
|
|
#include "internal/rational.h"
|
|
|
|
#include "ruby_assert.h"
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
#define ZERO INT2FIX(0)
|
|
|
|
#define ONE INT2FIX(1)
|
|
|
|
#define TWO INT2FIX(2)
|
|
|
|
|
2013-09-06 08:07:08 -04:00
|
|
|
#define GMP_GCD_DIGITS 1
|
|
|
|
|
2016-11-11 09:39:25 -05:00
|
|
|
#define INT_ZERO_P(x) (FIXNUM_P(x) ? FIXNUM_ZERO_P(x) : rb_bigzero_p(x))
|
2016-11-11 09:39:16 -05:00
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
VALUE rb_cRational;
|
|
|
|
|
2019-08-02 19:37:08 -04:00
|
|
|
static ID id_abs, id_integer_p,
|
2016-11-12 09:54:19 -05:00
|
|
|
id_i_num, id_i_den;
|
2019-08-02 19:37:08 -04:00
|
|
|
|
|
|
|
#define id_idiv idDiv
|
2018-01-22 08:09:37 -05:00
|
|
|
#define id_to_i idTo_i
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2013-05-29 19:57:25 -04:00
|
|
|
#define f_inspect rb_inspect
|
|
|
|
#define f_to_s rb_obj_as_string
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2018-11-14 09:12:30 -05:00
|
|
|
static VALUE nurat_to_f(VALUE self);
|
2021-01-22 21:04:45 -05:00
|
|
|
static VALUE float_to_r(VALUE self);
|
2018-11-14 09:12:30 -05:00
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
inline static VALUE
|
|
|
|
f_add(VALUE x, VALUE y)
|
|
|
|
{
|
2018-03-08 22:02:08 -05:00
|
|
|
if (FIXNUM_ZERO_P(y))
|
2008-09-12 21:55:56 -04:00
|
|
|
return x;
|
2018-03-08 22:02:08 -05:00
|
|
|
if (FIXNUM_ZERO_P(x))
|
2008-09-12 21:55:56 -04:00
|
|
|
return y;
|
2020-05-30 05:15:31 -04:00
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
|
|
|
return rb_int_plus(x, y);
|
2008-06-12 08:41:17 -04:00
|
|
|
return rb_funcall(x, '+', 1, y);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
inline static VALUE
|
2008-03-22 13:31:08 -04:00
|
|
|
f_div(VALUE x, VALUE y)
|
2008-03-20 08:26:58 -04:00
|
|
|
{
|
2018-03-08 22:02:08 -05:00
|
|
|
if (y == ONE)
|
2008-06-12 08:41:17 -04:00
|
|
|
return x;
|
2016-11-12 11:29:11 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
2016-11-12 10:43:26 -05:00
|
|
|
return rb_int_div(x, y);
|
2008-06-12 08:41:17 -04:00
|
|
|
return rb_funcall(x, '/', 1, y);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
f_lt_p(VALUE x, VALUE y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
if (FIXNUM_P(x) && FIXNUM_P(y))
|
2016-11-11 02:08:53 -05:00
|
|
|
return (SIGNED_VALUE)x < (SIGNED_VALUE)y;
|
2020-05-30 05:15:31 -04:00
|
|
|
if (RB_INTEGER_TYPE_P(x)) {
|
|
|
|
VALUE r = rb_int_cmp(x, y);
|
|
|
|
if (!NIL_P(r)) return rb_int_negative_p(r);
|
|
|
|
}
|
2016-11-11 02:08:53 -05:00
|
|
|
return RTEST(rb_funcall(x, '<', 1, y));
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 09:39:34 -05:00
|
|
|
#ifndef NDEBUG
|
|
|
|
/* f_mod is used only in f_gcd defined when NDEBUG is not defined */
|
2019-08-01 22:19:29 -04:00
|
|
|
inline static VALUE
|
|
|
|
f_mod(VALUE x, VALUE y)
|
|
|
|
{
|
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
|
|
|
return rb_int_modulo(x, y);
|
|
|
|
return rb_funcall(x, '%', 1, y);
|
|
|
|
}
|
2016-11-11 09:39:34 -05:00
|
|
|
#endif
|
2008-03-20 08:26:58 -04:00
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_mul(VALUE x, VALUE y)
|
|
|
|
{
|
2018-03-08 22:02:08 -05:00
|
|
|
if (FIXNUM_ZERO_P(y) && RB_INTEGER_TYPE_P(x))
|
|
|
|
return ZERO;
|
|
|
|
if (y == ONE) return x;
|
|
|
|
if (FIXNUM_ZERO_P(x) && RB_INTEGER_TYPE_P(y))
|
|
|
|
return ZERO;
|
|
|
|
if (x == ONE) return y;
|
|
|
|
else if (RB_INTEGER_TYPE_P(x))
|
2016-11-12 10:43:26 -05:00
|
|
|
return rb_int_mul(x, y);
|
2008-06-12 08:41:17 -04:00
|
|
|
return rb_funcall(x, '*', 1, y);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_sub(VALUE x, VALUE y)
|
|
|
|
{
|
2016-11-12 11:29:11 -05:00
|
|
|
if (FIXNUM_P(y) && FIXNUM_ZERO_P(y))
|
2008-09-12 21:55:56 -04:00
|
|
|
return x;
|
2008-06-12 08:41:17 -04:00
|
|
|
return rb_funcall(x, '-', 1, y);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-12 10:43:26 -05:00
|
|
|
inline static VALUE
|
|
|
|
f_abs(VALUE x)
|
|
|
|
{
|
2016-11-12 11:29:11 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
2016-11-12 10:43:26 -05:00
|
|
|
return rb_int_abs(x);
|
|
|
|
return rb_funcall(x, id_abs, 0);
|
|
|
|
}
|
|
|
|
|
2019-08-01 22:22:56 -04:00
|
|
|
|
2021-09-02 04:12:17 -04:00
|
|
|
inline static int
|
2019-08-01 22:22:56 -04:00
|
|
|
f_integer_p(VALUE x)
|
|
|
|
{
|
|
|
|
return RB_INTEGER_TYPE_P(x);
|
|
|
|
}
|
2011-04-24 09:24:02 -04:00
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_to_i(VALUE x)
|
|
|
|
{
|
2011-09-29 07:07:45 -04:00
|
|
|
if (RB_TYPE_P(x, T_STRING))
|
2011-04-24 09:24:02 -04:00
|
|
|
return rb_str_to_inum(x, 10, 0);
|
|
|
|
return rb_funcall(x, id_to_i, 0);
|
|
|
|
}
|
|
|
|
|
2020-05-30 05:15:31 -04:00
|
|
|
inline static int
|
2009-07-03 08:19:54 -04:00
|
|
|
f_eqeq_p(VALUE x, VALUE y)
|
2008-03-20 08:26:58 -04:00
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
if (FIXNUM_P(x) && FIXNUM_P(y))
|
2016-11-11 02:08:53 -05:00
|
|
|
return x == y;
|
2020-05-30 05:15:31 -04:00
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
|
|
|
return RTEST(rb_int_equal(x, y));
|
2016-11-12 20:51:29 -05:00
|
|
|
return (int)rb_equal(x, y);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2017-01-10 08:37:34 -05:00
|
|
|
inline static VALUE
|
|
|
|
f_idiv(VALUE x, VALUE y)
|
|
|
|
{
|
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
|
|
|
return rb_int_idiv(x, y);
|
|
|
|
return rb_funcall(x, id_idiv, 1, y);
|
|
|
|
}
|
2008-03-20 08:26:58 -04:00
|
|
|
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
#define f_expt10(x) rb_int_pow(INT2FIX(10), x)
|
2011-04-24 09:24:02 -04:00
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
f_zero_p(VALUE x)
|
|
|
|
{
|
2016-11-11 02:08:53 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(x)) {
|
2016-11-12 11:29:11 -05:00
|
|
|
return FIXNUM_ZERO_P(x);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(x, T_RATIONAL)) {
|
|
|
|
VALUE num = RRATIONAL(x)->num;
|
2009-07-12 10:57:42 -04:00
|
|
|
|
2016-11-12 11:29:11 -05:00
|
|
|
return FIXNUM_ZERO_P(num);
|
2009-07-12 10:57:42 -04:00
|
|
|
}
|
2016-11-12 20:51:29 -05:00
|
|
|
return (int)rb_equal(x, ZERO);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2008-09-21 08:21:32 -04:00
|
|
|
#define f_nonzero_p(x) (!f_zero_p(x))
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
f_one_p(VALUE x)
|
|
|
|
{
|
2016-11-11 02:08:53 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(x)) {
|
|
|
|
return x == LONG2FIX(1);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(x, T_RATIONAL)) {
|
|
|
|
VALUE num = RRATIONAL(x)->num;
|
|
|
|
VALUE den = RRATIONAL(x)->den;
|
2009-07-12 10:57:42 -04:00
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
return num == LONG2FIX(1) && den == LONG2FIX(1);
|
2009-07-12 10:57:42 -04:00
|
|
|
}
|
2016-11-12 20:51:29 -05:00
|
|
|
return (int)rb_equal(x, ONE);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2013-02-05 00:39:33 -05:00
|
|
|
f_minus_one_p(VALUE x)
|
|
|
|
{
|
2016-11-11 02:08:53 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(x)) {
|
|
|
|
return x == LONG2FIX(-1);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2021-09-03 07:50:12 -04:00
|
|
|
else if (RB_BIGNUM_TYPE_P(x)) {
|
2013-02-05 00:39:33 -05:00
|
|
|
return Qfalse;
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(x, T_RATIONAL)) {
|
|
|
|
VALUE num = RRATIONAL(x)->num;
|
|
|
|
VALUE den = RRATIONAL(x)->den;
|
2013-02-05 00:39:33 -05:00
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
return num == LONG2FIX(-1) && den == LONG2FIX(1);
|
2013-02-05 00:39:33 -05:00
|
|
|
}
|
2016-11-12 20:51:29 -05:00
|
|
|
return (int)rb_equal(x, INT2FIX(-1));
|
2013-02-05 00:39:33 -05:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
f_kind_of_p(VALUE x, VALUE c)
|
|
|
|
{
|
2016-11-13 23:02:45 -05:00
|
|
|
return (int)rb_obj_is_kind_of(x, c);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
k_numeric_p(VALUE x)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_kind_of_p(x, rb_cNumeric);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
k_integer_p(VALUE x)
|
|
|
|
{
|
2016-11-11 02:08:53 -05:00
|
|
|
return RB_INTEGER_TYPE_P(x);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
k_float_p(VALUE x)
|
|
|
|
{
|
2016-11-11 02:08:53 -05:00
|
|
|
return RB_FLOAT_TYPE_P(x);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 02:08:53 -05:00
|
|
|
inline static int
|
2008-03-20 08:26:58 -04:00
|
|
|
k_rational_p(VALUE x)
|
|
|
|
{
|
2016-11-11 02:08:53 -05:00
|
|
|
return RB_TYPE_P(x, T_RATIONAL);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2008-09-19 09:55:52 -04:00
|
|
|
#define k_exact_p(x) (!k_float_p(x))
|
|
|
|
#define k_inexact_p(x) k_float_p(x)
|
|
|
|
|
2009-07-12 08:09:21 -04:00
|
|
|
#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))
|
|
|
|
|
2022-05-09 02:57:09 -04:00
|
|
|
#if USE_GMP
|
2013-09-06 08:07:08 -04:00
|
|
|
VALUE
|
|
|
|
rb_gcd_gmp(VALUE x, VALUE y)
|
|
|
|
{
|
2014-04-12 23:48:17 -04:00
|
|
|
const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
|
2013-09-06 08:07:08 -04:00
|
|
|
mpz_t mx, my, mz;
|
|
|
|
size_t count;
|
|
|
|
VALUE z;
|
|
|
|
long zn;
|
|
|
|
|
|
|
|
mpz_init(mx);
|
|
|
|
mpz_init(my);
|
|
|
|
mpz_init(mz);
|
2014-02-15 16:17:34 -05:00
|
|
|
mpz_import(mx, BIGNUM_LEN(x), -1, sizeof(BDIGIT), 0, nails, BIGNUM_DIGITS(x));
|
|
|
|
mpz_import(my, BIGNUM_LEN(y), -1, sizeof(BDIGIT), 0, nails, BIGNUM_DIGITS(y));
|
2013-09-06 08:07:08 -04:00
|
|
|
|
|
|
|
mpz_gcd(mz, mx, my);
|
|
|
|
|
2016-12-30 03:01:34 -05:00
|
|
|
mpz_clear(mx);
|
|
|
|
mpz_clear(my);
|
|
|
|
|
2014-04-12 23:48:17 -04:00
|
|
|
zn = (mpz_sizeinbase(mz, 16) + SIZEOF_BDIGIT*2 - 1) / (SIZEOF_BDIGIT*2);
|
2013-09-06 08:07:08 -04:00
|
|
|
z = rb_big_new(zn, 1);
|
2014-02-15 16:17:34 -05:00
|
|
|
mpz_export(BIGNUM_DIGITS(z), &count, -1, sizeof(BDIGIT), 0, nails, mz);
|
2013-09-06 08:07:08 -04:00
|
|
|
|
2016-12-30 03:01:34 -05:00
|
|
|
mpz_clear(mz);
|
|
|
|
|
2013-09-06 08:07:08 -04:00
|
|
|
return rb_big_norm(z);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
#ifndef NDEBUG
|
|
|
|
#define f_gcd f_gcd_orig
|
|
|
|
#endif
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
inline static long
|
|
|
|
i_gcd(long x, long y)
|
|
|
|
{
|
2017-05-27 01:41:02 -04:00
|
|
|
unsigned long u, v, t;
|
|
|
|
int shift;
|
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (x < 0)
|
|
|
|
x = -x;
|
|
|
|
if (y < 0)
|
|
|
|
y = -y;
|
|
|
|
|
|
|
|
if (x == 0)
|
|
|
|
return y;
|
|
|
|
if (y == 0)
|
|
|
|
return x;
|
|
|
|
|
2017-05-27 01:41:02 -04:00
|
|
|
u = (unsigned long)x;
|
|
|
|
v = (unsigned long)y;
|
|
|
|
for (shift = 0; ((u | v) & 1) == 0; ++shift) {
|
|
|
|
u >>= 1;
|
|
|
|
v >>= 1;
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2017-05-27 01:41:02 -04:00
|
|
|
|
|
|
|
while ((u & 1) == 0)
|
|
|
|
u >>= 1;
|
|
|
|
|
|
|
|
do {
|
|
|
|
while ((v & 1) == 0)
|
|
|
|
v >>= 1;
|
|
|
|
|
|
|
|
if (u > v) {
|
|
|
|
t = v;
|
|
|
|
v = u;
|
|
|
|
u = t;
|
|
|
|
}
|
|
|
|
v = v - u;
|
|
|
|
} while (v != 0);
|
|
|
|
|
|
|
|
return (long)(u << shift);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
inline static VALUE
|
2013-09-06 08:07:08 -04:00
|
|
|
f_gcd_normal(VALUE x, VALUE y)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE z;
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (FIXNUM_P(x) && FIXNUM_P(y))
|
|
|
|
return LONG2NUM(i_gcd(FIX2LONG(x), FIX2LONG(y)));
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2016-11-11 09:39:16 -05:00
|
|
|
if (INT_NEGATIVE_P(x))
|
|
|
|
x = rb_int_uminus(x);
|
|
|
|
if (INT_NEGATIVE_P(y))
|
|
|
|
y = rb_int_uminus(y);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2016-11-11 09:39:16 -05:00
|
|
|
if (INT_ZERO_P(x))
|
2008-03-15 20:23:43 -04:00
|
|
|
return y;
|
2016-11-11 09:39:16 -05:00
|
|
|
if (INT_ZERO_P(y))
|
2008-03-31 12:42:24 -04:00
|
|
|
return x;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
if (FIXNUM_P(x)) {
|
2016-11-12 11:29:11 -05:00
|
|
|
if (FIXNUM_ZERO_P(x))
|
2008-03-31 12:42:24 -04:00
|
|
|
return y;
|
|
|
|
if (FIXNUM_P(y))
|
|
|
|
return LONG2NUM(i_gcd(FIX2LONG(x), FIX2LONG(y)));
|
|
|
|
}
|
|
|
|
z = x;
|
2016-11-11 09:39:16 -05:00
|
|
|
x = rb_int_modulo(y, x);
|
2008-03-31 12:42:24 -04:00
|
|
|
y = z;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
/* NOTREACHED */
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2013-09-06 08:07:08 -04:00
|
|
|
VALUE
|
|
|
|
rb_gcd_normal(VALUE x, VALUE y)
|
|
|
|
{
|
|
|
|
return f_gcd_normal(x, y);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_gcd(VALUE x, VALUE y)
|
|
|
|
{
|
2022-05-09 02:57:09 -04:00
|
|
|
#if USE_GMP
|
2021-09-03 07:50:12 -04:00
|
|
|
if (RB_BIGNUM_TYPE_P(x) && RB_BIGNUM_TYPE_P(y)) {
|
2014-04-18 21:11:04 -04:00
|
|
|
size_t xn = BIGNUM_LEN(x);
|
|
|
|
size_t yn = BIGNUM_LEN(y);
|
2013-09-08 03:02:42 -04:00
|
|
|
if (GMP_GCD_DIGITS <= xn || GMP_GCD_DIGITS <= yn)
|
2013-09-06 08:07:08 -04:00
|
|
|
return rb_gcd_gmp(x, y);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
return f_gcd_normal(x, y);
|
|
|
|
}
|
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
#ifndef NDEBUG
|
|
|
|
#undef f_gcd
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_gcd(VALUE x, VALUE y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE r = f_gcd_orig(x, y);
|
2008-09-21 08:21:32 -04:00
|
|
|
if (f_nonzero_p(r)) {
|
2008-03-31 12:42:24 -04:00
|
|
|
assert(f_zero_p(f_mod(x, r)));
|
|
|
|
assert(f_zero_p(f_mod(y, r)));
|
|
|
|
}
|
|
|
|
return r;
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-03-27 07:48:00 -04:00
|
|
|
inline static VALUE
|
|
|
|
f_lcm(VALUE x, VALUE y)
|
2008-03-19 09:29:04 -04:00
|
|
|
{
|
2016-11-12 10:43:26 -05:00
|
|
|
if (INT_ZERO_P(x) || INT_ZERO_P(y))
|
2008-03-31 12:42:24 -04:00
|
|
|
return ZERO;
|
2008-06-12 08:41:17 -04:00
|
|
|
return f_abs(f_mul(f_div(x, f_gcd(x, y)), y));
|
2008-03-19 09:29:04 -04:00
|
|
|
}
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
#define get_dat1(x) \
|
2016-03-29 21:27:03 -04:00
|
|
|
struct RRational *dat = RRATIONAL(x)
|
2008-03-15 20:23:43 -04:00
|
|
|
|
|
|
|
#define get_dat2(x,y) \
|
2016-03-29 21:27:03 -04:00
|
|
|
struct RRational *adat = RRATIONAL(x), *bdat = RRATIONAL(y)
|
2008-03-15 20:23:43 -04:00
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
nurat_s_new_internal(VALUE klass, VALUE num, VALUE den)
|
|
|
|
{
|
* gc.c: support RGENGC. [ruby-trunk - Feature #8339]
See this ticet about RGENGC.
* gc.c: Add several flags:
* RGENGC_DEBUG: if >0, then prints debug information.
* RGENGC_CHECK_MODE: if >0, add assertions.
* RGENGC_PROFILE: if >0, add profiling features.
check GC.stat and GC::Profiler.
* include/ruby/ruby.h: disable RGENGC by default (USE_RGENGC == 0).
* array.c: add write barriers for T_ARRAY and generate sunny objects.
* include/ruby/ruby.h (RARRAY_PTR_USE): added. Use this macro if
you want to access raw pointers. If you modify the contents which
pointer pointed, then you need to care write barrier.
* bignum.c, marshal.c, random.c: generate T_BIGNUM sunny objects.
* complex.c, include/ruby/ruby.h: add write barriers for T_COMPLEX
and generate sunny objects.
* rational.c (nurat_s_new_internal), include/ruby/ruby.h: add write
barriers for T_RATIONAL and generate sunny objects.
* internal.h: add write barriers for RBasic::klass.
* numeric.c (rb_float_new_in_heap): generate sunny T_FLOAT objects.
* object.c (rb_class_allocate_instance), range.c:
generate sunny T_OBJECT objects.
* string.c: add write barriers for T_STRING and generate sunny objects.
* variable.c: add write barriers for ivars.
* vm_insnhelper.c (vm_setivar): ditto.
* include/ruby/ruby.h, debug.c: use two flags
FL_WB_PROTECTED and FL_OLDGEN.
* node.h (NODE_FL_CREF_PUSHED_BY_EVAL, NODE_FL_CREF_OMOD_SHARED):
move flag bits.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@40703 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2013-05-13 14:07:47 -04:00
|
|
|
NEWOBJ_OF(obj, struct RRational, klass, T_RATIONAL | (RGENGC_WB_PROTECTED_RATIONAL ? FL_WB_PROTECTED : 0));
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2020-01-16 19:05:17 -05:00
|
|
|
RATIONAL_SET_NUM((VALUE)obj, num);
|
|
|
|
RATIONAL_SET_DEN((VALUE)obj, den);
|
2020-04-08 00:28:13 -04:00
|
|
|
OBJ_FREEZE_RAW((VALUE)obj);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
return (VALUE)obj;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
nurat_s_alloc(VALUE klass)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return nurat_s_new_internal(klass, ZERO, ONE);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_rational_new_bang1(VALUE klass, VALUE x)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return nurat_s_new_internal(klass, x, ONE);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2008-04-03 08:55:27 -04:00
|
|
|
inline static void
|
2008-04-02 09:31:42 -04:00
|
|
|
nurat_int_check(VALUE num)
|
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (!RB_INTEGER_TYPE_P(num)) {
|
2008-09-12 21:55:56 -04:00
|
|
|
if (!k_numeric_p(num) || !f_integer_p(num))
|
2010-03-03 09:18:26 -05:00
|
|
|
rb_raise(rb_eTypeError, "not an integer");
|
2008-04-02 09:31:42 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-09-12 21:55:56 -04:00
|
|
|
inline static VALUE
|
|
|
|
nurat_int_value(VALUE num)
|
|
|
|
{
|
|
|
|
nurat_int_check(num);
|
|
|
|
if (!k_integer_p(num))
|
|
|
|
num = f_to_i(num);
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2016-11-11 02:26:14 -05:00
|
|
|
static void
|
|
|
|
nurat_canonicalize(VALUE *num, VALUE *den)
|
|
|
|
{
|
2018-09-28 20:43:29 -04:00
|
|
|
assert(num); assert(RB_INTEGER_TYPE_P(*num));
|
|
|
|
assert(den); assert(RB_INTEGER_TYPE_P(*den));
|
2016-11-12 01:07:46 -05:00
|
|
|
if (INT_NEGATIVE_P(*den)) {
|
2016-11-18 10:04:36 -05:00
|
|
|
*num = rb_int_uminus(*num);
|
|
|
|
*den = rb_int_uminus(*den);
|
2016-11-11 02:26:14 -05:00
|
|
|
}
|
2016-11-12 01:07:46 -05:00
|
|
|
else if (INT_ZERO_P(*den)) {
|
2016-11-12 06:52:09 -05:00
|
|
|
rb_num_zerodiv();
|
2016-11-11 02:26:14 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-12-29 05:32:48 -05:00
|
|
|
static void
|
|
|
|
nurat_reduce(VALUE *x, VALUE *y)
|
|
|
|
{
|
2017-01-10 08:41:18 -05:00
|
|
|
VALUE gcd;
|
|
|
|
if (*x == ONE || *y == ONE) return;
|
|
|
|
gcd = f_gcd(*x, *y);
|
2016-12-29 05:32:48 -05:00
|
|
|
*x = f_idiv(*x, gcd);
|
|
|
|
*y = f_idiv(*y, gcd);
|
|
|
|
}
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
inline static VALUE
|
|
|
|
nurat_s_canonicalize_internal(VALUE klass, VALUE num, VALUE den)
|
|
|
|
{
|
2016-11-11 02:26:14 -05:00
|
|
|
nurat_canonicalize(&num, &den);
|
2016-12-29 05:32:48 -05:00
|
|
|
nurat_reduce(&num, &den);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-06-12 08:41:17 -04:00
|
|
|
return nurat_s_new_internal(klass, num, den);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
inline static VALUE
|
|
|
|
nurat_s_canonicalize_internal_no_reduce(VALUE klass, VALUE num, VALUE den)
|
|
|
|
{
|
2016-11-11 02:26:14 -05:00
|
|
|
nurat_canonicalize(&num, &den);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-06-12 08:41:17 -04:00
|
|
|
return nurat_s_new_internal(klass, num, den);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
inline static VALUE
|
|
|
|
f_rational_new2(VALUE klass, VALUE x, VALUE y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
assert(!k_rational_p(x));
|
|
|
|
assert(!k_rational_p(y));
|
|
|
|
return nurat_s_canonicalize_internal(klass, x, y);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
inline static VALUE
|
|
|
|
f_rational_new_no_reduce2(VALUE klass, VALUE x, VALUE y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
assert(!k_rational_p(x));
|
|
|
|
assert(!k_rational_p(y));
|
|
|
|
return nurat_s_canonicalize_internal_no_reduce(klass, x, y);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2018-03-15 03:19:46 -04:00
|
|
|
static VALUE nurat_convert(VALUE klass, VALUE numv, VALUE denv, int raise);
|
2016-11-12 01:07:46 -05:00
|
|
|
static VALUE nurat_s_convert(int argc, VALUE *argv, VALUE klass);
|
2018-03-15 03:19:46 -04:00
|
|
|
|
2009-06-27 03:46:57 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2019-01-03 00:51:18 -05:00
|
|
|
* Rational(x, y, exception: true) -> rational or nil
|
|
|
|
* Rational(arg, exception: true) -> rational or nil
|
2009-06-27 03:46:57 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns +x/y+ or +arg+ as a Rational.
|
2012-11-03 10:39:50 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational(2, 3) #=> (2/3)
|
|
|
|
* Rational(5) #=> (5/1)
|
|
|
|
* Rational(0.5) #=> (1/2)
|
|
|
|
* Rational(0.3) #=> (5404319552844595/18014398509481984)
|
|
|
|
*
|
|
|
|
* Rational("2/3") #=> (2/3)
|
|
|
|
* Rational("0.3") #=> (3/10)
|
2013-03-09 19:18:52 -05:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational("10 cents") #=> ArgumentError
|
|
|
|
* Rational(nil) #=> TypeError
|
|
|
|
* Rational(1, nil) #=> TypeError
|
|
|
|
*
|
2018-12-22 17:39:31 -05:00
|
|
|
* Rational("10 cents", exception: false) #=> nil
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Syntax of the string form:
|
2013-03-09 19:18:52 -05:00
|
|
|
*
|
2013-03-10 04:01:32 -04:00
|
|
|
* string form = extra spaces , rational , extra spaces ;
|
2013-03-09 19:18:52 -05:00
|
|
|
* 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 ] ;
|
|
|
|
* sign = "-" | "+" ;
|
2013-03-10 04:01:32 -04:00
|
|
|
* digits = digit , { digit | "_" , digit } ;
|
2013-03-09 19:18:52 -05:00
|
|
|
* digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;
|
2013-03-10 04:01:32 -04:00
|
|
|
* extra spaces = ? \s* ? ;
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* See also String#to_r.
|
2009-06-27 03:46:57 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_f_rational(int argc, VALUE *argv, VALUE klass)
|
|
|
|
{
|
2018-03-15 03:19:46 -04:00
|
|
|
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)) {
|
2019-07-11 06:20:53 -04:00
|
|
|
raise = rb_opts_exception_p(opts, raise);
|
2018-03-15 03:19:46 -04:00
|
|
|
}
|
|
|
|
return nurat_convert(rb_cRational, a1, a2, raise);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.numerator -> integer
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the numerator.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(7).numerator #=> 7
|
|
|
|
* Rational(7, 1).numerator #=> 7
|
|
|
|
* Rational(9, -4).numerator #=> -9
|
|
|
|
* Rational(-2, -10).numerator #=> 1
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_numerator(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
|
|
|
return dat->num;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.denominator -> integer
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the denominator (always positive).
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-07-05 11:48:09 -04:00
|
|
|
* Rational(7).denominator #=> 1
|
|
|
|
* Rational(7, 1).denominator #=> 1
|
|
|
|
* Rational(9, -4).denominator #=> 4
|
|
|
|
* Rational(-2, -10).denominator #=> 5
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_denominator(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
|
|
|
return dat->den;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2016-11-12 01:07:01 -05:00
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* -rat -> rational
|
|
|
|
*
|
|
|
|
* Negates +rat+.
|
|
|
|
*/
|
2016-11-18 10:17:19 -05:00
|
|
|
VALUE
|
|
|
|
rb_rational_uminus(VALUE self)
|
2016-11-12 01:07:01 -05:00
|
|
|
{
|
2016-11-18 10:17:19 -05:00
|
|
|
const int unused = (assert(RB_TYPE_P(self, T_RATIONAL)), 0);
|
2016-11-12 01:07:01 -05:00
|
|
|
get_dat1(self);
|
2016-11-18 10:17:19 -05:00
|
|
|
(void)unused;
|
2016-11-12 01:07:01 -05:00
|
|
|
return f_rational_new2(CLASS_OF(self), rb_int_uminus(dat->num), dat->den);
|
|
|
|
}
|
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
#ifndef NDEBUG
|
|
|
|
#define f_imul f_imul_orig
|
|
|
|
#endif
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_imul(long a, long b)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE r;
|
2008-03-20 08:26:58 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (a == 0 || b == 0)
|
|
|
|
return ZERO;
|
|
|
|
else if (a == 1)
|
|
|
|
return LONG2NUM(b);
|
|
|
|
else if (b == 1)
|
|
|
|
return LONG2NUM(a);
|
2008-03-20 08:26:58 -04:00
|
|
|
|
2013-04-09 07:39:53 -04:00
|
|
|
if (MUL_OVERFLOW_LONG_P(a, b))
|
2008-03-31 12:42:24 -04:00
|
|
|
r = rb_big_mul(rb_int2big(a), rb_int2big(b));
|
2013-04-09 07:39:53 -04:00
|
|
|
else
|
|
|
|
r = LONG2NUM(a * b);
|
2008-03-31 12:42:24 -04:00
|
|
|
return r;
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
#undef f_imul
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_imul(long x, long y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE r = f_imul_orig(x, y);
|
2009-07-03 08:19:54 -04:00
|
|
|
assert(f_eqeq_p(r, f_mul(LONG2NUM(x), LONG2NUM(y))));
|
2008-03-31 12:42:24 -04:00
|
|
|
return r;
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
inline static VALUE
|
|
|
|
f_addsub(VALUE self, VALUE anum, VALUE aden, VALUE bnum, VALUE bden, int k)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE num, den;
|
2008-03-20 08:26:58 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (FIXNUM_P(anum) && FIXNUM_P(aden) &&
|
|
|
|
FIXNUM_P(bnum) && FIXNUM_P(bden)) {
|
|
|
|
long an = FIX2LONG(anum);
|
|
|
|
long ad = FIX2LONG(aden);
|
|
|
|
long bn = FIX2LONG(bnum);
|
|
|
|
long bd = FIX2LONG(bden);
|
|
|
|
long ig = i_gcd(ad, bd);
|
|
|
|
|
|
|
|
VALUE g = LONG2NUM(ig);
|
|
|
|
VALUE a = f_imul(an, bd / ig);
|
|
|
|
VALUE b = f_imul(bn, ad / ig);
|
|
|
|
VALUE c;
|
|
|
|
|
|
|
|
if (k == '+')
|
2016-11-11 09:42:53 -05:00
|
|
|
c = rb_int_plus(a, b);
|
2008-03-31 12:42:24 -04:00
|
|
|
else
|
2016-11-11 09:57:11 -05:00
|
|
|
c = rb_int_minus(a, b);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2016-11-11 09:42:53 -05:00
|
|
|
b = rb_int_idiv(aden, g);
|
2008-03-31 12:42:24 -04:00
|
|
|
g = f_gcd(c, g);
|
2016-11-11 09:42:53 -05:00
|
|
|
num = rb_int_idiv(c, g);
|
|
|
|
a = rb_int_idiv(bden, g);
|
|
|
|
den = rb_int_mul(a, b);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2018-10-02 12:42:21 -04:00
|
|
|
else if (RB_INTEGER_TYPE_P(anum) && RB_INTEGER_TYPE_P(aden) &&
|
|
|
|
RB_INTEGER_TYPE_P(bnum) && RB_INTEGER_TYPE_P(bden)) {
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE g = f_gcd(aden, bden);
|
2016-11-11 09:42:53 -05:00
|
|
|
VALUE a = rb_int_mul(anum, rb_int_idiv(bden, g));
|
|
|
|
VALUE b = rb_int_mul(bnum, rb_int_idiv(aden, g));
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE c;
|
|
|
|
|
|
|
|
if (k == '+')
|
2016-11-11 09:42:53 -05:00
|
|
|
c = rb_int_plus(a, b);
|
2008-03-31 12:42:24 -04:00
|
|
|
else
|
2016-11-11 09:57:11 -05:00
|
|
|
c = rb_int_minus(a, b);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2016-11-11 09:42:53 -05:00
|
|
|
b = rb_int_idiv(aden, g);
|
2008-03-31 12:42:24 -04:00
|
|
|
g = f_gcd(c, g);
|
2016-11-11 09:42:53 -05:00
|
|
|
num = rb_int_idiv(c, g);
|
|
|
|
a = rb_int_idiv(bden, g);
|
|
|
|
den = rb_int_mul(a, b);
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2018-10-02 12:42:21 -04:00
|
|
|
else {
|
|
|
|
double a = NUM2DBL(anum) / NUM2DBL(aden);
|
|
|
|
double b = NUM2DBL(bnum) / NUM2DBL(bden);
|
|
|
|
double c = k == '+' ? a + b : a - b;
|
|
|
|
return DBL2NUM(c);
|
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_rational_new_no_reduce2(CLASS_OF(self), num, den);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2016-11-11 10:55:30 -05:00
|
|
|
static double nurat_to_double(VALUE self);
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2010-11-23 09:28:55 -05:00
|
|
|
* rat + numeric -> numeric
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Performs addition.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2, 3) + Rational(2, 3) #=> (4/3)
|
2017-02-05 06:15:49 -05:00
|
|
|
* Rational(900) + Rational(1) #=> (901/1)
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(-2, 9) + Rational(-9, 2) #=> (-85/18)
|
|
|
|
* Rational(9, 8) + 4 #=> (41/8)
|
|
|
|
* Rational(20, 9) + 9.8 #=> 12.022222222222222
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2016-04-15 10:46:35 -04:00
|
|
|
VALUE
|
2016-04-15 10:54:39 -04:00
|
|
|
rb_rational_plus(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(other)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat1(self);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2016-11-11 09:39:07 -05:00
|
|
|
return f_rational_new_no_reduce2(CLASS_OF(self),
|
|
|
|
rb_int_plus(dat->num, rb_int_mul(other, dat->den)),
|
|
|
|
dat->den);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2016-11-12 11:29:11 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other)) {
|
2016-11-11 10:55:30 -05:00
|
|
|
return DBL2NUM(nurat_to_double(self) + RFLOAT_VALUE(other));
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(other, T_RATIONAL)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat2(self, other);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-04-22 09:17:04 -04:00
|
|
|
return f_addsub(self,
|
|
|
|
adat->num, adat->den,
|
|
|
|
bdat->num, bdat->den, '+');
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else {
|
2008-04-02 10:13:53 -04:00
|
|
|
return rb_num_coerce_bin(self, other, '+');
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2010-11-23 09:28:55 -05:00
|
|
|
* rat - numeric -> numeric
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Performs subtraction.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2, 3) - Rational(2, 3) #=> (0/1)
|
|
|
|
* Rational(900) - Rational(1) #=> (899/1)
|
|
|
|
* Rational(-2, 9) - Rational(-9, 2) #=> (77/18)
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational(9, 8) - 4 #=> (-23/8)
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(20, 9) - 9.8 #=> -7.577777777777778
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2020-05-30 05:34:32 -04:00
|
|
|
VALUE
|
|
|
|
rb_rational_minus(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(other)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat1(self);
|
2008-03-20 08:26:58 -04:00
|
|
|
|
2016-11-11 09:45:11 -05:00
|
|
|
return f_rational_new_no_reduce2(CLASS_OF(self),
|
|
|
|
rb_int_minus(dat->num, rb_int_mul(other, dat->den)),
|
|
|
|
dat->den);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2016-11-11 09:57:11 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other)) {
|
2016-11-11 10:55:30 -05:00
|
|
|
return DBL2NUM(nurat_to_double(self) - RFLOAT_VALUE(other));
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(other, T_RATIONAL)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat2(self, other);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-04-22 09:17:04 -04:00
|
|
|
return f_addsub(self,
|
|
|
|
adat->num, adat->den,
|
|
|
|
bdat->num, bdat->den, '-');
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else {
|
2008-04-02 10:13:53 -04:00
|
|
|
return rb_num_coerce_bin(self, other, '-');
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-03-20 08:26:58 -04:00
|
|
|
inline static VALUE
|
|
|
|
f_muldiv(VALUE self, VALUE anum, VALUE aden, VALUE bnum, VALUE bden, int k)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE num, den;
|
2008-03-20 08:26:58 -04:00
|
|
|
|
2016-11-11 11:18:13 -05:00
|
|
|
assert(RB_TYPE_P(self, T_RATIONAL));
|
2018-09-28 20:45:41 -04:00
|
|
|
|
|
|
|
/* Integer#** can return Rational with Float right now */
|
|
|
|
if (RB_FLOAT_TYPE_P(anum) || RB_FLOAT_TYPE_P(aden) ||
|
|
|
|
RB_FLOAT_TYPE_P(bnum) || RB_FLOAT_TYPE_P(bden)) {
|
|
|
|
double an = NUM2DBL(anum), ad = NUM2DBL(aden);
|
|
|
|
double bn = NUM2DBL(bnum), bd = NUM2DBL(bden);
|
|
|
|
double x = (an * bn) / (ad * bd);
|
|
|
|
return DBL2NUM(x);
|
|
|
|
}
|
|
|
|
|
2016-11-11 11:18:13 -05:00
|
|
|
assert(RB_INTEGER_TYPE_P(anum));
|
|
|
|
assert(RB_INTEGER_TYPE_P(aden));
|
|
|
|
assert(RB_INTEGER_TYPE_P(bnum));
|
|
|
|
assert(RB_INTEGER_TYPE_P(bden));
|
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (k == '/') {
|
|
|
|
VALUE t;
|
|
|
|
|
2016-11-11 11:17:56 -05:00
|
|
|
if (INT_NEGATIVE_P(bnum)) {
|
|
|
|
anum = rb_int_uminus(anum);
|
|
|
|
bnum = rb_int_uminus(bnum);
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
|
|
|
t = bnum;
|
|
|
|
bnum = bden;
|
|
|
|
bden = t;
|
|
|
|
}
|
2008-03-20 08:26:58 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (FIXNUM_P(anum) && FIXNUM_P(aden) &&
|
|
|
|
FIXNUM_P(bnum) && FIXNUM_P(bden)) {
|
|
|
|
long an = FIX2LONG(anum);
|
|
|
|
long ad = FIX2LONG(aden);
|
|
|
|
long bn = FIX2LONG(bnum);
|
|
|
|
long bd = FIX2LONG(bden);
|
|
|
|
long g1 = i_gcd(an, bd);
|
|
|
|
long g2 = i_gcd(ad, bn);
|
|
|
|
|
|
|
|
num = f_imul(an / g1, bn / g2);
|
|
|
|
den = f_imul(ad / g2, bd / g1);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
|
|
|
else {
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE g1 = f_gcd(anum, bden);
|
|
|
|
VALUE g2 = f_gcd(aden, bnum);
|
|
|
|
|
2016-11-11 10:11:04 -05:00
|
|
|
num = rb_int_mul(rb_int_idiv(anum, g1), rb_int_idiv(bnum, g2));
|
|
|
|
den = rb_int_mul(rb_int_idiv(aden, g2), rb_int_idiv(bden, g1));
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_rational_new_no_reduce2(CLASS_OF(self), num, den);
|
2008-03-20 08:26:58 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2010-11-23 09:28:55 -05:00
|
|
|
* rat * numeric -> numeric
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Performs multiplication.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2, 3) * Rational(2, 3) #=> (4/9)
|
|
|
|
* Rational(900) * Rational(1) #=> (900/1)
|
|
|
|
* Rational(-2, 9) * Rational(-9, 2) #=> (1/1)
|
|
|
|
* Rational(9, 8) * 4 #=> (9/2)
|
|
|
|
* Rational(20, 9) * 9.8 #=> 21.77777777777778
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2019-01-03 01:19:17 -05:00
|
|
|
VALUE
|
|
|
|
rb_rational_mul(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(other)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat1(self);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-04-22 09:17:04 -04:00
|
|
|
return f_muldiv(self,
|
|
|
|
dat->num, dat->den,
|
|
|
|
other, ONE, '*');
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2016-11-11 10:11:04 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other)) {
|
2016-11-11 10:55:30 -05:00
|
|
|
return DBL2NUM(nurat_to_double(self) * RFLOAT_VALUE(other));
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(other, T_RATIONAL)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat2(self, other);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-04-22 09:17:04 -04:00
|
|
|
return f_muldiv(self,
|
|
|
|
adat->num, adat->den,
|
|
|
|
bdat->num, bdat->den, '*');
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else {
|
2008-04-02 10:13:53 -04:00
|
|
|
return rb_num_coerce_bin(self, other, '*');
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2010-11-23 09:28:55 -05:00
|
|
|
* rat / numeric -> numeric
|
|
|
|
* rat.quo(numeric) -> numeric
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Performs division.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2, 3) / Rational(2, 3) #=> (1/1)
|
|
|
|
* Rational(900) / Rational(1) #=> (900/1)
|
|
|
|
* Rational(-2, 9) / Rational(-9, 2) #=> (4/81)
|
|
|
|
* Rational(9, 8) / 4 #=> (9/32)
|
|
|
|
* Rational(20, 9) / 9.8 #=> 0.22675736961451246
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2020-12-09 04:48:59 -05:00
|
|
|
VALUE
|
|
|
|
rb_rational_div(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(other)) {
|
2008-03-31 12:42:24 -04:00
|
|
|
if (f_zero_p(other))
|
2016-11-12 06:52:09 -05:00
|
|
|
rb_num_zerodiv();
|
2008-03-31 12:42:24 -04:00
|
|
|
{
|
|
|
|
get_dat1(self);
|
|
|
|
|
|
|
|
return f_muldiv(self,
|
|
|
|
dat->num, dat->den,
|
|
|
|
other, ONE, '/');
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2018-11-14 04:53:11 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other)) {
|
2018-11-14 09:12:30 -05:00
|
|
|
VALUE v = nurat_to_f(self);
|
2018-11-14 04:53:13 -05:00
|
|
|
return rb_flo_div_flo(v, other);
|
2018-11-14 04:53:11 -05:00
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
else if (RB_TYPE_P(other, T_RATIONAL)) {
|
2008-03-31 12:42:24 -04:00
|
|
|
if (f_zero_p(other))
|
2016-11-12 06:52:09 -05:00
|
|
|
rb_num_zerodiv();
|
2008-03-31 12:42:24 -04:00
|
|
|
{
|
|
|
|
get_dat2(self, other);
|
|
|
|
|
2009-07-12 10:57:42 -04:00
|
|
|
if (f_one_p(self))
|
|
|
|
return f_rational_new_no_reduce2(CLASS_OF(self),
|
|
|
|
bdat->den, bdat->num);
|
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_muldiv(self,
|
|
|
|
adat->num, adat->den,
|
|
|
|
bdat->num, bdat->den, '/');
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else {
|
2008-04-02 10:13:53 -04:00
|
|
|
return rb_num_coerce_bin(self, other, '/');
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.fdiv(numeric) -> float
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Performs division and returns the value as a Float.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2, 3).fdiv(1) #=> 0.6666666666666666
|
|
|
|
* Rational(2, 3).fdiv(0.5) #=> 1.3333333333333333
|
|
|
|
* Rational(2).fdiv(3) #=> 0.6666666666666666
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_fdiv(VALUE self, VALUE other)
|
|
|
|
{
|
2016-11-12 02:28:47 -05:00
|
|
|
VALUE div;
|
2009-06-28 10:39:31 -04:00
|
|
|
if (f_zero_p(other))
|
2020-12-09 04:48:59 -05:00
|
|
|
return rb_rational_div(self, rb_float_new(0.0));
|
2016-11-12 02:28:47 -05:00
|
|
|
if (FIXNUM_P(other) && other == LONG2FIX(1))
|
|
|
|
return nurat_to_f(self);
|
2020-12-09 04:48:59 -05:00
|
|
|
div = rb_rational_div(self, other);
|
2016-11-12 02:28:47 -05:00
|
|
|
if (RB_TYPE_P(div, T_RATIONAL))
|
|
|
|
return nurat_to_f(div);
|
|
|
|
if (RB_FLOAT_TYPE_P(div))
|
|
|
|
return div;
|
2018-02-27 03:15:27 -05:00
|
|
|
return rb_funcall(div, idTo_f, 0);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2010-11-23 09:28:55 -05:00
|
|
|
* rat ** numeric -> numeric
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Performs exponentiation.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational(2) ** Rational(3) #=> (8/1)
|
|
|
|
* Rational(10) ** -2 #=> (1/100)
|
|
|
|
* Rational(10) ** -2.0 #=> 0.01
|
|
|
|
* Rational(-4) ** Rational(1, 2) #=> (0.0+2.0i)
|
|
|
|
* Rational(1, 2) ** 0 #=> (1/1)
|
|
|
|
* Rational(1, 2) ** 0.0 #=> 1.0
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2018-10-19 22:49:18 -04:00
|
|
|
VALUE
|
|
|
|
rb_rational_pow(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2010-11-22 17:31:55 -05:00
|
|
|
if (k_numeric_p(other) && k_exact_zero_p(other))
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_rational_new_bang1(CLASS_OF(self), ONE);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (k_rational_p(other)) {
|
|
|
|
get_dat1(other);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
if (f_one_p(dat->den))
|
2009-06-28 06:50:39 -04:00
|
|
|
other = dat->num; /* c14n */
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2013-02-05 00:39:33 -05:00
|
|
|
/* Deal with special cases of 0**n and 1**n */
|
|
|
|
if (k_numeric_p(other) && k_exact_p(other)) {
|
|
|
|
get_dat1(self);
|
2013-03-12 04:00:16 -04:00
|
|
|
if (f_one_p(dat->den)) {
|
|
|
|
if (f_one_p(dat->num)) {
|
2013-02-05 00:39:33 -05:00
|
|
|
return f_rational_new_bang1(CLASS_OF(self), ONE);
|
2013-03-12 04:00:16 -04:00
|
|
|
}
|
2016-11-12 01:07:24 -05:00
|
|
|
else if (f_minus_one_p(dat->num) && RB_INTEGER_TYPE_P(other)) {
|
2020-05-30 01:59:44 -04:00
|
|
|
return f_rational_new_bang1(CLASS_OF(self), INT2FIX(rb_int_odd_p(other) ? -1 : 1));
|
2013-03-12 04:00:16 -04:00
|
|
|
}
|
2016-11-12 01:07:24 -05:00
|
|
|
else if (INT_ZERO_P(dat->num)) {
|
2016-11-12 10:43:34 -05:00
|
|
|
if (rb_num_negative_p(other)) {
|
2016-11-12 06:52:09 -05:00
|
|
|
rb_num_zerodiv();
|
2013-03-12 04:00:16 -04:00
|
|
|
}
|
|
|
|
else {
|
2013-02-05 00:39:33 -05:00
|
|
|
return f_rational_new_bang1(CLASS_OF(self), ZERO);
|
2013-03-12 04:00:16 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-02-05 00:39:33 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/* General case */
|
2016-11-12 01:07:24 -05:00
|
|
|
if (FIXNUM_P(other)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
VALUE num, den;
|
|
|
|
|
|
|
|
get_dat1(self);
|
|
|
|
|
2016-11-12 01:07:24 -05:00
|
|
|
if (INT_POSITIVE_P(other)) {
|
2016-11-11 11:38:28 -05:00
|
|
|
num = rb_int_pow(dat->num, other);
|
|
|
|
den = rb_int_pow(dat->den, other);
|
2016-11-12 01:07:24 -05:00
|
|
|
}
|
|
|
|
else if (INT_NEGATIVE_P(other)) {
|
2016-11-11 11:38:28 -05:00
|
|
|
num = rb_int_pow(dat->den, rb_int_uminus(other));
|
|
|
|
den = rb_int_pow(dat->num, rb_int_uminus(other));
|
2016-11-12 01:07:24 -05:00
|
|
|
}
|
|
|
|
else {
|
2008-04-22 09:17:04 -04:00
|
|
|
num = ONE;
|
|
|
|
den = ONE;
|
|
|
|
}
|
2017-02-22 18:28:26 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(num)) { /* infinity due to overflow */
|
2018-01-18 20:45:36 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(den))
|
|
|
|
return DBL2NUM(nan(""));
|
2017-02-22 18:28:26 -05:00
|
|
|
return num;
|
|
|
|
}
|
2017-02-22 18:49:40 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(den)) { /* infinity due to overflow */
|
|
|
|
num = ZERO;
|
|
|
|
den = ONE;
|
|
|
|
}
|
2008-04-27 06:02:19 -04:00
|
|
|
return f_rational_new2(CLASS_OF(self), num, den);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2021-09-03 07:50:12 -04:00
|
|
|
else if (RB_BIGNUM_TYPE_P(other)) {
|
2009-06-28 09:27:48 -04:00
|
|
|
rb_warn("in a**b, b may be too big");
|
2016-11-11 11:38:28 -05:00
|
|
|
return rb_float_pow(nurat_to_f(self), other);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2016-11-12 11:29:11 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other) || RB_TYPE_P(other, T_RATIONAL)) {
|
2016-11-11 11:38:28 -05:00
|
|
|
return rb_float_pow(nurat_to_f(self), other);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else {
|
2021-07-26 20:20:24 -04:00
|
|
|
return rb_num_coerce_bin(self, other, idPow);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
2018-10-19 22:49:18 -04:00
|
|
|
#define nurat_expt rb_rational_pow
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* rational <=> numeric -> -1, 0, +1, or nil
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns -1, 0, or +1 depending on whether +rational+ is
|
|
|
|
* less than, equal to, or greater than +numeric+.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2013-02-22 22:35:38 -05:00
|
|
|
* +nil+ is returned if the two values are incomparable.
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational(2, 3) <=> Rational(2, 3) #=> 0
|
|
|
|
* Rational(5) <=> 5 #=> 0
|
|
|
|
* Rational(2, 3) <=> Rational(1, 3) #=> 1
|
|
|
|
* Rational(1, 3) <=> 1 #=> -1
|
|
|
|
* Rational(1, 3) <=> 0.3 #=> 1
|
|
|
|
*
|
|
|
|
* Rational(1, 3) <=> "0.3" #=> nil
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2016-11-22 00:21:12 -05:00
|
|
|
VALUE
|
|
|
|
rb_rational_cmp(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2020-06-16 01:42:24 -04:00
|
|
|
switch (TYPE(other)) {
|
|
|
|
case T_FIXNUM:
|
|
|
|
case T_BIGNUM:
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat1(self);
|
|
|
|
|
2016-11-11 20:29:01 -05:00
|
|
|
if (dat->den == LONG2FIX(1))
|
|
|
|
return rb_int_cmp(dat->num, other); /* c14n */
|
|
|
|
other = f_rational_new_bang1(CLASS_OF(self), other);
|
2020-06-16 01:42:24 -04:00
|
|
|
/* FALLTHROUGH */
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2020-06-16 01:42:24 -04:00
|
|
|
|
|
|
|
case T_RATIONAL:
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
VALUE num1, num2;
|
|
|
|
|
|
|
|
get_dat2(self, other);
|
|
|
|
|
|
|
|
if (FIXNUM_P(adat->num) && FIXNUM_P(adat->den) &&
|
|
|
|
FIXNUM_P(bdat->num) && FIXNUM_P(bdat->den)) {
|
|
|
|
num1 = f_imul(FIX2LONG(adat->num), FIX2LONG(bdat->den));
|
|
|
|
num2 = f_imul(FIX2LONG(bdat->num), FIX2LONG(adat->den));
|
|
|
|
}
|
|
|
|
else {
|
2016-11-11 20:29:01 -05:00
|
|
|
num1 = rb_int_mul(adat->num, bdat->den);
|
|
|
|
num2 = rb_int_mul(bdat->num, adat->den);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2016-11-11 20:29:01 -05:00
|
|
|
return rb_int_cmp(rb_int_minus(num1, num2), ZERO);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2020-06-16 01:42:24 -04:00
|
|
|
|
|
|
|
case T_FLOAT:
|
|
|
|
return rb_dbl_cmp(nurat_to_double(self), RFLOAT_VALUE(other));
|
|
|
|
|
|
|
|
default:
|
2021-07-26 20:20:24 -04:00
|
|
|
return rb_num_coerce_cmp(self, other, idCmp);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat == object -> true or false
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns +true+ if +rat+ equals +object+ numerically.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2, 3) == Rational(2, 3) #=> true
|
|
|
|
* Rational(5) == 5 #=> true
|
|
|
|
* Rational(0) == 0.0 #=> true
|
|
|
|
* Rational('1/3') == 0.33 #=> false
|
|
|
|
* Rational('1/2') == '1/2' #=> false
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
2009-07-03 08:19:54 -04:00
|
|
|
nurat_eqeq_p(VALUE self, VALUE other)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(other)) {
|
2018-10-02 12:42:21 -04:00
|
|
|
get_dat1(self);
|
2008-04-22 09:17:04 -04:00
|
|
|
|
2018-10-02 12:42:21 -04:00
|
|
|
if (RB_INTEGER_TYPE_P(dat->num) && RB_INTEGER_TYPE_P(dat->den)) {
|
2016-11-11 21:24:32 -05:00
|
|
|
if (INT_ZERO_P(dat->num) && INT_ZERO_P(other))
|
2008-06-13 08:59:22 -04:00
|
|
|
return Qtrue;
|
|
|
|
|
2008-04-22 09:17:04 -04:00
|
|
|
if (!FIXNUM_P(dat->den))
|
|
|
|
return Qfalse;
|
|
|
|
if (FIX2LONG(dat->den) != 1)
|
|
|
|
return Qfalse;
|
2016-11-11 21:24:32 -05:00
|
|
|
return rb_int_equal(dat->num, other);
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2018-10-02 12:42:21 -04:00
|
|
|
else {
|
|
|
|
const double d = nurat_to_double(self);
|
2021-08-17 13:25:19 -04:00
|
|
|
return RBOOL(FIXNUM_ZERO_P(rb_dbl_cmp(d, NUM2DBL(other))));
|
2018-10-02 12:42:21 -04:00
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2016-11-11 21:24:32 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other)) {
|
2016-11-12 11:29:11 -05:00
|
|
|
const double d = nurat_to_double(self);
|
2021-08-17 13:25:19 -04:00
|
|
|
return RBOOL(FIXNUM_ZERO_P(rb_dbl_cmp(d, RFLOAT_VALUE(other))));
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(other, T_RATIONAL)) {
|
2008-04-22 09:17:04 -04:00
|
|
|
{
|
|
|
|
get_dat2(self, other);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2016-11-11 21:24:32 -05:00
|
|
|
if (INT_ZERO_P(adat->num) && INT_ZERO_P(bdat->num))
|
2008-06-13 08:59:22 -04:00
|
|
|
return Qtrue;
|
|
|
|
|
2021-08-17 13:25:19 -04:00
|
|
|
return RBOOL(rb_int_equal(adat->num, bdat->num) &&
|
2016-11-11 21:24:32 -05:00
|
|
|
rb_int_equal(adat->den, bdat->den));
|
2008-04-22 09:17:04 -04:00
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else {
|
2016-11-12 20:51:29 -05:00
|
|
|
return rb_equal(other, self);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-27 03:46:57 -04:00
|
|
|
/* :nodoc: */
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_coerce(VALUE self, VALUE other)
|
|
|
|
{
|
2016-11-11 02:08:52 -05:00
|
|
|
if (RB_INTEGER_TYPE_P(other)) {
|
2008-03-31 12:42:24 -04:00
|
|
|
return rb_assoc_new(f_rational_new_bang1(CLASS_OF(self), other), self);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2016-11-12 01:17:12 -05:00
|
|
|
else if (RB_FLOAT_TYPE_P(other)) {
|
|
|
|
return rb_assoc_new(other, nurat_to_f(self));
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(other, T_RATIONAL)) {
|
2009-06-16 19:17:17 -04:00
|
|
|
return rb_assoc_new(other, self);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
|
|
|
else if (RB_TYPE_P(other, T_COMPLEX)) {
|
2021-01-22 21:04:45 -05:00
|
|
|
if (!k_exact_zero_p(RCOMPLEX(other)->imag))
|
2011-08-16 21:24:22 -04:00
|
|
|
return rb_assoc_new(other, rb_Complex(self, INT2FIX(0)));
|
2021-01-22 21:04:45 -05:00
|
|
|
other = RCOMPLEX(other)->real;
|
|
|
|
if (RB_FLOAT_TYPE_P(other)) {
|
|
|
|
other = float_to_r(other);
|
|
|
|
RBASIC_SET_CLASS(other, CLASS_OF(self));
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
other = f_rational_new_bang1(CLASS_OF(self), other);
|
|
|
|
}
|
|
|
|
return rb_assoc_new(other, self);
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_raise(rb_eTypeError, "%s can't be coerced into %s",
|
|
|
|
rb_obj_classname(other), rb_obj_classname(self));
|
|
|
|
return Qnil;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2016-11-12 10:07:53 -05:00
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* rat.positive? -> true or false
|
2016-11-12 10:07:53 -05:00
|
|
|
*
|
|
|
|
* Returns +true+ if +rat+ is greater than 0.
|
|
|
|
*/
|
|
|
|
static VALUE
|
|
|
|
nurat_positive_p(VALUE self)
|
|
|
|
{
|
|
|
|
get_dat1(self);
|
2021-08-17 13:25:19 -04:00
|
|
|
return RBOOL(INT_POSITIVE_P(dat->num));
|
2016-11-12 10:07:53 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* rat.negative? -> true or false
|
2016-11-12 10:07:53 -05:00
|
|
|
*
|
|
|
|
* Returns +true+ if +rat+ is less than 0.
|
|
|
|
*/
|
|
|
|
static VALUE
|
|
|
|
nurat_negative_p(VALUE self)
|
|
|
|
{
|
|
|
|
get_dat1(self);
|
2021-08-17 13:25:19 -04:00
|
|
|
return RBOOL(INT_NEGATIVE_P(dat->num));
|
2016-11-12 10:07:53 -05:00
|
|
|
}
|
|
|
|
|
2016-11-15 23:25:33 -05:00
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* rat.abs -> rational
|
|
|
|
* rat.magnitude -> rational
|
2016-11-15 23:25:33 -05:00
|
|
|
*
|
|
|
|
* Returns the absolute value of +rat+.
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* (1/2r).abs #=> (1/2)
|
|
|
|
* (-1/2r).abs #=> (1/2)
|
2016-11-15 23:25:33 -05:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational#magnitude is an alias for Rational#abs.
|
2016-11-15 23:25:33 -05:00
|
|
|
*/
|
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_rational_abs(VALUE self)
|
|
|
|
{
|
|
|
|
get_dat1(self);
|
|
|
|
if (INT_NEGATIVE_P(dat->num)) {
|
|
|
|
VALUE num = rb_int_abs(dat->num);
|
|
|
|
return nurat_s_canonicalize_internal_no_reduce(CLASS_OF(self), num, dat->den);
|
|
|
|
}
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_floor(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
return rb_int_idiv(dat->num, dat->den);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
nurat_ceil(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
return rb_int_uminus(rb_int_idiv(rb_int_uminus(dat->num), dat->den));
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.to_i -> integer
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the truncated value as an integer.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2017-02-22 10:46:43 -05:00
|
|
|
* Equivalent to Rational#truncate.
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational(2, 3).to_i #=> 0
|
|
|
|
* Rational(3).to_i #=> 3
|
|
|
|
* Rational(300.6).to_i #=> 300
|
|
|
|
* Rational(98, 71).to_i #=> 1
|
|
|
|
* Rational(-31, 2).to_i #=> -15
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_truncate(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
2016-11-12 01:58:35 -05:00
|
|
|
if (INT_NEGATIVE_P(dat->num))
|
|
|
|
return rb_int_uminus(rb_int_idiv(rb_int_uminus(dat->num), dat->den));
|
|
|
|
return rb_int_idiv(dat->num, dat->den);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
2016-11-05 05:49:39 -04:00
|
|
|
nurat_round_half_up(VALUE self)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2008-12-29 06:50:10 -05:00
|
|
|
VALUE num, den, neg;
|
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-12-29 06:50:10 -05:00
|
|
|
num = dat->num;
|
|
|
|
den = dat->den;
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
neg = INT_NEGATIVE_P(num);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-12-29 06:50:10 -05:00
|
|
|
if (neg)
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
num = rb_int_uminus(num);
|
2008-12-29 06:50:10 -05:00
|
|
|
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
num = rb_int_plus(rb_int_mul(num, TWO), den);
|
|
|
|
den = rb_int_mul(den, TWO);
|
|
|
|
num = rb_int_idiv(num, den);
|
2008-12-29 06:50:10 -05:00
|
|
|
|
|
|
|
if (neg)
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
num = rb_int_uminus(num);
|
2008-12-29 06:50:10 -05:00
|
|
|
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2016-11-25 01:28:00 -05:00
|
|
|
static VALUE
|
|
|
|
nurat_round_half_down(VALUE self)
|
|
|
|
{
|
|
|
|
VALUE num, den, neg;
|
|
|
|
|
|
|
|
get_dat1(self);
|
|
|
|
|
|
|
|
num = dat->num;
|
|
|
|
den = dat->den;
|
|
|
|
neg = INT_NEGATIVE_P(num);
|
|
|
|
|
|
|
|
if (neg)
|
|
|
|
num = rb_int_uminus(num);
|
|
|
|
|
|
|
|
num = rb_int_plus(rb_int_mul(num, TWO), den);
|
|
|
|
num = rb_int_minus(num, ONE);
|
|
|
|
den = rb_int_mul(den, TWO);
|
|
|
|
num = rb_int_idiv(num, den);
|
|
|
|
|
|
|
|
if (neg)
|
|
|
|
num = rb_int_uminus(num);
|
|
|
|
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2016-11-05 05:49:39 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_round_half_even(VALUE self)
|
|
|
|
{
|
|
|
|
VALUE num, den, neg, qr;
|
|
|
|
|
|
|
|
get_dat1(self);
|
|
|
|
|
|
|
|
num = dat->num;
|
|
|
|
den = dat->den;
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
neg = INT_NEGATIVE_P(num);
|
2016-11-05 05:49:39 -04:00
|
|
|
|
|
|
|
if (neg)
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
num = rb_int_uminus(num);
|
2016-11-05 05:49:39 -04:00
|
|
|
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
num = rb_int_plus(rb_int_mul(num, TWO), den);
|
|
|
|
den = rb_int_mul(den, TWO);
|
|
|
|
qr = rb_int_divmod(num, den);
|
2016-11-05 05:49:39 -04:00
|
|
|
num = RARRAY_AREF(qr, 0);
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
if (INT_ZERO_P(RARRAY_AREF(qr, 1)))
|
|
|
|
num = rb_int_and(num, LONG2FIX(((int)~1)));
|
2016-11-05 05:49:39 -04:00
|
|
|
|
|
|
|
if (neg)
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
num = rb_int_uminus(num);
|
2016-11-05 05:49:39 -04:00
|
|
|
|
|
|
|
return num;
|
|
|
|
}
|
|
|
|
|
2008-12-29 06:50:10 -05:00
|
|
|
static VALUE
|
2009-06-27 20:22:07 -04:00
|
|
|
f_round_common(int argc, VALUE *argv, VALUE self, VALUE (*func)(VALUE))
|
2008-12-29 06:50:10 -05:00
|
|
|
{
|
|
|
|
VALUE n, b, s;
|
|
|
|
|
2018-12-06 02:49:24 -05:00
|
|
|
if (rb_check_arity(argc, 0, 1) == 0)
|
2008-12-29 06:50:10 -05:00
|
|
|
return (*func)(self);
|
|
|
|
|
2018-12-06 02:49:24 -05:00
|
|
|
n = argv[0];
|
2008-12-29 06:50:10 -05:00
|
|
|
|
|
|
|
if (!k_integer_p(n))
|
|
|
|
rb_raise(rb_eTypeError, "not an integer");
|
|
|
|
|
2011-04-24 09:24:02 -04:00
|
|
|
b = f_expt10(n);
|
2019-01-03 01:19:17 -05:00
|
|
|
s = rb_rational_mul(self, b);
|
2008-12-29 06:50:10 -05:00
|
|
|
|
2012-12-15 04:25:13 -05:00
|
|
|
if (k_float_p(s)) {
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
if (INT_NEGATIVE_P(n))
|
2012-12-15 04:25:13 -05:00
|
|
|
return ZERO;
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
|
2013-07-25 22:42:26 -04:00
|
|
|
if (!k_rational_p(s)) {
|
|
|
|
s = f_rational_new_bang1(CLASS_OF(self), s);
|
|
|
|
}
|
|
|
|
|
2008-12-29 06:50:10 -05:00
|
|
|
s = (*func)(s);
|
|
|
|
|
2020-12-09 04:48:59 -05:00
|
|
|
s = rb_rational_div(f_rational_new_bang1(CLASS_OF(self), s), b);
|
2008-12-29 06:50:10 -05:00
|
|
|
|
rational.c: optimize Rational#{floor,ceil,round,truncate}
* rational.c (f_{expt10,round_common},nurat_{floor,ceil,round_half_{up,even}}):
optimize Rational#{floor,ceil,round,truncate}.
Author: Tadashi Saito <tad.a.digger@gmail.com>
* numeric.c (rb_int_divmod): rename from int_divmod to be exported.
* numeric.c (rb_int_and): rename from int_and to be exported.
* intern.h (rb_int_{divmod,and}): exported.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@56742 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2016-11-12 01:45:11 -05:00
|
|
|
if (RB_TYPE_P(s, T_RATIONAL) && FIX2INT(rb_int_cmp(n, ONE)) < 0)
|
|
|
|
s = nurat_truncate(s);
|
2008-12-29 06:50:10 -05:00
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2020-12-09 04:48:59 -05:00
|
|
|
VALUE
|
|
|
|
rb_rational_floor(VALUE self, int ndigits)
|
|
|
|
{
|
|
|
|
if (ndigits == 0) {
|
|
|
|
return nurat_floor(self);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
VALUE n = INT2NUM(ndigits);
|
|
|
|
return f_round_common(1, &n, self, nurat_floor);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2017-04-03 15:23:13 -04:00
|
|
|
* rat.floor([ndigits]) -> integer or rational
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2017-04-03 15:23:13 -04:00
|
|
|
* Returns the largest number less than or equal to +rat+ with
|
|
|
|
* a precision of +ndigits+ decimal digits (default: 0).
|
|
|
|
*
|
|
|
|
* When the precision is negative, the returned value is an integer
|
|
|
|
* with at least <code>ndigits.abs</code> trailing zeros.
|
|
|
|
*
|
|
|
|
* Returns a rational when +ndigits+ is positive,
|
|
|
|
* otherwise returns an integer.
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(3).floor #=> 3
|
|
|
|
* Rational(2, 3).floor #=> 0
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational(-3, 2).floor #=> -2
|
2009-06-27 03:46:57 -04:00
|
|
|
*
|
2017-02-22 10:46:43 -05:00
|
|
|
* # decimal - 1 2 3 . 4 5 6
|
|
|
|
* # ^ ^ ^ ^ ^ ^
|
|
|
|
* # precision -3 -2 -1 0 +1 +2
|
2009-06-27 03:46:57 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational('-123.456').floor(+1).to_f #=> -123.5
|
|
|
|
* Rational('-123.456').floor(-1) #=> -130
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-12-29 06:50:10 -05:00
|
|
|
static VALUE
|
|
|
|
nurat_floor_n(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2009-06-27 20:22:07 -04:00
|
|
|
return f_round_common(argc, argv, self, nurat_floor);
|
2008-12-29 06:50:10 -05:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2017-04-03 15:23:13 -04:00
|
|
|
* rat.ceil([ndigits]) -> integer or rational
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2017-04-03 15:23:13 -04:00
|
|
|
* Returns the smallest number greater than or equal to +rat+ with
|
|
|
|
* a precision of +ndigits+ decimal digits (default: 0).
|
|
|
|
*
|
|
|
|
* When the precision is negative, the returned value is an integer
|
|
|
|
* with at least <code>ndigits.abs</code> trailing zeros.
|
|
|
|
*
|
|
|
|
* Returns a rational when +ndigits+ is positive,
|
|
|
|
* otherwise returns an integer.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(3).ceil #=> 3
|
|
|
|
* Rational(2, 3).ceil #=> 1
|
|
|
|
* Rational(-3, 2).ceil #=> -1
|
|
|
|
*
|
2017-02-22 10:46:43 -05:00
|
|
|
* # decimal - 1 2 3 . 4 5 6
|
|
|
|
* # ^ ^ ^ ^ ^ ^
|
|
|
|
* # precision -3 -2 -1 0 +1 +2
|
2009-06-27 03:46:57 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational('-123.456').ceil(+1).to_f #=> -123.4
|
|
|
|
* Rational('-123.456').ceil(-1) #=> -120
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-12-29 06:50:10 -05:00
|
|
|
static VALUE
|
|
|
|
nurat_ceil_n(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2009-06-27 20:22:07 -04:00
|
|
|
return f_round_common(argc, argv, self, nurat_ceil);
|
2008-12-29 06:50:10 -05:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2017-04-03 15:23:13 -04:00
|
|
|
* rat.truncate([ndigits]) -> integer or rational
|
|
|
|
*
|
|
|
|
* Returns +rat+ truncated (toward zero) to
|
|
|
|
* a precision of +ndigits+ decimal digits (default: 0).
|
|
|
|
*
|
|
|
|
* When the precision is negative, the returned value is an integer
|
|
|
|
* with at least <code>ndigits.abs</code> trailing zeros.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2017-04-03 15:23:13 -04:00
|
|
|
* Returns a rational when +ndigits+ is positive,
|
|
|
|
* otherwise returns an integer.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(3).truncate #=> 3
|
|
|
|
* Rational(2, 3).truncate #=> 0
|
|
|
|
* Rational(-3, 2).truncate #=> -1
|
|
|
|
*
|
2017-02-22 10:46:43 -05:00
|
|
|
* # decimal - 1 2 3 . 4 5 6
|
|
|
|
* # ^ ^ ^ ^ ^ ^
|
|
|
|
* # precision -3 -2 -1 0 +1 +2
|
2009-06-27 03:46:57 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational('-123.456').truncate(+1).to_f #=> -123.4
|
|
|
|
* Rational('-123.456').truncate(-1) #=> -120
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-12-29 06:50:10 -05:00
|
|
|
static VALUE
|
|
|
|
nurat_truncate_n(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2009-06-27 20:22:07 -04:00
|
|
|
return f_round_common(argc, argv, self, nurat_truncate);
|
2008-12-29 06:50:10 -05:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2017-04-03 15:19:20 -04:00
|
|
|
* rat.round([ndigits] [, half: mode]) -> integer or rational
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2017-04-03 15:19:20 -04:00
|
|
|
* Returns +rat+ rounded to the nearest value with
|
|
|
|
* a precision of +ndigits+ decimal digits (default: 0).
|
2017-04-01 18:48:01 -04:00
|
|
|
*
|
2017-04-03 15:19:20 -04:00
|
|
|
* When the precision is negative, the returned value is an integer
|
|
|
|
* with at least <code>ndigits.abs</code> trailing zeros.
|
|
|
|
*
|
|
|
|
* Returns a rational when +ndigits+ is positive,
|
|
|
|
* otherwise returns an integer.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(3).round #=> 3
|
|
|
|
* Rational(2, 3).round #=> 1
|
|
|
|
* Rational(-3, 2).round #=> -2
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2017-02-22 10:46:43 -05:00
|
|
|
* # decimal - 1 2 3 . 4 5 6
|
|
|
|
* # ^ ^ ^ ^ ^ ^
|
|
|
|
* # precision -3 -2 -1 0 +1 +2
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Rational('-123.456').round(+1).to_f #=> -123.5
|
|
|
|
* Rational('-123.456').round(-1) #=> -120
|
2017-04-01 18:48:01 -04:00
|
|
|
*
|
2017-04-03 15:19:20 -04:00
|
|
|
* The optional +half+ keyword argument is available
|
|
|
|
* similar to Float#round.
|
2017-04-01 18:48:01 -04:00
|
|
|
*
|
2017-04-03 15:19:20 -04:00
|
|
|
* Rational(25, 100).round(1, half: :up) #=> (3/10)
|
|
|
|
* Rational(25, 100).round(1, half: :down) #=> (1/5)
|
|
|
|
* Rational(25, 100).round(1, half: :even) #=> (1/5)
|
|
|
|
* Rational(35, 100).round(1, half: :up) #=> (2/5)
|
|
|
|
* Rational(35, 100).round(1, half: :down) #=> (3/10)
|
|
|
|
* Rational(35, 100).round(1, half: :even) #=> (2/5)
|
|
|
|
* Rational(-25, 100).round(1, half: :up) #=> (-3/10)
|
|
|
|
* Rational(-25, 100).round(1, half: :down) #=> (-1/5)
|
|
|
|
* Rational(-25, 100).round(1, half: :even) #=> (-1/5)
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-12-29 06:50:10 -05:00
|
|
|
static VALUE
|
|
|
|
nurat_round_n(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2016-11-05 05:49:39 -04:00
|
|
|
VALUE opt;
|
|
|
|
enum ruby_num_rounding_mode mode = (
|
Make rb_scan_args handle keywords more similar to Ruby methods (#2460)
Cfuncs that use rb_scan_args with the : entry suffer similar keyword
argument separation issues that Ruby methods suffer if the cfuncs
accept optional or variable arguments.
This makes the following changes to : handling.
* Treats as **kw, prompting keyword argument separation warnings
if called with a positional hash.
* Do not look for an option hash if empty keywords are provided.
For backwards compatibility, treat an empty keyword splat as a empty
mandatory positional hash argument, but emit a a warning, as this
behavior will be removed in Ruby 3. The argument number check
needs to be moved lower so it can correctly handle an empty
positional argument being added.
* If the last argument is nil and it is necessary to treat it as an option
hash in order to make sure all arguments are processed, continue to
treat the last argument as the option hash. Emit a warning in this case,
as this behavior will be removed in Ruby 3.
* If splitting the keyword hash into two hashes, issue a warning, as we
will not be splitting hashes in Ruby 3.
* If the keyword argument is required to fill a mandatory positional
argument, continue to do so, but emit a warning as this behavior will
be going away in Ruby 3.
* If keyword arguments are provided and the last argument is not a hash,
that indicates something wrong. This can happen if a cfunc is calling
rb_scan_args multiple times, and providing arguments that were not
passed to it from Ruby. Callers need to switch to the new
rb_scan_args_kw function, which allows passing of whether keywords
were provided.
This commit fixes all warnings caused by the changes above.
It switches some function calls to *_kw versions with appropriate
kw_splat flags. If delegating arguments, RB_PASS_CALLED_KEYWORDS
is used. If creating new arguments, RB_PASS_KEYWORDS is used if
the last argument is a hash to be treated as keywords.
In open_key_args in io.c, use rb_scan_args_kw.
In this case, the arguments provided come from another C
function, not Ruby. The last argument may or may not be a hash,
so we can't set keyword argument mode. However, if it is a
hash, we don't want to warn when treating it as keywords.
In Ruby files, make sure to appropriately use keyword splats
or literal keywords when calling Cfuncs that now issue keyword
argument separation warnings through rb_scan_args. Also, make
sure not to pass nil in place of an option hash.
Work around Kernel#warn warnings due to problems in the Rubygems
override of the method. There is an open pull request to fix
these issues in Rubygems, but part of the Rubygems tests for
their override fail on ruby-head due to rb_scan_args not
recognizing empty keyword splats, which this commit fixes.
Implementation wise, adding rb_scan_args_kw is kind of a pain,
because rb_scan_args takes a variable number of arguments.
In order to not duplicate all the code, the function internals need
to be split into two functions taking a va_list, and to avoid passing
in a ton of arguments, a single struct argument is used to handle
the variables previously local to the function.
2019-09-25 14:18:49 -04:00
|
|
|
argc = rb_scan_args(argc, argv, "*:", NULL, &opt),
|
2016-11-05 05:49:39 -04:00
|
|
|
rb_num_get_rounding_option(opt));
|
2016-11-18 01:29:51 -05:00
|
|
|
VALUE (*round_func)(VALUE) = ROUND_FUNC(mode, nurat_round);
|
2016-11-05 05:49:39 -04:00
|
|
|
return f_round_common(argc, argv, self, round_func);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2021-07-26 14:20:27 -04:00
|
|
|
VALUE
|
|
|
|
rb_flo_round_by_rational(int argc, VALUE *argv, VALUE num)
|
|
|
|
{
|
|
|
|
return nurat_to_f(nurat_round_n(argc, argv, float_to_r(num)));
|
|
|
|
}
|
|
|
|
|
2016-11-11 10:55:30 -05:00
|
|
|
static double
|
|
|
|
nurat_to_double(VALUE self)
|
|
|
|
{
|
|
|
|
get_dat1(self);
|
2018-10-02 12:42:21 -04:00
|
|
|
if (!RB_INTEGER_TYPE_P(dat->num) || !RB_INTEGER_TYPE_P(dat->den)) {
|
2018-10-04 20:37:40 -04:00
|
|
|
return NUM2DBL(dat->num) / NUM2DBL(dat->den);
|
2018-10-02 12:42:21 -04:00
|
|
|
}
|
2016-11-11 10:55:30 -05:00
|
|
|
return rb_int_fdiv_double(dat->num, dat->den);
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.to_f -> float
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns the value as a Float.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2).to_f #=> 2.0
|
|
|
|
* Rational(9, 4).to_f #=> 2.25
|
|
|
|
* Rational(-3, 4).to_f #=> -0.75
|
|
|
|
* Rational(20, 3).to_f #=> 6.666666666666667
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_to_f(VALUE self)
|
|
|
|
{
|
2016-11-11 10:55:30 -05:00
|
|
|
return DBL2NUM(nurat_to_double(self));
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.to_r -> self
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns self.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2).to_r #=> (2/1)
|
|
|
|
* Rational(-8, 6).to_r #=> (-4/3)
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_to_r(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return self;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2010-04-26 07:14:40 -04:00
|
|
|
#define id_ceil rb_intern("ceil")
|
2019-08-01 22:25:41 -04:00
|
|
|
static VALUE
|
|
|
|
f_ceil(VALUE x)
|
|
|
|
{
|
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
|
|
|
return x;
|
|
|
|
if (RB_FLOAT_TYPE_P(x))
|
|
|
|
return rb_float_ceil(x, 0);
|
|
|
|
|
|
|
|
return rb_funcall(x, id_ceil, 0);
|
|
|
|
}
|
2010-04-26 07:14:40 -04:00
|
|
|
|
2019-08-02 19:37:08 -04:00
|
|
|
#define id_quo idQuo
|
2019-08-01 22:28:24 -04:00
|
|
|
static VALUE
|
|
|
|
f_quo(VALUE x, VALUE y)
|
|
|
|
{
|
|
|
|
if (RB_INTEGER_TYPE_P(x))
|
|
|
|
return rb_int_div(x, y);
|
|
|
|
if (RB_FLOAT_TYPE_P(x))
|
|
|
|
return DBL2NUM(RFLOAT_VALUE(x) / RFLOAT_VALUE(y));
|
|
|
|
|
|
|
|
return rb_funcallv(x, id_quo, 1, &y);
|
|
|
|
}
|
2010-04-26 07:14:40 -04:00
|
|
|
|
2010-12-25 19:36:08 -05:00
|
|
|
#define f_reciprocal(x) f_quo(ONE, (x))
|
2010-04-26 07:14:40 -04:00
|
|
|
|
|
|
|
/*
|
|
|
|
The algorithm here is the method described in CLISP. Bruno Haible has
|
|
|
|
graciously given permission to use this algorithm. He says, "You can use
|
|
|
|
it, if you present the following explanation of the algorithm."
|
|
|
|
|
|
|
|
Algorithm (recursively presented):
|
|
|
|
If x is a rational number, return x.
|
|
|
|
If x = 0.0, return 0.
|
|
|
|
If x < 0.0, return (- (rationalize (- x))).
|
|
|
|
If x > 0.0:
|
|
|
|
Call (integer-decode-float x). It returns a m,e,s=1 (mantissa,
|
|
|
|
exponent, sign).
|
|
|
|
If m = 0 or e >= 0: return x = m*2^e.
|
|
|
|
Search a rational number between a = (m-1/2)*2^e and b = (m+1/2)*2^e
|
|
|
|
with smallest possible numerator and denominator.
|
|
|
|
Note 1: If m is a power of 2, we ought to take a = (m-1/4)*2^e.
|
|
|
|
But in this case the result will be x itself anyway, regardless of
|
|
|
|
the choice of a. Therefore we can simply ignore this case.
|
|
|
|
Note 2: At first, we need to consider the closed interval [a,b].
|
|
|
|
but since a and b have the denominator 2^(|e|+1) whereas x itself
|
|
|
|
has a denominator <= 2^|e|, we can restrict the search to the open
|
|
|
|
interval (a,b).
|
|
|
|
So, for given a and b (0 < a < b) we are searching a rational number
|
|
|
|
y with a <= y <= b.
|
|
|
|
Recursive algorithm fraction_between(a,b):
|
|
|
|
c := (ceiling a)
|
|
|
|
if c < b
|
|
|
|
then return c ; because a <= c < b, c integer
|
|
|
|
else
|
|
|
|
; a is not integer (otherwise we would have had c = a < b)
|
|
|
|
k := c-1 ; k = floor(a), k < a < b <= k+1
|
|
|
|
return y = k + 1/fraction_between(1/(b-k), 1/(a-k))
|
|
|
|
; note 1 <= 1/(b-k) < 1/(a-k)
|
|
|
|
|
|
|
|
You can see that we are actually computing a continued fraction expansion.
|
|
|
|
|
|
|
|
Algorithm (iterative):
|
|
|
|
If x is rational, return x.
|
|
|
|
Call (integer-decode-float x). It returns a m,e,s (mantissa,
|
|
|
|
exponent, sign).
|
|
|
|
If m = 0 or e >= 0, return m*2^e*s. (This includes the case x = 0.0.)
|
|
|
|
Create rational numbers a := (2*m-1)*2^(e-1) and b := (2*m+1)*2^(e-1)
|
|
|
|
(positive and already in lowest terms because the denominator is a
|
|
|
|
power of two and the numerator is odd).
|
|
|
|
Start a continued fraction expansion
|
|
|
|
p[-1] := 0, p[0] := 1, q[-1] := 1, q[0] := 0, i := 0.
|
|
|
|
Loop
|
|
|
|
c := (ceiling a)
|
|
|
|
if c >= b
|
|
|
|
then k := c-1, partial_quotient(k), (a,b) := (1/(b-k),1/(a-k)),
|
|
|
|
goto Loop
|
|
|
|
finally partial_quotient(c).
|
|
|
|
Here partial_quotient(c) denotes the iteration
|
|
|
|
i := i+1, p[i] := c*p[i-1]+p[i-2], q[i] := c*q[i-1]+q[i-2].
|
|
|
|
At the end, return s * (p[i]/q[i]).
|
|
|
|
This rational number is already in lowest terms because
|
|
|
|
p[i]*q[i-1]-p[i-1]*q[i] = (-1)^i.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void
|
|
|
|
nurat_rationalize_internal(VALUE a, VALUE b, VALUE *p, VALUE *q)
|
|
|
|
{
|
|
|
|
VALUE c, k, t, p0, p1, p2, q0, q1, q2;
|
|
|
|
|
|
|
|
p0 = ZERO;
|
|
|
|
p1 = ONE;
|
|
|
|
q0 = ONE;
|
|
|
|
q1 = ZERO;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
c = f_ceil(a);
|
|
|
|
if (f_lt_p(c, b))
|
|
|
|
break;
|
|
|
|
k = f_sub(c, ONE);
|
|
|
|
p2 = f_add(f_mul(k, p1), p0);
|
|
|
|
q2 = f_add(f_mul(k, q1), q0);
|
|
|
|
t = f_reciprocal(f_sub(b, k));
|
|
|
|
b = f_reciprocal(f_sub(a, k));
|
|
|
|
a = t;
|
|
|
|
p0 = p1;
|
|
|
|
q0 = q1;
|
|
|
|
p1 = p2;
|
|
|
|
q1 = q2;
|
|
|
|
}
|
|
|
|
*p = f_add(f_mul(c, p1), p0);
|
|
|
|
*q = f_add(f_mul(c, q1), q0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* rat.rationalize -> self
|
|
|
|
* rat.rationalize(eps) -> rational
|
|
|
|
*
|
2012-11-10 05:29:13 -05:00
|
|
|
* Returns a simpler approximation of the value if the optional
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* argument +eps+ is given (rat-|eps| <= result <= rat+|eps|),
|
|
|
|
* self otherwise.
|
2010-04-26 07:14:40 -04:00
|
|
|
*
|
|
|
|
* r = Rational(5033165, 16777216)
|
|
|
|
* r.rationalize #=> (5033165/16777216)
|
|
|
|
* r.rationalize(Rational('0.01')) #=> (3/10)
|
|
|
|
* r.rationalize(Rational('0.1')) #=> (1/3)
|
|
|
|
*/
|
|
|
|
static VALUE
|
|
|
|
nurat_rationalize(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
|
|
|
VALUE e, a, b, p, q;
|
2020-05-30 05:39:56 -04:00
|
|
|
VALUE rat = self;
|
|
|
|
get_dat1(self);
|
2010-04-26 07:14:40 -04:00
|
|
|
|
2018-12-06 02:49:24 -05:00
|
|
|
if (rb_check_arity(argc, 0, 1) == 0)
|
2010-04-26 07:14:40 -04:00
|
|
|
return self;
|
|
|
|
|
2018-12-06 02:49:24 -05:00
|
|
|
e = f_abs(argv[0]);
|
2020-05-30 05:39:56 -04:00
|
|
|
|
|
|
|
if (INT_NEGATIVE_P(dat->num)) {
|
|
|
|
rat = f_rational_new2(RBASIC_CLASS(self), rb_int_uminus(dat->num), dat->den);
|
|
|
|
}
|
|
|
|
|
|
|
|
a = FIXNUM_ZERO_P(e) ? rat : rb_rational_minus(rat, e);
|
|
|
|
b = FIXNUM_ZERO_P(e) ? rat : rb_rational_plus(rat, e);
|
2010-04-26 07:14:40 -04:00
|
|
|
|
|
|
|
if (f_eqeq_p(a, b))
|
|
|
|
return self;
|
|
|
|
|
|
|
|
nurat_rationalize_internal(a, b, &p, &q);
|
2020-05-30 05:39:56 -04:00
|
|
|
if (rat != self) {
|
|
|
|
RATIONAL_SET_NUM(rat, rb_int_uminus(p));
|
|
|
|
RATIONAL_SET_DEN(rat, q);
|
|
|
|
return rat;
|
|
|
|
}
|
2010-04-26 07:14:40 -04:00
|
|
|
return f_rational_new2(CLASS_OF(self), p, q);
|
|
|
|
}
|
|
|
|
|
2009-06-27 03:46:57 -04:00
|
|
|
/* :nodoc: */
|
2021-05-06 21:04:08 -04:00
|
|
|
st_index_t
|
|
|
|
rb_rational_hash(VALUE self)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2009-09-08 09:10:04 -04:00
|
|
|
st_index_t v, h[2];
|
* string.c (rb_hash_uint32, rb_hash_uint, rb_hash_start, rb_hash_end),
include/ruby/intern.h: add Murmurhash API. [ruby-dev:37784]
* complex.c (nucomp_hash), array.c (rb_ary_hash), time.c (time_hash),
string.c (rb_str_hsah), object.c (rb_obj_hash), range.c
(range_hash), struct.c (rb_struct_hash), hash.c (rb_any_hash),
rational.c (nurat_hash): use Murmurhash. [ruby-dev:37784]
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@22317 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2009-02-14 14:55:34 -05:00
|
|
|
VALUE n;
|
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
* string.c (rb_hash_uint32, rb_hash_uint, rb_hash_start, rb_hash_end),
include/ruby/intern.h: add Murmurhash API. [ruby-dev:37784]
* complex.c (nucomp_hash), array.c (rb_ary_hash), time.c (time_hash),
string.c (rb_str_hsah), object.c (rb_obj_hash), range.c
(range_hash), struct.c (rb_struct_hash), hash.c (rb_any_hash),
rational.c (nurat_hash): use Murmurhash. [ruby-dev:37784]
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@22317 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2009-02-14 14:55:34 -05:00
|
|
|
n = rb_hash(dat->num);
|
2009-07-25 00:44:36 -04:00
|
|
|
h[0] = NUM2LONG(n);
|
* string.c (rb_hash_uint32, rb_hash_uint, rb_hash_start, rb_hash_end),
include/ruby/intern.h: add Murmurhash API. [ruby-dev:37784]
* complex.c (nucomp_hash), array.c (rb_ary_hash), time.c (time_hash),
string.c (rb_str_hsah), object.c (rb_obj_hash), range.c
(range_hash), struct.c (rb_struct_hash), hash.c (rb_any_hash),
rational.c (nurat_hash): use Murmurhash. [ruby-dev:37784]
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@22317 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2009-02-14 14:55:34 -05:00
|
|
|
n = rb_hash(dat->den);
|
2009-07-25 00:44:36 -04:00
|
|
|
h[1] = NUM2LONG(n);
|
* string.c (rb_hash_uint32, rb_hash_uint, rb_hash_start, rb_hash_end),
include/ruby/intern.h: add Murmurhash API. [ruby-dev:37784]
* complex.c (nucomp_hash), array.c (rb_ary_hash), time.c (time_hash),
string.c (rb_str_hsah), object.c (rb_obj_hash), range.c
(range_hash), struct.c (rb_struct_hash), hash.c (rb_any_hash),
rational.c (nurat_hash): use Murmurhash. [ruby-dev:37784]
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@22317 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2009-02-14 14:55:34 -05:00
|
|
|
v = rb_memhash(h, sizeof(h));
|
2021-05-06 21:04:08 -04:00
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
nurat_hash(VALUE self)
|
|
|
|
{
|
|
|
|
return ST2FIX(rb_rational_hash(self));
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2021-05-06 21:04:08 -04:00
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
2009-06-27 20:22:07 -04:00
|
|
|
f_format(VALUE self, VALUE (*func)(VALUE))
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2008-12-05 07:47:07 -05:00
|
|
|
VALUE s;
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
2008-12-05 07:47:07 -05:00
|
|
|
|
|
|
|
s = (*func)(dat->num);
|
|
|
|
rb_str_cat2(s, "/");
|
|
|
|
rb_str_concat(s, (*func)(dat->den));
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.to_s -> string
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the value as a string.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2).to_s #=> "2/1"
|
|
|
|
* Rational(-8, 6).to_s #=> "-4/3"
|
2012-11-03 10:39:50 -04:00
|
|
|
* Rational('1/2').to_s #=> "1/2"
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-12-05 07:47:07 -05:00
|
|
|
static VALUE
|
|
|
|
nurat_to_s(VALUE self)
|
|
|
|
{
|
2009-06-27 20:22:07 -04:00
|
|
|
return f_format(self, f_to_s);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* rat.inspect -> string
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the value as a string for inspection.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(2).inspect #=> "(2/1)"
|
|
|
|
* Rational(-8, 6).inspect #=> "(-4/3)"
|
2012-11-03 10:39:50 -04:00
|
|
|
* Rational('1/2').inspect #=> "(1/2)"
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_inspect(VALUE self)
|
|
|
|
{
|
2008-12-05 07:47:07 -05:00
|
|
|
VALUE s;
|
|
|
|
|
2008-12-12 23:05:25 -05:00
|
|
|
s = rb_usascii_str_new2("(");
|
2009-06-27 20:22:07 -04:00
|
|
|
rb_str_concat(s, f_format(self, f_inspect));
|
2008-12-05 07:47:07 -05:00
|
|
|
rb_str_cat2(s, ")");
|
|
|
|
|
|
|
|
return s;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2012-07-25 04:41:07 -04:00
|
|
|
/* :nodoc: */
|
|
|
|
static VALUE
|
|
|
|
nurat_dumper(VALUE self)
|
|
|
|
{
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* :nodoc: */
|
|
|
|
static VALUE
|
|
|
|
nurat_loader(VALUE self, VALUE a)
|
|
|
|
{
|
2016-11-11 02:26:14 -05:00
|
|
|
VALUE num, den;
|
2012-07-25 04:41:07 -04:00
|
|
|
|
2016-11-11 02:26:14 -05:00
|
|
|
get_dat1(self);
|
|
|
|
num = rb_ivar_get(a, id_i_num);
|
|
|
|
den = rb_ivar_get(a, id_i_den);
|
|
|
|
nurat_int_check(num);
|
|
|
|
nurat_int_check(den);
|
|
|
|
nurat_canonicalize(&num, &den);
|
2020-01-16 19:05:17 -05:00
|
|
|
RATIONAL_SET_NUM((VALUE)dat, num);
|
|
|
|
RATIONAL_SET_DEN((VALUE)dat, den);
|
2017-10-19 06:58:08 -04:00
|
|
|
OBJ_FREEZE_RAW(self);
|
2012-07-25 04:41:07 -04:00
|
|
|
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/* :nodoc: */
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_marshal_dump(VALUE self)
|
|
|
|
{
|
2008-09-16 06:21:23 -04:00
|
|
|
VALUE a;
|
2008-03-31 12:42:24 -04:00
|
|
|
get_dat1(self);
|
2008-09-16 06:21:23 -04:00
|
|
|
|
|
|
|
a = rb_assoc_new(dat->num, dat->den);
|
2013-01-26 08:39:15 -05:00
|
|
|
rb_copy_generic_ivar(a, self);
|
2008-09-16 06:21:23 -04:00
|
|
|
return a;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/* :nodoc: */
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_marshal_load(VALUE self, VALUE a)
|
|
|
|
{
|
2016-11-11 02:26:14 -05:00
|
|
|
VALUE num, den;
|
|
|
|
|
2012-06-02 21:26:41 -04:00
|
|
|
rb_check_frozen(self);
|
|
|
|
|
2010-08-05 05:36:16 -04:00
|
|
|
Check_Type(a, T_ARRAY);
|
2012-02-25 02:20:00 -05:00
|
|
|
if (RARRAY_LEN(a) != 2)
|
|
|
|
rb_raise(rb_eArgError, "marshaled rational must have an array whose length is 2 but %ld", RARRAY_LEN(a));
|
2008-04-28 07:28:55 -04:00
|
|
|
|
2016-11-11 02:26:14 -05:00
|
|
|
num = RARRAY_AREF(a, 0);
|
|
|
|
den = RARRAY_AREF(a, 1);
|
|
|
|
nurat_int_check(num);
|
|
|
|
nurat_int_check(den);
|
|
|
|
nurat_canonicalize(&num, &den);
|
|
|
|
rb_ivar_set(self, id_i_num, num);
|
|
|
|
rb_ivar_set(self, id_i_den, den);
|
2012-07-25 04:41:07 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
return self;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-07-12 07:46:40 -04:00
|
|
|
VALUE
|
|
|
|
rb_rational_reciprocal(VALUE x)
|
|
|
|
{
|
|
|
|
get_dat1(x);
|
2021-01-22 20:28:07 -05:00
|
|
|
return nurat_convert(CLASS_OF(x), dat->den, dat->num, FALSE);
|
2009-07-12 07:46:40 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* int.gcd(other_int) -> integer
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns the greatest common divisor of the two integers.
|
|
|
|
* The result is always positive. 0.gcd(x) and x.gcd(0) return x.abs.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* 36.gcd(60) #=> 12
|
2009-06-27 03:46:57 -04:00
|
|
|
* 2.gcd(2) #=> 2
|
|
|
|
* 3.gcd(-7) #=> 1
|
|
|
|
* ((1<<31)-1).gcd((1<<61)-1) #=> 1
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-27 07:48:00 -04:00
|
|
|
VALUE
|
|
|
|
rb_gcd(VALUE self, VALUE other)
|
|
|
|
{
|
2008-09-12 21:55:56 -04:00
|
|
|
other = nurat_int_value(other);
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_gcd(self, other);
|
2008-03-27 07:48:00 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* int.lcm(other_int) -> integer
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns the least common multiple of the two integers.
|
|
|
|
* The result is always positive. 0.lcm(x) and x.lcm(0) return zero.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* 36.lcm(60) #=> 180
|
2009-06-27 03:46:57 -04:00
|
|
|
* 2.lcm(2) #=> 2
|
|
|
|
* 3.lcm(-7) #=> 21
|
|
|
|
* ((1<<31)-1).lcm((1<<61)-1) #=> 4951760154835678088235319297
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-27 07:48:00 -04:00
|
|
|
VALUE
|
|
|
|
rb_lcm(VALUE self, VALUE other)
|
|
|
|
{
|
2008-09-12 21:55:56 -04:00
|
|
|
other = nurat_int_value(other);
|
2008-03-31 12:42:24 -04:00
|
|
|
return f_lcm(self, other);
|
2008-03-27 07:48:00 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* int.gcdlcm(other_int) -> array
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns an array with the greatest common divisor and
|
|
|
|
* the least common multiple of the two integers, [gcd, lcm].
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* 36.gcdlcm(60) #=> [12, 180]
|
2009-06-27 03:46:57 -04:00
|
|
|
* 2.gcdlcm(2) #=> [2, 2]
|
|
|
|
* 3.gcdlcm(-7) #=> [1, 21]
|
|
|
|
* ((1<<31)-1).gcdlcm((1<<61)-1) #=> [1, 4951760154835678088235319297]
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-27 07:48:00 -04:00
|
|
|
VALUE
|
|
|
|
rb_gcdlcm(VALUE self, VALUE other)
|
|
|
|
{
|
2008-09-12 21:55:56 -04:00
|
|
|
other = nurat_int_value(other);
|
2008-03-31 12:42:24 -04:00
|
|
|
return rb_assoc_new(f_gcd(self, other), f_lcm(self, other));
|
2008-03-27 07:48:00 -04:00
|
|
|
}
|
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
VALUE
|
|
|
|
rb_rational_raw(VALUE x, VALUE y)
|
|
|
|
{
|
2020-01-16 20:47:20 -05:00
|
|
|
if (! RB_INTEGER_TYPE_P(x))
|
|
|
|
x = rb_to_int(x);
|
|
|
|
if (! RB_INTEGER_TYPE_P(y))
|
|
|
|
y = rb_to_int(y);
|
2020-01-16 20:41:03 -05:00
|
|
|
if (INT_NEGATIVE_P(y)) {
|
|
|
|
x = rb_int_uminus(x);
|
|
|
|
y = rb_int_uminus(y);
|
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
return nurat_s_new_internal(rb_cRational, x, y);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_rational_new(VALUE x, VALUE y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return nurat_s_canonicalize_internal(rb_cRational, x, y);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_Rational(VALUE x, VALUE y)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
VALUE a[2];
|
|
|
|
a[0] = x;
|
|
|
|
a[1] = y;
|
|
|
|
return nurat_s_convert(2, a, rb_cRational);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2014-05-17 12:37:41 -04:00
|
|
|
VALUE
|
|
|
|
rb_rational_num(VALUE rat)
|
|
|
|
{
|
|
|
|
return nurat_numerator(rat);
|
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_rational_den(VALUE rat)
|
|
|
|
{
|
|
|
|
return nurat_denominator(rat);
|
|
|
|
}
|
|
|
|
|
2009-06-18 20:31:08 -04:00
|
|
|
#define id_numerator rb_intern("numerator")
|
2010-12-25 19:36:08 -05:00
|
|
|
#define f_numerator(x) rb_funcall((x), id_numerator, 0)
|
2009-06-18 20:31:08 -04:00
|
|
|
|
|
|
|
#define id_denominator rb_intern("denominator")
|
2010-12-25 19:36:08 -05:00
|
|
|
#define f_denominator(x) rb_funcall((x), id_denominator, 0)
|
2009-06-18 20:31:08 -04:00
|
|
|
|
2018-01-22 08:09:37 -05:00
|
|
|
#define id_to_r idTo_r
|
2010-12-25 19:36:08 -05:00
|
|
|
#define f_to_r(x) rb_funcall((x), id_to_r, 0)
|
2009-06-18 20:31:08 -04:00
|
|
|
|
2009-06-19 09:37:04 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* num.numerator -> integer
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the numerator.
|
2009-06-19 09:37:04 -04:00
|
|
|
*/
|
2009-06-18 20:31:08 -04:00
|
|
|
static VALUE
|
|
|
|
numeric_numerator(VALUE self)
|
|
|
|
{
|
|
|
|
return f_numerator(f_to_r(self));
|
|
|
|
}
|
|
|
|
|
2009-06-19 17:57:51 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* num.denominator -> integer
|
2009-06-19 17:57:51 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the denominator (always positive).
|
2009-06-19 17:57:51 -04:00
|
|
|
*/
|
2009-06-18 20:31:08 -04:00
|
|
|
static VALUE
|
|
|
|
numeric_denominator(VALUE self)
|
|
|
|
{
|
|
|
|
return f_denominator(f_to_r(self));
|
|
|
|
}
|
|
|
|
|
2013-06-06 22:50:32 -04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* num.quo(int_or_rat) -> rat
|
|
|
|
* num.quo(flo) -> flo
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns the most exact division (rational for integers, float for floats).
|
2013-06-06 22:50:32 -04:00
|
|
|
*/
|
|
|
|
|
2017-05-27 01:41:00 -04:00
|
|
|
VALUE
|
|
|
|
rb_numeric_quo(VALUE x, VALUE y)
|
2013-06-06 22:50:32 -04:00
|
|
|
{
|
2019-08-10 10:19:24 -04:00
|
|
|
if (RB_TYPE_P(x, T_COMPLEX)) {
|
|
|
|
return rb_complex_div(x, y);
|
|
|
|
}
|
|
|
|
|
2016-11-12 11:29:11 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(y)) {
|
2019-08-02 19:37:08 -04:00
|
|
|
return rb_funcallv(x, idFdiv, 1, &y);
|
2013-06-06 22:50:32 -04:00
|
|
|
}
|
|
|
|
|
2020-10-23 01:38:24 -04:00
|
|
|
x = rb_convert_type(x, T_RATIONAL, "Rational", "to_r");
|
2020-12-09 04:48:59 -05:00
|
|
|
return rb_rational_div(x, y);
|
2013-06-06 22:50:32 -04:00
|
|
|
}
|
|
|
|
|
2018-09-01 03:34:31 -04:00
|
|
|
VALUE
|
|
|
|
rb_rational_canonicalize(VALUE x)
|
|
|
|
{
|
|
|
|
if (RB_TYPE_P(x, T_RATIONAL)) {
|
|
|
|
get_dat1(x);
|
|
|
|
if (f_one_p(dat->den)) return dat->num;
|
|
|
|
}
|
|
|
|
return x;
|
|
|
|
}
|
2013-06-06 22:50:32 -04:00
|
|
|
|
2009-06-19 09:37:04 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* int.numerator -> self
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
|
|
|
* Returns self.
|
|
|
|
*/
|
2009-06-18 20:31:08 -04:00
|
|
|
static VALUE
|
|
|
|
integer_numerator(VALUE self)
|
|
|
|
{
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
|
2009-06-19 09:37:04 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-07-05 11:48:09 -04:00
|
|
|
* int.denominator -> 1
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
|
|
|
* Returns 1.
|
|
|
|
*/
|
2009-06-18 20:31:08 -04:00
|
|
|
static VALUE
|
|
|
|
integer_denominator(VALUE self)
|
|
|
|
{
|
|
|
|
return INT2FIX(1);
|
|
|
|
}
|
|
|
|
|
2009-06-19 09:37:04 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* flo.numerator -> integer
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the numerator. The result is machine dependent.
|
2009-06-19 09:59:08 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* n = 0.3.numerator #=> 5404319552844595
|
|
|
|
* d = 0.3.denominator #=> 18014398509481984
|
|
|
|
* n.fdiv(d) #=> 0.3
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
*
|
|
|
|
* See also Float#denominator.
|
2009-06-19 09:37:04 -04:00
|
|
|
*/
|
2019-07-15 19:15:05 -04:00
|
|
|
VALUE
|
|
|
|
rb_float_numerator(VALUE self)
|
2009-06-18 20:31:08 -04:00
|
|
|
{
|
|
|
|
double d = RFLOAT_VALUE(self);
|
2017-04-30 20:32:56 -04:00
|
|
|
VALUE r;
|
2021-08-26 21:52:02 -04:00
|
|
|
if (!isfinite(d))
|
2009-06-18 20:31:08 -04:00
|
|
|
return self;
|
2017-04-30 20:32:56 -04:00
|
|
|
r = float_to_r(self);
|
|
|
|
return nurat_numerator(r);
|
2009-06-18 20:31:08 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 09:37:04 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* flo.denominator -> integer
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the denominator (always positive). The result is machine
|
|
|
|
* dependent.
|
2009-06-19 09:59:08 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* See also Float#numerator.
|
2009-06-19 09:37:04 -04:00
|
|
|
*/
|
2019-07-15 18:58:47 -04:00
|
|
|
VALUE
|
|
|
|
rb_float_denominator(VALUE self)
|
2009-06-18 20:31:08 -04:00
|
|
|
{
|
|
|
|
double d = RFLOAT_VALUE(self);
|
2017-04-30 20:32:56 -04:00
|
|
|
VALUE r;
|
2021-08-26 21:52:02 -04:00
|
|
|
if (!isfinite(d))
|
2009-06-18 20:31:08 -04:00
|
|
|
return INT2FIX(1);
|
2017-04-30 20:32:56 -04:00
|
|
|
r = float_to_r(self);
|
|
|
|
return nurat_denominator(r);
|
2009-06-18 20:31:08 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* nil.to_r -> (0/1)
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns zero as a rational.
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
nilclass_to_r(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return rb_rational_new1(INT2FIX(0));
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2010-04-26 07:14:40 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* nil.rationalize([eps]) -> (0/1)
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns zero as a rational. The optional argument +eps+ is always
|
2010-04-26 07:14:40 -04:00
|
|
|
* ignored.
|
|
|
|
*/
|
|
|
|
static VALUE
|
|
|
|
nilclass_rationalize(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2018-12-03 21:24:15 -05:00
|
|
|
rb_check_arity(argc, 0, 1);
|
2010-04-26 07:14:40 -04:00
|
|
|
return nilclass_to_r(self);
|
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* int.to_r -> rational
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Returns the value as a rational.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* 1.to_r #=> (1/1)
|
|
|
|
* (1<<64).to_r #=> (18446744073709551616/1)
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
integer_to_r(VALUE self)
|
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
return rb_rational_new1(self);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2010-04-26 07:14:40 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* int.rationalize([eps]) -> rational
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns the value as a rational. The optional argument +eps+ is
|
2010-04-26 07:14:40 -04:00
|
|
|
* always ignored.
|
|
|
|
*/
|
|
|
|
static VALUE
|
|
|
|
integer_rationalize(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2018-12-03 21:24:15 -05:00
|
|
|
rb_check_arity(argc, 0, 1);
|
2010-04-26 07:14:40 -04:00
|
|
|
return integer_to_r(self);
|
|
|
|
}
|
|
|
|
|
2008-09-07 18:10:38 -04:00
|
|
|
static void
|
2019-08-02 06:04:38 -04:00
|
|
|
float_decode_internal(VALUE self, VALUE *rf, int *n)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2008-03-31 12:42:24 -04:00
|
|
|
double f;
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2019-08-02 06:04:38 -04:00
|
|
|
f = frexp(RFLOAT_VALUE(self), n);
|
2008-03-31 12:42:24 -04:00
|
|
|
f = ldexp(f, DBL_MANT_DIG);
|
2019-08-02 06:04:38 -04:00
|
|
|
*n -= DBL_MANT_DIG;
|
2008-09-07 18:10:38 -04:00
|
|
|
*rf = rb_dbl2big(f);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* flt.to_r -> rational
|
|
|
|
*
|
|
|
|
* Returns the value as a rational.
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* 2.0.to_r #=> (2/1)
|
|
|
|
* 2.5.to_r #=> (5/2)
|
|
|
|
* -0.75.to_r #=> (-3/4)
|
|
|
|
* 0.0.to_r #=> (0/1)
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* 0.3.to_r #=> (5404319552844595/18014398509481984)
|
|
|
|
*
|
|
|
|
* NOTE: 0.3.to_r isn't the same as "0.3".to_r. The latter is
|
|
|
|
* equivalent to "3/10".to_r, but the former isn't so.
|
|
|
|
*
|
|
|
|
* 0.3.to_r == 3/10r #=> false
|
|
|
|
* "0.3".to_r == 3/10r #=> true
|
2012-11-10 05:29:13 -05:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* See also Float#rationalize.
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
float_to_r(VALUE self)
|
|
|
|
{
|
2019-08-02 06:04:38 -04:00
|
|
|
VALUE f;
|
|
|
|
int n;
|
2008-09-07 18:10:38 -04:00
|
|
|
|
|
|
|
float_decode_internal(self, &f, &n);
|
2009-07-19 09:25:05 -04:00
|
|
|
#if FLT_RADIX == 2
|
2019-08-02 06:04:38 -04:00
|
|
|
if (n == 0)
|
|
|
|
return rb_rational_new1(f);
|
|
|
|
if (n > 0)
|
|
|
|
return rb_rational_new1(rb_int_lshift(f, INT2FIX(n)));
|
|
|
|
n = -n;
|
|
|
|
return rb_rational_new2(f, rb_int_lshift(ONE, INT2FIX(n)));
|
2009-07-19 09:25:05 -04:00
|
|
|
#else
|
2016-11-12 06:52:00 -05:00
|
|
|
f = rb_int_mul(f, rb_int_pow(INT2FIX(FLT_RADIX), n));
|
|
|
|
if (RB_TYPE_P(f, T_RATIONAL))
|
|
|
|
return f;
|
|
|
|
return rb_rational_new1(f);
|
2009-07-19 09:25:05 -04:00
|
|
|
#endif
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2013-08-01 10:58:54 -04:00
|
|
|
VALUE
|
|
|
|
rb_flt_rationalize_with_prec(VALUE flt, VALUE prec)
|
|
|
|
{
|
|
|
|
VALUE e, a, b, p, q;
|
|
|
|
|
|
|
|
e = f_abs(prec);
|
|
|
|
a = f_sub(flt, e);
|
|
|
|
b = f_add(flt, e);
|
|
|
|
|
|
|
|
if (f_eqeq_p(a, b))
|
2016-11-12 07:14:10 -05:00
|
|
|
return float_to_r(flt);
|
2013-08-01 10:58:54 -04:00
|
|
|
|
|
|
|
nurat_rationalize_internal(a, b, &p, &q);
|
|
|
|
return rb_rational_new2(p, q);
|
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_flt_rationalize(VALUE flt)
|
|
|
|
{
|
2020-05-30 05:39:56 -04:00
|
|
|
VALUE a, b, f, p, q, den;
|
2019-08-02 06:04:38 -04:00
|
|
|
int n;
|
2013-08-01 10:58:54 -04:00
|
|
|
|
|
|
|
float_decode_internal(flt, &f, &n);
|
2019-08-02 06:04:38 -04:00
|
|
|
if (INT_ZERO_P(f) || n >= 0)
|
|
|
|
return rb_rational_new1(rb_int_lshift(f, INT2FIX(n)));
|
2013-08-01 10:58:54 -04:00
|
|
|
|
|
|
|
{
|
2020-05-30 05:39:56 -04:00
|
|
|
VALUE radix_times_f;
|
2013-08-01 10:58:54 -04:00
|
|
|
|
2016-11-12 07:14:10 -05:00
|
|
|
radix_times_f = rb_int_mul(INT2FIX(FLT_RADIX), f);
|
2019-08-02 05:11:05 -04:00
|
|
|
#if FLT_RADIX == 2 && 0
|
2019-08-02 06:04:38 -04:00
|
|
|
den = rb_int_lshift(ONE, INT2FIX(1-n));
|
2019-08-02 05:11:05 -04:00
|
|
|
#else
|
2019-08-02 06:04:38 -04:00
|
|
|
den = rb_int_positive_pow(FLT_RADIX, 1-n);
|
2019-08-02 05:11:05 -04:00
|
|
|
#endif
|
2013-08-01 10:58:54 -04:00
|
|
|
|
2020-05-30 05:39:56 -04:00
|
|
|
a = rb_int_minus(radix_times_f, INT2FIX(FLT_RADIX - 1));
|
|
|
|
b = rb_int_plus(radix_times_f, INT2FIX(FLT_RADIX - 1));
|
2013-08-01 10:58:54 -04:00
|
|
|
}
|
|
|
|
|
2020-05-30 05:39:56 -04:00
|
|
|
if (f_eqeq_p(a, b))
|
2016-11-12 07:14:10 -05:00
|
|
|
return float_to_r(flt);
|
2013-08-01 10:58:54 -04:00
|
|
|
|
2020-05-30 05:39:56 -04:00
|
|
|
a = rb_rational_new2(a, den);
|
|
|
|
b = rb_rational_new2(b, den);
|
2013-08-01 10:58:54 -04:00
|
|
|
nurat_rationalize_internal(a, b, &p, &q);
|
|
|
|
return rb_rational_new2(p, q);
|
|
|
|
}
|
|
|
|
|
2010-04-26 07:14:40 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* flt.rationalize([eps]) -> rational
|
|
|
|
*
|
|
|
|
* Returns a simpler approximation of the value (flt-|eps| <= result
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* <= flt+|eps|). If the optional argument +eps+ is not given,
|
|
|
|
* it will be chosen automatically.
|
2010-04-26 07:14:40 -04:00
|
|
|
*
|
|
|
|
* 0.3.rationalize #=> (3/10)
|
|
|
|
* 1.333.rationalize #=> (1333/1000)
|
|
|
|
* 1.333.rationalize(0.01) #=> (4/3)
|
2012-11-10 05:29:13 -05:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* See also Float#to_r.
|
2010-04-26 07:14:40 -04:00
|
|
|
*/
|
|
|
|
static VALUE
|
|
|
|
float_rationalize(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
2016-11-12 07:14:10 -05:00
|
|
|
double d = RFLOAT_VALUE(self);
|
2020-05-30 05:39:56 -04:00
|
|
|
VALUE rat;
|
|
|
|
int neg = d < 0.0;
|
|
|
|
if (neg) self = DBL2NUM(-d);
|
2010-04-26 07:14:40 -04:00
|
|
|
|
2018-12-06 02:49:24 -05:00
|
|
|
if (rb_check_arity(argc, 0, 1)) {
|
2020-05-30 05:39:56 -04:00
|
|
|
rat = rb_flt_rationalize_with_prec(self, argv[0]);
|
2010-04-26 07:14:40 -04:00
|
|
|
}
|
|
|
|
else {
|
2020-05-30 05:39:56 -04:00
|
|
|
rat = rb_flt_rationalize(self);
|
2010-04-26 07:14:40 -04:00
|
|
|
}
|
2020-05-30 05:39:56 -04:00
|
|
|
if (neg) RATIONAL_SET_NUM(rat, rb_int_uminus(RRATIONAL(rat)->num));
|
|
|
|
return rat;
|
2010-04-26 07:14:40 -04:00
|
|
|
}
|
|
|
|
|
2012-11-20 07:10:08 -05:00
|
|
|
inline static int
|
|
|
|
issign(int c)
|
|
|
|
{
|
|
|
|
return (c == '-' || c == '+');
|
|
|
|
}
|
|
|
|
|
2012-11-17 10:19:55 -05:00
|
|
|
static int
|
2017-03-15 23:32:16 -04:00
|
|
|
read_sign(const char **s, const char *const e)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2012-11-17 10:19:55 -05:00
|
|
|
int sign = '?';
|
2008-06-09 01:39:57 -04:00
|
|
|
|
2017-03-15 23:32:16 -04:00
|
|
|
if (*s < e && issign(**s)) {
|
2012-11-17 10:19:55 -05:00
|
|
|
sign = **s;
|
|
|
|
(*s)++;
|
|
|
|
}
|
|
|
|
return sign;
|
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2012-11-20 07:10:08 -05:00
|
|
|
inline static int
|
|
|
|
islettere(int c)
|
|
|
|
{
|
|
|
|
return (c == 'e' || c == 'E');
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2018-02-23 21:08:36 -05:00
|
|
|
static VALUE
|
|
|
|
negate_num(VALUE num)
|
|
|
|
{
|
|
|
|
if (FIXNUM_P(num)) {
|
|
|
|
return rb_int_uminus(num);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
BIGNUM_NEGATE(num);
|
|
|
|
return rb_big_norm(num);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-11-17 10:19:55 -05:00
|
|
|
static int
|
2018-11-07 21:25:44 -05:00
|
|
|
read_num(const char **s, const char *const end, VALUE *num, VALUE *nexp)
|
2012-11-17 10:19:55 -05:00
|
|
|
{
|
2017-03-16 02:51:24 -04:00
|
|
|
VALUE fp = ONE, exp, fn = ZERO, n = ZERO;
|
2017-03-15 23:32:16 -04:00
|
|
|
int expsign = 0, ok = 0;
|
|
|
|
char *e;
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2018-11-07 21:25:44 -05:00
|
|
|
*nexp = ZERO;
|
2016-12-29 05:32:48 -05:00
|
|
|
*num = ZERO;
|
2017-03-15 23:32:16 -04:00
|
|
|
if (*s < end && **s != '.') {
|
|
|
|
n = rb_int_parse_cstr(*s, end-*s, &e, NULL,
|
|
|
|
10, RB_INT_PARSE_UNDERSCORE);
|
|
|
|
if (NIL_P(n))
|
2012-11-17 10:19:55 -05:00
|
|
|
return 0;
|
2017-03-15 23:32:16 -04:00
|
|
|
*s = e;
|
|
|
|
*num = n;
|
|
|
|
ok = 1;
|
2012-11-17 10:19:55 -05:00
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2017-03-15 23:32:16 -04:00
|
|
|
if (*s < end && **s == '.') {
|
|
|
|
size_t count = 0;
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2012-11-17 10:19:55 -05:00
|
|
|
(*s)++;
|
2017-03-15 23:32:16 -04:00
|
|
|
fp = rb_int_parse_cstr(*s, end-*s, &e, &count,
|
|
|
|
10, RB_INT_PARSE_UNDERSCORE);
|
|
|
|
if (NIL_P(fp))
|
|
|
|
return 1;
|
|
|
|
*s = e;
|
2012-11-17 10:19:55 -05:00
|
|
|
{
|
2018-11-07 21:25:44 -05:00
|
|
|
VALUE l = f_expt10(*nexp = SIZET2NUM(count));
|
2017-03-15 23:32:16 -04:00
|
|
|
n = n == ZERO ? fp : rb_int_plus(rb_int_mul(*num, l), fp);
|
|
|
|
*num = n;
|
|
|
|
fn = SIZET2NUM(count);
|
2012-11-17 10:19:55 -05:00
|
|
|
}
|
2017-03-15 23:32:16 -04:00
|
|
|
ok = 1;
|
2012-11-17 10:19:55 -05:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2017-03-15 23:32:16 -04:00
|
|
|
if (ok && *s + 1 < end && islettere(**s)) {
|
2012-11-17 10:19:55 -05:00
|
|
|
(*s)++;
|
2017-03-15 23:32:16 -04:00
|
|
|
expsign = read_sign(s, end);
|
|
|
|
exp = rb_int_parse_cstr(*s, end-*s, &e, NULL,
|
|
|
|
10, RB_INT_PARSE_UNDERSCORE);
|
|
|
|
if (NIL_P(exp))
|
|
|
|
return 1;
|
|
|
|
*s = e;
|
2016-12-29 05:32:48 -05:00
|
|
|
if (exp != ZERO) {
|
|
|
|
if (expsign == '-') {
|
|
|
|
if (fn != ZERO) exp = rb_int_plus(exp, fn);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (fn != ZERO) exp = rb_int_minus(exp, fn);
|
2018-11-07 21:25:44 -05:00
|
|
|
exp = negate_num(exp);
|
2016-12-29 05:32:48 -05:00
|
|
|
}
|
2018-11-07 21:25:44 -05:00
|
|
|
*nexp = exp;
|
2016-12-29 04:26:45 -05:00
|
|
|
}
|
2012-11-17 10:19:55 -05:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2017-03-15 23:32:16 -04:00
|
|
|
return ok;
|
2012-11-17 10:19:55 -05:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2017-03-15 23:32:16 -04:00
|
|
|
inline static const char *
|
|
|
|
skip_ws(const char *s, const char *e)
|
2012-11-17 10:19:55 -05:00
|
|
|
{
|
2017-03-15 23:32:16 -04:00
|
|
|
while (s < e && isspace((unsigned char)*s))
|
|
|
|
++s;
|
|
|
|
return s;
|
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2017-03-15 23:32:16 -04:00
|
|
|
static VALUE
|
2018-03-15 03:19:46 -04:00
|
|
|
parse_rat(const char *s, const char *const e, int strict, int raise)
|
2017-03-15 23:32:16 -04:00
|
|
|
{
|
|
|
|
int sign;
|
2018-11-07 21:25:44 -05:00
|
|
|
VALUE num, den, nexp, dexp;
|
2017-03-15 23:32:16 -04:00
|
|
|
|
|
|
|
s = skip_ws(s, e);
|
|
|
|
sign = read_sign(&s, e);
|
|
|
|
|
2018-11-07 21:25:44 -05:00
|
|
|
if (!read_num(&s, e, &num, &nexp)) {
|
2017-03-15 23:32:16 -04:00
|
|
|
if (strict) return Qnil;
|
2020-10-23 01:38:24 -04:00
|
|
|
return nurat_s_alloc(rb_cRational);
|
2017-03-15 23:32:16 -04:00
|
|
|
}
|
2018-11-07 21:25:44 -05:00
|
|
|
den = ONE;
|
2017-03-15 23:32:16 -04:00
|
|
|
if (s < e && *s == '/') {
|
|
|
|
s++;
|
2018-11-07 21:25:44 -05:00
|
|
|
if (!read_num(&s, e, &den, &dexp)) {
|
2017-03-15 23:32:16 -04:00
|
|
|
if (strict) return Qnil;
|
2018-11-07 21:25:44 -05:00
|
|
|
den = ONE;
|
2017-03-15 23:32:16 -04:00
|
|
|
}
|
|
|
|
else if (den == ZERO) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (!raise) return Qnil;
|
2017-03-15 23:32:16 -04:00
|
|
|
rb_num_zerodiv();
|
|
|
|
}
|
|
|
|
else if (strict && skip_ws(s, e) != e) {
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
else {
|
2018-11-07 21:25:44 -05:00
|
|
|
nexp = rb_int_minus(nexp, dexp);
|
2017-03-15 23:32:16 -04:00
|
|
|
nurat_reduce(&num, &den);
|
|
|
|
}
|
2016-12-29 05:32:48 -05:00
|
|
|
}
|
2017-03-15 23:32:16 -04:00
|
|
|
else if (strict && skip_ws(s, e) != e) {
|
|
|
|
return Qnil;
|
2016-12-29 05:32:48 -05:00
|
|
|
}
|
|
|
|
|
2018-11-07 21:25:44 -05:00
|
|
|
if (nexp != ZERO) {
|
|
|
|
if (INT_NEGATIVE_P(nexp)) {
|
|
|
|
VALUE mul;
|
2020-06-16 02:18:55 -04:00
|
|
|
if (FIXNUM_P(nexp)) {
|
|
|
|
mul = f_expt10(LONG2NUM(-FIX2LONG(nexp)));
|
|
|
|
if (! RB_FLOAT_TYPE_P(mul)) {
|
|
|
|
num = rb_int_mul(num, mul);
|
|
|
|
goto reduce;
|
|
|
|
}
|
2018-11-07 21:25:44 -05:00
|
|
|
}
|
2020-06-16 02:18:55 -04:00
|
|
|
return sign == '-' ? DBL2NUM(-HUGE_VAL) : DBL2NUM(HUGE_VAL);
|
2018-11-07 21:25:44 -05:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
VALUE div;
|
2020-06-16 02:18:55 -04:00
|
|
|
if (FIXNUM_P(nexp)) {
|
|
|
|
div = f_expt10(nexp);
|
|
|
|
if (! RB_FLOAT_TYPE_P(div)) {
|
|
|
|
den = rb_int_mul(den, div);
|
|
|
|
goto reduce;
|
|
|
|
}
|
2018-11-07 21:25:44 -05:00
|
|
|
}
|
2020-06-16 02:18:55 -04:00
|
|
|
return sign == '-' ? DBL2NUM(-0.0) : DBL2NUM(+0.0);
|
2018-11-07 21:25:44 -05:00
|
|
|
}
|
2020-06-16 02:18:55 -04:00
|
|
|
reduce:
|
2018-11-07 21:25:44 -05:00
|
|
|
nurat_reduce(&num, &den);
|
|
|
|
}
|
|
|
|
|
2016-12-29 05:32:48 -05:00
|
|
|
if (sign == '-') {
|
2018-02-23 21:08:36 -05:00
|
|
|
num = negate_num(num);
|
2012-11-17 10:19:55 -05:00
|
|
|
}
|
2012-11-17 19:26:15 -05:00
|
|
|
|
2020-10-23 01:38:24 -04:00
|
|
|
return rb_rational_raw(num, den);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
2018-03-15 03:19:46 -04:00
|
|
|
string_to_r_strict(VALUE self, int raise)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2012-11-17 10:19:55 -05:00
|
|
|
VALUE num;
|
|
|
|
|
|
|
|
rb_must_asciicompat(self);
|
|
|
|
|
2018-03-15 03:19:46 -04:00
|
|
|
num = parse_rat(RSTRING_PTR(self), RSTRING_END(self), 1, raise);
|
2017-03-15 23:32:16 -04:00
|
|
|
if (NIL_P(num)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (!raise) return Qnil;
|
|
|
|
rb_raise(rb_eArgError, "invalid value for convert(): %+"PRIsVALUE,
|
|
|
|
self);
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2018-11-07 21:25:44 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(num) && !FLOAT_ZERO_P(num)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (!raise) return Qnil;
|
|
|
|
rb_raise(rb_eFloatDomainError, "Infinity");
|
|
|
|
}
|
2012-11-17 10:19:55 -05:00
|
|
|
return num;
|
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
2009-06-27 03:46:57 -04:00
|
|
|
* str.to_r -> rational
|
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* Returns the result of interpreting leading characters in +str+
|
|
|
|
* as a rational. Leading whitespace and extraneous characters
|
|
|
|
* past the end of a valid number are ignored.
|
|
|
|
* Digit sequences can be separated by an underscore.
|
|
|
|
* If there is not a valid number at the start of +str+,
|
|
|
|
* zero is returned. This method never raises an exception.
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* ' 2 '.to_r #=> (2/1)
|
|
|
|
* '300/2'.to_r #=> (150/1)
|
|
|
|
* '-9.2'.to_r #=> (-46/5)
|
|
|
|
* '-9.2e2'.to_r #=> (-920/1)
|
|
|
|
* '1_234_567'.to_r #=> (1234567/1)
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* '21 June 09'.to_r #=> (21/1)
|
2009-06-27 03:46:57 -04:00
|
|
|
* '21/06/09'.to_r #=> (7/2)
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* 'BWV 1079'.to_r #=> (0/1)
|
|
|
|
*
|
|
|
|
* NOTE: "0.3".to_r isn't the same as 0.3.to_r. The former is
|
|
|
|
* equivalent to "3/10".to_r, but the latter isn't so.
|
|
|
|
*
|
|
|
|
* "0.3".to_r == 3/10r #=> true
|
|
|
|
* 0.3.to_r == 3/10r #=> false
|
2013-03-10 04:01:32 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* See also Kernel#Rational.
|
2009-06-19 07:42:07 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
|
|
|
string_to_r(VALUE self)
|
|
|
|
{
|
2012-11-17 10:19:55 -05:00
|
|
|
VALUE num;
|
2008-06-13 08:29:50 -04:00
|
|
|
|
2012-11-17 10:19:55 -05:00
|
|
|
rb_must_asciicompat(self);
|
2008-06-13 08:29:50 -04:00
|
|
|
|
2018-03-15 03:19:46 -04:00
|
|
|
num = parse_rat(RSTRING_PTR(self), RSTRING_END(self), 0, TRUE);
|
2008-06-13 08:29:50 -04:00
|
|
|
|
2018-11-07 21:25:44 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(num) && !FLOAT_ZERO_P(num))
|
2012-11-17 10:19:55 -05:00
|
|
|
rb_raise(rb_eFloatDomainError, "Infinity");
|
|
|
|
return num;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2012-11-17 10:19:55 -05:00
|
|
|
VALUE
|
|
|
|
rb_cstr_to_rat(const char *s, int strict) /* for complex's internal */
|
|
|
|
{
|
|
|
|
VALUE num;
|
|
|
|
|
2018-03-15 03:19:46 -04:00
|
|
|
num = parse_rat(s, s + strlen(s), strict, TRUE);
|
2012-11-17 10:19:55 -05:00
|
|
|
|
2018-11-07 21:25:44 -05:00
|
|
|
if (RB_FLOAT_TYPE_P(num) && !FLOAT_ZERO_P(num))
|
2012-11-17 10:19:55 -05:00
|
|
|
rb_raise(rb_eFloatDomainError, "Infinity");
|
|
|
|
return num;
|
|
|
|
}
|
2008-04-05 10:25:40 -04:00
|
|
|
|
2008-03-15 20:23:43 -04:00
|
|
|
static VALUE
|
2018-03-15 03:19:46 -04:00
|
|
|
to_rational(VALUE val)
|
2008-03-15 20:23:43 -04:00
|
|
|
{
|
2018-03-15 03:19:46 -04:00
|
|
|
return rb_convert_type_with_id(val, T_RATIONAL, "Rational", idTo_r);
|
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2018-03-15 03:19:46 -04:00
|
|
|
static VALUE
|
|
|
|
nurat_convert(VALUE klass, VALUE numv, VALUE denv, int raise)
|
|
|
|
{
|
|
|
|
VALUE a1 = numv, a2 = denv;
|
|
|
|
int state;
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2020-10-22 04:59:52 -04:00
|
|
|
assert(a1 != Qundef);
|
|
|
|
|
2019-01-12 00:02:58 -05:00
|
|
|
if (NIL_P(a1) || NIL_P(a2)) {
|
|
|
|
if (!raise) return Qnil;
|
2018-03-15 03:19:46 -04:00
|
|
|
rb_raise(rb_eTypeError, "can't convert nil into Rational");
|
2019-01-12 00:02:58 -05:00
|
|
|
}
|
2009-06-18 09:41:44 -04:00
|
|
|
|
2013-09-09 01:17:13 -04:00
|
|
|
if (RB_TYPE_P(a1, T_COMPLEX)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (k_exact_zero_p(RCOMPLEX(a1)->imag))
|
|
|
|
a1 = RCOMPLEX(a1)->real;
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2013-09-09 01:17:13 -04:00
|
|
|
if (RB_TYPE_P(a2, T_COMPLEX)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (k_exact_zero_p(RCOMPLEX(a2)->imag))
|
|
|
|
a2 = RCOMPLEX(a2)->real;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2020-10-22 04:59:52 -04:00
|
|
|
if (RB_INTEGER_TYPE_P(a1)) {
|
|
|
|
// nothing to do
|
|
|
|
}
|
|
|
|
else if (RB_FLOAT_TYPE_P(a1)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
a1 = float_to_r(a1);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2020-10-22 04:59:52 -04:00
|
|
|
else if (RB_TYPE_P(a1, T_RATIONAL)) {
|
|
|
|
// nothing to do
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
else if (RB_TYPE_P(a1, T_STRING)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
a1 = string_to_r_strict(a1, raise);
|
|
|
|
if (!raise && NIL_P(a1)) return Qnil;
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2020-10-22 04:59:52 -04:00
|
|
|
else if (!rb_respond_to(a1, idTo_r)) {
|
|
|
|
VALUE tmp = rb_protect(rb_check_to_int, a1, NULL);
|
|
|
|
rb_set_errinfo(Qnil);
|
|
|
|
if (!NIL_P(tmp)) {
|
|
|
|
a1 = tmp;
|
|
|
|
}
|
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2020-10-22 04:59:52 -04:00
|
|
|
if (RB_INTEGER_TYPE_P(a2)) {
|
|
|
|
// nothing to do
|
|
|
|
}
|
|
|
|
else if (RB_FLOAT_TYPE_P(a2)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
a2 = float_to_r(a2);
|
2013-09-09 01:17:13 -04:00
|
|
|
}
|
2020-10-22 04:59:52 -04:00
|
|
|
else if (RB_TYPE_P(a2, T_RATIONAL)) {
|
|
|
|
// nothing to do
|
|
|
|
}
|
2013-09-09 01:17:13 -04:00
|
|
|
else if (RB_TYPE_P(a2, T_STRING)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
a2 = string_to_r_strict(a2, raise);
|
|
|
|
if (!raise && NIL_P(a2)) return Qnil;
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2020-10-22 04:59:52 -04:00
|
|
|
else if (a2 != Qundef && !rb_respond_to(a2, idTo_r)) {
|
|
|
|
VALUE tmp = rb_protect(rb_check_to_int, a2, NULL);
|
|
|
|
rb_set_errinfo(Qnil);
|
|
|
|
if (!NIL_P(tmp)) {
|
|
|
|
a2 = tmp;
|
|
|
|
}
|
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2013-09-09 01:17:13 -04:00
|
|
|
if (RB_TYPE_P(a1, T_RATIONAL)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (a2 == Qundef || (k_exact_one_p(a2)))
|
|
|
|
return a1;
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2018-03-15 03:19:46 -04:00
|
|
|
if (a2 == Qundef) {
|
2020-10-22 04:59:52 -04:00
|
|
|
if (!RB_INTEGER_TYPE_P(a1)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (!raise) {
|
|
|
|
VALUE result = rb_protect(to_rational, a1, NULL);
|
|
|
|
rb_set_errinfo(Qnil);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
return to_rational(a1);
|
|
|
|
}
|
2008-09-20 21:30:25 -04:00
|
|
|
}
|
|
|
|
else {
|
2018-02-27 11:45:09 -05:00
|
|
|
if (!k_numeric_p(a1)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (!raise) {
|
|
|
|
a1 = rb_protect(to_rational, a1, &state);
|
|
|
|
if (state) {
|
|
|
|
rb_set_errinfo(Qnil);
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
a1 = rb_check_convert_type_with_id(a1, T_RATIONAL, "Rational", idTo_r);
|
|
|
|
}
|
2018-02-27 11:45:09 -05:00
|
|
|
}
|
|
|
|
if (!k_numeric_p(a2)) {
|
2018-03-15 03:19:46 -04:00
|
|
|
if (!raise) {
|
|
|
|
a2 = rb_protect(to_rational, a2, &state);
|
|
|
|
if (state) {
|
|
|
|
rb_set_errinfo(Qnil);
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
a2 = rb_check_convert_type_with_id(a2, T_RATIONAL, "Rational", idTo_r);
|
|
|
|
}
|
2018-02-27 11:45:09 -05:00
|
|
|
}
|
2018-03-15 03:19:46 -04:00
|
|
|
if ((k_numeric_p(a1) && k_numeric_p(a2)) &&
|
2020-10-26 05:43:30 -04:00
|
|
|
(!f_integer_p(a1) || !f_integer_p(a2))) {
|
|
|
|
VALUE tmp = rb_protect(to_rational, a1, &state);
|
|
|
|
if (!state) {
|
|
|
|
a1 = tmp;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
rb_set_errinfo(Qnil);
|
|
|
|
}
|
2018-03-15 03:19:46 -04:00
|
|
|
return f_div(a1, a2);
|
2020-10-26 05:43:30 -04:00
|
|
|
}
|
2008-03-31 12:42:24 -04:00
|
|
|
}
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2020-01-16 19:45:10 -05:00
|
|
|
a1 = nurat_int_value(a1);
|
|
|
|
|
|
|
|
if (a2 == Qundef) {
|
|
|
|
a2 = ONE;
|
|
|
|
}
|
|
|
|
else if (!k_integer_p(a2) && !raise) {
|
|
|
|
return Qnil;
|
2018-03-15 03:19:46 -04:00
|
|
|
}
|
2020-01-16 19:45:10 -05:00
|
|
|
else {
|
|
|
|
a2 = nurat_int_value(a2);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return nurat_s_canonicalize_internal(klass, a1, a2);
|
2018-03-15 03:19:46 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
nurat_s_convert(int argc, VALUE *argv, VALUE klass)
|
|
|
|
{
|
|
|
|
VALUE a1, a2;
|
|
|
|
|
|
|
|
if (rb_scan_args(argc, argv, "11", &a1, &a2) == 1) {
|
|
|
|
a2 = Qundef;
|
2008-06-09 08:02:29 -04:00
|
|
|
}
|
2018-03-15 03:19:46 -04:00
|
|
|
|
|
|
|
return nurat_convert(klass, a1, a2, TRUE);
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
/*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* A rational number can be represented as a pair of integer numbers:
|
|
|
|
* a/b (b>0), where a is the numerator and b is the denominator.
|
|
|
|
* Integer a equals rational a/1 mathematically.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2021-12-03 08:12:28 -05:00
|
|
|
* You can create a \Rational object explicitly with:
|
|
|
|
*
|
2022-02-07 11:26:39 -05:00
|
|
|
* - A {rational literal}[rdoc-ref:syntax/literals.rdoc@Rational+Literals].
|
2021-12-03 08:12:28 -05:00
|
|
|
*
|
|
|
|
* You can convert certain objects to Rationals with:
|
|
|
|
*
|
2022-02-07 11:18:56 -05:00
|
|
|
* - \Method #Rational.
|
2021-12-03 08:12:28 -05:00
|
|
|
*
|
|
|
|
* Examples
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(1) #=> (1/1)
|
|
|
|
* Rational(2, 3) #=> (2/3)
|
2021-12-03 08:12:28 -05:00
|
|
|
* Rational(4, -6) #=> (-2/3) # Reduced.
|
2009-06-27 03:46:57 -04:00
|
|
|
* 3.to_r #=> (3/1)
|
2015-04-30 04:02:38 -04:00
|
|
|
* 2/3r #=> (2/3)
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* You can also create rational objects from floating-point numbers or
|
2009-06-27 03:46:57 -04:00
|
|
|
* strings.
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(0.3) #=> (5404319552844595/18014398509481984)
|
|
|
|
* Rational('0.3') #=> (3/10)
|
|
|
|
* Rational('2/3') #=> (2/3)
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* 0.3.to_r #=> (5404319552844595/18014398509481984)
|
|
|
|
* '0.3'.to_r #=> (3/10)
|
|
|
|
* '2/3'.to_r #=> (2/3)
|
2010-11-23 09:28:55 -05:00
|
|
|
* 0.3.rationalize #=> (3/10)
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* A rational object is an exact number, which helps you to write
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* programs without any rounding errors.
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* 10.times.inject(0) {|t| t + 0.1 } #=> 0.9999999999999999
|
|
|
|
* 10.times.inject(0) {|t| t + Rational('0.1') } #=> (1/1)
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
rational.c: improve docs
* rational.c: [DOC] improve docs for Rational and related methods
* improve class documentation for Rational
* fix call-seq's
* simplify examples for Rational#{floor,ceil,truncate,round}
* fix wrong examples for #floor, subtraction, and exponentiation
* improve docs for #<=>, Kernel#Rational, {String,Float}#to_r,
Integer.{gcd,lcm,gcdlcm}
* fix typos, grammar, and rdoc formatting
* other improvements
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@58230 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2017-04-01 16:19:59 -04:00
|
|
|
* However, when an expression includes an inexact component (numerical value
|
|
|
|
* or operation), it will produce an inexact result.
|
2009-06-19 09:37:04 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(10) / 3 #=> (10/3)
|
|
|
|
* Rational(10) / 3.0 #=> 3.3333333333333335
|
2009-06-19 07:42:07 -04:00
|
|
|
*
|
2009-06-27 03:46:57 -04:00
|
|
|
* Rational(-8) ** Rational(1, 3)
|
|
|
|
* #=> (1.0000000000000002+1.7320508075688772i)
|
2009-06-19 09:37:04 -04:00
|
|
|
*/
|
2008-03-15 20:23:43 -04:00
|
|
|
void
|
|
|
|
Init_Rational(void)
|
|
|
|
{
|
2012-07-25 04:41:07 -04:00
|
|
|
VALUE compat;
|
2020-09-25 13:56:30 -04:00
|
|
|
id_abs = rb_intern_const("abs");
|
|
|
|
id_integer_p = rb_intern_const("integer?");
|
|
|
|
id_i_num = rb_intern_const("@numerator");
|
|
|
|
id_i_den = rb_intern_const("@denominator");
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2009-06-19 07:42:07 -04:00
|
|
|
rb_cRational = rb_define_class("Rational", rb_cNumeric);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
|
|
|
rb_define_alloc_func(rb_cRational, nurat_s_alloc);
|
2008-09-24 04:44:47 -04:00
|
|
|
rb_undef_method(CLASS_OF(rb_cRational), "allocate");
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2008-09-23 06:33:27 -04:00
|
|
|
rb_undef_method(CLASS_OF(rb_cRational), "new");
|
2008-03-31 12:42:24 -04:00
|
|
|
|
2009-06-19 07:47:53 -04:00
|
|
|
rb_define_global_function("Rational", nurat_f_rational, -1);
|
2008-03-31 12:42:24 -04:00
|
|
|
|
|
|
|
rb_define_method(rb_cRational, "numerator", nurat_numerator, 0);
|
|
|
|
rb_define_method(rb_cRational, "denominator", nurat_denominator, 0);
|
|
|
|
|
2016-11-18 10:17:19 -05:00
|
|
|
rb_define_method(rb_cRational, "-@", rb_rational_uminus, 0);
|
2016-04-15 10:54:39 -04:00
|
|
|
rb_define_method(rb_cRational, "+", rb_rational_plus, 1);
|
2020-05-30 05:34:32 -04:00
|
|
|
rb_define_method(rb_cRational, "-", rb_rational_minus, 1);
|
2019-01-03 01:19:17 -05:00
|
|
|
rb_define_method(rb_cRational, "*", rb_rational_mul, 1);
|
2020-12-09 04:48:59 -05:00
|
|
|
rb_define_method(rb_cRational, "/", rb_rational_div, 1);
|
|
|
|
rb_define_method(rb_cRational, "quo", rb_rational_div, 1);
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cRational, "fdiv", nurat_fdiv, 1);
|
|
|
|
rb_define_method(rb_cRational, "**", nurat_expt, 1);
|
|
|
|
|
2016-11-22 00:21:12 -05:00
|
|
|
rb_define_method(rb_cRational, "<=>", rb_rational_cmp, 1);
|
2009-07-03 08:19:54 -04:00
|
|
|
rb_define_method(rb_cRational, "==", nurat_eqeq_p, 1);
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cRational, "coerce", nurat_coerce, 1);
|
|
|
|
|
2016-11-12 10:07:53 -05:00
|
|
|
rb_define_method(rb_cRational, "positive?", nurat_positive_p, 0);
|
|
|
|
rb_define_method(rb_cRational, "negative?", nurat_negative_p, 0);
|
2016-11-15 23:25:33 -05:00
|
|
|
rb_define_method(rb_cRational, "abs", rb_rational_abs, 0);
|
|
|
|
rb_define_method(rb_cRational, "magnitude", rb_rational_abs, 0);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-12-29 06:50:10 -05:00
|
|
|
rb_define_method(rb_cRational, "floor", nurat_floor_n, -1);
|
|
|
|
rb_define_method(rb_cRational, "ceil", nurat_ceil_n, -1);
|
|
|
|
rb_define_method(rb_cRational, "truncate", nurat_truncate_n, -1);
|
|
|
|
rb_define_method(rb_cRational, "round", nurat_round_n, -1);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cRational, "to_i", nurat_truncate, 0);
|
|
|
|
rb_define_method(rb_cRational, "to_f", nurat_to_f, 0);
|
|
|
|
rb_define_method(rb_cRational, "to_r", nurat_to_r, 0);
|
2010-04-26 07:14:40 -04:00
|
|
|
rb_define_method(rb_cRational, "rationalize", nurat_rationalize, -1);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cRational, "hash", nurat_hash, 0);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cRational, "to_s", nurat_to_s, 0);
|
|
|
|
rb_define_method(rb_cRational, "inspect", nurat_inspect, 0);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2012-12-03 05:10:14 -05:00
|
|
|
rb_define_private_method(rb_cRational, "marshal_dump", nurat_marshal_dump, 0);
|
2018-02-22 21:16:42 -05:00
|
|
|
/* :nodoc: */
|
2012-07-25 04:41:07 -04:00
|
|
|
compat = rb_define_class_under(rb_cRational, "compatible", rb_cObject);
|
2012-12-03 05:10:14 -05:00
|
|
|
rb_define_private_method(compat, "marshal_load", nurat_marshal_load, 1);
|
2012-07-25 04:41:07 -04:00
|
|
|
rb_marshal_define_compat(rb_cRational, compat, nurat_dumper, nurat_loader);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cInteger, "gcd", rb_gcd, 1);
|
|
|
|
rb_define_method(rb_cInteger, "lcm", rb_lcm, 1);
|
|
|
|
rb_define_method(rb_cInteger, "gcdlcm", rb_gcdlcm, 1);
|
2008-03-27 07:48:00 -04:00
|
|
|
|
2009-06-18 20:31:08 -04:00
|
|
|
rb_define_method(rb_cNumeric, "numerator", numeric_numerator, 0);
|
|
|
|
rb_define_method(rb_cNumeric, "denominator", numeric_denominator, 0);
|
2017-05-27 01:41:00 -04:00
|
|
|
rb_define_method(rb_cNumeric, "quo", rb_numeric_quo, 1);
|
2009-06-18 20:31:08 -04:00
|
|
|
|
|
|
|
rb_define_method(rb_cInteger, "numerator", integer_numerator, 0);
|
|
|
|
rb_define_method(rb_cInteger, "denominator", integer_denominator, 0);
|
|
|
|
|
2019-07-15 19:15:05 -04:00
|
|
|
rb_define_method(rb_cFloat, "numerator", rb_float_numerator, 0);
|
2019-07-15 18:58:47 -04:00
|
|
|
rb_define_method(rb_cFloat, "denominator", rb_float_denominator, 0);
|
2009-06-18 20:31:08 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cNilClass, "to_r", nilclass_to_r, 0);
|
2010-04-26 07:14:40 -04:00
|
|
|
rb_define_method(rb_cNilClass, "rationalize", nilclass_rationalize, -1);
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cInteger, "to_r", integer_to_r, 0);
|
2010-04-26 07:14:40 -04:00
|
|
|
rb_define_method(rb_cInteger, "rationalize", integer_rationalize, -1);
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cFloat, "to_r", float_to_r, 0);
|
2010-04-26 07:14:40 -04:00
|
|
|
rb_define_method(rb_cFloat, "rationalize", float_rationalize, -1);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-03-31 12:42:24 -04:00
|
|
|
rb_define_method(rb_cString, "to_r", string_to_r, 0);
|
2008-03-15 20:23:43 -04:00
|
|
|
|
2008-09-24 04:02:17 -04:00
|
|
|
rb_define_private_method(CLASS_OF(rb_cRational), "convert", nurat_s_convert, -1);
|
2014-08-22 04:01:42 -04:00
|
|
|
|
|
|
|
rb_provide("rational.so"); /* for backward compatibility */
|
2008-03-15 20:23:43 -04:00
|
|
|
}
|