rubysl-mathn 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 467e937606c8e419d779633cb724dd5327bfeeff
+  data.tar.gz: 1bcc431f67bb1a5581d5574aa816a7a58eea7971
+SHA512:
+  metadata.gz: d3d2f5ab89cab030c46699a7500a816980b5742b6148bb50c63c74cd4cf9bff608e4f520dcd416dd0a1f285251325ece2b646e81675d34447099b29e41ff2d22
+  data.tar.gz: 7f4f2d6254a66cdb96c398e8800f11d7da0440680ce5dce5591874cf27d9edef8be03a73182696e0464c9082cb9a3575298b4d62dc86189ecab6715146391f9f

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/.travis.yml

@@ -0,0 +1,8 @@
+language: ruby
+before_install:
+  - gem update --system
+  - gem --version
+  - gem install rubysl-bundler
+script: bundle exec mspec spec
+rvm:
+  - rbx-nightly-18mode

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in rubysl-mathn.gemspec
+gemspec

data/LICENSE

@@ -0,0 +1,25 @@
+Copyright (c) 2013, Brian Shirai
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+3. Neither the name of the library nor the names of its contributors may be
+   used to endorse or promote products derived from this software without
+   specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY DIRECT,
+INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
+OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/README.md

@@ -0,0 +1,29 @@
+# Rubysl::Mathn
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'rubysl-mathn'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install rubysl-mathn
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/lib/mathn.rb

@@ -0,0 +1 @@
+require "rubysl/mathn"

data/lib/rubysl/mathn.rb

@@ -0,0 +1,2 @@
+require "rubysl/mathn/mathn"
+require "rubysl/mathn/version"

data/lib/rubysl/mathn/mathn.rb

@@ -0,0 +1,313 @@
+#
+#   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
+    if value < 0
+      value = -value
+      pv = [[-1, 1]]
+    else
+      pv = []
+    end
+    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
+

data/lib/rubysl/mathn/version.rb

@@ -0,0 +1,5 @@
+module RubySL
+  module Mathn
+    VERSION = "1.0.0"
+  end
+end

data/rubysl-mathn.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+require './lib/rubysl/mathn/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "rubysl-mathn"
+  spec.version       = RubySL::Mathn::VERSION
+  spec.authors       = ["Brian Shirai"]
+  spec.email         = ["brixen@gmail.com"]
+  spec.description   = %q{Ruby standard library mathn.}
+  spec.summary       = %q{Ruby standard library mathn.}
+  spec.homepage      = "https://github.com/rubysl/rubysl-mathn"
+  spec.license       = "BSD"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "mspec", "~> 1.5"
+  spec.add_development_dependency "rubysl-prettyprint", "~> 1.0"
+end

data/spec/bignum/exponent_spec.rb

@@ -0,0 +1,19 @@
+require 'mathn'
+
+describe "Bignum#**" do
+  before(:each) do
+    @bignum = bignum_value(47)
+  end
+
+  it "returns self raised to other (positive) power" do
+    (@bignum ** 4).should == 7237005577332262361485077344629993318496048279512298547155833600056910050625
+    (@bignum ** 1.2).should be_close(57262152889751597425762.57804, TOLERANCE)
+  end
+
+  ruby_version_is '1.9' do
+    it "returns a complex number when negative and raised to a fractional power" do
+      ((-@bignum) ** (1/3)).should be_close(Complex(1048576,1816186.907597341), TOLERANCE)
+      ((-@bignum) ** (1.0/3)).should be_close(Complex(1048576,1816186.907597341), TOLERANCE)
+    end
+  end
+end

data/spec/complex/Complex_spec.rb

@@ -0,0 +1,12 @@
+require 'mathn'
+
+ruby_version_is '1.9' do
+  describe "Kernel#Complex" do
+    it "returns an Integer if imaginary part is 0" do
+      Complex(42,0).should == 42
+      Complex(42,0).should be_kind_of(Fixnum)
+      Complex(bignum_value,0).should == bignum_value
+      Complex(bignum_value,0).should be_kind_of(Bignum)
+    end
+  end
+end

data/spec/fixnum/exponent_spec.rb

