162 lines
5.1 KiB
C
162 lines
5.1 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
|
|
|
|
******************************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <gmp.h>
|
|
#include "flint.h"
|
|
#include "fmpz.h"
|
|
#include "fmpz_poly.h"
|
|
#include "fmpq_poly.h"
|
|
#include "ulong_extras.h"
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int i, result;
|
|
ulong cflags = UWORD(0);
|
|
|
|
FLINT_TEST_INIT(state);
|
|
|
|
flint_printf("div_series....");
|
|
fflush(stdout);
|
|
|
|
/* Check aliasing q and a */
|
|
for (i = 0; i < 100 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpq_poly_t a, b, q;
|
|
slong n = n_randint(state, 50) + 1;
|
|
|
|
fmpq_poly_init(a);
|
|
fmpq_poly_init(b);
|
|
fmpq_poly_init(q);
|
|
|
|
fmpq_poly_randtest(a, state, n_randint(state, 50) + 1, 80);
|
|
fmpq_poly_randtest_not_zero(b, state, n_randint(state, 50) + 1, 80);
|
|
fmpq_poly_set_coeff_ui(b, 0, 1);
|
|
|
|
fmpq_poly_div_series(q, a, b, n);
|
|
fmpq_poly_div_series(a, a, b, n);
|
|
|
|
cflags |= fmpq_poly_is_canonical(q) ? 0 : 1;
|
|
cflags |= fmpq_poly_is_canonical(a) ? 0 : 2;
|
|
result = (fmpq_poly_equal(q, a)) && !cflags;
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL (alias q and a):\n");
|
|
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n\n");
|
|
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
|
|
flint_printf("q = "), fmpq_poly_debug(q), flint_printf("\n\n");
|
|
flint_printf("cflags = %wu\n\n", cflags);
|
|
abort();
|
|
}
|
|
|
|
fmpq_poly_clear(a);
|
|
fmpq_poly_clear(b);
|
|
fmpq_poly_clear(q);
|
|
}
|
|
|
|
/* Check aliasing q and b */
|
|
for (i = 0; i < 100 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpq_poly_t a, b, q;
|
|
slong n = n_randint(state, 50) + 1;
|
|
|
|
fmpq_poly_init(a);
|
|
fmpq_poly_init(b);
|
|
fmpq_poly_init(q);
|
|
|
|
fmpq_poly_randtest(a, state, n_randint(state, 50) + 1, 80);
|
|
fmpq_poly_randtest_not_zero(b, state, n_randint(state, 50) + 1, 80);
|
|
fmpq_poly_set_coeff_ui(b, 0, 1);
|
|
|
|
fmpq_poly_div_series(q, a, b, n);
|
|
fmpq_poly_div_series(b, a, b, n);
|
|
|
|
cflags |= fmpq_poly_is_canonical(q) ? 0 : 1;
|
|
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
|
|
result = (fmpq_poly_equal(q, b)) && !cflags;
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL (alias q and b):\n");
|
|
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n\n");
|
|
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
|
|
flint_printf("q = "), fmpq_poly_debug(q), flint_printf("\n\n");
|
|
flint_printf("cflags = %wu\n\n", cflags);
|
|
abort();
|
|
}
|
|
|
|
fmpq_poly_clear(a);
|
|
fmpq_poly_clear(b);
|
|
fmpq_poly_clear(q);
|
|
}
|
|
|
|
/* Check that Q * B == A */
|
|
for (i = 0; i < 100 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpq_poly_t a, b, p, q;
|
|
slong n = n_randint(state, 50) + 1;
|
|
|
|
fmpq_poly_init(a);
|
|
fmpq_poly_init(b);
|
|
fmpq_poly_init(p);
|
|
fmpq_poly_init(q);
|
|
|
|
fmpq_poly_randtest(a, state, n_randint(state, 50) + 1, 80);
|
|
fmpq_poly_randtest_not_zero(b, state, n_randint(state, 50) + 1, 80);
|
|
fmpq_poly_set_coeff_ui(b, 0, 1);
|
|
|
|
fmpq_poly_div_series(q, a, b, n);
|
|
fmpq_poly_mullow(p, q, b, n);
|
|
|
|
fmpq_poly_truncate(a, n);
|
|
|
|
cflags |= fmpq_poly_is_canonical(q) ? 0 : 1;
|
|
cflags |= fmpq_poly_is_canonical(p) ? 0 : 2;
|
|
cflags |= fmpq_poly_is_canonical(a) ? 0 : 4;
|
|
result = (fmpq_poly_equal(p, a)) && !cflags;
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL (check Q * B = A):\n");
|
|
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n\n");
|
|
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
|
|
flint_printf("p = "), fmpq_poly_debug(p), flint_printf("\n\n");
|
|
flint_printf("q = "), fmpq_poly_debug(q), flint_printf("\n\n");
|
|
flint_printf("cflags = %wu\n\n", cflags);
|
|
abort();
|
|
}
|
|
|
|
fmpq_poly_clear(a);
|
|
fmpq_poly_clear(b);
|
|
fmpq_poly_clear(p);
|
|
fmpq_poly_clear(q);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return 0;
|
|
}
|