quick-is-prime
Advanced tools
Comparing version 1.0.1 to 1.0.2
{ | ||
"name": "quick-is-prime", | ||
"version": "1.0.1", | ||
"version": "1.0.2", | ||
"description": "Test if a number is prime in constant time, using a cached Sieve of Eratosthenes.", | ||
@@ -5,0 +5,0 @@ "main": "index.js", |
@@ -5,3 +5,3 @@ # quick-is-prime | ||
Test if a number is prime in constant time, using a cached Sieve of Eratosthenes. | ||
Test if a number is prime in constant time, using a cached Sieve of Eratosthenes. This is especially helpful to test many numbers' primality. | ||
@@ -32,4 +32,4 @@ ## Install | ||
This module uses a cached Sieve of Eratosthenes for constant time lookup. A new one will be automatically generated if the prime is larger than the current cached sieve. | ||
This module uses a cached Sieve of Eratosthenes for constant time lookup. A new one will be automatically generated if the number you're testing is larger than the currently cached sieve's upper bound. | ||
For best results, check primes highest to lowest. Alternatively, if you know what the upper-bound will be, you can just check that first and then not be concerned with the order. | ||
**For best results**, check primes highest to lowest. Or alternatively, if you know what the upper bound will be, just check that first to not be concerned with the order. |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
2148