public void VerifiesDecidersAgainstKnownOutput()
{
var sieveDecider = new SieveOfEratosthenesDecider(2);
var sieveProvider = new SieveOfEratosthenesProvider(2);
var sieveFactorizer = new SieveOfEratosthenesFactorizer(2);
var trialDivisionDecider = new TrialDivisionDecider(2);
for (int n = 0; n <= 2; ++n)
{
Assert.AreEqual(primesUpTo2.Contains(n), sieveDecider.IsPrime(n));
Assert.AreEqual(primesUpTo2.Contains(n), sieveProvider.IsPrime(n));
Assert.AreEqual(primesUpTo2.Contains(n), sieveFactorizer.IsPrime(n));
Assert.AreEqual(primesUpTo2.Contains(n), trialDivisionDecider.IsPrime(n));
Assert.AreEqual(primesUpTo2.Contains(n), NaivePrimeDeciderProviderFactorizer.IsPrime(n));
}
sieveDecider = new SieveOfEratosthenesDecider(49);
sieveProvider = new SieveOfEratosthenesProvider(49);
sieveFactorizer = new SieveOfEratosthenesFactorizer(49);
trialDivisionDecider = new TrialDivisionDecider(49);
for (int n = 0; n <= 49; ++n)
{
Assert.AreEqual(primesUpTo49.Contains(n), sieveDecider.IsPrime(n));
Assert.AreEqual(primesUpTo49.Contains(n), sieveProvider.IsPrime(n));
Assert.AreEqual(primesUpTo49.Contains(n), sieveFactorizer.IsPrime(n));
Assert.AreEqual(primesUpTo49.Contains(n), trialDivisionDecider.IsPrime(n));
Assert.AreEqual(primesUpTo49.Contains(n), NaivePrimeDeciderProviderFactorizer.IsPrime(n));
}
}
private void SieveOfEratosthenesDecider(int limit, int passes, int start, int end)
{
var decider = new SieveOfEratosthenesDecider(limit);
for (int p = 0; p < passes; ++p)
{
for (int n = start; n <= end; ++n)
{
decider.IsPrime(n);
}
}
}
public void VerifiesDecidersAgainstNaiveDecider()
{
for (int i = 1000; i <= 10000; i += 1000)
{
var sieveDecider = new SieveOfEratosthenesDecider(i);
var sieveProvider = new SieveOfEratosthenesProvider(i);
var sieveFactorizer = new SieveOfEratosthenesFactorizer(i);
var trialDivisionDecider = new TrialDivisionDecider(i);
for (int n = 0; n <= i; ++n)
{
Assert.AreEqual(NaivePrimeDeciderProviderFactorizer.IsPrime(n), sieveDecider.IsPrime(n));
Assert.AreEqual(NaivePrimeDeciderProviderFactorizer.IsPrime(n), sieveProvider.IsPrime(n));
Assert.AreEqual(NaivePrimeDeciderProviderFactorizer.IsPrime(n), sieveFactorizer.IsPrime(n));
Assert.AreEqual(NaivePrimeDeciderProviderFactorizer.IsPrime(n), trialDivisionDecider.IsPrime(n));
}
}
}
public SieveOfEratosthenesProvider(int limit)
{
Limit = limit;
_decider = new SieveOfEratosthenesDecider(Limit);
var primes = 2 <= Limit
? new List<int> { 2 }
: new List<int>();
for (int n = 3; n <= Limit; n += 2)
{
if (IsOddPrime(n))
{
primes.Add(n);
}
}
Primes = primes.AsReadOnly();
}
public SieveOfEratosthenesProvider(int limit)
{
Limit = limit;
_decider = new SieveOfEratosthenesDecider(Limit);
var primes = 2 <= Limit
? new List <int> {
2
}
: new List <int>();
for (int n = 3; n <= Limit; n += 2)
{
if (IsOddPrime(n))
{
primes.Add(n);
}
}
Primes = primes;
}
