Sieve class

A class named sieve and iterator were made to match the implementation of primesieve.org to use in ntheory functions.
What is the speed of the old `generate_primes` vs. the new `generate_primes`? It should ideally be the same, if I read the code correctly, but is it in practice? I would like to see the numbers for limit=1e8 or so.