PrimeGenerator

Utility for generating prime numers.

struct PrimeGenerator (

) if (

isIntegral!T

) {

pure nothrow @nogc @safe

enum bool empty;

T front();

void popFront();

typeof(this) save();

}

Members

Functions

front T front()
popFront void popFront(): Advances the generator.
save typeof(this) save(): Creates a copy of the generator.

Variables

empty enum bool empty;

Examples

import std.algorithm : equal;
import std.range : take;

// dfmt off
static immutable earlyPrimes = 
   [ 2,   3,   5,   7,  11,   13,  17,  19,  23,  29,
    31,  37,  41,  43,  47,   53,  59,  61,  67,  71,
    73,  79,  83,  89,  97,  101, 103, 107, 109, 113,
    127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 
    179, 181, 191, 193, 197, 199, 211, 223, 227, 229];
// dfmt on

auto primes = PrimeGenerator!int();

assert(equal(earlyPrimes, primes.take(earlyPrimes.length)));

PrimeGenerator

Members

Functions

Variables

Examples

Meta

Source