rdx 0.9.0.pre → 0.9.0.pre.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/README +186 -12
- data/TODO +18 -0
- data/examples/minimal/.rdx +1 -0
- data/examples/minimal/rakefile +5 -2
- data/examples/ruby-2.0.0-p0/install/core/BUGS +70 -0
- data/examples/ruby-2.0.0-p0/install/core/HALL_OF_SHAME +53 -0
- data/examples/ruby-2.0.0-p0/install/core/README +14 -4
- data/examples/ruby-2.0.0-p0/install/core/Rakefile +9 -4
- data/examples/ruby-2.0.0-p0/install/core/TODO +5 -0
- data/examples/ruby-2.0.0-p0/install/core/diffs/array.c.diff +8 -7
- data/examples/ruby-2.0.0-p0/install/core/diffs/encoding.c.diff +1 -1
- data/examples/ruby-2.0.0-p0/install/core/diffs/enumerator.c.diff +4 -12
- data/examples/ruby-2.0.0-p0/install/core/diffs/eval.c.diff +3 -5
- data/examples/ruby-2.0.0-p0/install/core/diffs/file.c.diff +2 -2
- data/examples/ruby-2.0.0-p0/install/core/diffs/gc.c.diff +5 -4
- data/examples/ruby-2.0.0-p0/install/core/diffs/hash.c.diff +4 -3
- data/examples/ruby-2.0.0-p0/install/core/diffs/object.c.diff +5 -4
- data/examples/ruby-2.0.0-p0/install/core/diffs/proc.c.diff +7 -6
- data/examples/ruby-2.0.0-p0/install/core/diffs/random.c.diff +3 -3
- data/examples/ruby-2.0.0-p0/install/core/diffs/rational.c.diff +21 -18
- data/examples/ruby-2.0.0-p0/install/core/diffs/ruby.c.diff +1 -1
- data/examples/ruby-2.0.0-p0/install/stdlib/DOCUMENTATION +22 -0
- data/examples/ruby-2.0.0-p0/install/stdlib/README +12 -4
- data/examples/ruby-2.0.0-p0/install/stdlib/Rakefile +10 -5
- data/examples/ruby-2.0.0-p0/install/stdlib/TODO +6 -0
- data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/optparse.rb.diff +31 -11
- data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/uri/common.rb.diff +8 -7
- data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/weakref.rb.diff +2 -2
- data/lib/rdx.rb +42 -92
- data/lib/rdx/assertions.rb +8 -9
- data/lib/rdx/binding.rb +2 -2
- data/lib/rdx/comment.rb +7 -5
- data/lib/rdx/convention.rb +10 -9
- data/lib/rdx/directive.rb +51 -26
- data/lib/rdx/example.rb +94 -68
- data/lib/rdx/generator.rb +1 -1
- data/lib/rdx/generator/rdoc.rb +5 -6
- data/lib/rdx/options.rb +7 -3
- data/lib/rdx/reporter.rb +17 -0
- data/lib/rdx/ruby_lex.rb +3 -3
- data/lib/rdx/runner.rb +1 -1
- data/lib/rdx/statement.rb +1 -1
- data/lib/rdx/store.rb +1 -1
- data/lib/rdx/task.rb +1 -1
- data/lib/rdx/text.rb +1 -1
- data/lib/rdx/version.rb +1 -1
- data/rakefile +43 -14
- metadata +23 -3
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/array.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/array.c 2015-
|
2
|
+
+++ core/patched/array.c 2015-08-30 08:06:05 +0000
|
3
3
|
@@ -571,6 +571,7 @@
|
4
4
|
* Array.try_convert([1]) #=> [1]
|
5
5
|
* Array.try_convert("1") #=> nil
|
@@ -102,16 +102,17 @@
|
|
102
102
|
*
|
103
103
|
*/
|
104
104
|
|
105
|
-
@@ -5222,7 +5225,
|
105
|
+
@@ -5222,7 +5225,8 @@
|
106
106
|
*
|
107
107
|
* ary = Array.new #=> []
|
108
108
|
* Array.new(3) #=> [nil, nil, nil]
|
109
109
|
- * Array.new(3, true) #=> [0, 0, 0]
|
110
|
+
+ * :rdx: # Epic Fail!
|
110
111
|
+ * Array.new(3, true) #=> [true, true, true]
|
111
112
|
*
|
112
113
|
* Note that the second argument populates the array with references to the
|
113
114
|
* same object. Therefore, it is only recommended in cases when you need to
|
114
|
-
@@ -5242,8 +
|
115
|
+
@@ -5242,8 +5246,8 @@
|
115
116
|
*
|
116
117
|
* An array can also be created by using the Array() method, provided by
|
117
118
|
* Kernel, which calls #to_ary or #to_a on it's argument.
|
@@ -122,7 +123,7 @@
|
|
122
123
|
*
|
123
124
|
* == Example Usage
|
124
125
|
*
|
125
|
-
@@ -5275,8 +
|
126
|
+
@@ -5275,8 +5279,7 @@
|
126
127
|
* To raise an error for indices outside of the array bounds or else to
|
127
128
|
* provide a default value when that happens, you can use #fetch.
|
128
129
|
*
|
@@ -132,7 +133,7 @@
|
|
132
133
|
* arr.fetch(100, "oops") #=> "oops"
|
133
134
|
*
|
134
135
|
* The special methods #first and #last will return the first and last
|
135
|
-
@@ -5353,7 +
|
136
|
+
@@ -5353,7 +5356,8 @@
|
136
137
|
* To delete a particular element anywhere in an array, use #delete:
|
137
138
|
*
|
138
139
|
* arr = [1, 2, 2, 3]
|
@@ -142,7 +143,7 @@
|
|
142
143
|
*
|
143
144
|
* A useful method if you need to remove +nil+ values from an array is
|
144
145
|
* #compact:
|
145
|
-
@@ -5381,9 +
|
146
|
+
@@ -5381,9 +5385,9 @@
|
146
147
|
* Note that this operation leaves the array unchanged.
|
147
148
|
*
|
148
149
|
* arr = [1, 2, 3, 4, 5]
|
@@ -155,7 +156,7 @@
|
|
155
156
|
*
|
156
157
|
* Another sometimes useful iterator is #reverse_each which will iterate over
|
157
158
|
* the elements in the array in reverse order.
|
158
|
-
@@ -5413,7 +
|
159
|
+
@@ -5413,7 +5417,7 @@
|
159
160
|
*
|
160
161
|
* arr = [1, 2, 3, 4, 5, 6]
|
161
162
|
* arr.select { |a| a > 3 } #=> [4, 5, 6]
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/enumerator.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/enumerator.c 2015-
|
2
|
+
+++ core/patched/enumerator.c 2015-08-30 07:34:33 +0000
|
3
3
|
@@ -26,51 +26,80 @@
|
4
4
|
* - Kernel#enum_for
|
5
5
|
* - Enumerator.new
|
@@ -401,15 +401,7 @@
|
|
401
401
|
*
|
402
402
|
* def pythagorean_triples
|
403
403
|
* (1..Float::INFINITY).lazy.flat_map {|z|
|
404
|
-
@@ -
|
405
|
-
* }
|
406
|
-
* }
|
407
|
-
* end
|
408
|
-
+ *
|
409
|
-
* # show first ten pythagorean triples
|
410
|
-
* p pythagorean_triples.take(10).force # take is lazy, so force is needed
|
411
|
-
* p pythagorean_triples.first(10) # first is eager
|
412
|
-
@@ -1400,12 +1458,31 @@
|
404
|
+
@@ -1400,12 +1457,31 @@
|
413
405
|
* naturally remain lazy if called from a lazy enumerator.
|
414
406
|
*
|
415
407
|
* For example, continuing from the example in Kernel#to_enum:
|
@@ -443,7 +435,7 @@
|
|
443
435
|
* # works naturally on lazy enumerator:
|
444
436
|
* r.lazy.repeat(2).class # => Enumerator::Lazy
|
445
437
|
* r.lazy.repeat(2).map{|n| n ** 2}.first(5) # => [1, 1, 4, 4, 9]
|
446
|
-
@@ -1511,9 +
|
438
|
+
@@ -1511,9 +1587,9 @@
|
447
439
|
* A value <i>x</i> returned by <i>block</i> is decomposed if either of
|
448
440
|
* the following conditions is true:
|
449
441
|
*
|
@@ -456,7 +448,7 @@
|
|
456
448
|
*
|
457
449
|
* Otherwise, <i>x</i> is contained as-is in the return value.
|
458
450
|
*
|
459
|
-
@@ -1888,15 +
|
451
|
+
@@ -1888,15 +1964,15 @@
|
460
452
|
*
|
461
453
|
* e = o.to_enum
|
462
454
|
*
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/eval.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/eval.c 2015-
|
2
|
+
+++ core/patched/eval.c 2015-08-30 07:36:03 +0000
|
3
3
|
@@ -321,13 +321,13 @@
|
4
4
|
*
|
5
5
|
* Returns the list of +Modules+ nested at the point of call.
|
@@ -18,13 +18,11 @@
|
|
18
18
|
*/
|
19
19
|
|
20
20
|
static VALUE
|
21
|
-
@@ -
|
22
|
-
* This list includes the names of all modules and classes
|
21
|
+
@@ -358,13 +358,11 @@
|
23
22
|
* defined in the global scope.
|
24
23
|
*
|
25
|
-
|
24
|
+
* Module.constants.first(4)
|
26
25
|
- * # => [:ARGF, :ARGV, :ArgumentError, :Array]
|
27
|
-
+ * Module.constants.sort.first(4)
|
28
26
|
+ * # -> [:ARGF, :ARGV, :ArgumentError, :Array]
|
29
27
|
*
|
30
28
|
* Module.constants.include?(:SEEK_SET) # => false
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/file.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/file.c 2015-
|
2
|
+
+++ core/patched/file.c 2015-08-30 07:36:59 +0000
|
3
3
|
@@ -267,7 +267,10 @@
|
4
4
|
* not normalize the name.
|
5
5
|
*
|
@@ -161,7 +161,7 @@
|
|
161
161
|
* support this feature.
|
162
162
|
*
|
163
163
|
- * File.stat("testfile").blocks #=> 2
|
164
|
-
+ * File.stat("testfile").blocks
|
164
|
+
+ * File.stat("testfile").blocks #-> 2
|
165
165
|
*/
|
166
166
|
|
167
167
|
static VALUE
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/gc.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/gc.c 2015-
|
2
|
+
+++ core/patched/gc.c 2015-08-30 09:39:26 +0000
|
3
3
|
@@ -1221,10 +1221,12 @@
|
4
4
|
* a = 102.7
|
5
5
|
* b = 95 # Won't be returned
|
@@ -154,7 +154,7 @@
|
|
154
154
|
* collection.
|
155
155
|
- *
|
156
156
|
+ *
|
157
|
-
+ * :rdx: bug on x64-mingw32 seems that the last object defined (c) isn't
|
157
|
+
+ * :rdx: bug on x64-mingw32 seems that the last object defined (c) isn't garbaged in this cycle...
|
158
158
|
+ * :rdx: indicative_numbers
|
159
159
|
* include ObjectSpace
|
160
160
|
*
|
@@ -184,10 +184,11 @@
|
|
184
184
|
*
|
185
185
|
*/
|
186
186
|
|
187
|
-
@@ -
|
187
|
+
@@ -4454,7 +4473,8 @@
|
188
|
+
* length and object space size.
|
188
189
|
*
|
189
190
|
* Example:
|
190
|
-
|
191
|
+
- *
|
191
192
|
+ * :rdx: discard_output
|
192
193
|
+ *
|
193
194
|
* GC::Profiler.enable
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/hash.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/hash.c 2015-
|
2
|
+
+++ core/patched/hash.c 2015-08-30 07:39:56 +0000
|
3
3
|
@@ -604,13 +604,7 @@
|
4
4
|
* is not found and a default value is not supplied.
|
5
5
|
*
|
@@ -52,16 +52,17 @@
|
|
52
52
|
*
|
53
53
|
*/
|
54
54
|
static VALUE
|
55
|
-
@@ -3347,7 +3348,
|
55
|
+
@@ -3347,7 +3348,8 @@
|
56
56
|
*
|
57
57
|
* Accessing a value in a Hash requires using its key:
|
58
58
|
*
|
59
59
|
- * puts grades["Jane Doe"] # => 10
|
60
|
+
+ * :rdx: # Epic Fail!
|
60
61
|
+ * grades["Jane Doe"] # => 0
|
61
62
|
*
|
62
63
|
* === Common Uses
|
63
64
|
*
|
64
|
-
@@ -3362,13 +
|
65
|
+
@@ -3362,13 +3364,15 @@
|
65
66
|
* argument on a method call, no braces are needed, thus creating a really
|
66
67
|
* clean interface:
|
67
68
|
*
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/object.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/object.c 2015-
|
2
|
+
+++ core/patched/object.c 2015-08-30 07:46:24 +0000
|
3
3
|
@@ -88,9 +88,9 @@
|
4
4
|
* obj = "a"
|
5
5
|
* other = obj.dup
|
@@ -233,11 +233,12 @@
|
|
233
233
|
* Integer("0930", 10) #=> 930
|
234
234
|
* Integer("111", 2) #=> 7
|
235
235
|
*/
|
236
|
-
@@ -2784,9 +2788,
|
236
|
+
@@ -2784,9 +2788,10 @@
|
237
237
|
* <i>arg</i> is <tt>nil</tt> or <tt>[]</tt>.
|
238
238
|
*
|
239
239
|
* Hash([]) #=> {}
|
240
240
|
- * Hash(nil) #=> nil
|
241
|
+
+ * :rdx: # Epic Fail!
|
241
242
|
+ * Hash(nil) #=> {}
|
242
243
|
* Hash(key: :value) #=> {:key => :value}
|
243
244
|
- * Hash([1, 2, 3]) #=> TypeError
|
@@ -245,7 +246,7 @@
|
|
245
246
|
*/
|
246
247
|
|
247
248
|
static VALUE
|
248
|
-
@@ -2815,20 +
|
249
|
+
@@ -2815,20 +2820,33 @@
|
249
250
|
* This can be demonstrated by overriding <code>new</code> in
|
250
251
|
* <code>Class</code>:
|
251
252
|
*
|
@@ -284,7 +285,7 @@
|
|
284
285
|
*
|
285
286
|
* <em>produces:</em>
|
286
287
|
*
|
287
|
-
@@ -2838,6 +
|
288
|
+
@@ -2838,6 +2856,8 @@
|
288
289
|
* that follows, the vertical arrows represent inheritance, and the
|
289
290
|
* parentheses meta-classes. All metaclasses are instances
|
290
291
|
* of the class `Class'.
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/proc.c 2015-06-11 07:51:43 +0000
|
2
|
-
+++ core/patched/proc.c 2015-
|
2
|
+
+++ core/patched/proc.c 2015-08-30 07:47:34 +0000
|
3
3
|
@@ -147,9 +147,9 @@
|
4
4
|
*
|
5
5
|
* A Proc object generated by +lambda+ doesn't have such tricks.
|
@@ -54,16 +54,17 @@
|
|
54
54
|
*
|
55
55
|
*/
|
56
56
|
|
57
|
-
@@ -649,7 +647,
|
57
|
+
@@ -649,7 +647,8 @@
|
58
58
|
*
|
59
59
|
* proc { |x = 0| }.arity #=> 0
|
60
60
|
* lambda { |a = 0| }.arity #=> -1
|
61
61
|
- * proc { |x=0, y| }.arity #=> 0
|
62
|
+
+ * :rdx: # Epic Fail!
|
62
63
|
+ * proc { |x=0, y| }.arity #=> 1
|
63
64
|
* lambda { |x=0, y| }.arity #=> -2
|
64
65
|
* proc { |x=0, y=0| }.arity #=> 0
|
65
66
|
* lambda { |x=0, y=0| }.arity #=> -1
|
66
|
-
@@ -1434,7 +
|
67
|
+
@@ -1434,7 +1433,7 @@
|
67
68
|
* A.define_singleton_method(:who_am_i) do
|
68
69
|
* "I am: #{class_name}"
|
69
70
|
* end
|
@@ -72,7 +73,7 @@
|
|
72
73
|
*
|
73
74
|
* guy = "Bob"
|
74
75
|
* guy.define_singleton_method(:hello) { "#{self}: Hello there!" }
|
75
|
-
@@ -1635,15 +
|
76
|
+
@@ -1635,15 +1634,12 @@
|
76
77
|
* bm.call
|
77
78
|
* bm = um.bind(B.new)
|
78
79
|
* bm.call
|
@@ -89,7 +90,7 @@
|
|
89
90
|
*/
|
90
91
|
|
91
92
|
static VALUE
|
92
|
-
@@ -2043,7 +
|
93
|
+
@@ -2043,7 +2039,7 @@
|
93
94
|
}
|
94
95
|
|
95
96
|
/*
|
@@ -98,7 +99,7 @@
|
|
98
99
|
* local_jump_error.exit_value -> obj
|
99
100
|
*
|
100
101
|
* Returns the exit value associated with this +LocalJumpError+.
|
101
|
-
@@ -2167,34 +
|
102
|
+
@@ -2167,34 +2163,34 @@
|
102
103
|
* takes the rest of arguments.
|
103
104
|
*
|
104
105
|
* b = proc {|x, y, z| (x||0) + (y||0) + (z||0) }
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/random.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/random.c 2015-
|
2
|
+
+++ core/patched/random.c 2015-08-30 07:48:11 +0000
|
3
3
|
@@ -563,7 +563,7 @@
|
4
4
|
* Returns an arbitrary seed value. This is used by Random.new
|
5
5
|
* when no seed value is specified as an argument.
|
@@ -14,11 +14,11 @@
|
|
14
14
|
* prng1 = Random.new(1234)
|
15
15
|
* prng1.seed #=> 1234
|
16
16
|
- * prng1.rand(100) #=> 47
|
17
|
-
+ *
|
17
|
+
+ * rand1 = prng1.rand(100) #-> 47
|
18
18
|
*
|
19
19
|
* prng2 = Random.new(prng1.seed)
|
20
20
|
- * prng2.rand(100) #=> 47
|
21
|
-
+ * prng2.rand(100) #=>
|
21
|
+
+ * prng2.rand(100) #=> rand1 # 47
|
22
22
|
*/
|
23
23
|
static VALUE
|
24
24
|
random_get_seed(VALUE obj)
|
@@ -1,5 +1,5 @@
|
|
1
1
|
--- core/orig/rational.c 2015-06-11 07:51:44 +0000
|
2
|
-
+++ core/patched/rational.c 2015-
|
2
|
+
+++ core/patched/rational.c 2015-08-30 07:59:16 +0000
|
3
3
|
@@ -569,8 +569,8 @@
|
4
4
|
*
|
5
5
|
* Returns x/y;
|
@@ -27,7 +27,7 @@
|
|
27
27
|
* rat.numerator.gcd(rat.denominator) #=> 1
|
28
28
|
*/
|
29
29
|
static VALUE
|
30
|
-
@@ -706,10 +715,
|
30
|
+
@@ -706,10 +715,11 @@
|
31
31
|
*
|
32
32
|
* Performs addition.
|
33
33
|
*
|
@@ -36,13 +36,14 @@
|
|
36
36
|
- * Rational(-2, 9) + Rational(-9, 2) #=> (-85/18)
|
37
37
|
- * Rational(9, 8) + 4 #=> (41/8)
|
38
38
|
+ * Rational(2, 3) + Rational(2, 3) #=> 4/3
|
39
|
+
+ * :rdx: # Epic Fail!
|
39
40
|
+ * Rational(900) + Rational(1) #=> 901/1
|
40
41
|
+ * Rational(-2, 9) + Rational(-9, 2) #=> -85/18
|
41
42
|
+ * Rational(9, 8) + 4 #=> 41/8
|
42
43
|
* Rational(20, 9) + 9.8 #=> 12.022222222222222
|
43
44
|
*/
|
44
45
|
static VALUE
|
45
|
-
@@ -746,10 +
|
46
|
+
@@ -746,10 +756,11 @@
|
46
47
|
*
|
47
48
|
* Performs subtraction.
|
48
49
|
*
|
@@ -53,11 +54,12 @@
|
|
53
54
|
+ * Rational(2, 3) - Rational(2, 3) #=> 0/1
|
54
55
|
+ * Rational(900) - Rational(1) #=> 899/1
|
55
56
|
+ * Rational(-2, 9) - Rational(-9, 2) #=> 77/18
|
57
|
+
+ * :rdx: # Epic Fail!
|
56
58
|
+ * Rational(9, 8) - 4 #=> -23/8
|
57
59
|
* Rational(20, 9) - 9.8 #=> -7.577777777777778
|
58
60
|
*/
|
59
61
|
static VALUE
|
60
|
-
@@ -825,10 +
|
62
|
+
@@ -825,10 +836,10 @@
|
61
63
|
*
|
62
64
|
* Performs multiplication.
|
63
65
|
*
|
@@ -72,7 +74,7 @@
|
|
72
74
|
* Rational(20, 9) * 9.8 #=> 21.77777777777778
|
73
75
|
*/
|
74
76
|
static VALUE
|
75
|
-
@@ -866,10 +
|
77
|
+
@@ -866,10 +877,10 @@
|
76
78
|
*
|
77
79
|
* Performs division.
|
78
80
|
*
|
@@ -87,7 +89,7 @@
|
|
87
89
|
* Rational(20, 9) / 9.8 #=> 0.22675736961451246
|
88
90
|
*/
|
89
91
|
static VALUE
|
90
|
-
@@ -952,11 +
|
92
|
+
@@ -952,11 +963,11 @@
|
91
93
|
*
|
92
94
|
* Performs exponentiation.
|
93
95
|
*
|
@@ -103,7 +105,7 @@
|
|
103
105
|
* Rational(1, 2) ** 0.0 #=> 1.0
|
104
106
|
*/
|
105
107
|
static VALUE
|
106
|
-
@@ -1198,8 +
|
108
|
+
@@ -1198,8 +1209,7 @@
|
107
109
|
*
|
108
110
|
* Returns the truncated value as an integer.
|
109
111
|
*
|
@@ -113,12 +115,13 @@
|
|
113
115
|
*
|
114
116
|
* Rational(2, 3).to_i #=> 0
|
115
117
|
* Rational(3).to_i #=> 3
|
116
|
-
@@ -1281,12 +
|
118
|
+
@@ -1281,12 +1291,14 @@
|
117
119
|
*
|
118
120
|
* Rational(3).floor #=> 3
|
119
121
|
* Rational(2, 3).floor #=> 0
|
120
122
|
- * Rational(-3, 2).floor #=> -1
|
121
123
|
- *
|
124
|
+
+ * :rdx: # Epic Fail!
|
122
125
|
+ * Rational(-3, 2).floor #=> -2
|
123
126
|
+ *
|
124
127
|
+ * :rdx: off -
|
@@ -130,7 +133,7 @@
|
|
130
133
|
* '%f' % Rational('-123.456').floor(+1) #=> "-123.500000"
|
131
134
|
* '%f' % Rational('-123.456').floor(-1) #=> "-130.000000"
|
132
135
|
*/
|
133
|
-
@@ -1307,10 +
|
136
|
+
@@ -1307,10 +1319,11 @@
|
134
137
|
* Rational(2, 3).ceil #=> 1
|
135
138
|
* Rational(-3, 2).ceil #=> -1
|
136
139
|
*
|
@@ -143,7 +146,7 @@
|
|
143
146
|
* '%f' % Rational('-123.456').ceil(+1) #=> "-123.400000"
|
144
147
|
* '%f' % Rational('-123.456').ceil(-1) #=> "-120.000000"
|
145
148
|
*/
|
146
|
-
@@ -1331,10 +
|
149
|
+
@@ -1331,10 +1344,11 @@
|
147
150
|
* Rational(2, 3).truncate #=> 0
|
148
151
|
* Rational(-3, 2).truncate #=> -1
|
149
152
|
*
|
@@ -156,7 +159,7 @@
|
|
156
159
|
* '%f' % Rational('-123.456').truncate(+1) #=> "-123.400000"
|
157
160
|
* '%f' % Rational('-123.456').truncate(-1) #=> "-120.000000"
|
158
161
|
*/
|
159
|
-
@@ -1356,10 +
|
162
|
+
@@ -1356,10 +1370,11 @@
|
160
163
|
* Rational(2, 3).round #=> 1
|
161
164
|
* Rational(-3, 2).round #=> -2
|
162
165
|
*
|
@@ -169,7 +172,7 @@
|
|
169
172
|
* '%f' % Rational('-123.456').round(+1) #=> "-123.500000"
|
170
173
|
* '%f' % Rational('-123.456').round(-1) #=> "-120.000000"
|
171
174
|
*/
|
172
|
-
@@ -1393,8 +
|
175
|
+
@@ -1393,8 +1408,8 @@
|
173
176
|
*
|
174
177
|
* Returns self.
|
175
178
|
*
|
@@ -180,7 +183,7 @@
|
|
180
183
|
*/
|
181
184
|
static VALUE
|
182
185
|
nurat_to_r(VALUE self)
|
183
|
-
@@ -1508,9 +
|
186
|
+
@@ -1508,9 +1523,9 @@
|
184
187
|
* otherwise.
|
185
188
|
*
|
186
189
|
* r = Rational(5033165, 16777216)
|
@@ -193,7 +196,7 @@
|
|
193
196
|
*/
|
194
197
|
static VALUE
|
195
198
|
nurat_rationalize(int argc, VALUE *argv, VALUE self)
|
196
|
-
@@ -1863,8 +
|
199
|
+
@@ -1863,8 +1878,8 @@
|
197
200
|
*
|
198
201
|
* Returns the value as a rational.
|
199
202
|
*
|
@@ -204,7 +207,7 @@
|
|
204
207
|
*/
|
205
208
|
static VALUE
|
206
209
|
integer_to_r(VALUE self)
|
207
|
-
@@ -1922,10 +
|
210
|
+
@@ -1922,10 +1937,10 @@
|
208
211
|
* NOTE: 0.3.to_r isn't the same as '0.3'.to_r. The latter is
|
209
212
|
* equivalent to '3/10'.to_r, but the former isn't so.
|
210
213
|
*
|
@@ -219,7 +222,7 @@
|
|
219
222
|
*
|
220
223
|
* See rationalize.
|
221
224
|
*/
|
222
|
-
@@ -1959,9 +
|
225
|
+
@@ -1959,9 +1974,9 @@
|
223
226
|
* <= flt+|eps|). if the optional eps is not given, it will be chosen
|
224
227
|
* automatically.
|
225
228
|
*
|
@@ -232,7 +235,7 @@
|
|
232
235
|
*
|
233
236
|
* See to_r.
|
234
237
|
*/
|
235
|
-
@@ -2246,14 +
|
238
|
+
@@ -2246,14 +2261,14 @@
|
236
239
|
* NOTE: '0.3'.to_r isn't the same as 0.3.to_r. The former is
|
237
240
|
* equivalent to '3/10'.to_r, but the latter isn't so.
|
238
241
|
*
|
@@ -255,7 +258,7 @@
|
|
255
258
|
*/
|
256
259
|
static VALUE
|
257
260
|
string_to_r(VALUE self)
|
258
|
-
@@ -2376,37 +
|
261
|
+
@@ -2376,37 +2391,39 @@
|
259
262
|
* In ruby, you can create rational object with Rational, to_r or
|
260
263
|
* rationalize method. The return values will be irreducible.
|
261
264
|
*
|