faster_prime 1.0.0 → 1.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 1ed371cae61edc695a59c5054e619ea5ad4e9db55aedd020f4f0cb4ecd5a2d0c
-  data.tar.gz: b2bd47bf86e05d018bd526b91dd0b95e2a3b250fb3e7ea206acebd14179b1fd4
+  metadata.gz: dc920ccbdf79248776827937fc3e6c8e346e206a50b7849e182037ff5b5659ca
+  data.tar.gz: 36f8dc82146711ab31305c6e4ec0ae0fdbc2208f15bf3dd222a00cf2b635db37
 SHA512:
-  metadata.gz: f7afb2a310eba71bcbbb296677265546b79f6528913ccff47cdfaca9377b482728f8949b3bdb62be085b69bb66fa38dffae0496689ef6447fde66f4c2d0d3c18
-  data.tar.gz: a2353577ac4598150a9edf176f7590ab8d7875236ab284bf16f7876fb581c9d2fdfeb63d43bdb67a29e64d7efc6352def2ed5798d883051e66f390468259728a
+  metadata.gz: fab8571c17be17bb574d08500faa1311707537831a3f6e6582629d8d4d6428803645816d87f34d91fccfbf0ff3a8bc92c73008dfa97e77821f5c7460d34e25e0
+  data.tar.gz: d10a6daeef8b85767dd7d0cbd30ade4b4fed52e47a63a5dd3de2c1d3e988aa938d53ca7dc5e5db622ec40d25a3aaaca012b8e118709c7985ef8223b76ec6cff2

data/Gemfile

@@ -1,5 +1,9 @@
 source "https://rubygems.org"
 
-git_source(:github) {|repo_name| "https://github.com/#{repo_name}" }
-
 gemspec
+
+group :development do
+  gem "rake"
+  gem "simplecov"
+  gem "minitest"
+end

data/README.md

