Trait num_prime::PrimeBuffer

pub trait PrimeBuffer<'a> {
    type PrimeIter: Iterator<Item = &'a u64>;

    fn iter(&'a self) -> Self::PrimeIter;
    fn reserve(&mut self, limit: u64);
    fn bound(&self) -> u64;
    fn contains(&self, num: u64) -> bool;
    fn clear(&mut self);
}

This trait represents a general data structure that stores primes.

It’s recommended to store at least a bunch of small primes in the buffer to make some of the algorithms more efficient.

Required Associated Types

type PrimeIter: Iterator<Item = &'a u64>

Required Methods

fn iter(&'a self) -> Self::PrimeIter

Directly return an iterator of existing primes

fn reserve(&mut self, limit: u64)

Generate primes until the largest prime in the buffer is equal or larger than limit

fn bound(&self) -> u64

Get the largest primes in the list

fn contains(&self, num: u64) -> bool

Test if the number is in the buffer. If a number is not in the buffer, then it’s either a composite or large than PrimeBuffer::bound()

fn clear(&mut self)

clear the prime buffer to save memory

Implementors

impl<'a> PrimeBuffer<'a> for NaiveBuffer

type PrimeIter = Iter<'a, u64>