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

Search limit for divisor sets made configurable

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-09-11 18:41:18 +02:00
1 parent a63bc6ac06
commit 1b1697d4da
2 files changed
+5 -5
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

EvenPerfectBitScanner.Tests/ProgramTests.cs
+2 -2
View File
@@ -88,8 +88,8 @@ public class ProgramTests
try
{
Program.IsEvenPerfectCandidate(11UL).Should().BeFalse();
Program.IsEvenPerfectCandidate(5UL).Should().BeTrue();
Program.IsEvenPerfectCandidate(11UL, 32).Should().BeFalse();
Program.IsEvenPerfectCandidate(5UL, 32).Should().BeTrue();
}
finally
{
EvenPerfectBitScanner/Program.cs
+3 -3
View File
@@ -623,7 +623,7 @@ internal static class Program
Console.WriteLine($"Testing {p}");
}
bool isPerfect = IsEvenPerfectCandidate(p, out bool searchedMersenne, out bool detailedCheck);
bool isPerfect = IsEvenPerfectCandidate(p, divisorCyclesSearchLimit, out bool searchedMersenne, out bool detailedCheck);
PrintResult(p, searchedMersenne, detailedCheck, isPerfect);
}
}
@@ -949,9 +949,9 @@ internal static class Program
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
internal static bool IsEvenPerfectCandidate(ulong p)
internal static bool IsEvenPerfectCandidate(ulong p, int divisorCyclesSearchLimit)
{
return IsEvenPerfectCandidate(p, out _, out _);
return IsEvenPerfectCandidate(p, divisorCyclesSearchLimit, out _, out _);
}
internal static bool IsEvenPerfectCandidate(ulong p, int divisorCyclesSearchLimit, out bool searchedMersenne, out bool detailedCheck)