congruence_solver 0.2.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: b8cdf5634b888651240db1d379330c26e0915815
+  data.tar.gz: cb6e241768d62d727196d40600aed3da6c8d8cbd
+SHA512:
+  metadata.gz: c656aba94e133852ff5a6cb03cb4e4d35e7df80bc60205254caf6ffb1b8bb486121c939a2f8c63dce9dc3881b7ad48840d7a63619b1839faa18acca2148a72bb
+  data.tar.gz: 84930366fe58c6f75167c673b180b5d1dcc89e38540160f0281b1c10ba100eb7603d23f63ea6346d8ea7117030ae2274d27f82433cc9c5542aa9496d3ee4f146

data/.gitignore

@@ -0,0 +1,6 @@
+Gemfile
+Gemfile.lock
+tmp/
+todo
+lib/congruence_solver/congruence_solver.so
+*.gem

data/.gitmodules

@@ -0,0 +1,3 @@
+[submodule "ext/congruence_solver"]
+	path = ext/congruence_solver
+	url = https://github.com/laneb/congruence_solver_ext.git

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--require spec_helper

data/.travis.yml

@@ -0,0 +1,4 @@
+language: ruby
+rvm:
+  - 2.2.2
+before_install: gem install bundler -v 1.10.4

data/README.md

@@ -0,0 +1,57 @@
+# CongruenceSolver
+
+CongruenceSolver is a gem for solving polynomial congruences. Should you ever need to solve polynomial congruences and have Ruby installed, this is the gem for you!
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'congruence_solver'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install congruence_solver
+
+## Usage
+
+To solve a polynomial congruence at the command line, simply invoke `csolve` and then enter the congruence at the prompt.
+
+```
+csolve
+Congruence to solve:
+x^2 + 2x + 1 = x^3 + 3x^5 mod 49
+(0) 1
+(1) 8
+(2) 15
+(3) 22
+(4) 26
+(5) 29
+(6) 36
+(7) 43
+```
+
+To use the CongruenceSolver in a Ruby program, use CongruenceSolve::solve_congruence(coeffs, mod), where coeffs is the ascending list of coefficients of the polynomial (congruent to 0) and mod is the modulus of the congruence.
+
+```
+#solve -3x^5 - x^3 + x^2 + 2x + 1 = 0 mod 49
+coeffs = [1, 2, 1, 1, 0, 3]
+mod = 49
+CongruenceSolver.solve_congruence(coeffs, mod).sort  #=> [1, 8, 15, 22, 26, 29, 36, 43]
+``` 
+
+## Development
+
+After checking out the repo, run `bundle install` to install dependencies. Then, run `rake spec` to run the tests, or rake bench to run the benchmark.
+
+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).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/laneb/congruence_solver.
+

data/Rakefile

@@ -0,0 +1,53 @@
+#require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+require 'rake/extensiontask'
+
+
+
+
+=begin
+namespace :test do
+	desc "Compile and unit test C extensions"
+	Rspec::Core::RakeTask.new :c => :compile_c do |t|
+		t.rspec_opts = C_SPEC_FILE
+	end
+end
+=end
+
+#exe runs the csolve binary
+task :exe do
+	$LOAD_PATH << "#{Dir.pwd}/lib/"
+	require_relative "bin/csolve.rb"
+end
+
+#spec runs all RSpec examples
+RSpec::Core::RakeTask.new :spec
+
+#uses task template provided by rake-compiler to run the extension compilation
+#workflow. Task name: compile (do not use task name: ext)
+Rake::ExtensionTask.new 'congruence_solver' do |ext|
+	ext.lib_dir = "lib/congruence_solver"
+end
+
+task :bench do
+	$LOAD_PATH << "#{Dir.pwd}/lib/"
+	Dir.foreach("bench") do |bm_file|
+		path = "bench/#{bm_file}"
+		if File.file? path and path =~ "_bm.rb^"
+			require_relative path
+		end
+	end
+end
+
+#executes compile task defined above, then cleans up the tmp directory that
+#rake-compiler leaves behind for some reason
+task :compile_c => :compile do
+	CLEAN_CMD = "rmdir /s /q tmp"
+	system CLEAN_CMD
+end
+
+
+
+
+
+

data/bench/bench_tools.rb

