kotovalexarian-likes-github/ruby--ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2022-11-09 12:17:21 -05:00
Code Releases Activity

* expand tabs.

Browse source 
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@66126 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
svn 2018-12-02 05:21:57 +00:00
parent c8fb30fc9e
commit e021386e90
1 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
ext/bigdecimal/bigdecimal.c
View file

@ -2313,7 +2313,7 @@ BigDecimal_power(int argc, VALUE*argv, VALUE self)
n = NIL_P(prec) ? (ssize_t)(x->Prec*VpBaseFig()) : NUM2SSIZET(prec); n = NIL_P(prec) ? (ssize_t)(x->Prec*VpBaseFig()) : NUM2SSIZET(prec);
if (VpIsNaN(x)) { if (VpIsNaN(x)) {
y = VpCreateRbObject(n, "0"); y = VpCreateRbObject(n, "0");
RB_GC_GUARD(y->obj); RB_GC_GUARD(y->obj);
VpSetNaN(y); VpSetNaN(y);
return ToValue(y); return ToValue(y);
@ -2437,7 +2437,7 @@ BigDecimal_power(int argc, VALUE*argv, VALUE self)
} }
} }
else { else {
y = VpCreateRbObject(n, "0"); y = VpCreateRbObject(n, "0");
if (BIGDECIMAL_NEGATIVE_P(x)) { if (BIGDECIMAL_NEGATIVE_P(x)) {
if (is_integer(vexp)) { if (is_integer(vexp)) {
if (is_even(vexp)) { if (is_even(vexp)) {
@ -2470,7 +2470,7 @@ BigDecimal_power(int argc, VALUE*argv, VALUE self)
} }
else if (RTEST(rb_funcall(abs_value, '<', 1, INT2FIX(1)))) { else if (RTEST(rb_funcall(abs_value, '<', 1, INT2FIX(1)))) {
if (is_negative(vexp)) { if (is_negative(vexp)) {
y = VpCreateRbObject(n, "0"); y = VpCreateRbObject(n, "0");
if (is_even(vexp)) { if (is_even(vexp)) {
VpSetInf(y, VpGetSign(x)); VpSetInf(y, VpGetSign(x));
} }
@ -2488,7 +2488,7 @@ BigDecimal_power(int argc, VALUE*argv, VALUE self)
} }
else { else {
if (is_positive(vexp)) { if (is_positive(vexp)) {
y = VpCreateRbObject(n, "0"); y = VpCreateRbObject(n, "0");
if (is_even(vexp)) { if (is_even(vexp)) {
VpSetInf(y, VpGetSign(x)); VpSetInf(y, VpGetSign(x));
} }
@ -4838,7 +4838,7 @@ VpMult(Real *c, Real *a, Real *b)
if (MxIndC < MxIndAB) { /* The Max. prec. of c < Prec(a)+Prec(b) */ if (MxIndC < MxIndAB) { /* The Max. prec. of c < Prec(a)+Prec(b) */
w = c; w = c;
c = VpAlloc((size_t)((MxIndAB + 1) * BASE_FIG), "#0", 1); c = VpAlloc((size_t)((MxIndAB + 1) * BASE_FIG), "#0", 1);
MxIndC = MxIndAB; MxIndC = MxIndAB;
} }