Permalink
Browse files

stripped trailing spaces.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@22552 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
  • Loading branch information...
1 parent 624d07b commit 12d2c8ba41edb5a02a7471e39d67ece2894492d8 @nobu nobu committed Feb 22, 2009
Showing with 847 additions and 849 deletions.
  1. +190 −190 array.c
  2. +2 −2 bignum.c
  3. +1 −1 blockinlining.c
  4. +31 −31 class.c
  5. +12 −12 compar.c
  6. +0 −1 compile.c
  7. +41 −41 cont.c
  8. +1 −1 debug.c
  9. +10 −10 dln.c
  10. +1 −1 encoding.c
  11. +3 −3 enum.c
  12. +19 −19 error.c
  13. +1 −1 eval_error.c
  14. +8 −8 gc.c
  15. +1 −1 goruby.c
  16. +1 −1 id.c
  17. +24 −24 io.c
  18. +1 −1 iseq.c
  19. +7 −7 load.c
  20. +1 −1 marshal.c
  21. +30 −30 math.c
  22. +1 −1 numeric.c
  23. +144 −144 object.c
  24. +1 −1 parse.y
  25. +68 −68 proc.c
  26. +9 −9 random.c
  27. +44 −44 range.c
  28. +10 −10 re.c
  29. +14 −14 regcomp.c
  30. +2 −2 regenc.c
  31. +1 −1 regerror.c
  32. +7 −7 regexec.c
  33. +8 −8 regparse.c
  34. +2 −2 regsyntax.c
  35. +4 −4 signal.c
  36. +11 −11 sprintf.c
  37. +1 −1 strftime.c
  38. +35 −35 struct.c
  39. +79 −79 time.c
  40. +10 −10 transcode.c
  41. +8 −8 util.c
  42. +1 −2 vm_eval.c
  43. +2 −2 vm_insnhelper.c
View
380 array.c

Large diffs are not rendered by default.

