primes-utils 1.0.5 → 1.0.6

data/README.md

@@ -40,7 +40,7 @@ Miller-Rabin here is super fast, but probabilistic (not deterministic), primalit
 https://en.wikipedia.org/wiki/Miller-Rabin_primality_test
 The method's reliability can be increased by increasing the default input parameter of k=20.
 ```
-1111111111111111111.primemr?  => true
+1111111111111111111.primemr? => true
 1111111111111111111.primemr? 50  => true
 1111111111111111111.primemr?(50) => true
 11111111111111111111.primemr? => false
@@ -53,11 +53,11 @@ Determine the prime factorization of the absolute value of an integer.
 This replaces the `prime division` method in the `prime.rb` standard library.
 Returns an array of arrays of factors and exponents: [[2,4],[3,2],[5,1]] => (2^4)(3^2)(5^1) = (16)(9)(5) = 720
 Default Strictly Prime (SP) Prime Generator (PG) used here is P13.
-Can change SP PG used on input.  Acceptable range are primes from 3 - 19.
+Can change SP PG used on input. Acceptable primes range: [3 - 19].
 ```
 1111111111111111111.prime_division => [[1111111111111111111, 1]]
 11111111111111111111.prime_division  => [[11, 1], [41, 1], [101, 1], [271, 1], [3541, 1], [9091, 1], [27961, 1]]
-123456789.factors  => [[3, 2], [3607, 1], [3803, 1]]
+123456789.factors => [[3, 2], [3607, 1], [3803, 1]]
 123456789.factors 17 => [[3, 2], [3607, 1], [3803, 1]]
 123456789.factors(17) => [[3, 2], [3607, 1], [3803, 1]]
 -12345678.factors => [[2, 1], [3, 2], [47, 1], [14593, 1]]
@@ -65,30 +65,32 @@ Can change SP PG used on input.  Acceptable range are primes from 3 - 19.
 1.factors => []
 ```
 **primes(start_num=0)**
-Create an array of primes from the range start_num - end_num.
-The order of the range doesn't matter if both given:   start.primes end  <=> end.prime start
+Create an array of primes from the absolute value range (|start_num| - |end_num|).
+The order of the range doesn't matter if both given: start.primes end  <=> end.prime start
 If only one parameter used, then all the primes upto that number will be returned.
 ```
