flint3-sys 3.5.1

Rust bindings to the FLINT C library
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

/*
    Copyright (C) 2010 Fredrik Johansson

    This file is part of FLINT.

    FLINT is free software: you can redistribute it and/or modify it under
    the terms of the GNU Lesser General Public License (LGPL) as published
    by the Free Software Foundation; either version 3 of the License, or
    (at your option) any later version.  See <https://www.gnu.org/licenses/>.
*/

#include "test_helpers.h"
#include "ulong_extras.h"

#define check_prime_bounds(n, ans) \
do { \
    int ok, reasonable; \
    ulong lo, hi; \
    n_nth_prime_bounds(&lo, &hi, n); \
 \
    ok = lo <= ans && ans <= hi; \
    reasonable = (n < 1000) || (ans/2 < lo && hi < ans*2); \
 \
    if (!(ok && reasonable)) \
        TEST_FUNCTION_FAIL("n = %wu: %wu < %wu < %wu\n", n, lo, ans, hi); \
} while (0)

TEST_FUNCTION_START(n_nth_prime_bounds, state)
{
    int n;

    for (n=6; n<7500 * FLINT_MIN(10, flint_test_multiplier()); n++)
    {
        check_prime_bounds(n, n_nth_prime(n));
    }

    /* Some known large primes */
    check_prime_bounds(UWORD(10), UWORD(29));
    check_prime_bounds(UWORD(100), UWORD(541));
    check_prime_bounds(UWORD(1000), UWORD(7919));
    check_prime_bounds(UWORD(10000), UWORD(104729));
    check_prime_bounds(UWORD(100000), UWORD(1299709));
    check_prime_bounds(UWORD(1000000), UWORD(15485863));
    check_prime_bounds(UWORD(10000000), UWORD(179424673));
    check_prime_bounds(UWORD(100000000), UWORD(2038074743));
#if FLINT64
    check_prime_bounds(UWORD(1000000000), UWORD(22801763489));
    check_prime_bounds(UWORD(10000000000), UWORD(252097800623));
    check_prime_bounds(UWORD(100000000000), UWORD(2760727302517));
    check_prime_bounds(UWORD(1000000000000), UWORD(29996224275833));
    check_prime_bounds(UWORD(10000000000000), UWORD(323780508946331));
    check_prime_bounds(UWORD(100000000000000), UWORD(3475385758524527));
    check_prime_bounds(UWORD(1000000000000000), UWORD(37124508045065437));
    check_prime_bounds(UWORD(10000000000000000), UWORD(394906913903735329));
    check_prime_bounds(UWORD(100000000000000000), UWORD(4185296581467695669));
#endif

    TEST_FUNCTION_END(state);
}