prime_numbers 0.0.3

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/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 Adit
+
+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,63 @@
+# PrimeNumbers
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'prime_numbers'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install prime_numbers
+
+## Usage (in terminal)
+
+    > PrimeNumbers.table_product_primes(10)
+
+
+## WHAT I'VE DONE
+
+
+1. I've looked around for some existing code ;)
+  
+  
+  - never reinvent from scratch
+  
+  - 99% of the time somebody has already done something I need to accomplish.
+    70% of the time it's the EXACT same request (first 10 prime numbers!)
+  
+  - I want to learn to "copy the good stuff" and "enhance"
+  
+  - chances are you get stuff done first and well tested too
+
+
+2. Once I found some good piece of code I spend my precious time to:
+
+  a) test it's copy-pasted code behaviour
+  b) encapsulate into organized structure
+  c) package the whole stuff and ship for good
+
+  enjoy!
+
+
+
+## SOME NOTES
+
+Just to add something of my own I've added some code extending functionality:
+
+  - monkey patching is considered a bad practice if done wildly
+  - better do it "with style", I've tried to implement new beta function "refine"
+
+
+
+## REFS
+
+- first N prime numbers: z5h from http://stackoverflow.com/questions/11673968/how-do-i-generate-the-first-n-prime-numbers
+- how to monkey patch (BETA): http://www.sitepoint.com/a-look-at-ruby-2-0/
+- build a gem: http://railscasts.com/episodes/245-new-gem-with-bundler?view=asciicast

data/Rakefile

@@ -0,0 +1,12 @@
+require "bundler/gem_tasks"
+
+begin
+  require 'rspec/core/rake_task'
+  RSpec::Core::RakeTask.new(:spec) do |spec|
+    spec.pattern = 'spec/**/*_spec.rb'
+    spec.rspec_opts = ['--color']
+  end
+  task :default => :spec  
+rescue LoadError
+  nil
+end

data/lib/prime_numbers/prime_int.rb

@@ -0,0 +1,20 @@
+module PrimeInt
+
+  class Integer
+    
+    def self.is_prime?(num)
+      return false if num <= 1
+      2.upto(Math.sqrt(num).to_i) do |x|
+        return false if num % x == 0
+      end
+      true
+    end
+    
+    def self.next_prime(num)
+      n = num + 1
+      n = n + 1 until is_prime?(n)
+      n
+    end
+  end
+  
+end

data/lib/prime_numbers/version.rb

@@ -0,0 +1,3 @@
+module PrimeNumbers
+  VERSION = "0.0.3"
+end

data/lib/prime_numbers.rb

@@ -0,0 +1,41 @@
+require "terminal-table"
+require "prime_numbers/version"
+require "prime_numbers/prime_int"
+
+module PrimeNumbers
+  
+  def self.fist_primes(n = 10)
+    e = Enumerator.new do |els|
+      i = 2
+      loop do
+        els << i
+        i = PrimeInt::Integer.next_prime(i)
+      end
+    end
+    e.take n
+  end
+  
+  def self.first_prime_prods(n = 10)
+    return 0 unless n > 1
+    
+    rows = []
+    next_prime = 0
+    prime_prod = 1
+    
+    (n - 1).times do |i|
+      
+      next_prime = PrimeInt::Integer.next_prime(next_prime)
+      prime_prod = prime_prod * next_prime
+      
+      rows << [i, next_prime, prime_prod]
+    end
+    
+    rows
+  end
+  
+  def self.table_product_primes(n = 10)
+    # This is just a binding from an external plugin which can be modified / substituted during time
+    Terminal::Table.new :headings => ['i', 'Prime', 'Product'], :rows => first_prime_prods(n)
+  end
+  
+end

data/prime_numbers.gemspec

@@ -0,0 +1,31 @@
+# -*- encoding: utf-8 -*-
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'prime_numbers/version'
+
+Gem::Specification.new do |gem|
+  gem.name          = "prime_numbers"
+  gem.version       = PrimeNumbers::VERSION
+  gem.authors       = ["Adit"]
+  gem.email         = ["a.saxena@email.it"]
+  gem.description   = "Write a program that calculates and prints out a multiplication table of the first 10 calculated prime numbers."
+  gem.summary       = "The program must run from the command line and print to screen 1 table.\nAcross the top and down the left side should be the 10 primes, and the body of the table should contain the product of multiplying these numbers."
+
+  gem.homepage      = ""
+
+  gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  
+  gem.files         = `git ls-files`.split($/)
+  # s.files         = Dir["[A-Z]*[^~]"] + Dir["lib/**/*.rb"] + Dir["spec/*"] + [".gitignore"]
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  
+  gem.require_paths = ["lib"]
+  
+  gem.add_dependency "terminal-table"
+  
+  gem.add_development_dependency "rake"
+  gem.add_development_dependency "rspec"
+  gem.add_development_dependency "awesome_print"
+  
+end