@@ -0,0 +1,15 @@
+require 'mathn'
+
+describe "Fixnum#**" do
+  it "returns self raised to other (positive) power" do
+    (2 ** 4).should == 16
+    (2 ** 1.2).should be_close(2.2973967, TOLERANCE)
+  end
+
+  ruby_version_is '1.9' do
+    it "returns a complex number when negative and raised to a fractional power" do
+      ((-8) ** (1/3)).should be_close(Complex(1, 1.73205), TOLERANCE)
+      ((-8) ** (1.0/3)).should be_close(Complex(1, 1.73205), TOLERANCE)
+    end
+  end
+end

data/spec/float/exponent_spec.rb

@@ -0,0 +1,15 @@
+require 'mathn'
+
+describe "Float#**" do
+  it "returns self raised to other (positive) power" do
+    (2.0 ** 4).should == 16.0
+    (2.0 ** 1.2).should be_close(2.2973967, TOLERANCE)
+  end
+
+  ruby_version_is '1.9' do
+    it "returns a complex number when negative and raised to a fractional power" do
+      ((-8.0) ** (1/3)).should be_close(Complex(1, 1.73205), TOLERANCE)
+      ((-8.0) ** (1.0/3)).should be_close(Complex(1, 1.73205), TOLERANCE)
+    end
+  end
+end

data/spec/integer/from_prime_division_spec.rb

@@ -0,0 +1,7 @@
+require 'mathn'
+
+describe "Integer::from_prime_division" do
+  it "Reverse a prime factorization of an integer" do
+    Integer.from_prime_division([[2, 1], [3, 2], [7, 1]]).should == 126
+  end
+end

data/spec/integer/gcd2_spec.rb

@@ -0,0 +1,17 @@
+require 'mathn'
+
+ruby_version_is ''...'1.9' do
+  describe "Integer#gcd2" do
+    it "Returns the greatest common divisor of the two numbers" do
+      15.gcd2(5).should == 5
+      15.gcd2(-6).should == 3
+      -23.gcd2(19).should == 1
+      -10.gcd2(-2).should == 2
+    end
+
+    it "raises a ZeroDivisionError when is called on zero" do
+      lambda { 0.gcd2(2) }.should raise_error(ZeroDivisionError)
+      lambda { 2.gcd2(0) }.should raise_error(ZeroDivisionError)
+    end
+  end
+end

data/spec/integer/prime_division_spec.rb

@@ -0,0 +1,19 @@
+require 'mathn'
+
+describe "Integer#prime_division" do
+  it "Performs a prime factorization of a positive integer" do
+    100.prime_division.should == [[2, 2], [5, 2]]
+  end
+
+  # Proper handling of negative integers has been added to MRI trunk
+  # in revision 24091. Prior to that, all versions of MRI returned nonsense.
+  ruby_bug "trunk@24091", "1.9.1" do
+    it "Performs a prime factorization of a negative integer" do
+      -26.prime_division.should == [[-1, 1], [2, 1], [13, 1]]
+    end
+  end
+
+  it "raises a ZeroDivisionError when is called on zero" do
+    lambda { 0.prime_division }.should raise_error(ZeroDivisionError)
+  end
+end

data/spec/math/fixtures/classes.rb

@@ -0,0 +1,3 @@
+class IncludesMath
+  include Math
+end

data/spec/math/rsqrt_spec.rb

@@ -0,0 +1,13 @@
+require File.expand_path('../shared/rsqrt', __FILE__)
+
+describe "Math#rsqrt" do
+  it_behaves_like :mathn_math_rsqrt, :_, IncludesMath.new
+
+  it "is a private instance method" do
+    IncludesMath.should have_private_instance_method(:rsqrt)
+  end
+end
+
+describe "Math.rsqrt" do
+  it_behaves_like :mathn_math_rsqrt, :_, Math
+end

data/spec/math/shared/rsqrt.rb

