Sieve of Erathosnes Generator

sieve.py

def prime_generator():
    current = 2

    primes = []

    while True:
        while any(map(lambda x: current % x == 0, primes)):
            current += 1

        yield current
        primes.append(current)

primes2 = prime_generator()
known_primes = [2, 3, 5, 7, 11, 13, 17, 19, 23]

for n in known_primes:
    assert primes2.next() == n, n
print "Done"