data/spec/prime_numbers_spec.rb

@@ -0,0 +1,74 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+# WARNING: this works for short numbers! (takes too much memory)
+class PrimeTester
+  def self.is_prime?(n)
+    ("1" * n) !~ /^1?$|^(11+?)\1+$/
+  end
+end
+
+describe PrimeNumbers do
+  
+  # A good check implements different calculation methods: regex magic != manual loop
+  it "test 100 sample numbers to check if our prime calculator return valid number" do
+    
+    100.times do |i|
+      
+      is_prime_regx = PrimeTester.is_prime? i
+      is_prime_our_class = PrimeInt::Integer.is_prime?(i)
+      
+      is_prime_regx.should eq(is_prime_our_class)
+  
+    end  
+    
+  end
+  
+  it "Raise an error for invalid product" do
+    PrimeNumbers.first_prime_prods(0).should eq 0
+    PrimeNumbers.first_prime_prods(-1).should eq 0
+    PrimeNumbers.first_prime_prods(-100).should eq 0
+  end
+  
+  it "Test a multiplication table of the first 10 calculated prime numbers" do
+    qty = 10
+    
+    qty.should be > 1
+    
+    first_primes = PrimeNumbers.fist_primes(qty)
+    first_primes_prods = PrimeNumbers.first_prime_prods(qty)
+    
+    manual_prod = 1
+    
+    (qty - 1).times do |i|
+      
+      manual_prod = manual_prod * first_primes[i]
+      manual_prod.should eq first_primes_prods[i][2]
+      
+    end
+  end
+  
+  it "Prints out a multiplication table of the first 10 calculated prime numbers" do
+    puts PrimeNumbers.table_product_primes(10)
+  end
+  
+  it "Benchmarks our performance" do
+    require 'prime'
+    
+    Benchmark.bm(7) do |bm|
+      bm.report("Ruby Core Prime:")     { Prime.prime?(20_000) }
+      bm.report("Our prime validator:") { PrimeInt::Integer.is_prime?(20_000) }
+    end
+    
+  end
+  
+  it "this Benchmark compares our prime lister vs prime products" do
+    require 'prime'
+    
+    Benchmark.bm(7) do |bm|
+      bm.report("list primes only:")   { PrimeNumbers.fist_primes(20_000) }
+      bm.report("list primes and its product:")   { PrimeNumbers.first_prime_prods(20_000) }
+    end
+    
+  end
+  
+end

data/spec/spec_helper.rb

@@ -0,0 +1,8 @@
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+
+require "benchmark"
+require "awesome_print"
+require "prime_numbers"
+
+

metadata

@@ -0,0 +1,139 @@
+--- !ruby/object:Gem::Specification
+name: prime_numbers
+version: !ruby/object:Gem::Version
+  version: 0.0.3
+  prerelease: 
+platform: ruby
+authors:
+- Adit
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-11-07 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: terminal-table
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: awesome_print
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Write a program that calculates and prints out a multiplication table
+  of the first 10 calculated prime numbers.
+email:
+- a.saxena@email.it
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- !binary |-
+  LmdpdGlnbm9yZQ==
+- !binary |-
+  R2VtZmlsZQ==
+- !binary |-
+  TElDRU5TRS50eHQ=
+- !binary |-
+  UkVBRE1FLm1k
+- !binary |-
+  UmFrZWZpbGU=
+- !binary |-
+  bGliL3ByaW1lX251bWJlcnMucmI=
+- !binary |-
+  bGliL3ByaW1lX251bWJlcnMvcHJpbWVfaW50LnJi
+- !binary |-
+  bGliL3ByaW1lX251bWJlcnMvdmVyc2lvbi5yYg==
+- !binary |-
+  cHJpbWVfbnVtYmVycy5nZW1zcGVj
+- !binary |-
+  c3BlYy9wcmltZV9udW1iZXJzX3NwZWMucmI=
+- !binary |-
+  c3BlYy9zcGVjX2hlbHBlci5yYg==
+homepage: ''
+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.24
+signing_key: 
+specification_version: 3
+summary: The program must run from the command line and print to screen 1 table. Across
+  the top and down the left side should be the 10 primes, and the body of the table
+  should contain the product of multiplying these numbers.
+test_files:
+- !binary |-
+  c3BlYy9wcmltZV9udW1iZXJzX3NwZWMucmI=
+- !binary |-
+  c3BlYy9zcGVjX2hlbHBlci5yYg==
+has_rdoc: