File Manager

X7ROOT File Manager

Current Path: /opt/alt/ruby18/lib64/ruby/1.8

opt / alt / ruby18 / lib64 / ruby / 1.8 /

ðŸ“ ..
ðŸ“„ English.rb(5.6 KB)
ðŸ“„ Env.rb(274 B)
ðŸ“„ abbrev.rb(2.5 KB)
ðŸ“„ base64.rb(3.37 KB)
ðŸ“„ benchmark.rb(17.73 KB)
ðŸ“ bigdecimal
ðŸ“ cgi
ðŸ“„ cgi-lib.rb(6.89 KB)
ðŸ“„ cgi.rb(73.74 KB)
ðŸ“„ complex.rb(12.84 KB)
ðŸ“„ csv.rb(24.46 KB)
ðŸ“ date
ðŸ“„ date.rb(53.02 KB)
ðŸ“„ date2.rb(128 B)
ðŸ“„ debug.rb(20.61 KB)
ðŸ“„ delegate.rb(8.81 KB)
ðŸ“ digest
ðŸ“„ digest.rb(1.12 KB)
ðŸ“ dl
ðŸ“ drb
ðŸ“„ drb.rb(19 B)
ðŸ“„ e2mmap.rb(4.04 KB)
ðŸ“„ erb.rb(21.38 KB)
ðŸ“„ eregex.rb(487 B)
ðŸ“„ expect.rb(633 B)
ðŸ“„ fileutils.rb(42.23 KB)
ðŸ“„ finalize.rb(5.38 KB)
ðŸ“„ find.rb(1.84 KB)
ðŸ“„ forwardable.rb(6.16 KB)
ðŸ“„ ftools.rb(6.17 KB)
ðŸ“„ generator.rb(8.1 KB)
ðŸ“„ getoptlong.rb(14.88 KB)
ðŸ“„ getopts.rb(2.25 KB)
ðŸ“„ gserver.rb(6.43 KB)
ðŸ“„ importenv.rb(590 B)
ðŸ“ io
ðŸ“„ ipaddr.rb(21.96 KB)
ðŸ“ irb
ðŸ“„ irb.rb(7.43 KB)
ðŸ“„ jcode.rb(4.3 KB)
ðŸ“„ kconv.rb(8.12 KB)
ðŸ“„ logger.rb(17.59 KB)
ðŸ“„ mailread.rb(1.28 KB)
ðŸ“„ mathn.rb(5.42 KB)
ðŸ“„ matrix.rb(27.21 KB)
ðŸ“„ md5.rb(411 B)
ðŸ“„ mkmf.rb(50.65 KB)
ðŸ“„ monitor.rb(7.93 KB)
ðŸ“„ mutex_m.rb(2.07 KB)
ðŸ“ net
ðŸ“„ observer.rb(5.15 KB)
ðŸ“„ open-uri.rb(20.49 KB)
ðŸ“„ open3.rb(2.1 KB)
ðŸ“ openssl
ðŸ“„ openssl.rb(575 B)
ðŸ“ optparse
ðŸ“„ optparse.rb(47.12 KB)
ðŸ“„ ostruct.rb(3.35 KB)
ðŸ“„ parsearg.rb(1.55 KB)
ðŸ“„ parsedate.rb(1.33 KB)
ðŸ“„ pathname.rb(29.39 KB)
ðŸ“„ ping.rb(1.48 KB)
ðŸ“„ pp.rb(15.97 KB)
ðŸ“„ prettyprint.rb(18.33 KB)
ðŸ“„ profile.rb(90 B)
ðŸ“„ profiler.rb(1.59 KB)
ðŸ“„ pstore.rb(11.15 KB)
ðŸ“ racc
ðŸ“„ rational.rb(12.05 KB)
ðŸ“ rdoc
ðŸ“„ readbytes.rb(835 B)
ðŸ“„ resolv-replace.rb(1.55 KB)
ðŸ“„ resolv.rb(56.83 KB)
ðŸ“ rexml
ðŸ“ rinda
ðŸ“ rss
ðŸ“„ rss.rb(504 B)
ðŸ“„ rubyunit.rb(180 B)
ðŸ“ runit
ðŸ“„ scanf.rb(20.63 KB)
ðŸ“„ securerandom.rb(4.27 KB)
ðŸ“„ set.rb(27.08 KB)
ðŸ“„ sha1.rb(418 B)
ðŸ“ shell
ðŸ“„ shell.rb(4.66 KB)
ðŸ“„ shellwords.rb(3.99 KB)
ðŸ“„ singleton.rb(8.08 KB)
ðŸ“ soap
ðŸ“„ sync.rb(6.09 KB)
ðŸ“„ tempfile.rb(4.86 KB)
ðŸ“ test
ðŸ“„ thread.rb(104 B)
ðŸ“„ thwait.rb(4.32 KB)
ðŸ“„ time.rb(31.58 KB)
ðŸ“„ timeout.rb(3 KB)
ðŸ“„ tmpdir.rb(3.69 KB)
ðŸ“„ tracer.rb(2.73 KB)
ðŸ“„ tsort.rb(7.99 KB)
ðŸ“„ un.rb(4.54 KB)
ðŸ“ uri
ðŸ“„ uri.rb(710 B)
ðŸ“„ weakref.rb(2.68 KB)
ðŸ“ webrick
ðŸ“„ webrick.rb(811 B)
ðŸ“ wsdl
ðŸ“ x86_64-linux
ðŸ“ xmlrpc
ðŸ“ xsd
ðŸ“ yaml
ðŸ“„ yaml.rb(12.36 KB)