@@ -0,0 +1,33 @@
+
+def polynomial_to_s(coeffs)
+		polynomial = ""
+		is_first_term = true
+
+		coeffs.reverse.each_with_index do |coe, idx|
+			exp = coeffs.length - idx - 1
+			if coe != 0
+				if is_first_term
+					is_first_term = false
+				else
+					if coe < 0
+						polynomial << " - "
+					else
+						polynomial << " + "
+					end
+				end
+
+				if coe.abs > 1 or (coe.abs == 1 and exp < 2)
+					polynomial << coe.abs.to_s
+				end
+
+				if exp > 0
+					polynomial << "x"
+					if exp > 1
+						polynomial << "^#{exp}"
+					end
+				end
+			end
+		end
+
+		polynomial
+end

data/bench/solve_congruence_bm.rb

@@ -0,0 +1,71 @@
+require "congruence_solver"
+require "benchmark"
+require_relative "./bench_tools.rb"
+
+
+SMALL_DEG_POLYNOMIAL_COEFFS = [1, -4, 4] 
+LARGE_DEG_POLYNOMIAL_COEFFS = [-11, 0, 0, 3, 0, 0, 0, 0, 0, 10]
+SMALL_MOD = 49
+MED_MOD = 5104
+LARGE_MOD = 94122
+XTRA_LARGE_MOD = 401249
+XTRA_LARGE_PRIME_MOD = 306893
+SMALL_FACTORED_LARGE_MOD = 510510
+
+
+def solve_congruence_brute_force(coeffs, mod)
+	solutions = []
+
+	0.upto(mod) do |x|
+		sum = 0
+
+		coeffs.each_with_index do |coe, exp|
+			sum = (sum + coe*x**exp) % mod
+		end
+
+		if sum == 0 then solutions << x end
+	end
+
+	solutions
+end
+
+
+def bm_solve_congruence(coeffs, mod) 
+		puts "Solving #{polynomial_to_s(coeffs)} = 0 mod #{mod}"
+
+		rb_bf_solutions = solve_congruence_brute_force(coeffs, mod).sort
+		#c_bf_solutions = CongruenceSolver.brute_force(coeffs, mod).sort
+		c_lifting_solutions = CongruenceSolver.lift(coeffs, mod).sort
+
+		unless rb_bf_solutions == c_lifting_solutions #and c_bf_solutions c_lift_solutions
+			puts "Solutions do not match:"
+			puts "Ruby/force solutions #{rb_bf_solutions.inspect}"
+			#puts "C/force solutions #{c_bf_solutions}"
+			puts "C/lifting solutions: #{c_lifting_solutions.inspect}"
+		end
+
+		puts "Time measurements:"
+
+		Benchmark.bmbm do |bm|
+			bm.report("Ruby/force") do
+				solve_congruence_brute_force(coeffs, mod)
+			end
+=begin
+			bm.report("C/force") do
+				CongruenceSolver.brute_force(coeffs, mod)
+			end
+=end
+			bm.report("C/lifting") do
+				CongruenceSolver.lift(coeffs, mod)
+			end
+		end
+
+		print "\n\n"
+end
+
+
+[SMALL_DEG_POLYNOMIAL_COEFFS, LARGE_DEG_POLYNOMIAL_COEFFS].each do |coeffs|
+	[SMALL_MOD, MED_MOD, LARGE_MOD, XTRA_LARGE_MOD, XTRA_LARGE_PRIME_MOD, SMALL_FACTORED_LARGE_MOD].each do |mod|
+		bm_solve_congruence(coeffs, mod)
+	end
+end

data/bin/csolve.rb

