Here is a list of all documented files with brief descriptions:
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 |
iterator.hpp | The iterator class allows to easily iterate (forwards and backwards) over prime numbers |
primesieve.h | Primesieve C API. primesieve is a library for fast prime number generation. In case an error occurs errno is set to EDOM and PRIMESIEVE_ERROR is returned |
primesieve.hpp | Primesieve C++ API. primesieve is a library for fast prime number generation, in case an error occurs a primesieve::primesieve_error exception (derived form std::runtime_error) is thrown |
primesieve_error.hpp | The primesieve_error class is used for all exceptions within primesieve |