prime_8 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 394007c9775ca3dcf6896728ee7d70858da1ed5c
+  data.tar.gz: 46a382ece35a3153bc7b97c9d46ee93b99638f4d
+SHA512:
+  metadata.gz: 7338e9cd86e672a1f28972f49ac9602080b6157483c86be0a91ad3cdfec646fa84925705fd9efc9a2b7c4a30cd628a0bfd0e2a4c8a93d5fc4317468c79ab8994
+  data.tar.gz: 8e3bf1bc5a1d726ea715abbc89c0a7485a412102599d80a26640d9fead46dd29a37796b75ce0651092bd791a355839952e8e3c59668050e80127d0e49caf306c

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.travis.yml

@@ -0,0 +1,3 @@
+language: ruby
+rvm:
+  - 2.2.2

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,13 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, age, or religion.
+
+Examples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.
+
+Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct. Project maintainers who do not follow the Code of Conduct may be removed from the project team.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.
+
+This Code of Conduct is adapted from the [Contributor Covenant](http:contributor-covenant.org), version 1.0.0, available at [http://contributor-covenant.org/version/1/0/0/](http://contributor-covenant.org/version/1/0/0/)

data/Gemfile

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

data/README.md

@@ -0,0 +1,39 @@
+# Prime8
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/prime_8`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'prime_8'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install prime_8
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release` to create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/prime_8/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,7 @@
+require "bundler/gem_tasks"
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+task :test => :spec
+
+task :default => [:test]

data/bin/console

@@ -0,0 +1,11 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "prime_8"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+require "pry"
+Pry.start

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/exe/run

@@ -0,0 +1,21 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "prime_8"
+require 'cri'
+
+command = Cri::Command.define do
+  name        'print'
+  usage       'usage: print [options]'
+  summary     'prints a table of primes'
+  description <<-EOS
+  Just printing some primes, thank you.
+  Move along, nothin to see here.
+  EOS
+  run do |opts, args|
+    Prime8::ReportTable.new(args[0].to_i).run
+  end
+end
+
+command.run(ARGV)
+

data/lib/prime_8/generators/atkins_generator.rb

@@ -0,0 +1,23 @@
+require 'prime_8/generators/prime_generator'
+require 'prime_8/strategies'
+
+module Prime8::Generators
+  class AtkinsGenerator < PrimeGenerator
+    def initialize
+      @last_prime_index = -1
+      @strategy = Prime8::Strategies.atkins
+      super
+    end
+
+    def succ
+      @last_prime_index += 1
+      @strategy.get_nth_prime(@last_prime_index)
+    end
+    def rewind
+      initialize
+    end
+    alias next succ
+  end
+
+end
+

data/lib/prime_8/generators/eratosthenes_generator.rb

@@ -0,0 +1,22 @@
+require 'prime_8/generators/prime_generator'
+require 'prime_8/strategies'
+
+module Prime8::Generators
+  class EratosthenesGenerator < PrimeGenerator
+    def initialize
+      @last_prime_index = -1
+      @strategy = Prime8::Strategies.eraatosthenes
+      super
+    end
+
+    def succ
+      @last_prime_index += 1
+      @strategy.get_nth_prime(@last_prime_index)
+    end
+
+    def rewind
+      initialize
+    end
+    alias next succ
+  end
+end

data/lib/prime_8/generators/prime_generator.rb

@@ -0,0 +1,53 @@
+module Prime8::Generators
+  class PrimeGenerator
+    include Enumerable
+    def initialize(ubound = nil)
+      @ubound = ubound
+    end
+    
+    def upper_bound=(ubound)
+      @ubound = ubound
+    end
+    
+    def upper_bound
+      @ubound
+    end
+    
+    def succ
+      raise NotImplementedError, "need to define `succ'"
+    end
+
+    def next
+      raise NotImplementedError, "need to define `next'"
+    end
+
+    def rewind
+      raise NotImplementedError, "need to define `rewind'"
+    end
+
+    def each
+      return self.dup unless block_given?
+      if @ubound
+        last_value = nil
+        loop do
+          prime = succ
+          break last_value if prime > @ubound
+          last_value = yield prime
+        end
+      else
+        loop do
+          yield succ
+        end
+      end
+    end
+
+    alias with_index each_with_index
+
+    def with_object(obj)
+      return enum_for(:with_object) unless block_given?
+      each do |prime|
+        yield prime, obj
+      end
+    end
+  end
+end

data/lib/prime_8/generators.rb

@@ -0,0 +1,11 @@
+require 'prime_8/generators/eratosthenes_generator'
+
+module Prime8
+  module Generators
+    autoload :EratosthenesGenerator, "generators/eratosthenes_generator"
+
+    def self.default
+      EratosthenesGenerator.new
+    end
+  end
+end

data/lib/prime_8/multiplication.rb

@@ -0,0 +1,9 @@
+module Multiplication
+  def table_rows(array)
+    array.collect {|a| row_columns(a,array)}
+  end
+
+  def row_columns(int,array)
+    [int] + array.collect {|a| int * a}
+  end
+end

data/lib/prime_8/prime.rb

@@ -0,0 +1,24 @@
+require 'prime_8/version'
+require 'prime_8/report_table'
+require 'prime_8/strategies'
+require 'prime_8/generators'
+require 'prime_8/multiplication'
+
+module Prime8
+  autoload :Generators, "prime_8/generators"
+  autoload :Strategies, "prime_8/strategies"
+
+  class Prime
+    include Singleton
+    
+    def prime?(value, generator = Generators.default)
+      return false if value < 2
+      generator.each do |num|
+        q,r = value.divmod num
+        return true if q < num
+        return false if r == 0
+      end
+    end
+
+  end
+end

data/lib/prime_8/report_table.rb

@@ -0,0 +1,44 @@
+require 'command_line_reporter'
+require_relative 'multiplication'
+require_relative 'strategies'
+
+module Prime8
+  class ReportTable
+    include CommandLineReporter
+    include Multiplication
+
+    attr_reader :primes
+    def initialize(count=10)
+      @count = count
+      @primes = Prime8::Strategies.default.get_through_nth_prime(@count)
+    end
+
+    def table_headings
+      [""]+@primes
+    end
+
+    def row_datum
+      table_rows(@primes)
+    end
+
+    def run
+      table :border => true do
+        row :header => true do 
+          table_headings.each do |prime|
+            column(prime.to_s, :align => 'center', :width => 5, :color => 'blue')
+          end
+        end
+        row_datum.each do |row_data|
+          row do
+            column(row_data.slice!(0).to_s, :align => 'center', :width => 5, :bold => true, :color => 'blue')
+          end
+          row_data.each do |rd|
+            column(rd.to_s, :align => 'center', :width => 5)
+          end
+        end
+      end
+    end
+  end
+end
+            #column(row_data.slice!(1).to_s)
+            #row_data.each do |column_data|

data/lib/prime_8/strategies/atkin_sieve_strategy.rb

@@ -0,0 +1,94 @@
+require_relative 'strategy'
+
+module Prime8::Strategies
+  class AtkinSieveStrategy < Strategy
+
+    def initialize
+      @first_set = %w(1 13 17 29 37 41 49 53).map(&:to_i)
+      @second_set = %w(7 19 31 43).map(&:to_i)
+      @third_set = %w(11 23 47 59).map(&:to_i)
+      super
+    end
+
+
+    def compute_primes
+      max_segment_size = 1e6.to_i
+      max_cached_prime = @primes.last
+      @max_checked = max_cached_prime + 1 if max_cached_prime > @max_checked
+
+      segment_min = @max_checked
+      segment_max = [segment_min + max_segment_size, max_cached_prime * 2].min
+
+      ((segment_min + 1) .. segment_max).step(2).each do |candidate|
+        remainder = candidate % 60
+        if @first_set.include?(remainder)
+          candidate_is_prime = first_quadratic_form(candidate)
+        elsif @second_set.include?(remainder)
+          candidate_is_prime = second_quadradic_form(candidate)
+        elsif @third_set.include?(remainder)
+          candidate_is_prime = third_quadradic_form(candidate)
+        end
+
+        if candidate_is_prime && !has_prime_divisor?(candidate)
+          @primes << candidate
+        end
+      end
+      @max_checked = segment_max
+    end
+
+    private
+
+    def has_prime_divisor?(candidate)
+      @primes.any? { |prime| candidate % prime == 0 }
+    end
+
+    def first_quadratic_form(n)
+      candidate_is_prime = false
+      x_limit = n >> 2
+      for x in (1..x_limit)
+        break if ((memoized_x = 4*x**2) && (memoized_x >= n))
+        for y in (1..n)
+          break if ((memoized_y = y**2) && (memoized_y >= n))
+          candidate = memoized_x + memoized_y
+          next unless (candidate == n)
+          if ((candidate%12 == 1) || (candidate%12 == 5))
+            candidate_is_prime = !candidate_is_prime
+          end
+        end
+      end
+      candidate_is_prime
+    end
+
+    def second_quadradic_form(n)
+      candidate_is_prime = false
+      x_limit = n >> 1
+      for x in (1..x_limit)
+        break if ((memoized_x = 3*x**2) && (memoized_x >= n))
+        for y in (1..n)
+          break if ((memoized_y = y**2) && (memoized_y >= n))
+          candidate = memoized_x + memoized_y
+          next unless (candidate == n)
+          if (candidate%12 == 7)
+            candidate_is_prime = !candidate_is_prime
+          end
+        end
+      end
+      candidate_is_prime
+    end
+
+    def third_quadradic_form(n)
+      candidate_is_prime = false
+      for x in (1..n)
+        break if (x**2 >= n)
+        for y in (1...x)
+          candidate = 3*x**2 - y**2
+          next unless candidate == n
+          if candidate > 0 && candidate%12 == 11
+            candidate_is_prime = !candidate_is_prime
+          end
+        end
+      end
+      candidate_is_prime
+    end
+  end
+end

data/lib/prime_8/strategies/eratosthenes_sieve_strategy.rb

@@ -0,0 +1,34 @@
+require_relative 'strategy'
+module Prime8::Strategies
+  class EratosthenesSieveStrategy < Strategy
+    def initialize
+      super
+    end
+
+    def compute_primes
+      max_segment_size = 1e6.to_i
+      max_cached_prime = @primes.last
+      @max_checked = max_cached_prime + 1 if max_cached_prime > @max_checked
+
+      segment_min = @max_checked
+      segment_max = [segment_min + max_segment_size, max_cached_prime * 2].min
+      root = Integer(Math.sqrt(segment_max).floor)
+
+      sieving_primes = @primes[1 .. -1].take_while { |prime| prime <= root }
+      offsets = Array.new(sieving_primes.size) do |i|
+        (-(segment_min + 1 + sieving_primes[i]) / 2) % sieving_primes[i]
+      end
+
+      segment = ((segment_min + 1) .. segment_max).step(2).to_a
+      sieving_primes.each_with_index do |prime, index|
+        composite_index = offsets[index]
+        while composite_index < segment.size do
+          segment[composite_index] = nil
+          composite_index += prime
+        end
+      end
+      @primes = @primes | segment.compact
+      @max_checked = segment_max
+    end
+  end
+end

data/lib/prime_8/strategies/strategy.rb

@@ -0,0 +1,21 @@
+module Prime8::Strategies
+  class Strategy
+    include Singleton
+
+    def initialize
+      @primes = [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]
+      @max_checked = @primes.last + 1
+    end
+
+    def get_nth_prime(n)
+      compute_primes while @primes.size <= n
+      @primes[n]
+    end
+
+    def get_through_nth_prime(n)
+      compute_primes while @primes.size <= n
+      @primes.first(n)
+    end
+
+  end
+end

data/lib/prime_8/strategies.rb

@@ -0,0 +1,19 @@
+require_relative 'strategies/eratosthenes_sieve_strategy'
+require_relative 'strategies/atkin_sieve_strategy'
+
+module Prime8
+  module Strategies
+
+    def self.default
+      eraatosthenes
+    end
+
+    def self.eraatosthenes
+      EratosthenesSieveStrategy.instance
+    end
+
+    def self.atkin
+      AtkinSieveStrategy.instance
+    end
+  end
+end

data/lib/prime_8/version.rb

@@ -0,0 +1,3 @@
+module Prime8
+  VERSION = "0.1.0"
+end

data/lib/prime_8.rb

@@ -0,0 +1,2 @@
+require 'singleton'
+require 'prime_8/prime'

data/prime_8.gemspec

@@ -0,0 +1,38 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'prime_8/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "prime_8"
+  spec.version       = Prime8::VERSION
+  spec.authors       = ["Matthew Jording"]
+  spec.email         = ["mjording@gmail.com"]
+
+  spec.summary       = %q{A brief excercise and exploration of primes.}
+  spec.description   = %q{A brief excercise and exploration of primes. cli, benchmarks and tests between diffent prime generation algorithms, etc}
+  spec.homepage      = "http://github.com/mjording/prime_8."
+
+  # Prevent pushing this gem to RubyGems.org by setting 'allowed_push_host', or
+  # delete this section to allow pushing this gem to any host.
+  #if spec.respond_to?(:metadata)
+    #spec.metadata['allowed_push_host'] = "TODO: Set to 'http://mygemserver.com'"
+  #else
+    #raise "RubyGems 2.0 or newer is required to protect against public gem pushes."
+  #end
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency 'cri','2.7.0'
+  spec.add_dependency 'command_line_reporter', '>=3.0'
+  spec.add_development_dependency "bundler", "~> 1.9"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "benchmark-ips", "~> 2.2.0"
+  spec.add_development_dependency 'rspec', '~> 3.2.0'
+  spec.add_development_dependency 'pry', '~> 0.10.1'
+  spec.add_development_dependency 'awesome_print', '~> 1.6.1'
+
+end

metadata

@@ -0,0 +1,181 @@
+--- !ruby/object:Gem::Specification
+name: prime_8
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Matthew Jording
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2015-05-29 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: cri
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 2.7.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 2.7.0
+- !ruby/object:Gem::Dependency
+  name: command_line_reporter
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.9'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.9'
+- !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: benchmark-ips
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 2.2.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 2.2.0
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 3.2.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 3.2.0
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.10.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.10.1
+- !ruby/object:Gem::Dependency
+  name: awesome_print
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.6.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.6.1
+description: A brief excercise and exploration of primes. cli, benchmarks and tests
+  between diffent prime generation algorithms, etc
+email:
+- mjording@gmail.com
+executables:
+- run
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- exe/run
+- lib/prime_8.rb
+- lib/prime_8/generators.rb
+- lib/prime_8/generators/atkins_generator.rb
+- lib/prime_8/generators/eratosthenes_generator.rb
+- lib/prime_8/generators/prime_generator.rb
+- lib/prime_8/multiplication.rb
+- lib/prime_8/prime.rb
+- lib/prime_8/report_table.rb
+- lib/prime_8/strategies.rb
+- lib/prime_8/strategies/atkin_sieve_strategy.rb
+- lib/prime_8/strategies/eratosthenes_sieve_strategy.rb
+- lib/prime_8/strategies/strategy.rb
+- lib/prime_8/version.rb
+- prime_8.gemspec
+homepage: http://github.com/mjording/prime_8.
+licenses: []
+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.4.6
+signing_key: 
+specification_version: 4
+summary: A brief excercise and exploration of primes.
+test_files: []