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

Recording of failed heuristic cases turned off to speed up calculations

Browse Source
This commit is contained in:
mlemanczyk committed 2025-10-09 23:57:10 +02:00
1 parent 74e9e88977
commit b2ab47e0ee
2 files changed
+6 -6
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/PrimeOrderCalculator.Wide.cs
+3 -3
View File
@@ -79,7 +79,7 @@ internal static partial class PrimeOrderCalculator
PartialFactorResult128 phiFactors = PartialFactorWide(phi, config); PartialFactorResult128 phiFactors = PartialFactorWide(phi, config);
if (phiFactors.Factors is null) if (phiFactors.Factors is null)
{ {
HeuristicFailureLog.Record(prime, null, HeuristicFailureReason.PhiPartialFactorizationFailed); // HeuristicFailureLog.Record(prime, null, HeuristicFailureReason.PhiPartialFactorizationFailed);
return FinishStrictlyWide(prime, divisorData, config.Mode); return FinishStrictlyWide(prime, divisorData, config.Mode);
} }
@@ -109,7 +109,7 @@ internal static partial class PrimeOrderCalculator
if (config.Mode == PrimeOrderMode.Strict) if (config.Mode == PrimeOrderMode.Strict)
{ {
HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.StrictModeRequested); // HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.StrictModeRequested);
return FinishStrictlyWide(prime, divisorData, PrimeOrderMode.Strict); return FinishStrictlyWide(prime, divisorData, PrimeOrderMode.Strict);
} }
@@ -118,7 +118,7 @@ internal static partial class PrimeOrderCalculator
return new PrimeOrderResultWide(PrimeOrderStatus.Found, order); return new PrimeOrderResultWide(PrimeOrderStatus.Found, order);
} }
HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.HeuristicPipelineAssumedFullOrder); // HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.HeuristicPipelineAssumedFullOrder);
// The heuristic pipeline could not narrow the order any further; assume the current order is final. // The heuristic pipeline could not narrow the order any further; assume the current order is final.
return new PrimeOrderResultWide(PrimeOrderStatus.Found, candidateOrder); return new PrimeOrderResultWide(PrimeOrderStatus.Found, candidateOrder);
} }
PerfectNumbers.Core/PrimeOrderCalculator.cs
+3 -3
View File
@@ -194,7 +194,7 @@ internal static partial class PrimeOrderCalculator
if (phiFactors.Factors is null) if (phiFactors.Factors is null)
{ {
// DebugLog("No factors found"); // DebugLog("No factors found");
HeuristicFailureLog.Record(prime, null, HeuristicFailureReason.PhiPartialFactorizationFailed); // HeuristicFailureLog.Record(prime, null, HeuristicFailureReason.PhiPartialFactorizationFailed);
return FinishStrictly(prime, divisorData, config.Mode); return FinishStrictly(prime, divisorData, config.Mode);
} }
@@ -227,7 +227,7 @@ internal static partial class PrimeOrderCalculator
if (config.Mode == PrimeOrderMode.Strict) if (config.Mode == PrimeOrderMode.Strict)
{ {
HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.StrictModeRequested); // HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.StrictModeRequested);
return FinishStrictly(prime, divisorData, PrimeOrderMode.Strict); return FinishStrictly(prime, divisorData, PrimeOrderMode.Strict);
} }
@@ -237,7 +237,7 @@ internal static partial class PrimeOrderCalculator
} }
// DebugLog("Heuristic unresolved, assuming current order"); // DebugLog("Heuristic unresolved, assuming current order");
HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.HeuristicPipelineAssumedFullOrder); // HeuristicFailureLog.Record(prime, candidateOrder, HeuristicFailureReason.HeuristicPipelineAssumedFullOrder);
// The heuristic pipeline could not rule out additional divisors; assume the current order is final. // The heuristic pipeline could not rule out additional divisors; assume the current order is final.
return new PrimeOrderResult(PrimeOrderStatus.Found, candidateOrder); return new PrimeOrderResult(PrimeOrderStatus.Found, candidateOrder);
} }