mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
* lib/webrick/httpservlet/cgihandler.rb (WEBrick::HTTPServlet::CGIHandler):
qualify the access for Config constant. [ruby-dev:28338] * lib/resolv.rb (Resolv::DNS::Resource::IN::A): qualify ClassValue. [ruby-dev:28338] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@9962 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
parent
a6c936c15b
commit
f816b8b167
4 changed files with 33 additions and 42 deletions
|
@ -435,42 +435,16 @@ class Integer
|
|||
# The result is positive, no matter the sign of the arguments.
|
||||
#
|
||||
def gcd(n)
|
||||
m = self.abs
|
||||
n = n.abs
|
||||
|
||||
return n if m == 0
|
||||
return m if n == 0
|
||||
|
||||
b = 0
|
||||
while n[0] == 0 && m[0] == 0
|
||||
b += 1; n >>= 1; m >>= 1
|
||||
min = self.abs
|
||||
max = other.abs
|
||||
while min > 0
|
||||
tmp = min
|
||||
min = max % min
|
||||
max = tmp
|
||||
end
|
||||
m >>= 1 while m[0] == 0
|
||||
n >>= 1 while n[0] == 0
|
||||
while m != n
|
||||
m, n = n, m if n > m
|
||||
m -= n; m >>= 1 while m[0] == 0
|
||||
end
|
||||
m << b
|
||||
max
|
||||
end
|
||||
|
||||
def gcd2(int)
|
||||
a = self.abs
|
||||
b = int.abs
|
||||
|
||||
a, b = b, a if a < b
|
||||
|
||||
while b != 0
|
||||
void, a = a.divmod(b)
|
||||
a, b = b, a
|
||||
end
|
||||
return a
|
||||
end
|
||||
|
||||
#
|
||||
# Returns the <em>lowest common multiple</em> (LCM) of the two arguments
|
||||
# (+self+ and +other+).
|
||||
#
|
||||
# Examples:
|
||||
# 6.lcm 7 # -> 42
|
||||
# 6.lcm 9 # -> 18
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue