prime_products 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c89a59e2546e8634e232c6a6061743a774327d482bb8848f49dfbb9ac2dbf39e
+  data.tar.gz: 995d3b55063f6961309571a108abf290911c55feb6e33b0fa85a909ae6769e1d
+SHA512:
+  metadata.gz: 3137a492c281a242fa36e46a2fe3f3dda3ce4632ba91ab8e7594292f9a10f52fddbbb50ab25d374d0fce7c972eb942a842b29005f6db706ba49cd58cc7ce6154
+  data.tar.gz: 9fed6a69ea93e510de70f7a08aa18bb8bde65754cb37974367cbf2f04a638fc1840ebfea99b214901ab2c8e59b6d51932a9d09128deafd2dd1514b992ac391a5

data/.circleci/config.yml

@@ -0,0 +1,22 @@
+---
+version: 2
+jobs:
+  build:
+    working_directory: ~/prime_products
+    docker:
+      - image: circleci/ruby:2.5.3
+    steps:
+      - checkout
+      - run: gem install bundler --pre
+      - type: cache-restore
+        name: Restore Bundler cache
+        key: prime-products-{{ checksum "Gemfile.lock" }}
+      - run: bundle install --path vendor/bundle
+      - type: cache-save
+        name: Save Bundler cache
+        key: prime-products-{{ checksum "Gemfile.lock" }}
+        paths:
+          - vendor/bundle
+      - run: bundle exec rake
+      - run: bundle exec rake lint
+      - run: bundle exec ruby benchmarks/prime_numbers.rb

data/.gitignore

@@ -0,0 +1,13 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status
+
+*.gem

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,5 @@
+inherit_gem:
+  gc_ruboconfig: rubocop.yml
+
+AllCops:
+  TargetRubyVersion: 2.3

data/.ruby-version