@@ -0,0 +1,31 @@
+require 'mathn'
+require File.expand_path('../../fixtures/classes', __FILE__)
+
+describe :mathn_math_rsqrt, :shared => true do
+  it "returns the square root for Rational numbers" do
+    @object.send(:rsqrt, Rational(9, 25)).should == Rational(3, 5)
+    @object.send(:rsqrt, 16/64).should == Rational(1, 2)
+  end
+
+  it "returns the square root for positive numbers" do
+    @object.send(:rsqrt, 1).should == 1
+    @object.send(:rsqrt, 4.0).should == 2.0
+    @object.send(:rsqrt, 12.34).should == Math.sqrt!(12.34)
+  end
+
+  ruby_version_is ""..."1.9" do
+    it "raises an Errno::EDOM if the argument is a negative number" do
+      lambda { @object.send(:rsqrt, -1) }.should raise_error(Errno::EDOM)
+      lambda { @object.send(:rsqrt, -4.0) }.should raise_error(Errno::EDOM)
+      lambda { @object.send(:rsqrt, -16/64) }.should raise_error(Errno::EDOM)
+    end
+  end
+
+  ruby_version_is "1.9" do
+    it "raises an Math::DomainError if the argument is a negative number" do
+      lambda { @object.send(:rsqrt, -1) }.should raise_error(Math::DomainError)
+      lambda { @object.send(:rsqrt, -4.0) }.should raise_error(Math::DomainError)
+      lambda { @object.send(:rsqrt, -16/64) }.should raise_error(Math::DomainError)
+    end
+  end
+end

data/spec/math/shared/sqrt.rb

@@ -0,0 +1,25 @@
+require 'mathn'
+require File.expand_path('../../fixtures/classes', __FILE__)
+
+describe :mathn_math_sqrt, :shared => true do
+  it "returns the square root for Rational numbers" do
+    @object.send(:sqrt, Rational(9, 25)).should == Rational(3, 5)
+    @object.send(:sqrt, 16/64).should == Rational(1, 2)
+  end
+
+  it "returns the square root for Complex numbers" do
+    @object.send(:sqrt, Complex(1, 0)).should == 1
+  end
+
+  it "returns the square root for positive numbers" do
+    @object.send(:sqrt, 1).should == 1
+    @object.send(:sqrt, 4.0).should == 2.0
+    @object.send(:sqrt, 12.34).should == Math.sqrt!(12.34)
+  end
+
+  it "returns the square root for negative numbers" do
+    @object.send(:sqrt, -9).should == Complex(0, 3)
+    @object.send(:sqrt, -5.29).should == Complex(0, 2.3)
+    @object.send(:sqrt, -16/64).should == Complex(0, 1/2)
+  end
+end

data/spec/math/sqrt_spec.rb

@@ -0,0 +1,13 @@
+require File.expand_path('../shared/sqrt', __FILE__)
+
+describe "Math#rsqrt" do
+  it_behaves_like :mathn_math_sqrt, :_, IncludesMath.new
+
+  it "is a private instance method" do
+    IncludesMath.should have_private_instance_method(:sqrt)
+  end
+end
+
+describe "Math.rsqrt" do
+  it_behaves_like :mathn_math_sqrt, :_, Math
+end

data/spec/prime/each_spec.rb

@@ -0,0 +1,28 @@
+require'mathn'
+
+describe "Prime#each" do
+  it "enumerates the elements" do
+    primes = Prime.new
+    result = []
+
+    primes.each { |p|
+      result << p
+      break if p > 10
+    }
+
+    result.should == [2, 3, 5, 7, 11]
+  end
+
+  it "don't rewind the generator, each loop start at the current value" do
+    primes = Prime.new
+    primes.next
+    result = []
+
+    primes.each { |p|
+      result << p
+      break if p > 10
+    }
+
+    result.should == [3, 5, 7, 11]
+  end
+end

data/spec/prime/new_spec.rb

@@ -0,0 +1,11 @@
+require 'mathn'
+
+describe "Prime.new" do
+  it "returns a new Prime number" do
+    Prime.new.should be_kind_of(Prime)
+  end
+
+  it "raises a TypeError when is called with some arguments" do
+    lambda { Prime.new(1) }.should raise_error(ArgumentError)
+  end
+end

data/spec/prime/next_spec.rb

@@ -0,0 +1,10 @@
+require 'mathn'
+
+describe "Prime#next" do
+  it "returns the element at the current position and moves forward" do
+    p = Prime.new
+    p.next.should == 2
+    p.next.should == 3
+    p.next.next.should == 6
+  end
+end

data/spec/rational/Rational_spec.rb

