comments

Author: TilmanNeumann

src/test/java/de/tilman_neumann/jml/primes/exact/TDivPrimeTestPerformanceTest.java

@@ -20,6 +20,14 @@
 
 import de.tilman_neumann.util.ConfigUtil;
 
+/**
+ * Compare performance of prime tests for N<2^31.
+ * 
+ * Currently fastest is LEMIRE_INT_TEST.isPrimeUnrolled(n).
+ * 
+ * But since there are just 105.097.565 primes < 2^31 (Integer.MAX_VALUE = 2^31 - 1 being the biggest)
+ * and 203.280.221 primes < 2^32, maybe soon we will simply store them and look then up...
+ */
 public class TDivPrimeTestPerformanceTest {
 	private static final Logger LOG = LogManager.getLogger(TDivPrimeTestPerformanceTest.class);
 

src/test/java/de/tilman_neumann/jml/primes/exact/TDivPrimeTestTest.java

@@ -22,6 +22,13 @@
 
 import de.tilman_neumann.util.ConfigUtil;
 
+/**
+ * Tests correctness of prime tests for N<2^31.
+ * 
+ * Comparing the results of (established reference algorithm) BARRETT_TEST.isPrime_v1(n) 
+ * with (currently fastest) LEMIRE_INT_TEST.isPrimeUnrolled(n)
+ * for all odd N<2^31 takes less than 10 minutes and shows no errors.
+ */
 public class TDivPrimeTestTest {
 	private static final Logger LOG = LogManager.getLogger(TDivPrimeTestTest.class);
 
@@ -42,7 +49,7 @@ public void testTDivPrimeTest() {
 		test(2565572);
 
 		// test many odd numbers
-		for (int n=3; n < 10000000; n+=2) {
+		for (int n=3; n <= 10000000 /* Integer.MAX_VALUE */; n+=2) {
 			test(n);
 		}