/usr/include/primesieve/primesieve_iterator.h is in libprimesieve6-dev-common 5.6.0+ds-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 | /**
* @file primesieve_iterator.h
* @brief 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 pi(n^0.5) * 16 bytes. primesieve_iterator objects
* are very convenient to use at the cost of being slightly
* slower than the primesieve_callback_primes() functions.
*
* The @link primesieve_iterator.c primesieve_iterator.c
* @endlink example shows how to use primesieve_iterator. If
* any error occurs errno is set to EDOM and
* primesieve_next_prime() and primesieve_previous_prime()
* return PRIMESIEVE_ERROR.
*
* Copyright (C) 2015 Kim Walisch, <kim.walisch@gmail.com>
*
* This file is distributed under the BSD License. See the COPYING
* file in the top level directory.
*/
#ifndef PRIMESIEVE_ITERATOR_H
#define PRIMESIEVE_ITERATOR_H
#include <stdint.h>
#include <stddef.h>
#ifdef __cplusplus
extern "C" {
#endif
/** C prime iterator, please refer to @link primesieve_iterator.h
* primesieve_iterator.h @endlink for more information.
*/
typedef struct
{
size_t i_;
size_t last_idx_;
uint64_t* primes_;
uint64_t* primes_pimpl_;
uint64_t start_;
uint64_t stop_;
uint64_t stop_hint_;
uint64_t tiny_cache_size_;
int is_error_;
} primesieve_iterator;
/** Initialize the primesieve iterator before first using it. */
void primesieve_init(primesieve_iterator* pi);
/** Free all memory. */
void primesieve_free_iterator(primesieve_iterator* pi);
/** Set the primesieve iterator to start.
* @param start Generate primes > start (or < start).
* @param stop_hint Stop number optimization hint. E.g. if you want
* to generate the primes below 1000 use
* stop_hint = 1000, if you don't know use
* primesieve_get_max_stop().
* @pre start <= 2^64 - 2^32 * 10
*/
void primesieve_skipto(primesieve_iterator* pi, uint64_t start, uint64_t stop_hint);
/** Internal use. */
void primesieve_generate_next_primes(primesieve_iterator*);
/** Internal use. */
void primesieve_generate_previous_primes(primesieve_iterator*);
/** Get the next prime. */
static inline uint64_t primesieve_next_prime(primesieve_iterator* pi)
{
if (pi->i_++ == pi->last_idx_)
primesieve_generate_next_primes(pi);
return pi->primes_[pi->i_];
}
/** Get the previous prime,
* or 0 if input <= 2 e.g. previous_prime(2) = 0.
*/
static inline uint64_t primesieve_previous_prime(primesieve_iterator* pi)
{
if (pi->i_-- == 0)
primesieve_generate_previous_primes(pi);
return pi->primes_[pi->i_];
}
#ifdef __cplusplus
} /* extern "C" */
#endif
#endif
|