Divisor-Cycle Cache Rework

PerfectNumbers.Core.Tests/EulerPrimeTesterTests.cs

@@ -1,22 +0,0 @@
-using FluentAssertions;
-using Xunit;
-
-namespace PerfectNumbers.Core.Tests;
-
-[Trait("Category", "Fast")]
-public class EulerPrimeTesterTests
-{
-    private readonly EulerPrimeTester _tester = new(new PrimeTester());
-
-    [Theory]
-    [InlineData(13UL, true)]
-    [InlineData(29UL, true)]
-    [InlineData(3UL, false)]
-    [InlineData(21UL, false)]
-    [InlineData(1UL, false)]
-    public void IsEulerPrime_returns_expected(ulong n, bool expected)
-    {
-        _tester.IsEulerPrime(n).Should().Be(expected);
-    }
-}
-

PerfectNumbers.Core.Tests/MersenneNumberDivisorGpuTesterTests.cs

@@ -110,7 +110,6 @@ public class MersenneNumberDivisorGpuTesterTests
     {
         var tester = new MersenneNumberDivisorByDivisorGpuTester
         {
-            UseDivisorCycles = true,
             GpuBatchSize = 8,
         };
 
@@ -147,7 +146,6 @@ public class MersenneNumberDivisorGpuTesterTests
     {
         var tester = new MersenneNumberDivisorByDivisorGpuTester
         {
-            UseDivisorCycles = true,
             GpuBatchSize = 2,
         };
 
@@ -169,7 +167,6 @@ public class MersenneNumberDivisorGpuTesterTests
     {
         var tester = new MersenneNumberDivisorByDivisorCpuTester
         {
-            UseDivisorCycles = true,
             BatchSize = 2,
         };