Number Theory Utils 0.2.0
|
Iterator to find all powerful numbers and evaluate a function h at them See NUT_PfIt_INIT
, nut_PfIt_destroy
, nut_PfIt_next
.
More...
#include <dirichlet_powerful.h>
Data Fields | ||
uint64_t | len | |
uint64_t | cap | |
uint64_t | max | |
uint64_t | rt_max | |
uint64_t * | primes | |
uint64_t | num_primes | |
uint64_t | modulus | |
uint64_t | small_primes | |
nut_PfStackEnt * | entries | |
int | h_kind | |
union { | ||
int64_t(* h_fn )(uint64_t p, uint64_t pp, uint64_t e, uint64_t m) | ||
const int64_t * h_vals | ||
struct { | ||
uint64_t * offsets | ||
int64_t * values | ||
} h_seqs | ||
}; | ||
Iterator to find all powerful numbers and evaluate a function h at them See NUT_PfIt_INIT
, nut_PfIt_destroy
, nut_PfIt_next
.
Definition at line 89 of file dirichlet_powerful.h.
uint64_t nut_PfIt::len |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t nut_PfIt::cap |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t nut_PfIt::max |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t nut_PfIt::rt_max |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t * nut_PfIt::primes |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t nut_PfIt::num_primes |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t nut_PfIt::modulus |
Definition at line 90 of file dirichlet_powerful.h.
uint64_t nut_PfIt::small_primes |
Definition at line 90 of file dirichlet_powerful.h.
nut_PfStackEnt* nut_PfIt::entries |
Definition at line 91 of file dirichlet_powerful.h.
int nut_PfIt::h_kind |
Definition at line 92 of file dirichlet_powerful.h.
int64_t(* nut_PfIt::h_fn) (uint64_t p, uint64_t pp, uint64_t e, uint64_t m) |
Definition at line 94 of file dirichlet_powerful.h.
const int64_t* nut_PfIt::h_vals |
Definition at line 95 of file dirichlet_powerful.h.
uint64_t* nut_PfIt::offsets |
Definition at line 97 of file dirichlet_powerful.h.
int64_t* nut_PfIt::values |
Definition at line 98 of file dirichlet_powerful.h.