Namespace madlib

This is the Euler Sieve implementation of a primes finder.

Detailed Description

C++20 Header only prime generation class and related iterator. Meant as an exercise.

Using C++20 features and uses the Euler’s Sieve algorithm, this code is intended to be a usable, high quality example for both C++20 usage and the associated prime algorithms.

Classes

• Class euler_sieve_mult

• Class euler_sieve_sqrt

• Template Class prime_generator

• Template Class primes

• Template Class primes_generator

• Template Class primes_interface

• Template Class primes_iterator

• Class primes_iterator_sentinel_t

Typedefs

• Typedef madlib::prime_type

Variables

• Variable madlib::primes_iterator_sentinel