rationalize 0.0.1

data/README.md

@@ -0,0 +1,40 @@
+rationalize - Refinement version of mathn
+=========================================
+
+This project aims to provide refinement version of mathn.rb.
+
+Install
+========================
+
+	$ gem install rationalize
+
+Documentation
+========================
+
+* [API Reference](http://rubydoc.info/github/shugo/rationalize/frames)
+
+License
+========================
+
+(The MIT License)
+
+Copyright (c) 2012 Shugo Maeda
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/lib/rationalize.rb

@@ -0,0 +1,203 @@
+require "cmath"
+require "matrix"
+require "prime"
+
+#require "mathn/rational"
+#require "mathn/complex"
+
+# +Rationalize+ is a refinement version of mathn.
+#
+# @example
+#
+#   p 1 / 3 #=> 0
+#   class Foo
+#     using Rationalize
+#     p 1 / 3 #=> (1/3)
+#   end
+#   p 1 / 3 #=> 0
+#   p Rationalize.sqrt(Rational(9, 4)) #=> (3/2)
+module Rationalize
+  include CMath
+  extend CMath
+
+  refine Module do
+    def define_alias(mid, original)
+      define_method(mid) do |*args, &block|
+        send(original, *args, &block)
+      end
+    end
+  end
+
+  refine Fixnum do
+    define_alias :/, :quo
+    define_alias :power!, :**
+
+    def ** (other)
+      if self < 0 && other.round != other
+        Complex(self, 0.0) ** other
+      else
+        power!(other)
+      end
+    end
+  end
+
+  refine Bignum do
+    define_alias :/, :quo
+    define_alias :power!, :**
+
+    def ** (other)
+      if self < 0 && other.round != other
+        Complex(self, 0.0) ** other
+      else
+        power!(other)
+      end
+    end
+  end
+
+  refine Rational do
+    def ** (other)
+      if other.kind_of?(Rational)
+        other2 = other
+        if self < 0
+          return Complex(self, 0.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(num, den)
+      elsif other.kind_of?(Float)
+        Float(self) ** other
+      else
+        x , y = other.coerce(self)
+        x ** y
+      end
+    end
+  end
+
+  refine Float do
+    define_alias :power!, :**
+
+      def ** (other)
+        if self < 0 && other.round != other
+          Complex(self, 0.0) ** other
+        else
+          power!(other)
+        end
+      end
+  end
+
+  def sqrt(a)
+    if a.kind_of?(Complex)
+      abs = sqrt(a.real*a.real + a.imag*a.imag)
+#      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.imag >= 0
+        Complex(x, y)
+      else
+        Complex(x, -y)
+      end
+    elsif a.respond_to?(:nan?) and a.nan?
+      a
+    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, :rsqrt
+end

data/test/test_helper.rb

@@ -0,0 +1,3 @@
+$VERBOSE = true
+
+require "test/unit"

data/test/test_rationalize.rb

@@ -0,0 +1,21 @@
+require_relative "test_helper"
+
+require_relative "../lib/rationalize"
+
+class TestRationalize < Test::Unit::TestCase
+  def test_fixnum_slash
+    assert_equal(0, 0 / 3)
+    assert_equal(0, 1 / 3)
+    assert_equal(1, 3 / 3)
+
+    using Rationalize
+
+    assert_equal(Rational(0, 3), 0 / 3)
+    assert_equal(Rational(1, 3), 1 / 3)
+    assert_equal(Rational(3, 3), 3 / 3)
+  end
+
+  def test_sqrt
+    assert_equal(Rational(2, 3), Rationalize.sqrt(Rational(4, 9)))
+  end
+end

metadata

@@ -0,0 +1,57 @@
+--- !ruby/object:Gem::Specification 
+name: rationalize
+version: !ruby/object:Gem::Version 
+  prerelease: 
+  version: 0.0.1
+platform: ruby
+authors: 
+  - Shugo Maeda
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2012-10-01 00:00:00 Z
+dependencies: []
+
+description: 
+email: shugo@ruby-lang.org
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+  - lib/rationalize.rb
+  - test/test_helper.rb
+  - test/test_rationalize.rb
+  - README.md
+homepage: http://github.com/shugo/rationalize
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+  - lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.8.15
+signing_key: 
+specification_version: 3
+summary: Refinement version of mathn
+test_files: []
+