Struct primes::Sieve

pub struct Sieve { /* private fields */ }

Expand description

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.

Implementations

source

impl Sieve

source

pub fn new() -> Sieve

A new prime generator, primed with 2 and 3

Trait Implementations

source

impl Clone for Sieve

source

fn clone(&self) -> Sieve

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl Default for Sieve

source

fn default() -> Sieve

Returns the “default value” for a type. Read more

source

impl PrimeSetBasics for Sieve

source

fn expand(&mut self)

Finds one more prime, and adds it to the list

source

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

Return all primes found so far as a slice

Auto Trait Implementations

impl RefUnwindSafe for Sieve

impl Send for Sieve

impl Sync for Sieve

impl Unpin for Sieve

impl UnwindSafe for Sieve

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl PrimeSet for P where
P: PrimeSetBasics,

source

fn len(&self) -> usize

Number of primes found so far

source

fn is_empty(&self) -> bool

source

fn generator(&mut self) -> PrimeSetIter<'_, Self>ⓘNotable traits for PrimeSetIter<'a, P>`impl<'a, P: PrimeSet> Iterator for PrimeSetIter<'a, P> type Item = u64;`

Iterator over all primes not yet found

source

fn iter(&mut self) -> PrimeSetIter<'_, Self>ⓘNotable traits for PrimeSetIter<'a, P>`impl<'a, P: PrimeSet> Iterator for PrimeSetIter<'a, P> type Item = u64;`

Iterator over all primes, starting with 2. If you don’t care about the “state” of the PrimeSet, this is what you want! Read more

source

fn iter_vec(&self) -> Iter<'_, u64>

Iterator over just the primes found so far

source

fn find(&mut self, n: u64) -> (usize, u64 )

Find the next largest prime from a number Read more

source

fn is_prime(&mut self, n: u64) -> bool

Check if a number is prime Read more

source

fn find_vec(&self, n: u64) -> Option<(usize, u64 )>

Find the next largest prime from a number, if it is within the already-found list Read more

source

fn get(&mut self, index: usize) -> u64

Get the nth prime, even if we haven’t yet found it

source

fn prime_factors(&mut self, n: u64) -> Vec<u64>

Get the prime factors of a number, starting from 2, including repeats

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct primes::Sieve

Implementations

impl Sieve

pub fn new() -> Sieve

Trait Implementations

impl Clone for Sieve

fn clone(&self) -> Sieve

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

impl Default for Sieve

fn default() -> Sieve

impl PrimeSetBasics for Sieve

fn expand(&mut self)

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

Auto Trait Implementations

impl RefUnwindSafe for Sieve

impl Send for Sieve

impl Sync for Sieve

impl Unpin for Sieve

impl UnwindSafe for Sieve

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<P> PrimeSet for P where P: PrimeSetBasics,

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn generator(&mut self) -> PrimeSetIter<'_, Self>ⓘNotable traits for PrimeSetIter<'a, P>impl<'a, P: PrimeSet> Iterator for PrimeSetIter<'a, P> type Item = u64;

fn iter(&mut self) -> PrimeSetIter<'_, Self>ⓘNotable traits for PrimeSetIter<'a, P>impl<'a, P: PrimeSet> Iterator for PrimeSetIter<'a, P> type Item = u64;

fn iter_vec(&self) -> Iter<'_, u64>

fn find(&mut self, n: u64) -> (usize, u64)

fn is_prime(&mut self, n: u64) -> bool

fn find_vec(&self, n: u64) -> Option<(usize, u64)>

fn get(&mut self, index: usize) -> u64

fn prime_factors(&mut self, n: u64) -> Vec<u64>

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

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

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<P> PrimeSet for P where
P: PrimeSetBasics,

fn generator(&mut self) -> PrimeSetIter<'_, Self>ⓘNotable traits for PrimeSetIter<'a, P>`impl<'a, P: PrimeSet> Iterator for PrimeSetIter<'a, P> type Item = u64;`

fn iter(&mut self) -> PrimeSetIter<'_, Self>ⓘNotable traits for PrimeSetIter<'a, P>`impl<'a, P: PrimeSet> Iterator for PrimeSetIter<'a, P> type Item = u64;`

fn find(&mut self, n: u64) -> (usize, u64 )

fn find_vec(&self, n: u64) -> Option<(usize, u64 )>

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,