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
95
96
97
98
99
100
101
102
103
104
105
106
|
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2010, 2012 William Hart
Copyright (C) 2011, 2012 Fredrik Johansson
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "fmpz.h"
#include "fmpz_poly.h"
#include "fmpz_mod_poly.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result = 1;
FLINT_TEST_INIT(state);
flint_printf("evaluate_fmpz_vec_fast....");
fflush(stdout);
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
fmpz_mod_poly_t P;
fmpz * x, * y, * z;
fmpz_t mod;
slong j, n, npoints;
fmpz_init(mod);
do
{
fmpz_randtest_unsigned(mod, state, 5);
fmpz_add_ui(mod, mod, 2);
} while (!fmpz_is_probabprime(mod));
npoints = n_randint(state, 10);
n = n_randint(state, 10);
fmpz_mod_poly_init(P, mod);
x = _fmpz_vec_init(npoints);
y = _fmpz_vec_init(npoints);
z = _fmpz_vec_init(npoints);
fmpz_mod_poly_randtest(P, state, n);
for (j = 0; j < npoints; j++)
fmpz_randtest_mod(x + j, state, mod);
fmpz_mod_poly_evaluate_fmpz_vec_iter(y, P, x, npoints);
fmpz_mod_poly_evaluate_fmpz_vec_fast(z, P, x, npoints);
result = _fmpz_vec_equal(y, z, npoints);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("mod=");
fmpz_print(mod);
flint_printf(", n=%wd, npoints=%wd\n\n", n, npoints);
flint_printf("P: "); fmpz_mod_poly_print(P); flint_printf("\n\n");
for (j = 0; j < npoints; j++)
fmpz_print(y + j), flint_printf(" ");
flint_printf("\n");
for (j = 0; j < npoints; j++)
fmpz_print(z + j), flint_printf(" ");
flint_printf("\n");
abort();
}
fmpz_clear(mod);
fmpz_mod_poly_clear(P);
_fmpz_vec_clear(x, npoints);
_fmpz_vec_clear(y, npoints);
_fmpz_vec_clear(z, npoints);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
|
