primtetable 1.0.0

data/LICENSE

@@ -0,0 +1,13 @@
+Copyright 2014 William DePhillips
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

data/README.md

@@ -0,0 +1,16 @@
+A small ruby app that prints a multiplication table of prime numbers.
+
+It uses a simplistic incremental Sieve of Eratosthenes algorithm to find primes based on this academic paper: http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf
+
+
+Instructions
+============
+
+   > gem install primetable
+   > primetable 10
+
+This will print the first 10 prime numbers.  You can try raising that number and seeing how far you can go.
+
+
+Interesting Prime Number Resources
+----------------------------------

data/bin/primetable

@@ -0,0 +1,24 @@
+#!/usr/bin/env ruby
+
+require 'benchmark'
+
+require_relative '../lib/primes'
+require_relative '../lib/table_printer'
+
+if ARGV && ARGV.size == 1 && ARGV[0].to_i > 0
+  n = ARGV[0].to_i
+  primes = nil
+  time = Benchmark.realtime { primes = Primes.first(n) }
+
+  puts "Generating table for the first #{n} primes."
+  puts "found primes in #{time} sec"
+  puts "\n"
+
+  TablePrinter.new(primes).print
+
+  puts "\n\n"
+else
+  puts %{  usage: #{$0} N
+                            N is the number of primes to make a table for }
+  exit -1
+end

data/lib/composite_sequence.rb

@@ -0,0 +1,26 @@
+class CompositeSequence
+
+  def self.of_base_prime(prime)
+    self.new(prime)
+  end
+
+  def initialize(prime)
+    @base = prime
+    @current = 2 * prime
+  end
+
+  def next
+    @current
+  end
+
+  def <=>(other)
+    self.next <=> other.next
+  end
+
+  def take_next!
+    self.next.tap do
+      @current += @base
+    end
+  end
+
+end

data/lib/multiplication_table.rb

@@ -0,0 +1,13 @@
+class MultiplicationTable
+
+  def initialize(factors)
+    @factors = factors
+  end
+
+  def generate
+    @factors.map do |f1|
+      @factors.map { |f2| f1 * f2 }
+    end
+  end
+
+end

data/lib/ordered_composite_sequences.rb

@@ -0,0 +1,44 @@
+require_relative 'composite_sequence'
+
+class OrderedCompositeSequences
+
+  def initialize
+    @sequences = []
+  end
+
+  def empty?
+    @sequences.empty?
+  end
+
+  def take_next_composite!
+    next_sequence.take_next!.tap do |return_value|
+
+      @sequences.sort!
+      @sequences.each do |other_sequence|
+        upcoming_value = other_sequence.next
+        if upcoming_value == return_value
+          other_sequence.take_next!
+        end
+        break if upcoming_value > return_value
+      end
+
+      @sequences.sort!
+    end
+  end
+
+  def next_composite
+    next_sequence.next
+  end
+
+  def add_sequence_for(prime)
+    (@sequences << CompositeSequence.of_base_prime(prime)).sort!
+    nil
+  end
+
+  private
+
+  def next_sequence
+    @sequences[0]
+  end
+
+end

data/lib/primes.rb

@@ -0,0 +1,28 @@
+require_relative 'ordered_composite_sequences'
+
+class Primes
+
+  # based on incremental sieve of eratosthenes algorithm described by:
+  # http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf
+  def self.first(n)
+    composites = OrderedCompositeSequences.new
+    primes = []
+    current = 2
+
+    while primes.size < n
+      if composites.empty? || composites.next_composite > current
+        primes << current
+        composites.add_sequence_for current
+        current += 1
+      elsif composites.next_composite == current
+        composites.take_next_composite!
+        current += 1
+      end
+
+    end
+
+    primes
+  end
+
+
+end

data/lib/table_printer.rb

@@ -0,0 +1,58 @@
+require_relative '../lib/multiplication_table'
+
+class TablePrinter
+
+  def initialize(primes, io=STDOUT)
+    @primes = primes
+    @table = MultiplicationTable.new(@primes).generate
+    @io = io
+  end
+
+  def print
+    print_header_row
+    print_rows
+  end
+
+  def longest_digits
+    @longest_digits ||= @table.flatten.max.to_s.size
+  end
+
+  private
+
+  def print_header_row
+    @io.write spacer
+    @io.write formatted_list(@primes)
+    @io.write "\n"
+    @io.write "=" * ((@primes.size + 1) * field_size)
+    @io.write "\n"
+  end
+
+  def print_rows
+    @table.each_with_index do |row, i|
+      @io.write(format % @primes[i] + separator)
+      @io.write formatted_list(row)
+      @io.write "\n"
+    end
+  end
+
+  def formatted_list(array)
+    array.map { |elem| format % elem }.join(separator)
+  end
+
+  def spacer
+    @spacer ||= " " * field_size
+  end
+
+  def separator
+    " | "
+  end
+
+  def format
+    @format ||= "%#{longest_digits}d"
+  end
+
+  def field_size
+    @field_size ||= longest_digits + separator.size
+  end
+
+end

metadata

@@ -0,0 +1,56 @@
+--- !ruby/object:Gem::Specification
+name: primtetable
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+  prerelease: 
+platform: ruby
+authors:
+- Bill DePhillips
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-09-25 00:00:00.000000000 Z
+dependencies: []
+description: command line tool that prints a table of the first N prime numbers, (e.g.
+  2,3,5 x 2,3,5)
+email:
+- bill.dephillips@gmail.com
+executables:
+- primetable
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/primes.rb
+- lib/ordered_composite_sequences.rb
+- lib/table_printer.rb
+- lib/multiplication_table.rb
+- lib/composite_sequence.rb
+- LICENSE
+- README.md
+- bin/primetable
+homepage: https://github.com/rearadmiral/primetable
+licenses:
+- Apache
+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.21
+signing_key: 
+specification_version: 3
+summary: prints multiplication tables of first N prime numbers
+test_files: []