@@ -8,6 +8,8 @@ This is an alternative implementation to the standard `lib/prime.rb`.  It is (al
 * Replace `require "prime"` with `require "faster_prime"`.
 * Replace `Prime` with `FasterPrime`.
 
+If you want to use this without the core extension, you can use `require "faster_prime/base"` and `FasterPrime.prime?(num)` instead of `Integer#prime?`.
+
 ## Benchmark
 
 ### `Integer#prime?`

data/faster_prime.gemspec

@@ -1,6 +1,4 @@
-lib = File.expand_path("../lib", __FILE__)
-$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require "faster_prime"
+require_relative "lib/faster_prime/version"
 
 Gem::Specification.new do |spec|
   spec.name          = "faster_prime"
@@ -18,7 +16,4 @@ Gem::Specification.new do |spec|
   spec.bindir        = "exe"
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
   spec.require_paths = ["lib"]
-
-  spec.add_development_dependency "bundler", "~> 1.16"
-  spec.add_development_dependency "rake", "~> 10.0"
 end

data/lib/faster_prime/base.rb

@@ -0,0 +1,44 @@
+require "faster_prime/version"
+require "faster_prime/utils"
+require "faster_prime/primality_test"
+require "faster_prime/prime_factorization"
+require "faster_prime/sieve"
+require "faster_prime/core_ext"
+
+module FasterPrime
+  module Core
+    include Enumerable
+
+    class SuccEnumerator < Enumerator
+      alias succ next
+    end
+
+    def each(ubound = nil, &block)
+      return SuccEnumerator.new(Float::INFINITY) do |y|
+        Sieve.each(ubound) {|p| y << p }
+      end unless block_given?
+
+      Sieve.each(ubound, &block)
+    end
+
+    def prime?(n)
+      raise ArgumentError, "Expected an integer, got #{ n }" unless n.respond_to?(:integer?) && n.integer?
+      PrimalityTest.prime?(n)
+    end
+
+    def prime_division(n)
+      PrimeFactorization.prime_factorization(n).to_a
+    end
+
+    def int_from_prime_division(pd)
+      pd.inject(1) {|v, (p, e)| v * (p ** e) }
+    end
+  end
+
+  def self.instance
+    self
+  end
+
+  include Core
+  extend Core
+end

data/lib/faster_prime/primality_test.rb

@@ -75,18 +75,18 @@ module FasterPrime
       #
       # (1) simplest
       #
-      #   Leonhard::APRCL.prime?(N) #=> true or false
+      #   APRCL.prime?(N) #=> true or false
       #
       # (2) reuse-table
       #
-      #   aprcl = Leonhard::APRCL.new(B)
+      #   aprcl = APRCL.new(B)
       #   aprcl.prime?(N1) #=> true or false
       #   aprcl.prime?(N2) #=> true or false
       #   aprcl.bound #=> upper bound (>= B)
       #
       # (3) manual-t (for test or debug)
       #
-      #   aprcl = Leonhard::APRCP.new(B)
+      #   aprcl = APRCP.new(B)
       #   aprcl.set_t(t)
       #   aprcl.prime?(N) #=> true or false
 

data/lib/faster_prime/sieve.rb

@@ -25,7 +25,10 @@ module FasterPrime
 
     def each(ubound = nil, &blk)
       if ubound && SMALL_PRIMES.last >= ubound
-        SMALL_PRIMES.each(&blk)
+        SMALL_PRIMES.each do |n|
+          break if n > ubound
+          yield n
+        end
         return
       end
 

data/lib/faster_prime/version.rb

@@ -0,0 +1,3 @@
+module FasterPrime
+  VERSION = "1.0.2"
+end

data/lib/faster_prime.rb

@@ -1,45 +1,2 @@
-require "faster_prime/utils"
-require "faster_prime/primality_test"
-require "faster_prime/prime_factorization"
-require "faster_prime/sieve"
+require "faster_prime/base"
 require "faster_prime/core_ext"
-
-module FasterPrime
-  VERSION = "1.0.0"
-
-  module Core
-    include Enumerable
-
-    class SuccEnumerator < Enumerator
-      alias succ next
-    end
-
-    def each(ubound = nil, &block)
-      return SuccEnumerator.new(Float::INFINITY) do |y|
-        Sieve.each(ubound) {|p| y << p }
-      end unless block_given?
-
-      Sieve.each(ubound, &block)
-    end
-
-    def prime?(n)
-      raise ArgumentError, "Expected an integer, got #{ n }" unless n.respond_to?(:integer?) && n.integer?
-      PrimalityTest.prime?(n)
-    end
-
-    def prime_division(n)
-      PrimeFactorization.prime_factorization(n).to_a
-    end
-
-    def int_from_prime_division(pd)
-      pd.inject(1) {|v, (p, e)| v * (p ** e) }
-    end
-  end
-
-  def self.instance
-    self
-  end
-
-  include Core
-  extend Core
-end

metadata

@@ -1,43 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: faster_prime
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.0.2
 platform: ruby
 authors:
 - Yusuke Endoh
-autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-01-25 00:00:00.000000000 Z
-dependencies:
-- !ruby/object:Gem::Dependency
-  name: bundler
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '1.16'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '1.16'
-- !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'
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies: []
 description: This provides `Integer#prime?`, `Integer#prime_division`, and `Prime#each`
   that are almost compatible to and faster than `lib/prime.rb`.
 email:
@@ -52,15 +23,16 @@ files:
 - Rakefile
 - faster_prime.gemspec
 - lib/faster_prime.rb
+- lib/faster_prime/base.rb
 - lib/faster_prime/core_ext.rb
 - lib/faster_prime/primality_test.rb
 - lib/faster_prime/prime_factorization.rb
 - lib/faster_prime/sieve.rb
 - lib/faster_prime/utils.rb
+- lib/faster_prime/version.rb
 homepage: https://github.com/mame/faster_prime
 licenses: []
 metadata: {}
-post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
@@ -75,9 +47,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.7.3
-signing_key: 
+rubygems_version: 3.7.0.dev
 specification_version: 4
 summary: A faster substitute for `lib/prime.rb`.
 test_files: []