mlemanczyk/even-perfect-numbers-scanner
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge branch 'codex/analyze-gc-instances-in-checkdivisors-method' of https://github.com/mlemanczyk/even-perfect-numbers-scanner into codex/analyze-gc-instances-in-checkdivisors-method

Browse Source
This commit is contained in:
mlemanczyk committed 2025-10-17 01:24:44 +02:00
2 parents d6a1fa0b51 26894db181
commit 06b08708d9
1 file changed
+37 -31
Download Patch File Download Diff File Expand all files Collapse all files
PerfectNumbers.Core/PrimeOrderCalculator.cs
+37 -31
View File
@@ -852,44 +852,50 @@ internal static partial class PrimeOrderCalculator
compositeStack.Push(remaining);
pending.Clear();
long timestamp = 0L;
while (compositeStack.Count > 0)
bool pollardRhoDeadlineReached = Stopwatch.GetTimestamp() > deadlineTimestamp;
if (!pollardRhoDeadlineReached)
{
ulong composite = compositeStack.Pop();
// composite will never be smaller than 1 on the execution path
// if (composite <= 1UL)
// {
// continue;
// }
if (!cache.TryGetValue(composite, out bool isPrime))
while (compositeStack.Count > 0)
{
isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(composite);
cache.Add(composite, isPrime);
ulong composite = compositeStack.Pop();
// composite will never be smaller than 1 on the execution path
// if (composite <= 1UL)
// {
// continue;
// }
if (!cache.TryGetValue(composite, out bool isPrime))
{
isPrime = Open.Numeric.Primes.Prime.Numbers.IsPrime(composite);
cache.Add(composite, isPrime);
}
if (isPrime)
{
AddFactorToCollector(ref useDictionary, ref counts, primeSlots, exponentSlots, ref factorCount, composite, 1);
continue;
}
if (!TryPollardRho(composite, deadlineTimestamp, out ulong factor))
{
pending.Add(composite);
continue;
}
ulong quotient = composite / factor;
compositeStack.Push(factor);
compositeStack.Push(quotient);
}
if (isPrime)
{
AddFactorToCollector(ref useDictionary, ref counts, primeSlots, exponentSlots, ref factorCount, composite, 1);
continue;
}
pollardRhoDeadlineReached = Stopwatch.GetTimestamp() > deadlineTimestamp;
}
timestamp = Stopwatch.GetTimestamp();
if (timestamp > deadlineTimestamp)
if (pollardRhoDeadlineReached)
{
while (compositeStack.Count > 0)
{
pending.Add(composite);
continue;
pending.Add(compositeStack.Pop());
}
if (!TryPollardRho(composite, deadlineTimestamp, out ulong factor))
{
pending.Add(composite);
continue;
}
ulong quotient = composite / factor;
compositeStack.Push(factor);
compositeStack.Push(quotient);
}
}