@@ -0,0 +1,54 @@
+#!/usr/bin/env ruby
+require 'congruence_solver'
+require "polynomial_interpreter"
+
+
+SOLVE_CONGRUENCE_BENCH_FILE = "../bench/solve_congruence_bm.rb"
+
+
+if ARGV.pop == "bench"
+	require_relative SOLVE_CONGRUENCE_BENCH_FILE
+	exit(0)
+end
+
+CONGRUENCE_FORMAT = "(lhs polynomial) = (rhs polynomial) mod (modulus)"
+CONGRUENCE_INVALID_MSG = "Congruence invalid: congruences must be of form:\n#{CONGRUENCE_FORMAT}"
+POLYNOMIAL_FORMAT = "ax^b+cx^d...\n(integer coefficients, positive integer exponents, order irrelevant)"
+LHS_INVALID_MSG = "Left hand polynomial invalid: polynomials must be of form: #{POLYNOMIAL_FORMAT}"
+RHS_INVALID_MSG = "Right hand polynomial invalid: polynomials must be of form: #{POLYNOMIAL_FORMAT}"
+MOD_INVALID_MSG = "Mod invalid: modulus must be an integer greater than 2"
+
+puts "Congruence to solve:"
+
+begin
+	coeffs, mod = PolynomialInterpreter.read_congruence(STDIN.gets)
+rescue ArgumentError => e
+	if(e == PolynomialInterpreter::Errors::CONGRUENCE_INVALID)
+		STDERR.puts CONGRUENCE_INVALID_MSG
+		exit(1)
+
+	elsif(e == PolynomialInterpreter::Errors::LHS_POLYNOMIAL_INVALID)
+		STDERR.puts LHS_INVALID_MSG
+		exit(1)
+
+	elsif(e == PolynomialInterpreter::Errors::RHS_POLYNOMIAL_INVALID)
+		STDERR.puts RHS_INVALID_MSG
+		exit(1)
+
+	elsif(e == PolynomialInterpreter::Errors::MOD_INVALID)
+		STDERR.puts MOD_INVALID_MSG
+		exit(1)
+
+	else
+		raise e
+	end
+end
+
+solutions = CongruenceSolver.lift(coeffs, mod).sort
+
+if solutions.empty? 
+	puts "No solution."
+else
+	puts "Solutions:"
+	solutions.each_with_index {|sol, i| puts "(#{i}) #{sol}"}
+end

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/congruence_solver.gemspec

@@ -0,0 +1,33 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'congruence_solver/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "congruence_solver"
+  spec.version       = CongruenceSolver::VERSION
+  spec.authors       = ["lane"]
+  spec.email         = ["lane.barlow@gmail.com"]
+
+  spec.summary       = "A gem for solving polynomial congruences."
+  spec.description   = "Provides a class (CongruenceSolver) for finding the modular zeros of a 
+                          polynomial (given the coefficients and modulus) and a binary (csolve) to 
+                          to solve your congruences at the command line."
+  spec.homepage      = "https://github.com/laneb/congruence_solver"
+
+  spec.files         = `git ls-files`.split("\n")
+  spec.files        += `git submodule --quiet foreach pwd`.split("\n").map do |abs_dir|
+                          rel_dir = abs_dir.gsub(Dir::pwd, "")
+                          Dir::entries(rel_dir).select {|f| File::file? f}
+                        end.flatten
+  spec.bindir        = "bin"
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.extensions << "ext/congruence_solver/extconf.rb"
+
+  spec.add_development_dependency "bundler", "~> 1.10"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 2.4"
+  spec.add_development_dependency "rake-compiler", "~>0.9"
+end

data/ext/congruence_solver/extconf.rb

@@ -0,0 +1,4 @@
+require "mkmf"
+
+
+create_makefile "congruence_solver"

data/lib/congruence_solver/version.rb

@@ -0,0 +1,3 @@
+module CongruenceSolver
+  VERSION = "0.2.0"
+end

data/lib/congruence_solver.rb

@@ -0,0 +1,6 @@
+require "congruence_solver/version"
+require "congruence_solver/congruence_solver"
+
+module CongruenceSolver
+  # Your code goes here...
+end

data/lib/polynomial_interpreter.rb