@@ -0,0 +1,12 @@
+require 'mathn'
+
+ruby_version_is '1.9' do
+  describe "Kernel#Rational" do
+    it "returns an Integer if denominator divides numerator evenly" do
+      Rational(42,6).should == 7
+      Rational(42,6).should be_kind_of(Fixnum)
+      Rational(bignum_value,1).should == bignum_value
+      Rational(bignum_value,1).should be_kind_of(Bignum)
+    end
+  end
+end

data/spec/rational/exponent_spec.rb

@@ -0,0 +1,70 @@
+require 'mathn'
+
+ruby_version_is ''...'1.9' do
+  describe "Rational#** when passed [Rational]" do
+    it "returns Rational.new!(1, 1) when the passed argument is 0" do
+      (Rational.new!(3, 4) ** Rational.new!(0, 3)).should == Rational.new!(1,1)
+      (Rational.new!(-3, 4) ** Rational.new!(0, 3)).should == Rational.new!(1,1)
+      (Rational.new!(3, -4) ** Rational.new!(0, 3)).should == Rational.new!(1,1)
+      (Rational.new!(3, 4) ** Rational.new!(0, -3)).should == Rational.new!(1,1)
+    end
+
+    it "returns Rational.new!(1, 1) when self is 1" do
+      (Rational.new!(1,1) ** Rational.new!(2, 3)).should == Rational.new!(1,1)
+      (Rational.new!(1,1) ** Rational.new!(-2, 3)).should == Rational.new!(1,1)
+      (Rational.new!(1,1) ** Rational.new!(2, -3)).should == Rational.new!(1,1)
+      (Rational.new!(1,1) ** Rational.new!(-2, -3)).should == Rational.new!(1,1)
+    end
+
+    it "returns Rational.new!(0, 1) when self is 0" do
+      (Rational.new!(0,1) ** Rational.new!(2, 3)).should == Rational.new!(0,1)
+      (Rational.new!(0,1) ** Rational.new!(-2, 3)).should == Rational.new!(0,1)
+      (Rational.new!(0,1) ** Rational.new!(2, -3)).should == Rational.new!(0,1)
+      (Rational.new!(0,1) ** Rational.new!(-2, -3)).should == Rational.new!(0,1)
+    end
+
+    it "returns a Complex number when self is negative" do
+      (Rational.new!(-1,2) ** Rational.new!(2, 3)).should be_close(Complex(-0.314980262473718, 0.545561817985861), TOLERANCE)
+      (Rational.new!(-1,2) ** Rational.new!(-2, 3)).should be_close(Complex(-0.793700525984099, -1.3747296369986), TOLERANCE)
+      (Rational.new!(-1,2) ** Rational.new!(2, -3)).should be_close(Complex(-0.793700525984099, -1.3747296369986), TOLERANCE)
+    end
+  end
+
+  describe "Rational#** when passed [Integer]" do
+    it "returns the Rational value of self raised to the passed argument" do
+      (Rational.new!(3, 4) ** 4).should == Rational.new!(81, 256)
+      (Rational.new!(3, 4) ** -4).should == Rational.new!(256, 81)
+      (Rational.new!(-3, 4) ** -4).should == Rational.new!(256, 81)
+      (Rational.new!(3, -4) ** -4).should == Rational.new!(256, 81)
+    end
+
+    it "returns Rational.new!(1, 1) when the passed argument is 0" do
+      (Rational.new!(3, 4) ** 0).should == Rational.new!(1, 1)
+      (Rational.new!(-3, 4) ** 0).should == Rational.new!(1, 1)
+      (Rational.new!(3, -4) ** 0).should == Rational.new!(1, 1)
+
+      (Rational.new!(bignum_value, 4) ** 0).should == Rational.new!(1, 1)
+      (Rational.new!(3, -bignum_value) ** 0).should == Rational.new!(1, 1)
+    end
+  end
+
+  describe "Rational#** when passed [Float]" do
+    it "returns self converted to Float and raised to the passed argument" do
+      (Rational.new!(3, 1) ** 3.0).should == 27.0
+      (Rational.new!(3, 1) ** 1.5).should be_close(5.19615242270663, TOLERANCE)
+      (Rational.new!(3, 1) ** -1.5).should be_close(0.192450089729875, TOLERANCE)
+    end
+
+    it "returns 1.0 when the passed argument is 0" do
+      (Rational.new!(3, 4) ** 0.0).should == 1.0
+      (Rational.new!(-3, 4) ** 0.0).should == 1.0
+      (Rational.new!(-3, 4) ** 0.0).should == 1.0
+    end
+
+    it "returns NaN if self is negative and the passed argument is not 0" do
+      (Rational.new!(-3, 2) ** 1.5).nan?.should be_true
+      (Rational.new!(3, -2) ** 1.5).nan?.should be_true
+      (Rational.new!(3, -2) ** -1.5).nan?.should be_true
+    end
+  end
+end

