/*
Copyright (C) 2010 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 2.1 of the License, or
(at your option) any later version. See .
*/
#include
#include
#include
#include "flint.h"
#include "nmod_vec.h"
#include "nmod_poly.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("mul_classical....");
fflush(stdout);
/* Check aliasing of a and b */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
nmod_poly_t a, b, c;
mp_limb_t n = n_randtest_not_zero(state);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
nmod_poly_init(c, n);
nmod_poly_randtest(b, state, n_randint(state, 50));
nmod_poly_randtest(c, state, n_randint(state, 50));
nmod_poly_mul_classical(a, b, c);
nmod_poly_mul_classical(b, b, c);
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");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
nmod_poly_clear(c);
}
/* Check aliasing of a and c */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
nmod_poly_t a, b, c;
mp_limb_t n = n_randtest_not_zero(state);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
nmod_poly_init(c, n);
nmod_poly_randtest(b, state, n_randint(state, 50));
nmod_poly_randtest(c, state, n_randint(state, 50));
nmod_poly_mul_classical(a, b, c);
nmod_poly_mul_classical(c, b, c);
result = (nmod_poly_equal(a, c));
if (!result)
{
flint_printf("FAIL:\n");
nmod_poly_print(a), flint_printf("\n\n");
nmod_poly_print(c), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
nmod_poly_clear(c);
}
/* Check (b*c)+(b*d) = b*(c+d) */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
nmod_poly_t a1, a2, b, c, d;
mp_limb_t n = n_randtest_not_zero(state);
nmod_poly_init(a1, n);
nmod_poly_init(a2, n);
nmod_poly_init(b, n);
nmod_poly_init(c, n);
nmod_poly_init(d, n);
nmod_poly_randtest(b, state, n_randint(state, 50));
nmod_poly_randtest(c, state, n_randint(state, 50));
nmod_poly_randtest(d, state, n_randint(state, 50));
nmod_poly_mul_classical(a1, b, c);
nmod_poly_mul_classical(a2, b, d);
nmod_poly_add(a1, a1, a2);
nmod_poly_add(c, c, d);
nmod_poly_mul_classical(a2, b, c);
result = (nmod_poly_equal(a1, a2));
if (!result)
{
flint_printf("FAIL:\n");
nmod_poly_print(a1), flint_printf("\n\n");
nmod_poly_print(a2), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a1);
nmod_poly_clear(a2);
nmod_poly_clear(b);
nmod_poly_clear(c);
nmod_poly_clear(d);
}
/* check b^2 = b*b */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
nmod_poly_t a1, a2, b, c;
mp_limb_t n = n_randtest_not_zero(state);
nmod_poly_init(a1, n);
nmod_poly_init(a2, n);
nmod_poly_init(b, n);
nmod_poly_init(c, n);
nmod_poly_randtest(b, state, n_randint(state, 50));
nmod_poly_randtest(a1, state, n_randint(state, 50));
nmod_poly_randtest(a2, state, n_randint(state, 50));
nmod_poly_set(c, b);
nmod_poly_mul_classical(a1, b, b);
nmod_poly_mul_classical(a2, b, c);
result = (nmod_poly_equal(a1, a2));
if (!result)
{
flint_printf("FAIL (squaring):\n");
nmod_poly_print(a1), flint_printf("\n\n");
nmod_poly_print(a2), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a1);
nmod_poly_clear(a2);
nmod_poly_clear(b);
nmod_poly_clear(c);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}