Struct primes::Sieve

pub struct Sieve { /* fields omitted */ }

A prime generator, using the Sieve of Eratosthenes method. This is asymptotically more efficient than the Trial Division method, but slower earlier on.

Create with let mut pset = Sieve::new(), and then use pset.iter() to iterate over all primes.

Methods

impl Sieve

pub fn new() -> Sieve

A new prime generator, primed with 2 and 3

Trait Implementations

impl Clone for Sieve

fn clone(&self) -> Sieve

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Default for Sieve

fn default() -> Sieve

Returns the "default value" for a type.

impl PrimeSetBasics for Sieve

fn expand(&mut self)

Finds one more prime, and adds it to the list

fn list(&self) -> &[u64]

Return all primes found so far as a slice