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

Various try-out changes

Browse Source
This commit is contained in:
mlemanczyk committed 2025-10-17 06:53:54 +02:00
1 parent 301e715179
commit fddec17b3f
6 files changed
+813 -821
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/PrimeOrderCalculator.Shared.cs
+19 -19
View File
@@ -606,27 +606,27 @@ internal static partial class PrimeOrderCalculator
uint limit = config.SmallFactorLimit == 0 ? uint.MaxValue : config.SmallFactorLimit;
UInt128 remaining;
if (IsGpuPow2Allowed && value <= ulong.MaxValue)
{
Dictionary<ulong, int> narrowCounts = new(capacity: 8);
if (TryPopulateSmallPrimeFactorsGpu((ulong)value, limit, narrowCounts, out ulong narrowRemaining))
{
foreach (KeyValuePair<ulong, int> entry in narrowCounts)
{
counts[(UInt128)entry.Key] = entry.Value;
}
// if (IsGpuPow2Allowed && value <= ulong.MaxValue)
// {
// Dictionary<ulong, int> narrowCounts = new(capacity: 8);
// if (TryPopulateSmallPrimeFactorsGpu((ulong)value, limit, narrowCounts, out ulong narrowRemaining))
// {
// foreach (KeyValuePair<ulong, int> entry in narrowCounts)
// {
// counts[(UInt128)entry.Key] = entry.Value;
// }
remaining = (UInt128)narrowRemaining;
}
else
{
remaining = PopulateSmallPrimeFactorsCpuWide(value, limit, counts);
}
}
else
{
// remaining = (UInt128)narrowRemaining;
// }
// else
// {
// remaining = PopulateSmallPrimeFactorsCpuWide(value, limit, counts);
// }
// }
// else
// {
remaining = PopulateSmallPrimeFactorsCpuWide(value, limit, counts);
}
// }
List<UInt128> pending = new();
if (remaining > UInt128.One)