gcd 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 30d7a82701ec3bd49fb87a1acb06d0a530a734ce
+  data.tar.gz: 172ac8be2b05b594d0eed73a370be070c24096fb
+SHA512:
+  metadata.gz: 6226350d0f76b02168710ca36f82ec4084325cda2c7e5f27e8dfbffb5b902dc81b30d919420deb1cbd4f5df22710ec05847bd5a5697682a7c9ee6a9c5c751893
+  data.tar.gz: acb11fe67e3689a26641dff1058f4b59406ff4c38ae089e028c94756fbe94d8f4490b46d6597d5279d525406b31aebee39a9332db250b6ef6343a4ac10bb8746

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2015 TODO: Write your name
+
+MIT License
+
+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/README.md

@@ -0,0 +1,35 @@
+# GCD
+
+In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.[1][2]
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'gcd'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install gcd
+
+## Usage
+
+```ruby
+require "gcd"
+
+Math.gcd(7, 160) # => [23, -1]
+```
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/gcd/fork )
+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 a new Pull Request

data/Rakefile

@@ -0,0 +1,9 @@
+require "bundler/gem_tasks"
+require 'rake/testtask'
+
+Rake::TestTask.new do |task|
+  task.libs << %w(test lib)
+  task.pattern = 'test/test_*.rb'
+end
+
+task :default => :test

data/gcd.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'gcd/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "gcd"
+  spec.version       = GCD::VERSION
+  spec.authors       = ["James Moriarty"]
+  spec.email         = ["jamespaulmoriarty@gmail.com"]
+  spec.summary       = %q{In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder.}
+  spec.description   = ""
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  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.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+end

data/lib/ext/math.rb

@@ -0,0 +1,14 @@
+module Math
+  def self.gcd(a, b)
+    # trivial case first: gcd(a, 0) == 1*a + 0*0
+    return 1, 0 if b == 0
+
+    # recurse: a = q*b + r
+    q, r = a/b, a%b
+    s, t = gcd(b, r)
+
+    # compute and return coefficients:
+    # gcd(a, b) == gcd(b, r) == s*b + t*r == s*b + t*(a - q*b)
+    return t, s - q * t
+  end
+end

data/lib/gcd.rb

@@ -0,0 +1,6 @@
+require "gcd/version"
+require "ext/math"
+
+module GCD
+
+end

data/lib/gcd/version.rb

@@ -0,0 +1,3 @@
+module GCD
+  VERSION = "0.0.1"
+end

data/test/test_gcd.rb

@@ -0,0 +1,12 @@
+require "test_helper"
+
+class TestGCD < Minitest::Test
+  describe "GCD" do
+    it ".gcd(a,b)" do
+      assert_equal [1, 0],   Math.gcd(0, 0)
+      assert_equal [0, 1],   Math.gcd(0, 1)
+      assert_equal [0, 1],   Math.gcd(1, 1)
+      assert_equal [23, -1], Math.gcd(7, 160)
+    end
+  end
+end

data/test/test_helper.rb

@@ -0,0 +1,2 @@
+require 'gcd'
+require 'minitest/autorun'

metadata

@@ -0,0 +1,87 @@
+--- !ruby/object:Gem::Specification
+name: gcd
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- James Moriarty
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-01-10 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !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'
+description: ''
+email:
+- jamespaulmoriarty@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- gcd.gemspec
+- lib/ext/math.rb
+- lib/gcd.rb
+- lib/gcd/version.rb
+- test/test_gcd.rb
+- test/test_helper.rb
+homepage: ''
+licenses:
+- MIT
+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.2.2
+signing_key: 
+specification_version: 4
+summary: In mathematics, the greatest common divisor (gcd) of two or more integers,
+  when at least one of them is not zero, is the largest positive integer that divides
+  the numbers without a remainder.
+test_files:
+- test/test_gcd.rb
+- test/test_helper.rb