prime-numbers 0.0.1

data/.gitignore

@@ -0,0 +1,20 @@
+.DS_Store
+
+*.gem
+*.rbc
+.bundle
+.config
+coverage
+InstalledFiles
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+
+# YARD artifacts
+.yardoc
+_yardoc
+doc/

data/Gemfile

@@ -0,0 +1,4 @@
+source :rubygems
+
+# Specify your gem's dependencies in prime-numbers.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,24 @@
+PATH
+  remote: .
+  specs:
+    prime-numbers (0.0.1)
+
+GEM
+  remote: http://rubygems.org/
+  specs:
+    diff-lcs (1.1.3)
+    rspec (2.10.0)
+      rspec-core (~> 2.10.0)
+      rspec-expectations (~> 2.10.0)
+      rspec-mocks (~> 2.10.0)
+    rspec-core (2.10.1)
+    rspec-expectations (2.10.0)
+      diff-lcs (~> 1.1.3)
+    rspec-mocks (2.10.1)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  prime-numbers!
+  rspec

data/LICENSE

@@ -0,0 +1,22 @@
+Copyright (c) 2012 Andrei Ursan
+
+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,50 @@
+# 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
+
+    require 'prime-numbers'
+
+    # initialize a generator object with a strategy, let's say the "one liner", which uses
+    # this algorithm to find the prime numbers:
+    #      ('1' * number) !~ /^1?$|^(11+?)\1+$/
+    primes_generator = PrimeNumbers::Generator.new(:one_liner)
+
+    # or for a more performant strategy use
+    primes_generator = PrimeNumbers::Generator.new(:sieve_of_eratosthenes)
+
+    #then you can check for a specific prime number
+    prime_generator.is_prime? 947
+    => true
+    
+    # or for prime numbers within a range
+    prime_generate.generate 3500, 3540
+    => [3511, 3517, 3527, 3529, 3533, 3539] 
+
+    # inverse ranges are supported
+    prime_generate.generate 3540, 3500
+    => [3511, 3517, 3527, 3529, 3533, 3539] 
+
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Added some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1,2 @@
+#!/usr/bin/env rake
+require "bundler/gem_tasks"

data/lib/prime-numbers.rb

@@ -0,0 +1,32 @@
+require "prime-numbers/version"
+require "prime-numbers/algorithms/algorithm"
+require "prime-numbers/errors/range_boundary_exception"
+
+module PrimeNumbers
+  class Generator
+    def initialize algorithm_strategy
+      @algorithm = Algorithm.with_strategy(algorithm_strategy)
+    end
+
+    def generate a, b
+      a,b = range_sanitizer(a,b)[0], range_sanitizer(a,b)[1]
+      @algorithm.generate(a,b)
+    end
+
+    def is_prime? number
+      @algorithm.is_prime? number
+    end
+
+  private 
+    def range_sanitizer a,b
+      if a <= 0 || a.class == Float
+        raise RangeBoundaryException, "#{a} is an invalid range boundary, please provide a positive integer instead!"
+      elsif b <= 0 || b.class == Float
+        raise RangeBoundaryException, "#{b} is an invalid range boundary, please provide a positive integer instead!"
+      end
+
+      a,b = b,a if a > b
+      [a,b]
+    end
+  end
+end

data/lib/prime-numbers/algorithms/algorithm.rb

@@ -0,0 +1,15 @@
+require File.expand_path('../one_liner', __FILE__)
+require File.expand_path('../sieve_of_eratosthenes', __FILE__)
+
+module PrimeNumbers
+  class Algorithm
+    ALGORITHMS = {
+      one_liner: AlgorithmOneLiner,
+      sieve_of_eratosthenes: AlgorithmSieveOfEratosthenes
+    }
+
+    def self.with_strategy strategy
+      ALGORITHMS[strategy].new
+    end
+  end
+end

data/lib/prime-numbers/algorithms/one_liner.rb

@@ -0,0 +1,15 @@
+module PrimeNumbers
+  class AlgorithmOneLiner
+    def generate a, b
+      primenumbers = []
+      (a..b).each do |number|
+        primenumbers << number if self.is_prime? number
+      end
+      primenumbers
+    end
+
+    def is_prime? number
+      number < 2 ? false : ('1' * number) !~ /^1?$|^(11+?)\1+$/
+    end
+  end
+end

