public struct Sieve : IteratorProtocol
A generator for finding prime numbers
A prime sieve or prime number sieve is a fast type of algorithm for finding primes. It does so by iterating over the natural integers, and returning every number that is indeed prime.
Creates a Sieve
Makes Sieve conforming to the
public func makeIterator() -> Sieve