122 lines
3.6 KiB
C
122 lines
3.6 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) 2010 Sebastian Pancratz
|
|
Copyright (C) 2009 William Hart
|
|
|
|
******************************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <gmp.h>
|
|
#include "flint.h"
|
|
#include "fmpz.h"
|
|
#include "fmpq_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 < 1000 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpq_poly_t a, b;
|
|
|
|
fmpq_poly_init(a);
|
|
fmpq_poly_init(b);
|
|
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
|
|
|
|
fmpq_poly_set(b, a);
|
|
|
|
result = (fmpq_poly_equal(a, b));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n");
|
|
flint_printf("alloc = %wd\nlength = %wd\n\n", a->alloc, a->length);
|
|
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
|
|
flint_printf("alloc = %wd\nlength = %wd\n\n", b->alloc, b->length);
|
|
flint_printf("equal(a, b) = %d\n", result);
|
|
abort();
|
|
}
|
|
|
|
fmpq_poly_clear(a);
|
|
fmpq_poly_clear(b);
|
|
}
|
|
|
|
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpq_poly_t a, b;
|
|
slong coeff = (slong) n_randint(state, 100);
|
|
mpq_t x1, x2;
|
|
fmpz_t x1fmpz;
|
|
|
|
mpq_init(x1);
|
|
mpq_init(x2);
|
|
fmpz_init(x1fmpz);
|
|
fmpq_poly_init(a);
|
|
fmpq_poly_init(b);
|
|
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
|
|
|
|
fmpq_poly_set(b, a);
|
|
|
|
fmpq_poly_get_coeff_mpq(x2, b, coeff);
|
|
do
|
|
{
|
|
fmpz_randtest(x1fmpz, state, 200);
|
|
fmpz_get_mpz(mpq_numref(x1), x1fmpz);
|
|
flint_mpz_set_si(mpq_denref(x1), 1);
|
|
} while (mpq_equal(x1, x2));
|
|
fmpq_poly_set_coeff_mpq(b, coeff, x1);
|
|
|
|
result = (!fmpq_poly_equal(a, b));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n");
|
|
flint_printf("alloc = %wd\nlength = %wd\n\n", a->alloc, a->length);
|
|
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
|
|
flint_printf("alloc = %wd\nlength = %wd\n\n", b->alloc, b->length);
|
|
flint_printf("!equal(a, b) = %d\n", result);
|
|
abort();
|
|
}
|
|
|
|
mpq_clear(x1);
|
|
mpq_clear(x2);
|
|
fmpz_clear(x1fmpz);
|
|
fmpq_poly_clear(a);
|
|
fmpq_poly_clear(b);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return 0;
|
|
}
|