data/lib/prime-numbers/algorithms/sieve_of_eratosthenes.rb

@@ -0,0 +1,36 @@
+module PrimeNumbers
+  class AlgorithmSieveOfEratosthenes
+    def generate lower_bound, upper_bound
+        sqrt_upper = (Math.sqrt upper_bound).round
+        numbers = Array.new(upper_bound) {|e| e =  false}
+        primes = []
+
+        (2 .. sqrt_upper).each do |m|
+          if !numbers[m]
+
+            if m >= lower_bound
+              primes << m
+            end
+
+            k = m * m
+            while k <= upper_bound
+              numbers[k] = true
+              k += m
+            end
+
+          end
+        end
+
+        (sqrt_upper+1 .. upper_bound).each do |n|
+          if !numbers[n] && n >= lower_bound
+            primes << n
+          end
+        end
+        primes
+    end
+
+    def is_prime? number
+      number < 2 ? false : !generate(number,number).empty?
+    end
+  end
+end

data/lib/prime-numbers/errors/range_boundary_exception.rb

@@ -0,0 +1,2 @@
+class RangeBoundaryException < Exception
+end

data/lib/prime-numbers/version.rb

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

data/prime-numbers.gemspec

@@ -0,0 +1,19 @@
+# -*- encoding: utf-8 -*-
+require File.expand_path('../lib/prime-numbers/version', __FILE__)
+
+Gem::Specification.new do |gem|
+  gem.authors       = ["Andrei Ursan"]
+  gem.email         = ["hello@andreiursan.com"]
+  gem.description   = %q{Prime Numbers Generator}
+  gem.summary       = %q{Simply tells if a number is prime or generates al prime numbers from a provided range}
+  gem.homepage      = "https://github.com/andreiursan/prime-numbers"
+
+  gem.add_development_dependency "rspec"
+
+  gem.files         = `git ls-files`.split($\)
+  gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.name          = "prime-numbers"
+  gem.require_paths = ["lib"]
+  gem.version       = PrimeNumbers::VERSION
+end

data/spec/prime-numbers/algorithms/one_liner_spec.rb

@@ -0,0 +1,28 @@
+require 'spec_helper'
+
+describe PrimeNumbers::AlgorithmOneLiner do
+
+
+  before(:all) do
+    @algorithm = PrimeNumbers::AlgorithmOneLiner.new
+  end
+
+  it "should return true for prime numbers" do
+    [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 
+    41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 
+    83, 89, 97, 101, 7901, 7907, 7919].each do |number|
+      @algorithm.is_prime?(number).should be_true
+    end
+  end
+
+  it "should return false for non-prime numbers" do
+    [832, 1, -23, 0, 63, 888812, 15].each do |number|
+      @algorithm.is_prime?(number).should be_false
+    end
+  end
+
+  it "should return prime numbers in an interval" do
+    @algorithm.generate(7900, 8000).should eq([7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993])
+  end
+
+end

data/spec/prime-numbers/algorithms/sieve_of_eratosthenes_spec.rb

@@ -0,0 +1,28 @@
+require 'spec_helper'
+
+describe PrimeNumbers::AlgorithmSieveOfEratosthenes do
+
+
+  before(:all) do
+    @algorithm = PrimeNumbers::AlgorithmSieveOfEratosthenes.new
+  end
+
+  it "should return true for prime numbers" do
+    [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 
+    41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 
+    83, 89, 97, 101, 7901, 7907, 7919].each do |number|
+      @algorithm.is_prime?(number).should be_true
+    end
+  end
+
+  it "should return false for non-prime numbers" do
+    [832, 1, -23, 0, 63, 888812, 15].each do |number|
+      @algorithm.is_prime?(number).should be_false
+    end
+  end
+
+  it "should retunr prime numbers in an interval" do
+    @algorithm.generate(7900, 8000).should eq([7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993])
+  end
+
+end

data/spec/prime-numbers/errors/range_boundary_exception_spec.rb

