18#ifndef __BIN_PRIME_SIEVEPRIME_H
19#define __BIN_PRIME_SIEVEPRIME_H
69 Size & resultsWritten,
70 const Size offsetNumber = 0)
const;
POSIX-compatible application.
Compute prime numbers using the Sieve of Eratosthenes algorithm.
Result reportResult(const int n, const u8 *map, Size &resultsWritten, const Size offsetNumber=0) const
Report the calculated results.
Result searchSequential(const int n, u8 *map) const
Perform sequential search for prime numbers.
virtual ~SievePrime()
Destructor.
virtual Result exec()
Execute the application.
unsigned int Size
Any sane size indicator cannot go negative.
unsigned char u8
Unsigned 8-bit number.