primecount 0.2.1

Rust wrapper for https://github.com/kimwalisch/primecount
Documentation 
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

///
/// @file  gourdon.hpp
/// @brief Function declarations related to Xavier Gourdon's prime
///        counting function algorithm.
///
/// Copyright (C) 2021 Kim Walisch, <kim.walisch@gmail.com>
///
/// This file is distributed under the BSD License. See the COPYING
/// file in the top level directory.
///

#include <int128_t.hpp>
#include <print.hpp>

#include <stdint.h>

namespace primecount {

int64_t pi_gourdon(int64_t x, int threads);
int64_t pi_gourdon_64(int64_t x, int threads, bool print = is_print());
int64_t Sigma(int64_t x, int64_t y, int threads, bool print = is_print());
int64_t Phi0(int64_t x, int64_t y, int64_t z, int64_t k, int threads, bool print = is_print());
int64_t AC(int64_t x, int64_t y, int64_t z, int64_t k, int threads, bool print = is_print());
int64_t B(int64_t x, int64_t y, int threads, bool print = is_print());
int64_t D(int64_t x, int64_t y, int64_t z, int64_t k, int64_t d_approx, int threads, bool print = is_print());

#ifdef HAVE_INT128_T

int128_t pi_gourdon(int128_t x, int threads);
int128_t pi_gourdon_128(int128_t x, int threads, bool print = is_print());
int128_t Sigma(int128_t x, int64_t y, int threads, bool print = is_print());
int128_t Phi0(int128_t x, int64_t y, int64_t z, int64_t k, int threads, bool print = is_print());
int128_t AC(int128_t x, int64_t y, int64_t z, int64_t k, int threads, bool print = is_print());
int128_t B(int128_t x, int64_t y, int threads, bool print = is_print());
int128_t D(int128_t x, int64_t y, int64_t z, int64_t k, int128_t d_approx, int threads, bool print = is_print());

#endif

} // namespace