@@ -0,0 +1,12 @@
+require 'spec_helper'
+
+describe RangeBoundaryException do
+  
+  it "should raise a RangeBoundaryException" do
+    begin
+    raise RangeBoundaryException 
+    rescue RangeBoundaryException => error
+      error.class.should == RangeBoundaryException
+    end
+  end
+end

data/spec/prime-numbers_spec.rb

@@ -0,0 +1,56 @@
+require 'spec_helper'
+
+describe PrimeNumbers::PrimeNumberGenerator do
+
+  before(:all) do
+    @prime_generator = PrimeNumbers::Generator.new(:one_liner)
+  end
+
+  it "should respond to message generate" do
+    @prime_generator.should respond_to(:generate)
+  end
+
+  it "should respond to message is_prime?" do
+    @prime_generator.should respond_to(:is_prime?)
+  end
+
+  it "should return all prime numbers between 1 and 13" do
+    @prime_generator.generate(1, 13).should eq([2, 3, 5, 7, 11, 13])
+  end
+
+  it "should handle reverse ranges (20,1) == (1,20)" do
+    begin
+    @prime_generator.generate(20, 1).should eq([2, 3, 5, 7, 11, 13, 17, 19])  
+    raise RangeBoundaryException 
+    rescue RangeBoundaryException => error
+      error.class.should == RangeBoundaryException
+    end
+  end
+
+  it "should raise an error on negtive range boundaries" do
+    begin
+    @prime_generator.generate(20, -2)
+    rescue RangeBoundaryException => error
+      error.should_not eq(nil)
+      error.message.should eq("-2 is an invalid range boundary, please provide a positive integer instead!")
+    end
+  end
+
+  it "should raise an error on float numbers range boundaries" do
+    begin
+    @prime_generator.generate(20.5, 2)
+    rescue RangeBoundaryException => error
+      error.should_not eq(nil)
+      error.message.should eq("20.5 is an invalid range boundary, please provide a positive integer instead!")
+    end
+  end
+
+  it "should return true for a prime number (17)" do
+    @prime_generator.is_prime?(17).should be_true
+  end
+
+  it "should return false if a number isn't prime (18)" do
+    @prime_generator.is_prime?(18).should be_false
+  end
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1,4 @@
+require_relative "../lib/prime-numbers.rb"
+require_relative "../lib/prime-numbers/algorithms/one_liner.rb"
+require_relative "../lib/prime-numbers/algorithms/sieve_of_eratosthenes.rb"
+require_relative "../lib/prime-numbers/errors/range_boundary_exception.rb"

metadata

@@ -0,0 +1,85 @@
+--- !ruby/object:Gem::Specification
+name: prime-numbers
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Andrei Ursan
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-06-17 00:00:00.000000000 Z
+dependencies:
+- !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'
+description: Prime Numbers Generator
+email:
+- hello@andreiursan.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- Gemfile.lock
+- LICENSE
+- README.md
+- Rakefile
+- lib/prime-numbers.rb
+- lib/prime-numbers/algorithms/algorithm.rb
+- lib/prime-numbers/algorithms/one_liner.rb
+- lib/prime-numbers/algorithms/sieve_of_eratosthenes.rb
+- lib/prime-numbers/errors/range_boundary_exception.rb
+- lib/prime-numbers/version.rb
+- prime-numbers.gemspec
+- spec/prime-numbers/algorithms/one_liner_spec.rb
+- spec/prime-numbers/algorithms/sieve_of_eratosthenes_spec.rb
+- spec/prime-numbers/errors/range_boundary_exception_spec.rb
+- spec/prime-numbers_spec.rb
+- spec/spec_helper.rb
+homepage: https://github.com/andreiursan/prime-numbers
+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: Simply tells if a number is prime or generates al prime numbers from a provided
+  range
+test_files:
+- spec/prime-numbers/algorithms/one_liner_spec.rb
+- spec/prime-numbers/algorithms/sieve_of_eratosthenes_spec.rb
+- spec/prime-numbers/errors/range_boundary_exception_spec.rb
+- spec/prime-numbers_spec.rb
+- spec/spec_helper.rb