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) 2011 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"
#include "fmpz_vec.h"
#include "fmpq.h"
TEST_FUNCTION_START(fmpq_cfrac_bound, state)
{
int i;
for (i = 0; i < 10000 * flint_test_multiplier(); i++)
{
fmpq_t x, r;
fmpz * c;
slong n, bound;
fmpq_init(x);
fmpq_init(r);
/* Test worst case (quotient of Fibonacci numbers) */
if (n_randint(state, 50) == 1)
{
slong v = 1 + n_randint(state, 1000);
fmpz_fib_ui(fmpq_numref(x), v + 1);
fmpz_fib_ui(fmpq_denref(x), v);
}
else
{
fmpq_randtest(x, state, 1 + n_randint(state, 1000));
}
bound = fmpq_cfrac_bound(x);
c = _fmpz_vec_init(bound + 10);
n = fmpq_get_cfrac(c, r, x, bound);
if (n > bound)
{
flint_printf("FAIL: length=%wd > bound=%wd\n", n, bound);
fflush(stdout);
flint_abort();
}
_fmpz_vec_clear(c, bound + 10);
fmpq_clear(x);
fmpq_clear(r);
}
TEST_FUNCTION_END(state);
}