@@ -0,0 +1,116 @@
+class PolynomialInterpreter
+	module Errors
+		POLYNOMIAL_INVALID = ArgumentError.new "polynomial invalid"
+		CONGRUENCE_INVALID = ArgumentError.new "congruence invalid"
+		LHS_POLYNOMIAL_INVALID = ArgumentError.new "lhs polynomial invalid"
+		RHS_POLYNOMIAL_INVALID = ArgumentError.new "rhs polynomial invalid"
+		MOD_INVALID = ArgumentError.new "mod invalid"
+	end
+
+
+	def self.read_congruence(input_congruence)
+		match_data = input_congruence.match(/^(.*)=(.*) +(?:mod +(.*)|\(mod +(.*)\))$/)
+
+		if match_data.nil? 
+			raise Errors::CONGRUENCE_INVALID 
+		end
+
+		lhs = match_data[1]
+		rhs = match_data[2]
+		mod = match_data[3] || match_data[4]
+
+		begin
+			lh_coeffs = read_coeffs(lhs.gsub(" ", ""))
+		rescue ArgumentError => e
+			if(e == Errors::POLYNOMIAL_INVALID)
+				raise Errors::LHS_POLYNOMIAL_INVALID
+			else
+				raise e
+			end
+		end
+
+		begin
+			rh_coeffs = read_coeffs(rhs.gsub(" ", ""))
+		rescue ArgumentError => e
+			if e == Errors::POLYNOMIAL_INVALID
+				raise Errors::RHS_POLYNOMIAL_INVALID
+			else
+				raise e
+			end
+		end
+
+		if mod !~ /\d+/ or mod.to_i < 2
+			raise Errors::MOD_INVALID
+		end
+
+		0.upto rh_coeffs.length-1 do |idx|
+			unless rh_coeffs[idx].nil?
+				lh_coeffs[idx] ||= 0
+				lh_coeffs[idx] -= rh_coeffs[idx]
+			end
+		end
+
+		[lh_coeffs, mod.to_i]
+	end
+
+	def self.read_coeffs(input_polynomial)
+		if input_polynomial == ""
+			raise Errors::POLYNOMIAL_INVALID
+		end
+
+		last_var = nil
+		coeffs = Array.new
+
+		loop do
+			input_polynomial.slice!(/^(\d+)\*?/)
+			match_data_coe = Regexp.last_match
+
+			input_polynomial.slice!(/^([a-zA-Z])(?:\^(\d+))?/)
+			match_data_exp = Regexp.last_match
+
+			if match_data_coe.nil? and match_data_exp.nil? 
+				raise ArgumentError, INVALID_POLYNOMIAL_MSG 
+			else 
+				if match_data_exp.nil?
+					coe = match_data_coe[1].to_i
+					exp = 0
+				else
+					unless last_var.nil? or last_var == match_data_exp[1]
+							raise Errors::POLYNOMIAL_INVALID
+					end
+
+					last_var = match_data_exp[1]
+
+					if match_data_coe.nil?
+						coe = 1
+					else
+						coe = match_data_coe[1].to_i
+					end
+						
+					if match_data_exp[2].nil?
+							exp = 1
+					else
+						exp = match_data_exp[2].to_i
+					end
+				end
+			end
+
+			coeffs[exp] ||= 0
+			coeffs[exp] += coe.to_i
+
+			break if input_polynomial.length == 0
+
+			op = input_polynomial.slice!(0)
+
+			unless op.match /[-+]/
+				raise Errors::POLYNOMIAL_INVALID
+			end
+		end
+
+		0.upto(coeffs.length-1) do |idx|
+			coeffs[idx] ||= 0
+		end
+
+		coeffs
+	end
+end

data/spec/congruence_solver_spec.rb

@@ -0,0 +1,38 @@
+require "congruence_solver"
+
+RSpec.describe CongruenceSolver do
+	describe "::lift" do
+		it "expects 3 arguments" do
+			expect {CongruenceSolver.lift()}.to raise_error ArgumentError
+			expect {CongruenceSolver.lift(0)}.to raise_error ArgumentError
+			expect {CongruenceSolver.lift([1,2], 3)}.not_to raise_error
+			expect {CongruenceSolver.lift([1], [1], nil)}.to raise_error ArgumentError
+		end
+
+
+		it "solves individual polynomial congruences defined by their coefficients and mod" do
+			coeffs = [-1, 0, 4]
+			mod = 5
+			expect(CongruenceSolver.lift(coeffs, mod).sort).to eq [2, 3]
+
+			coeffs = [-3, 4, 9]
+			mod = 49
+			expect(CongruenceSolver.lift(coeffs, mod).sort).to eq []
+
+			coeffs = [1, -4, 4]
+			mod = 5104
+			expect(CongruenceSolver.lift(coeffs, mod).sort).to eq []
+
+			coeffs = [4, -4, 1]
+			mod = 5104
+			expect(CongruenceSolver.lift(coeffs, mod).sort).to eq [2, 1278, 2554, 3830]
+
+			coeffs = Array.new(500, 0)
+			coeffs[0] = -1
+			coeffs[500] = 1
+			mod = 15
+			expect(CongruenceSolver.lift(coeffs, mod).sort).to eq [1, 2, 4, 7, 8, 11, 13, 14]
+		end
+
+	end
+end

data/spec/csolve_spec.rb

