Project Euler Solutions
Classes | Namespaces | Typedefs | Functions | Variables
primes.h File Reference
#include <stdint.h>
#include <string.h>
#include "macros.h"
#include <stdlib.h>
#include <math.h>
#include "iterator.h"
Include dependency graph for primes.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  c::include::primes::prime_counter
 A cached prime number generator. More...
 
struct  c::include::primes::prime_sieve
 
struct  c::include::primes::prime_factor_counter
 

Namespaces

 c::include::primes
 

Typedefs

typedef struct prime_sieve c::include::primes::prime_sieve
 
typedef struct prime_counter c::include::primes::prime_counter
 
typedef struct prime_factor_counter c::include::primes::prime_factor_counter
 

Functions

prime_sieve c::include::primes::prime_sieve0 ()
 
void c::include::primes::free_prime_counter (prime_counter *pc)
 
prime_counter c::include::primes::prime_counter1 (uintmax_t stop)
 
prime_counter c::include::primes::prime_counter0 ()
 
void c::include::primes::free_prime_factor_counter (prime_factor_counter *pfc)
 
uintmax_t c::include::primes::is_composite (uintmax_t n)
 Tells you if a number is composite, and if so, its smallest prime factor. More...
 
bool c::include::primes::is_prime (uintmax_t n)
 Tells you if a number is prime. More...
 

Variables

static uintmax_t * c::include::primes::prime_cache = NULL
 
static uintmax_t c::include::primes::prime_cache_max = 0
 
static size_t c::include::primes::prime_cache_size = 0
 
static size_t c::include::primes::prime_cache_idx = 0