Count all set bits in pSieve->buffer

Displays the primes found (or just the total count, depending on what you ask for)

### Run sieve wheel > Runs the wheel sieving algorithm. When done, the `wheel` data structure marks all primes in range.

Run runs all bencmarks from the provided slice and outputs their results

Sq calculate the index of the square of Pr(i). Sq(i) = In(Pr(i)*Pr(i)) It is used to establish the slices like [n,n^2) that are filled consecutively b

Consteval in order to force clang to always optimize. Gcc consistently does so with constexpr and inside the body.

returns prime that could not be handled: start is too large range is too big block stop should not exceed sieve size for faster handling

Retrieves single word, then applies each single-bit mask in turn. When all masks have been applied, write the word back to the slice.

Free up resources for sieve object

prepare the benchmark settings using defaults

Minimum start for resetting bits -- this is the earliest reset we can apply without clobbering the factor itself

Search the bit array for the next set bit, which corresponds to the next prime

Calculate the equivalent (base) skip factor that will yield the same modulo pattern as a higher skip factor, for a given number of bits. They are peri

## Print header > Helper function that displays information about a run.

Displays the primes found (or just the total count, depending on what you ask for)

print results to console stderr for good feedback

print correctly-formatted results to `stderr` as per CONTRIBUTING.md - format is <name>;<iterations>;<total_time>;<num_threads>

## Run Implementation > Helper function that spawns threads, runs the algorithm, collects the results and displays the output.

Calculate the primes up to the specified limit

Purpose: Run the sieve in a loop until the maximum specified time */