pqc/external/flint-2.4.3/nmod_poly/test/t-compose_series_divconquer.c

146 lines
4.4 KiB
C
Raw Normal View History

2014-05-18 22:03:37 +00:00
/*=============================================================================
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 William Hart
Copyright (C) 2011 Sebastian Pancratz
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "nmod_poly.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result = 1;
FLINT_TEST_INIT(state);
flint_printf("compose_series_divconquer....");
fflush(stdout);
/* Aliasing */
for (i = 0; i < 500 * flint_test_multiplier(); i++)
{
nmod_poly_t a, b, c;
mp_limb_t n = n_randtest_not_zero(state);
slong N = n_randint(state, 50);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
nmod_poly_init(c, n);
nmod_poly_randtest(a, state, n_randint(state, 30));
nmod_poly_randtest(b, state, n_randint(state, 15));
nmod_poly_compose_series_divconquer(c, a, b, N);
nmod_poly_compose_series_divconquer(a, a, b, N);
result = nmod_poly_equal(c, a);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a->length = %wd, n = %wu\n", a->length, a->mod.n);
nmod_poly_print(c), flint_printf("\n\n");
nmod_poly_print(a), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
nmod_poly_clear(c);
}
/* Aliasing */
for (i = 0; i < 500 * flint_test_multiplier(); i++)
{
nmod_poly_t a, b, c;
mp_limb_t n = n_randtest_not_zero(state);
slong N = n_randint(state, 50);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
nmod_poly_init(c, n);
nmod_poly_randtest(a, state, n_randint(state, 30));
nmod_poly_randtest(b, state, n_randint(state, 15));
nmod_poly_compose_series_divconquer(c, a, b, N);
nmod_poly_compose_series_divconquer(b, a, b, N);
result = nmod_poly_equal(c, b);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a->length = %wd, n = %wu\n", a->length, a->mod.n);
nmod_poly_print(c), 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);
}
/* Compare with compose */
for (i = 0; i < 500 * flint_test_multiplier(); i++)
{
nmod_poly_t a, b, r1, r2;
mp_limb_t n = n_randtest_not_zero(state);
slong N = n_randint(state, 50);
nmod_poly_init(a, n);
nmod_poly_init(b, n);
nmod_poly_init(r1, n);
nmod_poly_init(r2, n);
nmod_poly_randtest(a, state, n_randint(state, 30));
nmod_poly_randtest(b, state, n_randint(state, 15));
nmod_poly_compose_series_divconquer(r1, a, b, N);
nmod_poly_compose(r2, a, b);
nmod_poly_truncate(r2, N);
result = nmod_poly_equal(r1, r2);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a->length = %wd, n = %wu\n", a->length, a->mod.n);
nmod_poly_print(r1), flint_printf("\n\n");
nmod_poly_print(r2), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(b);
nmod_poly_clear(r1);
nmod_poly_clear(r2);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}