def test_100_random_with_caching(self): # Randomly test for prime values <= than 100th prime, NOT resetting the # cache each time. for _ in range(100): r = random.randint(0, max(p100) + 1) expected_primes = [p for p in p100 if p <= r] actual_primes = factors.sieve_of_eratosthenes(r) self.assertListEqual(expected_primes, actual_primes, "Unexpected return for query value: %d" % r)
def test_100_random_with_caching(self): # Randomly test for prime values <= than 100th prime, NOT resetting the # cache each time. for _ in range(100): r = random.randint(0, max(p100) + 1) expected_primes = [p for p in p100 if p <= r] actual_primes = factors.sieve_of_eratosthenes(r) self.assertListEqual(expected_primes, actual_primes, "Unexpected return for query value: %d" % r)
def test_15(self): self.assertListEqual( factors.sieve_of_eratosthenes(15), [2, 3, 5, 7, 11, 13] )
def test_5(self): self.assertListEqual( factors.sieve_of_eratosthenes(5), [2, 3, 5] )
def test_7(self): self.assertListEqual( factors.sieve_of_eratosthenes(7), [2, 3, 5, 7] )
def test_2(self): self.assertListEqual( factors.sieve_of_eratosthenes(2), [2] )
def test_4(self): self.assertListEqual( factors.sieve_of_eratosthenes(4), [2, 3] )
def test_5(self): self.assertListEqual(factors.sieve_of_eratosthenes(5), [2, 3, 5])
def test_1(self): self.assertListEqual( factors.sieve_of_eratosthenes(1), [] )
def test_100_with_caching(self): # First ask for a value with 99 prime returns, then a value with 100 to # see that we did get that new extra value. self.assertListEqual(factors.sieve_of_eratosthenes(540), p100[:-1]) self.assertListEqual(factors.sieve_of_eratosthenes(541), p100)
def test_100_primes(self): self.assertListEqual(factors.sieve_of_eratosthenes(541), p100)
def test_60(self): self.assertListEqual( factors.sieve_of_eratosthenes(60), [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59])
def test_100_primes(self): self.assertListEqual(factors.sieve_of_eratosthenes(541), p100)
def test_25(self): self.assertListEqual(factors.sieve_of_eratosthenes(25), [2, 3, 5, 7, 11, 13, 17, 19, 23])
def test_15(self): self.assertListEqual(factors.sieve_of_eratosthenes(15), [2, 3, 5, 7, 11, 13])
def test_7(self): self.assertListEqual(factors.sieve_of_eratosthenes(7), [2, 3, 5, 7])
def test_25(self): self.assertListEqual( factors.sieve_of_eratosthenes(25), [2, 3, 5, 7, 11, 13, 17, 19, 23] )
def test_2(self): self.assertListEqual(factors.sieve_of_eratosthenes(2), [2])
def test_60(self): self.assertListEqual( factors.sieve_of_eratosthenes(60), [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59] )
def test_4(self): self.assertListEqual(factors.sieve_of_eratosthenes(4), [2, 3])
def test_100_with_caching(self): # First ask for a value with 99 prime returns, then a value with 100 to # see that we did get that new extra value. self.assertListEqual(factors.sieve_of_eratosthenes(540), p100[:-1]) self.assertListEqual(factors.sieve_of_eratosthenes(541), p100)
def test_1(self): self.assertListEqual(factors.sieve_of_eratosthenes(1), [])