aboutsummaryrefslogtreecommitdiffstats
path: root/array.c
diff options
context:
space:
mode:
authormrkn <mrkn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2016-04-15 13:33:05 +0000
committermrkn <mrkn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2016-04-15 13:33:05 +0000
commita945eb9ddab99357a9f831c5dae99f33f223ac71 (patch)
treeaa2e2561b4b4bc1160ca4f2434bd28a6770c22f7 /array.c
parent4bf8fa83b7084040fbe12cc003f881ccf128c911 (diff)
downloadruby-a945eb9ddab99357a9f831c5dae99f33f223ac71.tar.gz
array.c: sum for Rational and Float mixed arrays
* array.c (rb_ary_sum): apply the precision compensated algorithm for an array in which Rational and Float values are mixed. * test/ruby/test_array.rb (test_sum): add assertions for the above change. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@54601 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'array.c')
-rw-r--r--array.c18
1 files changed, 18 insertions, 0 deletions
diff --git a/array.c b/array.c
index d85e32ccae..93d3d47db0 100644
--- a/array.c
+++ b/array.c
@@ -5722,6 +5722,8 @@ rb_ary_sum(int argc, VALUE *argv, VALUE ary)
if (RB_FLOAT_TYPE_P(e)) {
/* Kahan's compensated summation algorithm */
double f, c;
+
+ float_value:
f = NUM2DBL(v);
c = 0.0;
for (; i < RARRAY_LEN(ary); i++) {
@@ -5735,6 +5737,8 @@ rb_ary_sum(int argc, VALUE *argv, VALUE ary)
x = FIX2LONG(e);
else if (RB_TYPE_P(e, T_BIGNUM))
x = rb_big2dbl(e);
+ else if (RB_TYPE_P(e, T_RATIONAL))
+ x = rb_num2dbl(e);
else
goto not_float;
@@ -5749,6 +5753,20 @@ rb_ary_sum(int argc, VALUE *argv, VALUE ary)
v = DBL2NUM(f);
}
+ if (RB_TYPE_P(e, T_RATIONAL)) {
+ for (; i < RARRAY_LEN(ary); i++) {
+ e = RARRAY_AREF(ary, i);
+ if (block_given)
+ e = rb_yield(e);
+ if (RB_FLOAT_TYPE_P(e)) {
+ v = rb_to_float(v);
+ goto float_value;
+ }
+ v = rb_funcall(v, idPLUS, 1, e);
+ }
+ return v;
+ }
+
for (; i < RARRAY_LEN(ary); i++) {
e = RARRAY_AREF(ary, i);
if (block_given)