data/spec/rational/inspect_spec.rb

@@ -0,0 +1,23 @@
+require 'mathn'
+
+describe "Rational#inspect" do
+  ruby_version_is ''...'1.9' do
+    it "returns a string representation of self" do
+      Rational.new!(3, 4).inspect.should == "3/4"
+      Rational.new!(-5, 8).inspect.should == "-5/8"
+      Rational.new!(-1, -2).inspect.should == "1/2"
+      Rational.new!(0, 2).inspect.should == "0/2"
+      Rational.new!(bignum_value, 1).inspect.should == "#{bignum_value}/1"
+    end
+  end
+
+  ruby_version_is '1.9' do
+    it "returns a string representation of self" do
+      Rational(3, 4).inspect.should == "(3/4)"
+      Rational(-5, 8).inspect.should == "(-5/8)"
+      Rational(-1, -2).inspect.should == "(1/2)"
+      Rational(0, 2).inspect.should == "0"
+      Rational(bignum_value, 1).inspect.should == "#{bignum_value}"
+    end
+  end
+end

metadata

@@ -0,0 +1,148 @@
+--- !ruby/object:Gem::Specification
+name: rubysl-mathn
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Brian Shirai
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-09-16 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: mspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+- !ruby/object:Gem::Dependency
+  name: rubysl-prettyprint
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.0'
+description: Ruby standard library mathn.
+email:
+- brixen@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .travis.yml
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- lib/mathn.rb
+- lib/rubysl/mathn.rb
+- lib/rubysl/mathn/mathn.rb
+- lib/rubysl/mathn/version.rb
+- rubysl-mathn.gemspec
+- spec/bignum/exponent_spec.rb
+- spec/complex/Complex_spec.rb
+- spec/fixnum/exponent_spec.rb
+- spec/float/exponent_spec.rb
+- spec/integer/from_prime_division_spec.rb
+- spec/integer/gcd2_spec.rb
+- spec/integer/prime_division_spec.rb
+- spec/math/fixtures/classes.rb
+- spec/math/rsqrt_spec.rb
+- spec/math/shared/rsqrt.rb
+- spec/math/shared/sqrt.rb
+- spec/math/sqrt_spec.rb
+- spec/prime/each_spec.rb
+- spec/prime/new_spec.rb
+- spec/prime/next_spec.rb
+- spec/rational/Rational_spec.rb
+- spec/rational/exponent_spec.rb
+- spec/rational/inspect_spec.rb
+homepage: https://github.com/rubysl/rubysl-mathn
+licenses:
+- BSD
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.3
+signing_key: 
+specification_version: 4
+summary: Ruby standard library mathn.
+test_files:
+- spec/bignum/exponent_spec.rb
+- spec/complex/Complex_spec.rb
+- spec/fixnum/exponent_spec.rb
+- spec/float/exponent_spec.rb
+- spec/integer/from_prime_division_spec.rb
+- spec/integer/gcd2_spec.rb
+- spec/integer/prime_division_spec.rb
+- spec/math/fixtures/classes.rb
+- spec/math/rsqrt_spec.rb
+- spec/math/shared/rsqrt.rb
+- spec/math/shared/sqrt.rb
+- spec/math/sqrt_spec.rb
+- spec/prime/each_spec.rb
+- spec/prime/new_spec.rb
+- spec/prime/next_spec.rb
+- spec/rational/Rational_spec.rb
+- spec/rational/exponent_spec.rb
+- spec/rational/inspect_spec.rb
+has_rdoc: