primesieve
7.5
|
Files | |
file | iterator.h |
primesieve_iterator allows to easily iterate over primes both forwards and backwards. Generating the first prime has a complexity of O(r log log r) operations with r = n^0.5, after that any additional prime is generated in amortized O(log n log log n) operations. The memory usage is about PrimePi(n^0.5) * 8 bytes. | |
file | iterator.hpp |
The iterator class allows to easily iterate (forwards and backwards) over prime numbers. | |
file | primesieve_error.hpp |
The primesieve_error class is used for all exceptions within primesieve. | |