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

Implement GPU pow2 heuristics with safe fallbacks

Browse Source
This commit is contained in:
Marek Lemańczyk committed 2025-10-04 22:40:12 +02:00
1 parent ea08d3f71f
commit 38df505f4f
5 files changed
+123 -50
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core.Tests/Gpu/PrimeOrderGpuHeuristicsTests.cs
+9 -9
View File
@@ -35,12 +35,12 @@ public class PrimeOrderGpuHeuristicsTests
}
[Fact]
public void TryPow2Mod_returns_unavailable_for_unmarked_prime()
public void TryPow2Mod_returns_success_for_supported_prime()
{
GpuPow2ModStatus status = PrimeOrderGpuHeuristics.TryPow2Mod(1UL, 193UL, out ulong remainder);
status.Should().Be(GpuPow2ModStatus.Unavailable);
remainder.Should().Be(0UL);
status.Should().Be(GpuPow2ModStatus.Success);
remainder.Should().Be(2UL);
}
[Fact]
@@ -76,8 +76,8 @@ public class PrimeOrderGpuHeuristicsTests
remainder.Should().Be(0UL);
GpuPow2ModStatus followUp = PrimeOrderGpuHeuristics.TryPow2Mod(4UL, 193UL, out ulong followUpRemainder);
followUp.Should().Be(GpuPow2ModStatus.Unavailable);
followUpRemainder.Should().Be(0UL);
followUp.Should().Be(GpuPow2ModStatus.Success);
followUpRemainder.Should().Be(16UL);
}
finally
{
@@ -108,15 +108,15 @@ public class PrimeOrderGpuHeuristicsTests
}
[Fact]
public void TryPow2ModBatch_returns_unavailable_and_clears_remainders_for_unmarked_prime()
public void TryPow2ModBatch_returns_success_for_supported_prime()
{
ulong[] remainders = { 123UL, 456UL };
ulong[] exponents = { 1UL, 2UL };
GpuPow2ModStatus status = PrimeOrderGpuHeuristics.TryPow2ModBatch(exponents, 257UL, remainders);
status.Should().Be(GpuPow2ModStatus.Unavailable);
remainders[0].Should().Be(0UL);
remainders[1].Should().Be(0UL);
status.Should().Be(GpuPow2ModStatus.Success);
remainders[0].Should().Be(2UL);
remainders[1].Should().Be(4UL);
}
[Fact]