@@ -0,0 +1,89 @@
+require "polynomial_interpreter"
+
+RSpec.describe PolynomialInterpreter do
+	describe "::read_congruence" do
+		context "when input contains no '\='" do
+			it "raises an ArgumentError" do
+				not_congruence = "x^2 (mod 5)"
+				expect {PolynomialInterpreter.read_congruence not_congruence}.to raise_error ArgumentError, "congruence invalid"
+			end
+		end
+
+		context "when input contains no mod" do
+			it "raises an ArgumentError" do
+				not_congruence = "x^2 = 3"
+				expect {PolynomialInterpreter.read_congruence not_congruence}.to raise_error ArgumentError, "congruence invalid"
+			end
+		end
+
+		context "when input contains an invalid mod" do
+			it "raises an ArgumentError" do
+				not_congruence = "x = 5 (mod)"
+				expect {PolynomialInterpreter.read_congruence not_congruence}.to raise_error ArgumentError, "congruence invalid"
+			end
+		end
+
+		context "when lhs is empty" do
+			it "raises an ArgumentError" do
+				congruence = "= 3 (mod 4)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "lhs polynomial invalid"
+			end
+		end
+
+		context "when lhs contains invalid characters" do
+			it "raises an ArgumentError" do
+				congruence = "x! = 3 (mod 5)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "lhs polynomial invalid"
+			end
+		end
+
+		context "when lhs contains more than one distinct variables" do
+			it "raises an ArgumentError" do
+				congruence = "x^2 + y = 0 (mod 6)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "lhs polynomial invalid"
+			end
+		end
+
+		context "when lhs contains negative power" do
+			it "raises an ArgumentError" do
+				congruence = "x^-1 = 2 (mod 35)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "lhs polynomial invalid"
+			end
+		end
+
+		context "when rhs is empty" do
+			it "raises an ArgumentError" do
+				congruence = "x^3 = (mod 4)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "rhs polynomial invalid"
+			end
+		end
+
+		context "when rhs contains invalid characters" do
+			it "raises an ArgumentError" do
+				congruence = "3 = x! (mod 5)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "rhs polynomial invalid"
+			end
+		end
+
+		context "when rhs contains more than one distinct variables" do
+			it "raises an ArgumentError" do
+				congruence = "0 = x^2 + y (mod 6)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "rhs polynomial invalid"
+			end
+		end
+
+		context "when rhs contains negative power" do
+			it "raises an ArgumentError" do
+				congruence = "2 = x^-1 (mod 35)"
+				expect {PolynomialInterpreter.read_congruence congruence}.to raise_error ArgumentError, "rhs polynomial invalid"
+			end
+		end
+
+		context "when input is a valid polynomial congruence" do
+			it "formats congruence as a single polynomial congruent to 0" do
+				congruence = "45x^5 + 5 + 3x ^6 + 5x^2 + x + 3x^5=x^9 + 9 x (mod 16)"
+				expect( PolynomialInterpreter.read_congruence(congruence)).to eq [[-1, 0, 0, 3, 48, 0, 0, 5, -8, 5].reverse, 16]
+			end
+		end
+	end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,96 @@
+# This file was generated by the `rspec --init` command. Conventionally, all
+# specs live under a `spec` directory, which RSpec adds to the `$LOAD_PATH`.
+# The generated `.rspec` file contains `--require spec_helper` which will cause
+# this file to always be loaded, without a need to explicitly require it in any
+# files.
+#
+# Given that it is always loaded, you are encouraged to keep this file as
+# light-weight as possible. Requiring heavyweight dependencies from this file
+# will add to the boot time of your test suite on EVERY test run, even for an
+# individual file that may not need all of that loaded. Instead, consider making
+# a separate helper file that requires the additional dependencies and performs
+# the additional setup, and require it from the spec files that actually need
+# it.
+#
+# The `.rspec` file also contains a few flags that are not defaults but that
+# users commonly want.
+#
+# See http://rubydoc.info/gems/rspec-core/RSpec/Core/Configuration
+RSpec.configure do |config|
+  # rspec-expectations config goes here. You can use an alternate
+  # assertion/expectation library such as wrong or the stdlib/minitest
+  # assertions if you prefer.
+  config.expect_with :rspec do |expectations|
+    # This option will default to `true` in RSpec 4. It makes the `description`
+    # and `failure_message` of custom matchers include text for helper methods
+    # defined using `chain`, e.g.:
+    #     be_bigger_than(2).and_smaller_than(4).description
+    #     # => "be bigger than 2 and smaller than 4"
+    # ...rather than:
+    #     # => "be bigger than 2"
+    expectations.include_chain_clauses_in_custom_matcher_descriptions = true
+  end
+
+  # rspec-mocks config goes here. You can use an alternate test double
+  # library (such as bogus or mocha) by changing the `mock_with` option here.
+  config.mock_with :rspec do |mocks|
+    # Prevents you from mocking or stubbing a method that does not exist on
+    # a real object. This is generally recommended, and will default to
+    # `true` in RSpec 4.
+    mocks.verify_partial_doubles = true
+  end
+
+# The settings below are suggested to provide a good initial experience
+# with RSpec, but feel free to customize to your heart's content.
+=begin
+  # These two settings work together to allow you to limit a spec run
+  # to individual examples or groups you care about by tagging them with
+  # `:focus` metadata. When nothing is tagged with `:focus`, all examples
+  # get run.
+  config.filter_run :focus
+  config.run_all_when_everything_filtered = true
+
+  # Allows RSpec to persist some state between runs in order to support
+  # the `--only-failures` and `--next-failure` CLI options. We recommend
+  # you configure your source control system to ignore this file.
+  config.example_status_persistence_file_path = "spec/examples.txt"
+
+  # Limits the available syntax to the non-monkey patched syntax that is
+  # recommended. For more details, see:
+  #   - http://myronmars.to/n/dev-blog/2012/06/rspecs-new-expectation-syntax
+  #   - http://www.teaisaweso.me/blog/2013/05/27/rspecs-new-message-expectation-syntax/
+  #   - http://myronmars.to/n/dev-blog/2014/05/notable-changes-in-rspec-3#new__config_option_to_disable_rspeccore_monkey_patching
+  config.disable_monkey_patching!
+
+  # This setting enables warnings. It's recommended, but in some cases may
+  # be too noisy due to issues in dependencies.
+  config.warnings = true
+
+  # Many RSpec users commonly either run the entire suite or an individual
+  # file, and it's useful to allow more verbose output when running an
+  # individual spec file.
+  if config.files_to_run.one?
+    # Use the documentation formatter for detailed output,
+    # unless a formatter has already been configured
+    # (e.g. via a command-line flag).
+    config.default_formatter = 'doc'
+  end
+
+  # Print the 10 slowest examples and example groups at the
+  # end of the spec run, to help surface which specs are running
+  # particularly slow.
+  config.profile_examples = 10
+
+  # Run specs in random order to surface order dependencies. If you find an
+  # order dependency and want to debug it, you can fix the order by providing
+  # the seed, which is printed after each run.
+  #     --seed 1234
+  config.order = :random
+
+  # Seed global randomization in this process using the `--seed` CLI option.
+  # Setting this allows you to use `--seed` to deterministically reproduce
+  # test failures related to randomization by passing the same `--seed` value
+  # as the one that triggered the failure.
+  Kernel.srand config.seed
+=end
+end

