r_math_plus 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 3a7bdad3ee832e67e60f81b058983001b616a6c9
+  data.tar.gz: 4c7b07dc511d2281bd3abe4109b86b570533d4e1
+SHA512:
+  metadata.gz: 91ee88368dd92c311b6beec7ebc9036dc76b711b229f8296c2c6d1b9ede210cf5d55767566787b49a5a550c0a1020437d381f95bac6cd851bac2b02d9c01ef21
+  data.tar.gz: 16150e3d61bdaa74a17cab523972d4bb67e29aa6dc0f0507afb8d75088e7dc78e566929a005b827089225a3c4b435864eb5d4b5305db68db7edd10b911bebaab

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 rmathplus.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2015 otamm
+
+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,77 @@
+# Rmathplus
+
+A gem designed due to my personal online puzzle solving habits; some of them may be a part
+of Ruby's kernel already, the purpose of the gem is to unite some methods in a single place with easy
+access to them. RMathPlus is a collection of methods that appear kinda often in puzzles, and also some
+that do not show up that often but can clearly be reused. Designed with computational efficiency in mind,
+some of the methods are interdependent and therefore it is a good idea to always load the whole gem instead
+of requiring specific methods.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'r_math_plus'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install rmathplus
+
+## Usage
+The '.is_prime?' method is the base of all of the other methods and also available by itself.
+Simple pass a number as a parameter and it will return a boolean value:
+```ruby
+RMathPlus.is_prime?(3) # => true
+RMathPlus.is_prime?(4) # => false
+```
+The method also accepts an optional second parameter, an array containing prime numbers;
+usage of the second parameter works best in an incrementing fashion (see this repo's lib/r_math_plus.rb '#prime_array' method for an example.)
+Ex:
+```ruby
+RMathPlus.is_prime?(5,[2,3]) # => true, faster execution
+RMathPlus.is_prime?(8,[2,3,5,7]) # => false, faster execution
+```
+
+The '.prime_array' method takes an integer as a parameter and returns an array with the primes lesser than or equal to the number:
+```ruby
+RMathPlus.prime_array(10) # => [2,3,5,7]
+```
+
+'.prime_factors' returns an array of the prime factors of a given number n. If n is a prime, it will return n.
+Ex:
+```ruby
+RMathPlus.prime_factors(10) # => [2,5]
+RMathPlus.prime_factors(8)  # => [2,2,2]
+```
+
+Second optional parameter used in order to improve speed if the method will run through an array of
+integers; its input should be the array returned by the '.prime_array' method with the array of numbers' biggest int as parameter.
+Ex:
+```ruby
+biggest_number_prime_array = RMathPlus.prime_array(10)
+prime_factors = []
+[2,4,6,7,9,10].each do |n|
+  prime_factors.push(RMathPlus.prime_factors(n,biggest_number_prime_array)) # will execute faster iterating through a single array, otherwise it would make a prime array for each of the numbers
+end
+# => prime_factors == [[2],[2,2],[2,3],[7],[3,3],[2,5]]
+```
+
+'.lcm' is used to calculate the least common multiple of a given array of numbers. Dependent on the method above, the code on lib/r_math_plus.rb which defines
+this method illustrates well an example of the use of the optional second parameter to the '.prime_factors' method above.
+```ruby
+RMathPlus.lcm([2,4,8]) # => 8
+RMathPlus.lcm([3,6,8]) # => 24
+```
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/rmathplus/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,2 @@
+require "bundler/gem_tasks"
+Dir.glob('spec/tasks/**/*.rake').each(&method(:import))

data/lib/r_math_plus/version.rb

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

data/lib/r_math_plus.rb

@@ -0,0 +1,94 @@
+require "r_math_plus/version"
+
+module RMathPlus
+
+  def self.is_prime?(n,prime_array=false) # number to be checked as first parameter, optional second parameter to be used with the 'prime_array' method.
+      if n < 2
+        return false
+      elsif n == 2
+        return true
+      else
+      if prime_array
+          for i in (2..(n/2)+1) #it makes no sense to divide by numbers which would result in a result less than 2 (the smallest prime); the '+1' in the end is due to the default 'round down' in integer division in Ruby.
+          prime_array.each { |prime| return false if (n % prime) == 0 }
+        end
+      else
+        for i in (2..(n/2)+1)
+          if (n % i) == 0
+            return false
+          end
+        end
+      end
+    end
+    return true
+  end
+
+  def self.prime_array(n) #returns an array with all primes less than number n.
+    if n < 2
+      return []
+    else
+      prime_array = []
+      for i in (2..n)
+        prime_array.push(i) if RMathPlus.is_prime?(i,prime_array) # the own prime_array built so far is passed as an argument in order to improve processing speed.
+      end
+    end
+    return prime_array
+  end
+
+  def self.prime_factors(number, biggest_number_prime_array=false) #returns the prime factors of a given number. if n is prime, returns n. second parameter to improve speed if method would be utilized in a range of numbers.
+    factors = []
+    if biggest_number_prime_array
+      primes = biggest_number_prime_array
+    else
+      primes = RMathPlus.prime_array(number)
+    end
+
+    while true
+      signal = factors.size #signalizes when to break the loop.
+      primes.each do |prime|
+        if (number % prime) == 0
+          factors.push(prime)
+          number = number / prime
+          break
+        end
+      end
+      if signal == factors.size
+        factors.push(number)
+        break
+      end
+    end
+    factors = factors.sort
+    return factors - [1] #...because 1 is not a prime.
+  end
+
+  def self.lcm(nums) #method that returns the least common multiple between a given array of numbers.
+    nums = nums.uniq.sort
+    primes = RMathPlus.prime_array(nums[-1]) #biggest number in the whole array.
+    factorized_nums = [] #holds the prime factors for each value in nums array.
+    nums.each { |n| factorized_nums.push(RMathPlus.prime_factors(n,primes)) }
+
+    unique_lcm_factors = [] #individual prime factors of lcm
+    lcm_factors = {} #prime factors of lcm
+    for factors in factorized_nums
+      for factor in factors.uniq
+        if lcm_factors.include?(factor)
+          lcm_factors[factor] = factors.count(factor) if factors.count(factor) > lcm_factors[factor]
+        else
+          lcm_factors[factor] = factors.count(factor)
+        end
+      end
+    end
+
+    lcm = 1
+    lcm_factors.each { |factor,max_quantity| lcm *= factor ** max_quantity }
+    return lcm
+  end
+
+end
+
+odds = []
+for i in (1..99)
+  odds.push(i) if (i % 2) == 1
+end
+
+puts RMathPlus.lcm(odds)

data/r_math_plus.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'r_math_plus/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "r_math_plus"
+  spec.version       = RMathPlus::VERSION
+  spec.authors       = ["Otávio Monteagudo"]
+  spec.email         = ["oivatom@gmail.com"]
+  spec.summary       = %q{ Math operations to use in puzzles. }
+  spec.description   = %q{ Some extra math ops to the standard library which include prime number operations and the least common multiple of an array of numbers. }
+  spec.homepage      = "https://github.com/otamm/RMathPlus"
+  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"
+  spec.add_development_dependency "rspec", "~> 3.0.0"
+end

data/spec/r_math_plus_spec.rb

@@ -0,0 +1,74 @@
+require 'spec_helper'
+
+
+describe RMathPlus do
+
+  describe ".is_prime?" do
+
+    it "returns true when a number is prime" do
+      (RMathPlus.is_prime?(3)).should == true
+    end
+
+    it "returns false when a number is not prime" do
+      (RMathPlus.is_prime?(4)).should == false
+    end
+
+    it "returns true when a big prime number is passed as param" do
+      (RMathPlus.is_prime?(104729)).should == true
+    end
+
+    it "executes faster when an array is passed as second parameter" do
+      begin1 = Time.now
+        (RMathPlus.is_prime?(50,[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]))
+      finish1 = Time.now
+
+      begin2 = Time.now
+        (RMathPlus.is_prime?(50))
+      finish2 = Time.now
+      ((finish1 - begin1) > (finish2 - begin2)).should == true
+    end
+
+  end
+
+  describe ".prime_array" do
+
+    it "returns an array with all the primes lesser than or equal to its parameter" do
+      expect(RMathPlus.prime_array(7)).to eq [2,3,5,7]
+    end
+
+    it "returns an empty array if input < 2" do
+      expect(RMathPlus.prime_array(0)).to eq []
+    end
+
+  end
+
+  describe ".prime_factors" do
+
+    it "returns repeated prime factors of a given number" do
+      expect(RMathPlus.prime_factors(8)).to eq [2,2,2]
+    end
+
+    it "returns its input if the input is a prime" do
+      expect(RMathPlus.prime_factors(11)).to eq [11]
+    end
+
+  end
+
+  describe ".lcm" do
+
+    it "returns the least common multiple of an array of numbers" do
+      expect(RMathPlus.lcm([2,4,8])).to eq 8
+    end
+
+    it "returns the least common multiple of a big array of numbers" do
+      odds = []
+      for i in (1..99)
+        odds.push(i) if (i % 2) == 1
+      end
+
+      expect(RMathPlus.lcm(odds)).to eq 1089380862964257455695840764614254743075
+    end
+
+  end
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1 @@
+require 'r_math_plus'

data/spec/tasks/rspec.rake

@@ -0,0 +1,3 @@
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)

metadata

@@ -0,0 +1,101 @@
+--- !ruby/object:Gem::Specification
+name: r_math_plus
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Otávio Monteagudo
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-03-05 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'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 3.0.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 3.0.0
+description: " Some extra math ops to the standard library which include prime number
+  operations and the least common multiple of an array of numbers. "
+email:
+- oivatom@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/r_math_plus.rb
+- lib/r_math_plus/version.rb
+- r_math_plus.gemspec
+- spec/r_math_plus_spec.rb
+- spec/spec_helper.rb
+- spec/tasks/rspec.rake
+homepage: https://github.com/otamm/RMathPlus
+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: Math operations to use in puzzles.
+test_files:
+- spec/r_math_plus_spec.rb
+- spec/spec_helper.rb
+- spec/tasks/rspec.rake