Struct BitwiseSieve 

pub struct BitwiseSieve { /* private fields */ }

Generates prime numbers using bitwise.

Examples

let mut bitwise_sieve = BitwiseSieve::new();
assert_eq!(bitwise_sieve.gen_range(0..10), vec![2, 3, 5, 7]);

Implementations

impl BitwiseSieve

pub fn new() -> Self

Creates a new sieve.

Trait Implementations

impl Clone for BitwiseSieve

fn clone(&self) -> BitwiseSieve

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BitwiseSieve

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for BitwiseSieve

fn default() -> BitwiseSieve

Returns the “default value” for a type.

impl GenPrime for BitwiseSieve

fn gen_range<R: RangeBounds<usize>>(&mut self, range: R) -> Vec<usize>

Finds all prime numbers in the given range.

impl Hash for BitwiseSieve

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for BitwiseSieve

fn eq(&self, other: &BitwiseSieve) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for BitwiseSieve

impl Eq for BitwiseSieve

impl StructuralPartialEq for BitwiseSieve