Oops, something went wrong.
View
@@ -1714,7 +1714,7 @@ bigmul1_karatsuba(VALUE x, VALUE y)
t1 = xl; xl = xh; xh = t1;
}
bigadd_core(BDIGITS(xh), RBIGNUM_LEN(xh),
- BDIGITS(xl), RBIGNUM_LEN(xl),
+ BDIGITS(xl), RBIGNUM_LEN(xl),
BDIGITS(xh), RBIGNUM_LEN(xh));
/* yh <- yh + yl */
@@ -1723,7 +1723,7 @@ bigmul1_karatsuba(VALUE x, VALUE y)
t1 = yl; yl = yh; yh = t1;
}
bigadd_core(BDIGITS(yh), RBIGNUM_LEN(yh),
- BDIGITS(yl), RBIGNUM_LEN(yl),
+ BDIGITS(yl), RBIGNUM_LEN(yl),
BDIGITS(yh), RBIGNUM_LEN(yh));
}
else yh = xh;
View
@@ -34,7 +34,7 @@ iseq_special_block(rb_iseq_t *iseq, void *builder)
else {
iseq->cached_special_block_builder = (void *)1;
}
-
+
if (iseq->parent_iseq) {
parent = iseq->parent_iseq->self;
}
View
62 class.c
@@ -82,7 +82,7 @@ clone_method(ID mid, NODE *body, struct clone_method_data *data)
NODE *fbody = body->nd_body->nd_body;
if (nd_type(fbody) == RUBY_VM_METHOD_NODE) {
- fbody = NEW_NODE(RUBY_VM_METHOD_NODE, 0,
+ fbody = NEW_NODE(RUBY_VM_METHOD_NODE, 0,
rb_iseq_clone((VALUE)fbody->nd_body, data->klass),
0);
}
@@ -198,7 +198,7 @@ make_metametaclass(VALUE metaclass)
}
else {
metametaclass = rb_class_boot(Qnil);
- RBASIC(metametaclass)->klass =
+ RBASIC(metametaclass)->klass =
(RBASIC(RBASIC(metaclass)->klass)->klass == RBASIC(metaclass)->klass)
? make_metametaclass(RBASIC(metaclass)->klass)
: RBASIC(RBASIC(metaclass)->klass)->klass;
@@ -212,9 +212,9 @@ make_metametaclass(VALUE metaclass)
while (FL_TEST(super_of_metaclass, T_ICLASS)) {
super_of_metaclass = RCLASS_SUPER(super_of_metaclass);
}
- RCLASS_SUPER(metametaclass) =
+ RCLASS_SUPER(metametaclass) =
rb_iv_get(RBASIC(super_of_metaclass)->klass, "__attached__") == super_of_metaclass
- ? RBASIC(super_of_metaclass)->klass
+ ? RBASIC(super_of_metaclass)->klass
: make_metametaclass(super_of_metaclass);
OBJ_INFECT(metametaclass, RCLASS_SUPER(metametaclass));
@@ -422,7 +422,7 @@ rb_include_module(VALUE klass, VALUE module)
if (!OBJ_UNTRUSTED(klass)) {
rb_secure(4);
}
-
+
if (TYPE(module) != T_MODULE) {
Check_Type(module, T_MODULE);
}
@@ -461,16 +461,16 @@ rb_include_module(VALUE klass, VALUE module)
/*
* call-seq:
* mod.included_modules -> array
- *
+ *
* Returns the list of modules included in <i>mod</i>.
- *
+ *
* module Mixin
* end
- *
+ *
* module Outer
* include Mixin
* end
- *
+ *
* Mixin.included_modules #=> []
* Outer.included_modules #=> [Mixin]
*/
@@ -492,10 +492,10 @@ rb_mod_included_modules(VALUE mod)
/*
* call-seq:
* mod.include?(module) => true or false
- *
+ *
* Returns <code>true</code> if <i>module</i> is included in
* <i>mod</i> or one of <i>mod</i>'s ancestors.
- *
+ *
* module A
* end
* class B
@@ -525,15 +525,15 @@ rb_mod_include_p(VALUE mod, VALUE mod2)
/*
* call-seq:
* mod.ancestors -> array
- *
+ *
* Returns a list of modules included in <i>mod</i> (including
* <i>mod</i> itself).
- *
+ *
* module Mod
* include Math
* include Comparable
* end
- *
+ *
* Mod.ancestors #=> [Mod, Comparable, Math]
* Math.ancestors #=> [Math]
*/
@@ -612,7 +612,7 @@ method_entry(ID key, NODE *body, st_table *list)
if (key == ID_ALLOCATOR) {
return ST_CONTINUE;
}
-
+
if (!st_lookup(list, key, 0)) {
if (body ==0 || !body->nd_body->nd_body) {
type = -1; /* none */
@@ -658,14 +658,14 @@ class_instance_method_list(int argc, VALUE *argv, VALUE mod, int (*func) (ID, lo
/*
* call-seq:
* mod.instance_methods(include_super=true) => array
- *
+ *
* Returns an array containing the names of instance methods that is callable
* from outside in the receiver. For a module, these are the public methods;
* for a class, they are the instance (not singleton) methods. With no
* argument, or with an argument that is <code>false</code>, the
* instance methods in <i>mod</i> are returned, otherwise the methods
* in <i>mod</i> and <i>mod</i>'s superclasses are returned.
- *
+ *
* module A
* def method1() end
* end
@@ -675,7 +675,7 @@ class_instance_method_list(int argc, VALUE *argv, VALUE mod, int (*func) (ID, lo
* class C < B
* def method3() end
* end
- *
+ *
* A.instance_methods #=> [:method1]
* B.instance_methods(false) #=> [:method2]
* C.instance_methods(false) #=> [:method3]
@@ -691,7 +691,7 @@ rb_class_instance_methods(int argc, VALUE *argv, VALUE mod)
/*
* call-seq:
* mod.protected_instance_methods(include_super=true) => array
- *
+ *
* Returns a list of the protected instance methods defined in
* <i>mod</i>. If the optional parameter is not <code>false</code>, the
* methods of any ancestors are included.
@@ -706,11 +706,11 @@ rb_class_protected_instance_methods(int argc, VALUE *argv, VALUE mod)
/*
* call-seq:
* mod.private_instance_methods(include_super=true) => array
- *
+ *
* Returns a list of the private instance methods defined in
* <i>mod</i>. If the optional parameter is not <code>false</code>, the
* methods of any ancestors are included.
- *
+ *
* module Mod
* def method1() end
* private :method1
@@ -729,7 +729,7 @@ rb_class_private_instance_methods(int argc, VALUE *argv, VALUE mod)
/*
* call-seq:
* mod.public_instance_methods(include_super=true) => array
- *
+ *
* Returns a list of the public instance methods defined in <i>mod</i>.
* If the optional parameter is not <code>false</code>, the methods of
* any ancestors are included.
@@ -744,30 +744,30 @@ rb_class_public_instance_methods(int argc, VALUE *argv, VALUE mod)
/*
* call-seq:
* obj.singleton_methods(all=true) => array
- *
+ *
* Returns an array of the names of singleton methods for <i>obj</i>.
* If the optional <i>all</i> parameter is true, the list will include
* methods in modules included in <i>obj</i>.
- *
+ *
* module Other
* def three() end
* end
- *
+ *
* class Single
* def Single.four() end
* end
- *
+ *
* a = Single.new
- *
+ *
* def a.one()
* end
- *
+ *
* class << a
* include Other
* def two()
* end
* end
- *
+ *
* Single.singleton_methods #=> [:four]
* a.singleton_methods(false) #=> [:two, :one]
* a.singleton_methods #=> [:two, :one, :three]
@@ -932,7 +932,7 @@ rb_scan_args(int argc, const VALUE *argv, const char *fmt, ...)
postargc = *q - '0';
nonpostargc = argc - postargc;
}
- else {
+ else {
postargc = 0;
nonpostargc = argc;
}
@@ -941,7 +941,7 @@ rb_scan_args(int argc, const VALUE *argv, const char *fmt, ...)
if (nonpostargc < 0)
rb_raise(rb_eArgError, "wrong number of arguments (%d for %d)",
argc, postargc);
- goto rest_arg;
+ goto rest_arg;
}
else if (ISDIGIT(*p)) {
/* leading mandatory arguments */
View
@@ -50,7 +50,7 @@ cmp_failed(void)
/*
* call-seq:
* obj == other => true or false
- *
+ *
* Compares two objects based on the receiver's <code><=></code>
* method, returning true if it returns 0. Also returns true if
* _obj_ and _other_ are the same object.
@@ -70,7 +70,7 @@ cmp_equal(VALUE x, VALUE y)
/*
* call-seq:
* obj > other => true or false
- *
+ *
* Compares two objects based on the receiver's <code><=></code>
* method, returning true if it returns 1.
*/
@@ -87,7 +87,7 @@ cmp_gt(VALUE x, VALUE y)
/*
* call-seq:
* obj >= other => true or false
- *
+ *
* Compares two objects based on the receiver's <code><=></code>
* method, returning true if it returns 0 or 1.
*/
@@ -104,7 +104,7 @@ cmp_ge(VALUE x, VALUE y)
/*
* call-seq:
* obj < other => true or false
- *
+ *
* Compares two objects based on the receiver's <code><=></code>
* method, returning true if it returns -1.
*/
@@ -121,7 +121,7 @@ cmp_lt(VALUE x, VALUE y)
/*
* call-seq:
* obj <= other => true or false
- *
+ *
* Compares two objects based on the receiver's <code><=></code>
* method, returning true if it returns -1 or 0.
*/
@@ -138,16 +138,16 @@ cmp_le(VALUE x, VALUE y)
/*
* call-seq:
* obj.between?(min, max) => true or false
- *
+ *
* Returns <code>false</code> if <i>obj</i> <code><=></code>
* <i>min</i> is less than zero or if <i>anObject</i> <code><=></code>
* <i>max</i> is greater than zero, <code>true</code> otherwise.
- *
+ *
* 3.between?(1, 5) #=> true
* 6.between?(1, 5) #=> false
* 'cat'.between?('ant', 'dog') #=> true
* 'gnu'.between?('ant', 'dog') #=> false
- *
+ *
*/
static VALUE
@@ -167,7 +167,7 @@ cmp_between(VALUE x, VALUE min, VALUE max)
* <code><=></code> to implement the conventional comparison operators
* (<code><</code>, <code><=</code>, <code>==</code>, <code>>=</code>,
* and <code>></code>) and the method <code>between?</code>.
- *
+ *
* class SizeMatters
* include Comparable
* attr :str
@@ -181,18 +181,18 @@ cmp_between(VALUE x, VALUE min, VALUE max)
* @str
* end
* end
- *
+ *
* s1 = SizeMatters.new("Z")
* s2 = SizeMatters.new("YY")
* s3 = SizeMatters.new("XXX")
* s4 = SizeMatters.new("WWWW")
* s5 = SizeMatters.new("VVVVV")
- *
+ *
* s1 < s2 #=> true
* s4.between?(s1, s3) #=> false
* s4.between?(s3, s5) #=> true
* [ s3, s2, s5, s4, s1 ].sort #=> [Z, YY, XXX, WWWW, VVVVV]
- *
+ *
*/
void
View
@@ -3962,7 +3962,6 @@ iseq_compile_each(rb_iseq_t *iseq, LINK_ANCHOR *ret, NODE * node, int poped)
VALUE label;
VALUE label_sym;
-
CONST_ID(goto_id, "__goto__");
CONST_ID(label_id, "__label__");
Oops, something went wrong.

0 comments on commit 12d2c8b

Please sign in to comment.