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
/*
Copyright (C) 2024 Albin Ahlbäck
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"
TEST_FUNCTION_START(n_factor_evaluate, state)
{
int result;
slong iter;
for (iter = 0; iter < 1000 * flint_test_multiplier(); iter++)
{
ulong eval, fac_eval;
n_factor_t factors;
int type;
n_factor_init(&factors);
type = n_randint(state, 2);
if (type == 0)
{
/* Test random limb */
eval = n_randtest_not_zero(state);
n_factor(&factors, eval, 0);
}
else
{
/* Test factorization whose evaluation cannot fit in a limb */
ulong top;
eval = 1;
do
{
ulong prime = n_randtest_prime(state, 0);
umul_ppmm(top, eval, eval, prime);
n_factor_insert(&factors, prime, 1);
} while (top == UWORD(0));
/* And maybe add extra exponents */
if (n_randint(state, 2))
factors.exp[n_randint(state, factors.num)] += 1 + n_randint(state, 10);
eval = 0; /* n_factor_evaluate should return 0 */
}
fac_eval = n_factor_evaluate(&factors);
result = (eval == fac_eval);
if (!result)
TEST_FUNCTION_FAIL(
"eval = %wu\n"
"fac_eval = %wu\n",
eval, fac_eval);
}
TEST_FUNCTION_END(state);
}