171 lines
4.9 KiB
C
171 lines
4.9 KiB
C
|
/*=============================================================================
|
||
|
|
||
|
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) 2011, 2010 Sebastian Pancratz
|
||
|
Copyright (C) 2009 William Hart
|
||
|
|
||
|
******************************************************************************/
|
||
|
|
||
|
#include <stdio.h>
|
||
|
#include <stdlib.h>
|
||
|
#include <gmp.h>
|
||
|
#include "flint.h"
|
||
|
#include "fmpz.h"
|
||
|
#include "fmpz_mod_poly.h"
|
||
|
#include "ulong_extras.h"
|
||
|
|
||
|
int
|
||
|
main(void)
|
||
|
{
|
||
|
int i, result;
|
||
|
FLINT_TEST_INIT(state);
|
||
|
|
||
|
flint_printf("compose_divconquer....");
|
||
|
fflush(stdout);
|
||
|
|
||
|
|
||
|
|
||
|
/* Check aliasing of a and c */
|
||
|
for (i = 0; i < 100; i++)
|
||
|
{
|
||
|
fmpz_t p;
|
||
|
fmpz_mod_poly_t a, b, c;
|
||
|
|
||
|
fmpz_init(p);
|
||
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
fmpz_add_ui(p, p, 2);
|
||
|
|
||
|
fmpz_mod_poly_init(a, p);
|
||
|
fmpz_mod_poly_init(b, p);
|
||
|
fmpz_mod_poly_init(c, p);
|
||
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 80));
|
||
|
fmpz_mod_poly_randtest(b, state, n_randint(state, 30));
|
||
|
|
||
|
fmpz_mod_poly_compose_divconquer(c, a, b);
|
||
|
fmpz_mod_poly_compose_divconquer(a, a, b);
|
||
|
|
||
|
result = (fmpz_mod_poly_equal(a, c));
|
||
|
if (!result)
|
||
|
{
|
||
|
flint_printf("FAIL:\n");
|
||
|
fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(c), flint_printf("\n\n");
|
||
|
abort();
|
||
|
}
|
||
|
|
||
|
fmpz_mod_poly_clear(a);
|
||
|
fmpz_mod_poly_clear(b);
|
||
|
fmpz_mod_poly_clear(c);
|
||
|
fmpz_clear(p);
|
||
|
}
|
||
|
|
||
|
/* Check aliasing of b and c */
|
||
|
for (i = 0; i < 100; i++)
|
||
|
{
|
||
|
fmpz_t p;
|
||
|
fmpz_mod_poly_t a, b, c;
|
||
|
|
||
|
fmpz_init(p);
|
||
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
fmpz_add_ui(p, p, 2);
|
||
|
|
||
|
fmpz_mod_poly_init(a, p);
|
||
|
fmpz_mod_poly_init(b, p);
|
||
|
fmpz_mod_poly_init(c, p);
|
||
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 80));
|
||
|
fmpz_mod_poly_randtest(b, state, n_randint(state, 30));
|
||
|
|
||
|
fmpz_mod_poly_compose_divconquer(c, a, b);
|
||
|
fmpz_mod_poly_compose_divconquer(b, a, b);
|
||
|
|
||
|
result = (fmpz_mod_poly_equal(b, c));
|
||
|
if (!result)
|
||
|
{
|
||
|
flint_printf("FAIL:\n");
|
||
|
fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(c), flint_printf("\n\n");
|
||
|
abort();
|
||
|
}
|
||
|
|
||
|
fmpz_mod_poly_clear(a);
|
||
|
fmpz_mod_poly_clear(b);
|
||
|
fmpz_mod_poly_clear(c);
|
||
|
fmpz_clear(p);
|
||
|
}
|
||
|
|
||
|
/* Compare with composition over Z[X] */
|
||
|
for (i = 0; i < 100; i++)
|
||
|
{
|
||
|
fmpz_t p;
|
||
|
fmpz_mod_poly_t a, b, c, d;
|
||
|
fmpz_poly_t A, B, C;
|
||
|
|
||
|
fmpz_init(p);
|
||
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
fmpz_add_ui(p, p, 2);
|
||
|
|
||
|
fmpz_mod_poly_init(a, p);
|
||
|
fmpz_mod_poly_init(b, p);
|
||
|
fmpz_mod_poly_init(c, p);
|
||
|
fmpz_mod_poly_init(d, p);
|
||
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 80));
|
||
|
fmpz_mod_poly_randtest(b, state, n_randint(state, 30));
|
||
|
|
||
|
fmpz_poly_init(A);
|
||
|
fmpz_poly_init(B);
|
||
|
fmpz_poly_init(C);
|
||
|
fmpz_mod_poly_get_fmpz_poly(A, a);
|
||
|
fmpz_mod_poly_get_fmpz_poly(B, b);
|
||
|
|
||
|
fmpz_mod_poly_compose_divconquer(c, a, b);
|
||
|
fmpz_poly_compose(C, A, B);
|
||
|
fmpz_mod_poly_set_fmpz_poly(d, C);
|
||
|
|
||
|
result = (fmpz_mod_poly_equal(c, d));
|
||
|
if (!result)
|
||
|
{
|
||
|
flint_printf("FAIL:\n");
|
||
|
fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(c), flint_printf("\n\n");
|
||
|
fmpz_mod_poly_print(d), flint_printf("\n\n");
|
||
|
abort();
|
||
|
}
|
||
|
|
||
|
fmpz_mod_poly_clear(a);
|
||
|
fmpz_mod_poly_clear(b);
|
||
|
fmpz_mod_poly_clear(c);
|
||
|
fmpz_mod_poly_clear(d);
|
||
|
fmpz_poly_clear(A);
|
||
|
fmpz_poly_clear(B);
|
||
|
fmpz_poly_clear(C);
|
||
|
fmpz_clear(p);
|
||
|
}
|
||
|
|
||
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
||
|
flint_printf("PASS\n");
|
||
|
return 0;
|
||
|
}
|
||
|
|