metadata

@@ -0,0 +1,123 @@
+--- !ruby/object:Gem::Specification
+name: congruence_solver
+version: !ruby/object:Gem::Version
+  version: 0.2.0
+platform: ruby
+authors:
+- lane
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2016-01-31 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !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: '2.4'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.4'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.9'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.9'
+description: "Provides a class (CongruenceSolver) for finding the modular zeros of
+  a \n                          polynomial (given the coefficients and modulus) and
+  a binary (csolve) to \n                          to solve your congruences at the
+  command line."
+email:
+- lane.barlow@gmail.com
+executables:
+- csolve.rb
+- setup
+extensions:
+- ext/congruence_solver/extconf.rb
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".gitmodules"
+- ".rspec"
+- ".travis.yml"
+- README.md
+- Rakefile
+- bench/bench_tools.rb
+- bench/solve_congruence_bm.rb
+- bin/csolve.rb
+- bin/setup
+- congruence_solver.gemspec
+- ext/congruence_solver/extconf.rb
+- lib/congruence_solver.rb
+- lib/congruence_solver/version.rb
+- lib/polynomial_interpreter.rb
+- spec/congruence_solver_spec.rb
+- spec/csolve_spec.rb
+- spec/spec_helper.rb
+homepage: https://github.com/laneb/congruence_solver
+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.5
+signing_key: 
+specification_version: 4
+summary: A gem for solving polynomial congruences.
+test_files: []