public void TestPrimeChecker(IPrimeChecker primeChecker) { if (primeChecker.Prime(1)) { Assert.Fail("PrimeChecker claims 1 is a prime"); } for (int p = 2; p < 10000; p++) { bool isPrime = primeChecker.Prime(p); int c = -1; for (int i = 2; i < p; i++) { if (p % i == 0) { c = i; } } if (isPrime && c != -1) { Assert.Fail("PrimeChecker claimed it's prime, but " + c.ToString() + " divides " + p.ToString(), p, c); } else if (c == -1 && !isPrime) { Assert.Fail("PrimeChecker claimed it's composite, but we didn't find any divisor", p); } } }
public ParallelRangeRunner(IPrimeChecker checker) { if (checker == null) { throw new ArgumentException(string.Format(Strings.ArgumentCannotBeNull, "checker")); } _checker = checker; }
public PrimeFactorGenerator2(IPrimeChecker primeChecker) { this.primeChecker = primeChecker; }
public Factorizer(IPrimeChecker primeChecker, IOrderFinder orderFinder) { PrimeChecker = primeChecker; OrderFinder = orderFinder; }
public IsPrimeCommand(IPrimeChecker <ulong> primeChecker) { _primeChecker = primeChecker; }
public PrimePolynom(IPrimeChecker primeChecker) { PrimeChecker = primeChecker; }
public static void Init(IPrimeChecker primeChecker, IOrderFinder orderFinder) { factorizer = new Factorizer(primeChecker, orderFinder); }