121 lines
3.2 KiB
C
121 lines
3.2 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 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("set/equal....");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/* Equal polynomials */
|
||
|
|
for (i = 0; i < 10000; i++)
|
||
|
|
{
|
||
|
|
fmpz_t p;
|
||
|
|
fmpz_mod_poly_t a, b;
|
||
|
|
|
||
|
|
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_randtest(a, state, n_randint(state, 100));
|
||
|
|
|
||
|
|
fmpz_mod_poly_set(b, a);
|
||
|
|
|
||
|
|
result = (fmpz_mod_poly_equal(a, b));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL:\n");
|
||
|
|
fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
|
fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_clear(a);
|
||
|
|
fmpz_mod_poly_clear(b);
|
||
|
|
|
||
|
|
fmpz_clear(p);
|
||
|
|
}
|
||
|
|
|
||
|
|
for (i = 0; i < 10000; i++)
|
||
|
|
{
|
||
|
|
fmpz_t p;
|
||
|
|
fmpz_mod_poly_t a, b;
|
||
|
|
slong coeff = n_randint(state, 100);
|
||
|
|
fmpz_t x;
|
||
|
|
|
||
|
|
fmpz_init(p);
|
||
|
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
|
fmpz_add_ui(p, p, 2);
|
||
|
|
|
||
|
|
fmpz_init(x);
|
||
|
|
fmpz_mod_poly_init(a, p);
|
||
|
|
fmpz_mod_poly_init(b, p);
|
||
|
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 100));
|
||
|
|
|
||
|
|
fmpz_mod_poly_set(b, a);
|
||
|
|
|
||
|
|
fmpz_mod_poly_get_coeff_fmpz(x, b, coeff);
|
||
|
|
fmpz_sub_ui(x, x, 1);
|
||
|
|
fmpz_mod_poly_set_coeff_fmpz(b, coeff, x);
|
||
|
|
|
||
|
|
result = (!fmpz_mod_poly_equal(a, b));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL:\n");
|
||
|
|
flint_printf("p = "), fmpz_print(p), flint_printf("\n\n");
|
||
|
|
fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
|
fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(x);
|
||
|
|
fmpz_mod_poly_clear(a);
|
||
|
|
fmpz_mod_poly_clear(b);
|
||
|
|
|
||
|
|
fmpz_clear(p);
|
||
|
|
}
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return 0;
|
||
|
|
}
|