Calculate the primes up to the specified limit

Calculate the primes up to the specified limit

Return the count of bits that are still set in the sieve. Assumes you've already called run_sieve, of course!

Returns a generator to iterate over the found prime numbers. Requires a prior run_sieve call

settings string to use where it is directly outputted

Return the count of bits that are still set in the sieve. Assumes you've already called run_sieve, of course!

Returns a generator to iterate over the found prime numbers. Requires a prior run_sieve call

delete the sieve

Run runs benchmark for an implementation specified in the Benchmark object, calculating primes up to a limit for a given duration.

calculate the maximum prime number that can be used for a given range in bits we have to take the sqaure of the real number, so we have to double, squ

Recommended start for resetting bits -- at the square of the factor

check the settings to make sure they are valid, dont overlap, etc.

calculate the first multiple of a prime number in a given range

Helper function to check for next argument

This is the main module that directs all the work sieve_size in a real number that is the maximum in the sieve (not in bits) block_size is in bi

NewSieve creates a new Sieve variable.

PrimeChecker fill sieve[minT:maxT] using all primes found in sieve[0:maxP]. So sieve[0:maxP] should be ready and maxP <= minT < maxT.

PrimeCheckerMulti split the slice sieve[from:to] to numProc (almost) equal parts and run numProc PrimeChecker workers to do the checking on this non o

Helper function for integer argument parsing

Build fill sieve with true for all non primes. We make no assumptions about the first odd primes. We do not suppose that 3,5,7 or 11 are primes. As th

Pr converts a sieve index to the corresponing number.

continue a pattern that start at <source_start> with a size of <size>. repeat this pattern up to <destination_stop>. for small sizes, this is done on

Purpose: This function calculates a segment of the sieve. The calculations starts are start_nr under the assumption that smaller numbers

fast integer square root https://en.wikipedia.org/wiki/Fast_inverse_square_root

CountPrimes return the number of primes + 1 encoded in sieve.

In converts an odd number to sieve index. This is the inverse of Pr().

<summary> Run all requested sieves based on the provided settings. </summary> <param name="settings">Collection of options used to determine which sie