Editing: mathn.rb

#
#   mathn.rb - 
#   	$Release Version: 0.5 $
#   	$Revision: 1.1.1.1.4.1 $
#   	$Date: 1998/01/16 12:36:05 $
#   	by Keiju ISHITSUKA(SHL Japan Inc.)
#
# --
#
#   
#

require "complex.rb"
require "rational.rb"
require "matrix.rb"

class Integer

def gcd2(int)
    a = self.abs
    b = int.abs
    a, b = b, a if a < b
    
    pd_a = a.prime_division
    pd_b = b.prime_division
    
    gcd = 1
    for pair in pd_a
      as = pd_b.assoc(pair[0])
      if as
	gcd *= as[0] ** [as[1], pair[1]].min
      end
    end
    return gcd
  end
  
  def Integer.from_prime_division(pd)
    value = 1
    for prime, index in pd
      value *= prime**index
    end
    value
  end
  
  def prime_division
    raise ZeroDivisionError if self == 0
    ps = Prime.new
    value = self
    pv = []
    for prime in ps
      count = 0
      while (value1, mod = value.divmod(prime)
	     mod) == 0
	value = value1
	count += 1
      end
      if count != 0
	pv.push [prime, count]
      end
      break if prime * prime  >= value
    end
    if value > 1
      pv.push [value, 1]
    end
    return pv
  end
end
  
class Prime
  include Enumerable

def initialize
    @seed = 1
    @primes = []
    @counts = []
  end
  
  def succ
    i = -1
    size = @primes.size
    while i < size
      if i == -1
	@seed += 1
	i += 1
      else
	while @seed > @counts[i]
	  @counts[i] += @primes[i]
	end
	if @seed != @counts[i]
	  i += 1
	else
	  i = -1
	end
      end
    end
    @primes.push @seed
    @counts.push @seed + @seed
    return @seed
  end
  alias next succ

def each
    loop do
      yield succ
    end
  end
end

class Fixnum
  alias / quo
end

class Bignum
  alias / quo
end

class Rational
  Unify = true

def inspect
    format "%s/%s", numerator.inspect, denominator.inspect
  end

alias power! **

