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
/*
Copyright (C) 2009 William Hart
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 "nmod_poly.h"
TEST_FUNCTION_START(nmod_poly_mulhigh, state)
{
int i, result;
/* Compare with left truncated product of a and b */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
nmod_poly_t a, b, c;
slong j, n;
ulong m = n_randtest_not_zero(state);
nmod_poly_init(a, m);
nmod_poly_init(b, m);
nmod_poly_init(c, m);
n = n_randint(state, 50);
nmod_poly_randtest(b, state, n);
nmod_poly_randtest(c, state, n);
nmod_poly_mulhigh(a, b, c, n);
nmod_poly_mul(b, b, c);
for (j = 0; j < n; j++)
{
if (j < a->length)
a->coeffs[j] = 0;
if (j < b->length)
b->coeffs[j] = 0;
}
_nmod_poly_normalise(a);
_nmod_poly_normalise(b);
result = (nmod_poly_equal(a, b));
if (!result)
{
flint_printf("FAIL:\n");
nmod_poly_print(a), flint_printf("\n\n");
nmod_poly_print(b), flint_printf("\n\n");
fflush(stdout);
flint_abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
nmod_poly_clear(c);
}
TEST_FUNCTION_END(state);
}