Replaced old header

Author: jwood000

src/DivisorsContainer.cpp

@@ -1,9 +1,7 @@
 #include <Rcpp.h>
 #include <cmath>
 #include <libdivide.h>
-#include <PollardRho.h>
-
-const double Significand53 = 9007199254740991.0;
+#include <GetFacsUtils.h>
 
 template <typename typeInt>
 inline typeInt getStartingIndex (typeInt lowerB, typeInt step) {

src/PollardRho.cpp

@@ -1,10 +1,8 @@
 #include <Rcpp.h>
 #include <cmath>
 #include <algorithm>
-#include "PrimesPolRho.h"
-#include "PollardRho.h"
-
-const double Significand53 = 9007199254740991.0;
+#include <PrimesPolRho.h>
+#include <GetFacsUtils.h>
 
 /* Prove primality or run probabilistic tests.  */
 int FlagProvePrimality = 1;

src/PrimesContainer.cpp

@@ -2,8 +2,9 @@
 #include <cmath>
 #include <array>
 #include <libdivide.h>
-#include "PrimesSegSieve.h"
-#include "PhiTinyLookup.h"
+#include <PrimesSegSieve.h>
+#include <PhiTinyLookup.h>
+#include <GetFacsUtils.h>
 
 // "AllPrimesCpp" implements a simple segmented version of the
 // Sieve of Eratosthenes (original implementation authored by 
@@ -17,8 +18,6 @@
 // Kim Walisch's official github repo for "pi_legendre" is:
 //                      https://github.com/kimwalisch/primecount
 
-const double Significand53 = 9007199254740991.0;
-
 // This is the largest multiple of 2*3*5*7 = 210
 // that is less than 2^15 = 32768 = 32KB. This
 // is the typical size of most CPU's L1 cache