ruby-numtheory 0.0.9.1 → 0.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 5664624f001011ac200885754788be11cf9d987e
-  data.tar.gz: 677ca9f6744e113bbf8fee3e651adb55dabd37ff
+  metadata.gz: 8e863efa8ec92c5c6a67c5cc17df53c1355e0565
+  data.tar.gz: 0543e5d9d99b856c4442a95b91951999d9e0e134
 SHA512:
-  metadata.gz: 039d5fb674c11e4b2f43f55801b1c0922ab542a4a4a3b8454488a7f536ec4f64264f0190a3cfb329ff19e171b17b5db84a460ae1134f714bb6c220f621c0bf83
-  data.tar.gz: 52d719becb03e7531fe445206e47681a0dead1e26a8f084a9f317a9526658cdbb09c8a9fbfbe742190915d3e36aa461feee7be722f5391cf1e3aca238b787701
+  metadata.gz: 03b09382a59295c16333ccc73a368e8976072209a709773735752382478974d111beb12f1e225d2c370ee21f04ec2424db6d8508d8ebcc659f96a301d731cc72
+  data.tar.gz: 02295d8eda2029415b4de4f9c2b0ab2f50c34effc8bd0501a1cb40ec66aa3e8e1b04d4cfcf4ef1a54562427b9069c00a2e02a7b83544b009bbb04383878281b1

data/.travis.yml

@@ -4,3 +4,4 @@ rvm:
   - 2.0.0
   - 2.1.0
   - 2.2.0
+  - 2.4.0

data/Gemfile

@@ -1,8 +1,8 @@
 source "http://rubygems.org"
 
 group :development do
-  gem "rake", ">= 0.9"
-  gem "rspec", "~> 2.10.0"
+  gem "rake", ">= 12.0"
+  gem "rspec", "~> 3.5.0"
   gem "bundler", ">= 1.0.0"
   gem "rake-compiler"
 end

data/ext/numtheory/numtheory.c

@@ -99,7 +99,7 @@ Init_numtheory()
             numtheory_nextprime, 0);
     rb_define_method(rb_cInteger, "prime_division",
             numtheory_prime_division, 0);
-    rb_define_method(rb_cFixnum, "factorial",
+    rb_define_method(rb_cInteger, "factorial",
             numtheory_factorial_primeswing, 0);
     rb_define_method(rb_cInteger, "primes_upto",
             numtheory_primes_upto, 1);

data/ext/numtheory/reduce.c

@@ -12,7 +12,7 @@
           "adcl $0, %2    \n\t" :   \
           "=m"(c0), "=m"(c1), "=m"(c2) :    \
           "m"(c0), "m"(c1), "m"(c2), "m"(i), "m"(j) :     \
-          "%eax","%edx", "%cc");
+          "%eax","%edx", "cc");
 
 #define BITSPERDIG (SIZEOF_BDIGITS * CHAR_BIT)
 #define BIGRAD ((BDIGIT_DBL)1 << BITSPERDIG)

data/ruby-numtheory.gemspec

@@ -3,7 +3,7 @@ Gem::Specification.new do |gem|
   gem.homepage = "http://github.com/lomereiter/ruby-numtheory"
   gem.license = "MIT"
   gem.summary = "Ruby number theory library"
-  gem.version = "0.0.9.1"
+  gem.version = "0.1.0"
   gem.platform = Gem::Platform::RUBY
 
   gem.description = <<-EOF

data/spec/numtheory/arithmetic_functions_spec.rb

@@ -5,27 +5,27 @@ describe "arithmetic function" do
 
   describe "primepi" do
     it "should raise ArgumentError if there're not enough precomputed primes" do
-      expect { primepi(100_000_000_000) }.should raise_error
+      expect { primepi(100_000_000_000) }.to raise_error(ArgumentError)
     end
 
     it "should return the number of primes less or equal than a given number" do
-      primepi(1).should == 0
-      primepi(2).should == 1
-      primepi(123512).should == 11607
-      primepi(498765).should == 41438
-      primepi(312361).should == 26983
-      primepi(-123513).should == 0
+      expect(primepi(1)).to eq(0)
+      expect(primepi(2)).to eq(1)
+      expect(primepi(123512)).to eq(11607)
+      expect(primepi(498765)).to eq(41438)
+      expect(primepi(312361)).to eq(26983)
+      expect(primepi(-123513)).to eq(0)
     end
   end
 
   describe "eulerphi" do
     it "should raise ArgumentError if the number is zero" do
-      expect { eulerphi(0) }.should raise_error
+      expect { eulerphi(0) }.to raise_error(ArgumentError)
     end
 
     it "should return the number of positive integers less than 'n' and coprime with 'n'" do