-50.primes  => [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
-50.primes 125  => [53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113]
-300.primes 250  => [251, 257, 263, 269, 271, 277, 281, 283, 293]
-541.primes.size  => 100
-1000.primes(5000).size  => 501
-(prms = 1000000.primes(1000100)).size  => 6
-prms.size  => 6
-prms  => [1000003, 1000033, 1000037, 1000039, 1000081, 1000099]
+50.primes => [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
+50.primes 125 => [53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113]
+300.primes 250 => [251, 257, 263, 269, 271, 277, 281, 283, 293]
+541.primes.size => 100
+1000.primes(5000).size => 501
+(prms = 1000000.primes(1000100)).size => 6
+prms.size => 6
+prms => [1000003, 1000033, 1000037, 1000039, 1000081, 1000099]
 -10.primes -50  => [11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
+0.primes => []
+1.primes => []
 ```
 **primenth(p=11) or nthprime(p=11)**
 Return the value of the nth (absolute value) prime.
 Default Strictly Prime (SP) Prime Generator (PG) used here is P11.
-Can change SP PG used on input.  Acceptable range are primes from 3 - 19.
+Can change SP PG used on input. Acceptable primes range: [3 - 19].
 ```
-1000000.primenth  => 15485863
-1500000.nthprime  => 23879519
-2000000.nthprime 13  => 32452843
--500000.nthprime  => 7368787
-0.nthprime  => 0
+1000000.primenth => 15485863
+1500000.nthprime => 23879519
+2000000.nthprime 13 => 32452843l
+-500000.nthprime => 7368787
+0.nthprime => 0
 ```
 ## Coding Implementations
 The methods `primemr`, `nthprime/primenth`, and `primes` are coded in pure ruby.

data/lib/primes/utils.rb

@@ -40,7 +40,7 @@ module Primes
                        47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103,
                        107, 109, 113, 127, 131, 137, 139, 149, 151, 157,163,
                        167, 173, 179, 181, 191, 193, 197, 199, 211].include? n
-        return false if not residues.include?(n%mod) || n == 1
+        return false if !residues.include?(n%mod) or n == 1
 
         sqrtN = Math.sqrt(n).to_i
         p=11          # first test prime pj
@@ -160,7 +160,7 @@ module Primes
       # If start_num > self, values are switched to continue
       # Output is an array of the primes within the given range
       # To find count of these primes do: end_num.primes(start_num).size
-      # This method uses the P13 Strictly Prime (SP) Prime Generator
+      # This method uses the P13 Strictly Prime (SP) Prime Generator (PG)
 
       num = self.abs;  start_num = start_num.abs
       num, start_num = start_num, num  if start_num > num
@@ -205,8 +205,8 @@ module Primes
       primes = start_num <= plast ? primes.drop_while {|p| p < start_num} : []
       k = (start_num-2).abs/mod  # start_num's residue group value
       modk = mod*k               # start_num's mod group value
-      m = rescnt*k               # number of prms elements upto kth resgroup
-      r = 0                      # begin process at start of resgroup
+      m = rescnt*k               # number of prms elements up to kth resgroup
+      r = 0                      # begin processing at start of resgroup
       while m < maxprms
         r +=1; if r > rescnt; r=1; modk +=mod end
         if prms[m]

data/lib/primes/utils/version.rb

@@ -1,5 +1,5 @@
 module Primes
   module Utils
-    VERSION = "1.0.5"
+    VERSION = "1.0.6"
   end
 end

metadata

@@ -1,51 +1,63 @@
---- !ruby/object:Gem::Specification
+--- !ruby/object:Gem::Specification 
 name: primes-utils
-version: !ruby/object:Gem::Version
-  version: 1.0.5
+version: !ruby/object:Gem::Version 
+  hash: 27
+  prerelease: 
+  segments: 
+  - 1
+  - 0
+  - 6
+  version: 1.0.6
 platform: ruby
-authors:
+authors: 
 - Jabari Zakiya
-autorequire:
+autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-04-03 00:00:00.000000000 Z
-dependencies:
-- !ruby/object:Gem::Dependency
+
+date: 2015-04-03 00:00:00 Z
+dependencies: 
+- !ruby/object:Gem::Dependency 
   name: bundler
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '1.9'
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '1.9'
   prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        hash: 29
+        segments: 
+        - 1
+        - 9
+        version: "1.9"
   type: :development
-- !ruby/object:Gem::Dependency
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
   name: rake
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '10.0'
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '10.0'
   prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        hash: 35
+        segments: 
+        - 10
+        - 0
+        version: "10.0"
   type: :development
-description: 'Methods: prime?, primemr?, primes, nthprime/primenth, factors/prime_division'
-email:
+  version_requirements: *id002
+description: "Methods: prime?, primemr?, primes, nthprime/primenth, factors/prime_division"
+email: 
 - jzakiya@gmail.com
 executables: []
+
 extensions: []
+
 extra_rdoc_files: []
-files:
-- ".gitignore"
+
+files: 
+- .gitignore
 - CODE_OF_CONDUCT.md
 - Gemfile
 - README.md
@@ -57,26 +69,36 @@ files:
 - primes-utils.gemspec
 homepage: https://github.com/jzakiya/primes-utils
 licenses: []
-metadata: {}
-post_install_message:
+
+post_install_message: 
 rdoc_options: []
-require_paths:
+
+require_paths: 
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement
-  requirements:
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
   - - ">="
-    - !ruby/object:Gem::Version
-      version: '0'
-required_rubygems_version: !ruby/object:Gem::Requirement
-  requirements:
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
   - - ">="
-    - !ruby/object:Gem::Version
-      version: '0'
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
 requirements: []
-rubyforge_project:
-rubygems_version: 2.4.5
-signing_key:
-specification_version: 4
+
+rubyforge_project: 
+rubygems_version: 1.8.25
+signing_key: 
+specification_version: 3
 summary: suite of extremely fast utility methods for testing and generating primes
 test_files: []
-has_rdoc:
+

checksums.yaml

@@ -1,7 +0,0 @@
----
-SHA1:
-  metadata.gz: 18a37c98fc792d7d1aa0097b9e638866423ceeba
-  data.tar.gz: b20fe5ee45d3d9f9d7d4ead6e5adc9e390cd066f
-SHA512:
-  metadata.gz: 9c3cb7bfa4e8fe537b56fcf13dcfad505802637537612fe601b75a0214eb0727e80c23f008d7785b7a180a08d8d52841cb8e9de913c465a015d26561ed2e4172
-  data.tar.gz: fafd267291075190e65fb8250f133c37002aa6a503ef0c230c83acc03c529136ff26689ce4afa99400ef7251d081895bb7e12149946d812641217c0356a210f4