Smarandache prime-digital sequence: Difference between revisions

Line 312:

<lang cpp>#include <iostream>

#include <cstdint>

#include "~~sieve_of_eratosthenes~~.h"

#include "prime_sieve.hpp"

using integer = uint32_t;

Line 332:

int main() {

const integer limit = 10000000;

~~sieve_of_eratosthenes~~ sieve(limit);

prime_sieve sieve(limit);

integer n = 0, n1 = 0, n2 = 0, n3 = 0;

std::cout << "First 25 SPDS primes:\n";

Line 361:

}</lang>

Contents of ~~sieve_of_eratosthenes~~.h:

Contents of prime_sieve.hpp:

<lang cpp>#ifndef ~~SIEVE_OF_ERATOSTHENES_H~~

<lang cpp>#ifndef PRIME_SIEVE_HPP

#define ~~SIEVE_OF_ERATOSTHENES_H~~

#define PRIME_SIEVE_HPP

#include <algorithm>

Line 372:

* See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.

*/

class ~~sieve_of_eratosthenes~~ {

class prime_sieve {

public:

explicit ~~sieve_of_eratosthenes~~(size_t);

explicit prime_sieve(size_t);

bool is_prime(size_t) const;

private:

Line 385:

* @param limit the maximum integer that can be tested for primality

*/

inline ~~sieve_of_eratosthenes~~::~~sieve_of_eratosthenes~~(size_t limit) {

inline prime_sieve::prime_sieve(size_t limit) {

limit = std::max(size_t(3), limit);

is_prime_.resize(limit/2, true);

Line 405:

* @return true if the integer is prime

*/

inline bool ~~sieve_of_eratosthenes~~::is_prime(size_t n) const {

inline bool prime_sieve::is_prime(size_t n) const {

if (n == 2)

return true;