-      eulerphi(12312361361).should == 11664342324
-      eulerphi(12361212371236123).should == 11713214239144000
+      expect(eulerphi(12312361361)).to eq(11664342324)
+      expect(eulerphi(12361212371236123)).to eq(11713214239144000)
     end
   end
 end

data/spec/numtheory/bit_function_spec.rb

@@ -3,30 +3,30 @@ require 'numtheory'
 describe "bit functions" do
   describe "popcount" do
     it "should return the number of bits set in a non-negative number" do
-      12351231231235091328209183029825132908123295012351.popcount.should == 84
-      82362346211236.popcount.should == 23
+      expect(12351231231235091328209183029825132908123295012351.popcount).to eq (84)
+      expect(82362346211236.popcount).to eq(23)
     end
 
     it "should raise ArgumentError for negative numbers" do
-      expect { (-5).popcount }.should raise_error
-      expect { (-112351235123512351235).popcount }.should raise_error
+      expect { (-5).popcount }.to raise_error(ArgumentError)
+      expect { (-112351235123512351235).popcount }.to raise_error(ArgumentError)
     end
   end
 
   describe "bitlength" do
     it "should return the length of a positive number in bits" do
-      123512351235125312.bitlength.should == 57
-      12355312.bitlength.should == 24
-      9123616312361235523462346311236136123123136212361.bitlength.should == 163
+      expect(123512351235125312.bitlength).to eq(57)
+      expect(12355312.bitlength).to eq(24)
+      expect(9123616312361235523462346311236136123123136212361.bitlength).to eq(163)
     end
 
     it "should return 1 when argument is 0" do
-      0.bitlength.should == 1
+      expect(0.bitlength).to eq(1)
     end
 
     it "should raise ArgumentError for negative numbers" do
-      expect { (-12351).bitlength }.should raise_error
-      expect { (-2039462306492384059132).bitlength }.should raise_error
+      expect { (-12351).bitlength }.to raise_error(ArgumentError)
+      expect { (-2039462306492384059132).bitlength }.to raise_error(ArgumentError)
     end
   end
 end

data/spec/numtheory/modular_arithmetic_spec.rb

@@ -4,61 +4,61 @@ describe "Z/pZ" do
 
   describe "modular inverse" do
     it "should raise ArgumentError if the inverse doesn't exist" do
-      expect { 3.inverse(1236123) }.should raise_error
-      expect { 636356661312236113261221231.inverse(71324141236123712312361347131) }.should raise_error
+      expect { 3.inverse(1236123) }.to raise_error(ArgumentError)
+      expect { 636356661312236113261221231.inverse(71324141236123712312361347131) }.to raise_error(ArgumentError)
     end
 
     it "should return the inverse modulo 'p' if it exists" do
-      170149610396103139612301.inverse(91023960139513512035130519351035).should == 47319168690720853552108144675271
-      10239613261.inverse(1713461351236).should == 1314959799745
-      61235.inverse(13271).should == 10552
+      expect(170149610396103139612301.inverse(91023960139513512035130519351035)).to eq(47319168690720853552108144675271)
+      expect(10239613261.inverse(1713461351236)).to eq(1314959799745)
+      expect(61235.inverse(13271)).to eq(10552)
     end
   end
 
   describe "jacobi symbol (a|n)" do
     it "should raise ArgumentError for negative 'n'" do
-      expect { 23.jacobi(-15) }.should raise_error
+      expect { 23.jacobi(-15) }.to raise_error(ArgumentError)
     end
 
     it "should raise ArgumentError for even 'n'" do
-      expect { 17.jacobi(24) }.should raise_error
+      expect { 17.jacobi(24) }.to raise_error(ArgumentError)
     end
 
     it "should return 0 when 'a' and 'n' have common divisors" do
-      25.jacobi(35).should be_zero
-      -24.jacobi(9).should be_zero
-      33.jacobi(3).should be_zero
-      128367169183989283691832619381.jacobi(1829631238193612396183612312361231123).should be_zero
+      expect(25.jacobi(35)).to be_zero
+      expect(-24.jacobi(9)).to be_zero
+      expect(33.jacobi(3)).to be_zero
+      expect(128367169183989283691832619381.jacobi(1829631238193612396183612312361231123)).to be_zero
     end
 
     it "should return 1 when 'a' is a square residue modulo 'n'" do
-      26.jacobi(25).should == 1
-      261235125312351.jacobi(251235123123512351).should == 1
-      123412354123123512351235123512455123.jacobi(12351231236123112351235123523513411).should == 1
+      expect(26.jacobi(25)).to eq(1)
+      expect(261235125312351.jacobi(251235123123512351)).to eq(1)
+      expect(123412354123123512351235123512455123.jacobi(12351231236123112351235123523513411)).to eq(1)
     end
 
     it "should return -1 in all the other cases" do