@@ -0,0 +1 @@
+2.5.3

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+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, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at me@timrogers.co.uk. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+git_source(:github) { |repo_name| "https://github.com/#{repo_name}" }
+
+# Specify your gem's dependencies in prime_products.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,75 @@
+PATH
+  remote: .
+  specs:
+    prime_products (0.1.0)
+      hanami-cli (~> 0.3.0)
+      immutable-ruby (~> 0.0.3)
+      terminal-table (~> 1.8.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    ast (2.4.0)
+    concurrent-ruby (1.0.5)
+    diff-lcs (1.3)
+    gc_ruboconfig (2.3.13)
+      rubocop (>= 0.57, < 0.61)
+      rubocop-rspec (~> 1.25)
+    hanami-cli (0.3.0)
+      concurrent-ruby (~> 1.0)
+      hanami-utils (~> 1.3)
+    hanami-utils (1.3.0)
+      concurrent-ruby (~> 1.0)
+      transproc (~> 1.0)
+    immutable-ruby (0.0.3)
+      concurrent-ruby (~> 1.0.0)
+    jaro_winkler (1.5.1)
+    parallel (1.12.1)
+    parser (2.5.3.0)
+      ast (~> 2.4.0)
+    powerpack (0.1.2)
+    rainbow (3.0.0)
+    rake (10.5.0)
+    rspec (3.8.0)
+      rspec-core (~> 3.8.0)
+      rspec-expectations (~> 3.8.0)
+      rspec-mocks (~> 3.8.0)
+    rspec-core (3.8.0)
+      rspec-support (~> 3.8.0)
+    rspec-expectations (3.8.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-mocks (3.8.0)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-support (3.8.0)
+    rubocop (0.60.0)
+      jaro_winkler (~> 1.5.1)
+      parallel (~> 1.10)
+      parser (>= 2.5, != 2.5.1.1)
+      powerpack (~> 0.1)
+      rainbow (>= 2.2.2, < 4.0)
+      ruby-progressbar (~> 1.7)
+      unicode-display_width (~> 1.4.0)
+    rubocop-rspec (1.30.1)
+      rubocop (>= 0.60.0)
+    ruby-progressbar (1.10.0)
+    terminal-table (1.8.0)
+      unicode-display_width (~> 1.1, >= 1.1.1)
+    transproc (1.0.2)
+    unicode-display_width (1.4.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.17.1)
+  gc_ruboconfig (~> 2.3.13)
+  prime_products!
+  rake (~> 10.0)
+  rspec (~> 3.0)
+  rubocop (~> 0.60.0)
+  rubocop-rspec (~> 1.30.1)
+
+BUNDLED WITH
+   1.17.1

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2018 Tim Rogers
+
+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,59 @@
+# Prime Products
+
+Prime Products is a command-line tool which outputs the multiplication table of the first `n` prime numbers.
+
+So, for instance, where `n=5`, you'd get a result like this:
+
+```
++----+----+----+----+----+-----+
+| *  | 2  | 3  | 5  | 7  | 11  |
+| 2  | 4  | 6  | 10 | 14 | 22  |
+| 3  | 6  | 9  | 15 | 21 | 33  |
+| 5  | 10 | 15 | 25 | 35 | 55  |
+| 7  | 14 | 21 | 35 | 49 | 77  |
+| 11 | 22 | 33 | 55 | 77 | 121 |
++----+----+----+----+----+-----+
+```
+
+The first row and column of the table contains the first 5 primes. Each other cell contains the product of the primes for the corresponding row and column.
+
+## Installation
+
+Install the gem by running `gem install prime_products`.
+
+In development, you can install this gem by cloning the repository and running `bundle`.
+
+## Usage
+
+To generate a table of prime products, run the `prime_products` executable, providing the size of the table as the first argument:
+
+```bash
+# If you have installed this gem from source, you will need to run
+# `bundle exec prime_products 10`.
+prime_products 10
+```
+
+If you do not provide an argument, we will use the first 5 by default.
+
+## Benchmarking
+
+This gem uses a naive method of finding the first *n* primes which does not scale especially well. However, this seems reasonable given that the primes will be displayed on-screen, and so it is unlikely you will want to see a large number at once.
+
+Despite being a naive solution, this is still moderately performant. On my machine:
+
+* finding the first 10 takes ~0.00004s
+* finding the first 100 takes ~0.001s
+* finding the first 1000 takes ~0.2s
+* finding the first 10000 takes ~31s
+
+It is unlikely that you would want a table of more than 1000, which only takes ~0.2 seconds. If we wanted to use these numbers elsewhere, and needed more, then I would optimise this code.
+
+You can see full benchmark results, comparing the Ruby standard library's implementation (`Prime.first`) to mine, by running `ruby benchmarks/prime_numbers.rb`.
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. Run `rake lint` to check the code style with Rubocop.
+
+You can also 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`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).

data/Rakefile

@@ -0,0 +1,10 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+require "rubocop/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+RuboCop::RakeTask.new(:lint)
+
+task default: :spec

data/benchmarks/prime_numbers.rb

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+require "benchmark"
+require "prime"
+require_relative "../lib/prime_products/prime_numbers"
+
+Benchmark.bm do |b|
+  [10, 100, 1000, 10_000].each do |n|
+    b.report("naive_#{n}") { PrimeProducts::PrimeNumbers.first(n) }
+    b.report("stdlib_#{n}") { Prime.first(n) }
+  end
+end

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "prime_products"
+
+# 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
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

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

data/exe/prime_products

@@ -0,0 +1,6 @@
+#! /usr/bin/env ruby
+# frozen_string_literal: true
+
+require "prime_products"
+
+PrimeProducts::CLI.call

data/lib/prime_products.rb

@@ -0,0 +1,30 @@
+# frozen_string_literal: true
+
+require "prime_products/cli"
+require "prime_products/prime_numbers"
+require "prime_products/products_table"
+require "prime_products/version"
+
+module PrimeProducts
+  # Generates an ASCII "multiplications table" of the first `number_of_primes` prime
+  # numbers, starting from zero, suitable for presentation in a shell.
+  #
+  # For example, if you pass in `5`, the result will be:
+  #
+  # +---+---+----+----+----+----+
+  # | * | 1 | 2  | 3  | 4  | 5  |
+  # | 1 | 1 | 2  | 3  | 4  | 5  |
+  # | 2 | 2 | 4  | 6  | 8  | 10 |
+  # | 3 | 3 | 6  | 9  | 12 | 15 |
+  # | 4 | 4 | 8  | 12 | 16 | 20 |
+  # | 5 | 5 | 10 | 15 | 20 | 25 |
+  # +---+---+----+----+----+----+
+  #
+  # @param numbers [Array<Integer>, Immutable::SortedSet<Integer>] the number of
+  #   prime numbers, starting from 0, you want to the multiplication table of
+  # @return [String] the generated table
+  def self.generate_table(number_of_primes:)
+    prime_numbers = PrimeNumbers.first(number_of_primes)
+    ProductsTable.generate(prime_numbers)
+  end
+end

data/lib/prime_products/cli.rb

@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+module PrimeProducts
+  module CLI
+    DEFAULT_NUMBER_OF_PRIMES = 10
+
+    # Generates a multiplication table of the first N primes (specified by a
+    # command line argument by default) and outputs it to the specified output (`STDOUT
+    # by default).
+    #
+    # @param output [IO] the output to print the table to
+    # @param arguments [Array] the CLI arguments (where the first argument is
+    #   expected to contain the number of primes to use, starting from zero)
+    def self.call(output: $stdout, arguments: ARGV)
+      number_of_primes = arguments[0]&.to_i || DEFAULT_NUMBER_OF_PRIMES
+
+      output.puts PrimeProducts.generate_table(number_of_primes: number_of_primes)
+    end
+  end
+end

data/lib/prime_products/prime_numbers.rb

@@ -0,0 +1,40 @@
+# frozen_string_literal: true
+
+require "immutable"
+
+module PrimeProducts
+  module PrimeNumbers
+    INFINITY = (1.0 / 0)
+
+    # Finds the first `n` prime numbers using a naive, but easy to understand, method.
+    # Alternative solutions are easy to find and implement.
+    #
+    # However, I am opting to stick with a simpler more friendly option to keep
+    # complexity low, given that __we will be displaying results on a screen__, making it
+    # unlikely that you will show huge quantities.
+    #
+    # Despite being a naive solution, this is still moderately performant. On my machine:
+    #
+    # * finding the first 10 takes ~0.00004s
+    # * finding the first 100 takes ~0.001s
+    # * finding the first 1000 takes ~0.2s
+    # * finding the first 10000 takes ~31s
+    #
+    # It is unlikely that you would want a table of more than 1000, which only takes
+    # ~0.2 seconds. If we wanted to use these numbers elsewhere, and needed more, then I
+    # would optimise this code.
+    #
+    # @param n [Integer] the number of prime numbers, starting from 0, you want to find
+    # @return [Immutable::SortedSet<Integer>] the first `n` prime numbers
+    def self.first(number_of_primes)
+      # In Ruby 2.6, you can generate a Range up to infinity with `(2..)` 😍
+      primes = (2..INFINITY).
+        lazy.
+        reject { |i| (2...i).any? { |divisor| (i % divisor).zero? } }.
+        take(number_of_primes).
+        to_a
+
+      Immutable::SortedSet[*primes]
+    end
+  end
+end

data/lib/prime_products/products_table.rb

@@ -0,0 +1,81 @@
+# frozen_string_literal: true
+
+require "terminal-table"
+
+module PrimeProducts
+  module ProductsTable
+    class << self
+      # Generates an ASCII "multiplication table" of the supplied `numbers`, suitable
+      # for presentation in a shell.
+      #
+      # For example, if you pass in `[1, 2, 3, 4, 5]`, the result will be:
+      #
+      # +---+---+----+----+----+----+
+      # | * | 1 | 2  | 3  | 4  | 5  |
+      # | 1 | 1 | 2  | 3  | 4  | 5  |
+      # | 2 | 2 | 4  | 6  | 8  | 10 |
+      # | 3 | 3 | 6  | 9  | 12 | 15 |
+      # | 4 | 4 | 8  | 12 | 16 | 20 |
+      # | 5 | 5 | 10 | 15 | 20 | 25 |
+      # +---+---+----+----+----+----+
+      #
+      # @param numbers [Array<Integer>, Immutable::SortedSet<Integer>] A list of numbers
+      #  which behaves like an Array, to build a multiplication table of. Using an
+      #  immutable list is recommended to reduce the chance of accidental mutations.
+      #  @return [String] the generated table
+      def generate(numbers)
+        ::Terminal::Table.new(rows: generate_rows(numbers)).to_s
+      end
+
+      private
+
+      # Generates the rows for our ASCII "multiplication table", based on a list of
+      # numbers provided
+      #
+      # @param numbers [Array<Integer>, Immutable::SortedSet<Integer>] A list of numbers
+      #  which behaves like an Array, to build a multiplication table of.
+      # @return [Array<Array<String>] the complete set of rows for the table
+      def generate_rows(numbers)
+        [
+          generate_header(numbers),
+          *generate_body_rows(numbers),
+        ]
+      end
+
+      # Generates the header row for our ASCII "multiplication table", with an asterisk
+      # followed by our numbers
+      #
+      # @param numbers [Array<Integer>, Immutable::SortedSet<Integer>] A list of numbers
+      #  which behaves like an Array, to build a multiplication table of.
+      # @return [Array<String>] the header row for the table
+      def generate_header(numbers)
+        ["*"] + numbers
+      end
+
+      # Generates the body rows (everything apart from the header) for our ASCII
+      # "multiplication table", based on a list of numbers provided
+      #
+      # @param numbers [Array<Integer>, Immutable::SortedSet<Integer>] A list of numbers
+      #  which behaves like an Array, to build a multiplication table of.
+      # @return [Array<Array<String>] the body rows for the table, with the multiplier
+      #   followed by the products
+      def generate_body_rows(numbers)
+        numbers.map { |n| generate_body_row(numbers, constant_multiplier: n) }
+      end
+
+      # Generates a body row for our multiplication table, starting with our
+      # `constant_multiplier`, and then the products of each of our `numbers`
+      # and the `constant_multiplier`
+      #
+      # @param numbers [Array<Integer>, Immutable::SortedSet<Integer>] A list of numbers
+      #  which behaves like an Array, to build a multiplication table of.
+      # @param constant_multiplier [Integer] the constant multiplier to multiply each of
+      #   the `numbers` by
+      # @return [Array<Array<String>] a body row for the table, with the multiplier
+      #   followed by the products
+      def generate_body_row(numbers, constant_multiplier:)
+        [constant_multiplier] + numbers.map { |n| n * constant_multiplier }
+      end
+    end
+  end
+end

data/lib/prime_products/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module PrimeProducts
+  VERSION = "0.1.0"
+end

data/prime_products.gemspec

@@ -0,0 +1,35 @@
+# frozen_string_literal: true
+
+lib = File.expand_path("lib", __dir__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require "prime_products/version"
+
+Gem::Specification.new do |spec|
+  spec.name                  = "prime_products"
+  spec.version               = PrimeProducts::VERSION
+  spec.authors               = ["Tim Rogers"]
+  spec.email                 = ["me@timrogers.co.uk"]
+
+  spec.summary = "Output the multiplication table of the first `n` prime numbers"
+  spec.required_ruby_version = ">= 2.3"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(File.expand_path(__dir__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency "hanami-cli", "~> 0.3.0"
+  spec.add_dependency "immutable-ruby", "~> 0.0.3"
+  spec.add_dependency "terminal-table", "~> 1.8.0"
+
+  spec.add_development_dependency "bundler", "~> 1.17.1"
+  spec.add_development_dependency "gc_ruboconfig", "~> 2.3.13"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "rubocop", "~> 0.60.0"
+  spec.add_development_dependency "rubocop-rspec", "~> 1.30.1"
+end

metadata

@@ -0,0 +1,191 @@
+--- !ruby/object:Gem::Specification
+name: prime_products
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Tim Rogers
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2018-11-25 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: hanami-cli
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.3.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.3.0
+- !ruby/object:Gem::Dependency
+  name: immutable-ruby
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.0.3
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.0.3
+- !ruby/object:Gem::Dependency
+  name: terminal-table
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.8.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.8.0
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.17.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.17.1
+- !ruby/object:Gem::Dependency
+  name: gc_ruboconfig
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 2.3.13
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 2.3.13
+- !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: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: rubocop
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.60.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.60.0
+- !ruby/object:Gem::Dependency
+  name: rubocop-rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.30.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.30.1
+description: 
+email:
+- me@timrogers.co.uk
+executables:
+- prime_products
+extensions: []
+extra_rdoc_files: []
+files:
+- ".circleci/config.yml"
+- ".gitignore"
+- ".rspec"
+- ".rubocop.yml"
+- ".ruby-version"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- benchmarks/prime_numbers.rb
+- bin/console
+- bin/setup
+- exe/prime_products
+- lib/prime_products.rb
+- lib/prime_products/cli.rb
+- lib/prime_products/prime_numbers.rb
+- lib/prime_products/products_table.rb
+- lib/prime_products/version.rb
+- prime_products.gemspec
+homepage: 
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '2.3'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.7.6
+signing_key: 
+specification_version: 4
+summary: Output the multiplication table of the first `n` prime numbers
+test_files: []