generate_prime_table 0.1.1 → 0.1.11

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 9b1aa56b765436f89e3de28dfaa254c8a456365c
-  data.tar.gz: 9f8f5f35eadf3c919b218d2469cf6396611ec3ec
+  metadata.gz: b342dbdeea1443a666cc014caa13a8cfc5219f1b
+  data.tar.gz: 3b41c294a05514b06a5f3515486fb8c0347ab705
 SHA512:
-  metadata.gz: 7696bd1a27b45d70c15fcbef3a79cfee0b62ff9758ef7a16489ef841bec81f423ce27a63741572727b8865cf2ced4db7c5f6158a31fad44f28f00ca70e38146a
-  data.tar.gz: 5a50d39bd4ee43a55124128e3bbc3dcab8b7117537616a57b0692ee7d6c4ee8467304cc60ea2f35b71eea5b525cd040a757bb3f895182ffb6303f18e7dfe926f
+  metadata.gz: 70c5b632c2590952ae92f3804403b08ad70f277064536f29b73b95adff99c52e0fee879f6f46a5d6109591f6603135b3fcfa3f0d316343dcfc44eedc80a3df3e
+  data.tar.gz: 4c034cd3342e2a31a43ae0bccdb427ddcc931e66673f160bab372cc570e3129016b2363b93e85022f74ec58463f9bdf5961d7b394ed4d25a5090fa945aa424d9

data/README.md

@@ -1,15 +1,18 @@
 # PrimeTable
 
-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_table`. To experiment with that code, run `bin/console` for an interactive prompt.
-
-TODO: Delete this and the text above, and describe your gem
+###Objective
+* Write a program that prints out a multiplication table of the first 'n' prime
+numbers.(where n could be any number greater than 0)
+* The program could be run from the command line and print one table to
+STDOUT, or can be used as service to get the table in array to use on view.
+* The first row and column of the table should have the 'n' primes, with each cell containing the product of the primes for the corresponding row and column.
 
 ## Installation
 
 Add this line to your application's Gemfile:
 
 ```ruby
-gem 'prime_table'
+gem 'generate_prime_table'
 ```
 
 And then execute:
@@ -18,11 +21,77 @@ And then execute:
 
 Or install it yourself as:
 
-    $ gem install prime_table
+    $ gem install generate_prime_table
 
 ## Usage
 
-TODO: Write usage instructions here
+#####There are three ways to extract the result:
+* Install the gem locally
+* And
+    * Create a ruby file and add the following to it:
+    ```
+        require_relative 'lib/prime_table'
+        
+        puts 'Enter the number'
+        @num = gets.chomp
+        @num = @num.to_i
+        puts PrimeTable::LESS_THAN_ZERO if @num <= 0
+        puts "Generating prime product table for #{@num} records" if @num > 0
+        table = @num <= 0 ? PrimeTable::TabularView.new : PrimeTable::TabularView.new(n:@num.to_i)
+        puts table.tableize
+    
+    ```
+
+    *  extract the result on console
+
+    ```
+        require 'prime_table'
+        @num = 10        
+        table = PrimeTable::TabularView.new(n:@num.to_i)
+        puts table.tableize
+    ```
+    * try to use it as gem in application code base
+    ```
+        add "gem 'generate_prime_table'" to gemfile
+        bundle install
+        add the following in any model/module/helper file
+            require_relative 'lib/prime_table'
+            def table(num)
+                @table = @num <= 0 ? PrimeTable::TabularView.new : PrimeTable::TabularView.new(n:@num.to_i)
+                @table.tableize
+            end
+    ```
+    
+####How to Run it using github code
+clone the repo and run
+    ```
+    'ruby table_generator_example.rb'
+    ```
+
+###Complexity Considerations:
+* Generating the multiplication table is O(n**2) complexity since we have to multiply each prime by it's corresponding counterpart
+* Displaying the table is O(n) since we're just iterating through the table and displaying each row. (there are 'n' number of rows)
+
+
+###Notes
+• Consider complexity. How fast does your code run? How does it scale?
+- As the 'N' gets bigger the program is going to start slowing down because we are using trial division to determine if the number is prime. However, for small 'n' number of primes this solution will suffice.
+
+• Did not use the Prime class from stdlib, written custom class for it.
+
+• Written tests to demonstrate TDD/BDD.
+
+###Approach
+
+####GetPrimes Class
+* Created a GetPrimes class which will instantiate 'n' number of primes
+
+####Compute Primes Multiplication
+* Computed the value of multiplied primes
+
+####Displays the Multiplication Table
+* Creates a TabularView class and calls methods to display the table.
+
 
 ## Development
 

data/lib/generators/prime_table/install_generator.rb

@@ -0,0 +1,12 @@
+module PrimeTable
+  module Generators
+    class InstallGenerator < Rails::Generators::Base
+      source_root File.expand_path("../", __FILE__)
+      desc "copies the example rb to root directory"
+
+      def copy_initializer
+        template 'table_generator_example.rb', '../'
+      end
+    end
+  end
+end

data/lib/prime_table/version.rb

@@ -1,3 +1,3 @@
 module PrimeTable
-  VERSION = "0.1.1"
+  VERSION = "0.1.11"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: generate_prime_table
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.11
 platform: ruby
 authors:
 - Aashish Saini
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-05-19 00:00:00.000000000 Z
+date: 2018-05-20 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -71,10 +71,11 @@ files:
 - Rakefile
 - bin/console
 - bin/setup
+- lib/generators/prime_table/install_generator.rb
 - lib/prime_table.rb
 - lib/prime_table/version.rb
 - prime_table.gemspec
-- table_generator.rb
+- table_generator_example.rb
 homepage: http://rubygems.org/gems/prime_table
 licenses:
 - MIT
@@ -95,7 +96,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.6.11
+rubygems_version: 2.6.13
 signing_key: 
 specification_version: 4
 summary: Prints the table that has N prime numberss, with each cell containing the