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

Restore CPU PrimeTester usage and rename fallback helpers

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-10-26 15:19:49 +01:00
1 parent ff1860a7b3
commit 43c7bafd5d
11 files changed
+1130 -1003
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/Gpu/MersenneNumberDivisorByDivisorGpuTester.cs
+4
View File
@@ -189,6 +189,7 @@ public sealed class MersenneNumberDivisorByDivisorGpuTester : IMersenneNumberDiv
processedCount = 0UL;
lastProcessed = 0UL;
// var enumerator = HeuristicPrimeTester.CreateMersenneDivisorEnumerator(prime, allowedMax);
var enumerator = PrimeTester.CreateMersenneDivisorEnumerator(prime, allowedMax);
Span<ulong> divisorSpan = divisors.AsSpan();
@@ -203,12 +204,15 @@ public sealed class MersenneNumberDivisorByDivisorGpuTester : IMersenneNumberDiv
int admissibleCount = 0;
int exponentIndex = 0;
// while (admissibleCount < batchCapacity && enumerator.TryGetNext(out HeuristicPrimeTester.HeuristicDivisorCandidate candidate))
while (admissibleCount < batchCapacity && enumerator.TryGetNext(out PrimeTester.HeuristicDivisorCandidate candidate))
{
processedCount = enumerator.ProcessedCount;
ulong divisorValue = candidate.Value;
// HeuristicPrimeTester.HeuristicDivisorPreparation preparation = HeuristicPrimeTester.PrepareHeuristicDivisor(in candidate);
PrimeTester.HeuristicDivisorPreparation preparation = PrimeTester.PrepareHeuristicDivisor(in candidate);
// ulong divisorCycle = HeuristicPrimeTester.ResolveHeuristicCycleLength(
ulong divisorCycle = PrimeTester.ResolveHeuristicCycleLength(
prime,
in preparation,