Debug thread range

Author: WrathfulSpatula

FindAFactor/_find_a_factor.cpp

@@ -824,9 +824,9 @@ struct Factorizer {
       BigInteger perfectSquare = 1U;
       std::vector<size_t> fv(primes.size(), 0);
       while (perfectSquare < toFactor) {
-        const BigInteger bIndex = threadOffset + (dis(gen) % threadRange);
-        const BigInteger halfBIndex = batchOffset + (bIndex >> 1U) + 1U;
-        const BigInteger bNum = (bIndex & 1U) ? batchTotal - halfBIndex : halfBIndex;
+        const BigInteger bIndex = dis(gen) % threadRange;
+        const BigInteger halfBIndex = threadOffset + (bIndex >> 1U) + 1U;
+        const BigInteger bNum = (bIndex & 1U) ? halfBIndex : (batchTotal - halfBIndex);
         BigInteger n = forwardFn((bNum * wheelEntryCount) + (dis(gen) % wheelEntryCount));
         const std::vector<size_t> pfv = factorizationVector(&n);
         if (!pfv.size()) {

pyproject.toml

@@ -8,7 +8,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "FindAFactor"
-version = "4.7.5"
+version = "4.7.6"
 requires-python = ">=3.8"
 description = "Find any nontrivial factor of a number"
 readme = {file = "README.txt", content-type = "text/markdown"}

setup.py

@@ -40,7 +40,7 @@ def build_extension(self, ext):
 
 setup(
     name='FindAFactor',
-    version='4.7.5',
+    version='4.7.6',
     author='Dan Strano',
     author_email='stranoj@gmail.com',
     description='Find any nontrivial factor of a number',