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

TODO added

Browse Source
This commit is contained in:
mlemanczyk committed 2025-10-18 17:48:38 +02:00
1 parent 14b72a6a2a
commit 6928d43aee
1 file changed
+2
Download Patch File Download Diff File Expand all files Collapse all files
EvenPerfectBitScanner.Benchmarks/Pow2MontgomeryModBenchmarks.cs
+2
View File
@@ -367,6 +367,7 @@ public class Pow2MontgomeryModBenchmarks
return result.MontgomeryMultiply(1UL, modulus, nPrime); return result.MontgomeryMultiply(1UL, modulus, nPrime);
} }
// TODO: Update it with the latest implementations
private static ulong Pow2MontgomeryModSlidingWindow(ulong exponent, in MontgomeryDivisorData divisor) private static ulong Pow2MontgomeryModSlidingWindow(ulong exponent, in MontgomeryDivisorData divisor)
{ {
ulong modulus = divisor.Modulus; ulong modulus = divisor.Modulus;
@@ -426,6 +427,7 @@ public class Pow2MontgomeryModBenchmarks
return result.MontgomeryMultiply(1UL, modulus, nPrime); return result.MontgomeryMultiply(1UL, modulus, nPrime);
} }
// TODO: Update it with the latest implementations, if it exists in production code. Otherwise just remove TODO
private static ulong Pow2ModBinary(ulong exponent, ulong modulus) private static ulong Pow2ModBinary(ulong exponent, ulong modulus)
{ {
if (modulus <= 1UL || (modulus & 1UL) == 0UL) if (modulus <= 1UL || (modulus & 1UL) == 0UL)