-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreal.rb
More file actions
223 lines (200 loc) · 5.48 KB
/
real.rb
File metadata and controls
223 lines (200 loc) · 5.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
class Real
attr :exp, :mant
def initialize(exp, mant)
@exp = exp
@mant = mant
end
def inspect
"#{'R'}(2^#{exp} * #{mant.take(20).map{|d| d.negative? ? (-d).to_s.overline : d.to_s }.join('')} = #{to_f})"
end
def to_f
e = exp - 1
m = 0
s = 0
i = 0
mant.each do |d|
if s.zero?
if d.zero?
e -= 1
break if e < Float::MIN_EXP
else
s = d
end
else
m = (m << 1) + d*s
i += 1
break if i > Float::MANT_BITS # one extra bit for rounding
end
end
if s.zero?
0.0
else
Float.encode(s < 0, m.odd? ? (m >> 1) + 1 : m >> 1, e)
end
end
def coerce(x)
return Real[x], self
end
def -@
Real.new(exp, mant.transform{|d| -d })
end
def pred
end
def succ
end
def +(x)
a = self
b = Real[x]
a,b = b,a if a.exp < b.exp
Real.digits(a.exp + 1) do |y|
ea = a.mant.each
eb = b.mant.each
(b.exp - a.exp - 1).times do
y << ea.next
end
d = 0
loop do
d += ea.next + eb.next
if d >= 2
y << 1
d -= 2
elsif d <= -2
y << -1
d += 2
else
y << 0
end
d *= 2
end
end
end
class << self
def zero
new(0, Enumerable.cycle(0))
end
def digits(exp=0, seq=nil, &block)
new(exp, (seq || Enumerable.generate(&block)).concat(Enumerable.cycle(0)))
end
def comparable(value, exp=nil)
if exp
upper = 2**exp
lower = -upper
else
case value <=> 0
when -1
upper = 0
lower = -1
exp = 0
while (value <=> lower) == -1
lower *= 2
exp += 1
end
when 1
lower = 0
upper = 1
exp = 0
while (value <=> upper) == 1
upper *= 2
exp += 1
end
else
return zero
end
end
digits(exp) do |out|
probe = 0
loop do
case value <=> probe
when -1
out << -1
upper = probe
probe = (probe + lower) / 2
when 1
out << 1
lower = probe
probe = (probe + upper) / 2
else
break
end
end
end
end
def [](x)
x.is_a? Real and return x
x.is_a? Numeric or raise ArgumentError, "#{x} is not a number"
x.zero? and return zero
if x.is_a? Float
s, m, e = x.float_decode
s = s ? -1 : 1
p = 0
Float::MANT_BITS.times do
p <<= 1
p |= m & 1
m >>= 1
end
p <<= 1
p |= 1
digits(e+1) do |y|
q = p
until q.zero?
y << (q.odd? ? s : 0)
q >>= 1
end
end
elsif x.integer?
s = if x.negative?
x = -x
-1
else
1
end
e = 0
p = 0
until x.zero?
e += 1
p <<= 1
p |= x & 1
x >>= 1
end
digits(e) do |y|
q = p
until q.zero?
y << (q.odd? ? s : 0)
q >>= 1
end
end
elsif x.rational?
s = if x.negative?
x = -x
-1
else
1
end
e = 1
while x < 1
e -= 1
x *= 2
end
while 2 < x
e += 1
x /= 2
end
digits(e) do |y|
u = x.numerator
v = x.denominator
until u.zero?
if u < v
y << 0
else
y << s
u -= v
end
u *= 2
end
end
else
raise ArgumentError, "Don't know how to calculate binary digits for #{x.class}"
end
end
end
end