def ** (other)
    if other.kind_of?(Rational)
      other2 = other
      if self < 0
	return Complex.new!(self, 0) ** other
      elsif other == 0
	return Rational(1,1)
      elsif self == 0
	return Rational(0,1)
      elsif self == 1
	return Rational(1,1)
      end
      
      npd = numerator.prime_division
      dpd = denominator.prime_division
      if other < 0
	other = -other
	npd, dpd = dpd, npd
      end
      
      for elm in npd
	elm[1] = elm[1] * other
	if !elm[1].kind_of?(Integer) and elm[1].denominator != 1
         return Float(self) ** other2
	end
	elm[1] = elm[1].to_i
      end
      
      for elm in dpd
	elm[1] = elm[1] * other
	if !elm[1].kind_of?(Integer) and elm[1].denominator != 1
         return Float(self) ** other2
	end
	elm[1] = elm[1].to_i
      end
      
      num = Integer.from_prime_division(npd)
      den = Integer.from_prime_division(dpd)
      
      Rational(num,den)
      
    elsif other.kind_of?(Integer)
      if other > 0
	num = numerator ** other
	den = denominator ** other
      elsif other < 0
	num = denominator ** -other
	den = numerator ** -other
      elsif other == 0
	num = 1
	den = 1
      end
      Rational.new!(num, den)
    elsif other.kind_of?(Float)
      Float(self) ** other
    else
      x , y = other.coerce(self)
      x ** y
    end
  end

def power2(other)
    if other.kind_of?(Rational)
      if self < 0
	return Complex(self, 0) ** other
      elsif other == 0
	return Rational(1,1)
      elsif self == 0
	return Rational(0,1)
      elsif self == 1
	return Rational(1,1)
      end
      
      dem = nil
      x = self.denominator.to_f.to_i
      neard = self.denominator.to_f ** (1.0/other.denominator.to_f)
      loop do
	if (neard**other.denominator == self.denominator)
	  dem = neaed
	  break
	end
      end
      nearn = self.numerator.to_f ** (1.0/other.denominator.to_f)
      Rational(num,den)
      
    elsif other.kind_of?(Integer)
      if other > 0
	num = numerator ** other
	den = denominator ** other
      elsif other < 0
	num = denominator ** -other
	den = numerator ** -other
      elsif other == 0
	num = 1
	den = 1
      end
      Rational.new!(num, den)
    elsif other.kind_of?(Float)
      Float(self) ** other
    else
      x , y = other.coerce(self)
      x ** y
    end
  end
end

module Math
  def sqrt(a)
    if a.kind_of?(Complex)
      abs = sqrt(a.real*a.real + a.image*a.image)
#      if not abs.kind_of?(Rational)
#	return a**Rational(1,2)
#      end
      x = sqrt((a.real + abs)/Rational(2))
      y = sqrt((-a.real + abs)/Rational(2))
#      if !(x.kind_of?(Rational) and y.kind_of?(Rational))
#	return a**Rational(1,2)
#      end
      if a.image >= 0 
	Complex(x, y)
      else
	Complex(x, -y)
      end
    elsif a >= 0
      rsqrt(a)
    else
      Complex(0,rsqrt(-a))
    end
  end
  
  def rsqrt(a)
    if a.kind_of?(Float)
      sqrt!(a)
    elsif a.kind_of?(Rational)
      rsqrt(a.numerator)/rsqrt(a.denominator)
    else
      src = a
      max = 2 ** 32
      byte_a = [src & 0xffffffff]
      # ruby's bug
      while (src >= max) and (src >>= 32)
	byte_a.unshift src & 0xffffffff
      end
      
      answer = 0
      main = 0
      side = 0
      for elm in byte_a
	main = (main << 32) + elm
	side <<= 16
	if answer != 0
	  if main * 4  < side * side
	    applo = main.div(side)
	  else 
	    applo = ((sqrt!(side * side + 4 * main) - side)/2.0).to_i + 1
	  end
	else
	  applo = sqrt!(main).to_i + 1
	end
	
	while (x = (side + applo) * applo) > main
	  applo -= 1
	end
	main -= x
	answer = (answer << 16) + applo
	side += applo * 2
      end
      if main == 0
	answer
      else
	sqrt!(a)
      end
    end
  end

module_function :sqrt
  module_function :rsqrt
end

class Complex
  Unify = true
end

X7ROOT File Manager

Editing: mathn.rb

Upload File

Create Folder