Sieve

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.

Show on GitHub

init()
Creates a Sieve IteratorProtocol / Sequence
Declaration
Swift

public init()
Show on GitHub
next()
Return the next prime number
Declaration
Swift

public mutating func next() -> BigInt?
Show on GitHub
makeIterator()
Makes Sieve conforming to the Sequence protocol
Declaration
Swift

public func makeIterator() -> Sieve
Show on GitHub


                    
                    
                    nthPrime(n:)

Gives the nth prime

Declaration

Swift

public static func nthPrime(n: BigInt) -> BigInt?

Parameters

`n`	The nth prime in the list

Show on GitHub