-      123412354123123512351235123512455123.jacobi(1235123123612311235123512352351341).should == -1
-      1386136123613661.jacobi(19381923138198391).should == -1
-      2.jacobi(5).should == -1
-      17.jacobi(23).should == -1
+      expect(123412354123123512351235123512455123.jacobi(1235123123612311235123512352351341)).to eq(-1)
+      expect(1386136123613661.jacobi(19381923138198391)).to eq(-1)
+      expect(2.jacobi(5)).to eq(-1)
+      expect(17.jacobi(23)).to eq(-1)
     end
   end
 
   describe "square root" do
 
     it "should raise ArgumentError if 'p' is not a prime number" do
-      expect { 7.sqrt_mod(9)}.should raise_error
+      expect { 7.sqrt_mod(9)}.to raise_error(ArgumentError)
     end
 
     it "should return nil if there is no square root" do
-      33.sqrt_mod(3).should be_nil
-      1231356123521351251.sqrt_mod(123061236013903516123121612316123612379).should be_nil
+      expect(33.sqrt_mod(3)).to be_nil
+      expect(1231356123521351251.sqrt_mod(123061236013903516123121612316123612379)).to be_nil
     end
 
     it "should otherwise return the square root from range [0 .. p/2]" do
-      1235112351311.sqrt_mod(123061936032513553).should == 20377270042474840
-      910836013912301293612035135.sqrt_mod(45734753461235122313131523613612412341612361691).should == 17194653522779996910096883279884862754880186510
+      expect(1235112351311.sqrt_mod(123061936032513553)).to eq(20377270042474840)
+      expect(910836013912301293612035135.sqrt_mod(45734753461235122313131523613612412341612361691)).to eq(17194653522779996910096883279884862754880186510)
     end
   end
 end

data/spec/numtheory/primality_tests_spec.rb

@@ -1,31 +1,25 @@
 require 'numtheory'
 
-RSpec.configure do |config|
-  config.expect_with :rspec do |c|
-    c.syntax = [:should]
-  end
-end
-
 describe "primality tests" do
   
   describe "prime? method" do
     it "should return exact result for precomputed values" do
-      0.should_not be_prime
-      1.should_not be_prime
-      2.should be_prime
-      3.should be_prime
-      9.should_not be_prime
-      -1.should_not be_prime
-      -2.should be_prime
-      -13.should be_prime
-      -16.should_not be_prime
+      expect(0).not_to be_prime
+      expect(1).not_to be_prime
+      expect(2).to be_prime
+      expect(3).to be_prime
+      expect(9).not_to be_prime
+      expect(-1).not_to be_prime
+      expect(-2).to be_prime
+      expect(-13).to be_prime
+      expect(-16).not_to be_prime
     end
 
     it "should apply BPSW test for larger values" do
-      12351236123627.should_not be_prime
-      12351236123659.should be_prime
-      12351236123627123612361235012532906135124234123512356123512342219.should_not be_prime
-      12351236123627123612361235012532906135124234123512356123512342221.should be_prime
+      expect(12351236123627).not_to be_prime
+      expect(12351236123659).to be_prime
+      expect(12351236123627123612361235012532906135124234123512356123512342219).not_to be_prime
+      expect(12351236123627123612361235012532906135124234123512356123512342221).to be_prime
     end
 
     it "should return true for BPSW pseudoprimes" do
@@ -38,13 +32,13 @@ describe "primality tests" do
       NumTheory.module_eval { remove_const :PrimalityTests }
       NumTheory::PrimalityTests = 1
       srand(100) # MR test uses random base to start
-      671.should be_MR_pseudoprime
-      671.should_not be_BPSW_pseudoprime
+      expect(671).to be_MR_pseudoprime
+      expect(671).not_to be_BPSW_pseudoprime
 
       NumTheory.module_eval { remove_const :PrimalityTests }
       NumTheory::PrimalityTests = 10
       srand(42)
-      671.should_not be_MR_pseudoprime
+      expect(671).not_to be_MR_pseudoprime
     end
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby-numtheory
 version: !ruby/object:Gem::Version
-  version: 0.0.9.1
+  version: 0.1.0
 platform: ruby
 authors:
 - Artem Tarasov
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-09-26 00:00:00.000000000 Z
+date: 2017-03-07 00:00:00.000000000 Z
 dependencies: []
 description: |2
       The library is written as C extension and aims to provide
@@ -64,7 +64,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.5
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
 summary: Ruby number theory library