119 lines
3.6 KiB
C
119 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) 2009 William Hart
|
||
|
Copyright (C) 2010 Sebastian Pancratz
|
||
|
|
||
|
******************************************************************************/
|
||
|
|
||
|
#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;
|
||
|
ulong cflags = UWORD(0);
|
||
|
|
||
|
FLINT_TEST_INIT(state);
|
||
|
|
||
|
flint_printf("scalar_div_ui....");
|
||
|
fflush(stdout);
|
||
|
|
||
|
/* Check aliasing of a and b */
|
||
|
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
|
||
|
{
|
||
|
fmpq_poly_t a, b;
|
||
|
ulong n = n_randtest_not_zero(state);
|
||
|
|
||
|
fmpq_poly_init(a);
|
||
|
fmpq_poly_init(b);
|
||
|
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
|
||
|
|
||
|
fmpq_poly_scalar_div_ui(b, a, n);
|
||
|
fmpq_poly_scalar_div_ui(a, a, n);
|
||
|
|
||
|
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
|
||
|
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
|
||
|
result = (fmpq_poly_equal(a, b) && !cflags);
|
||
|
if (!result)
|
||
|
{
|
||
|
flint_printf("FAIL:\n");
|
||
|
fmpq_poly_debug(a), flint_printf("\n\n");
|
||
|
fmpq_poly_debug(b), flint_printf("\n\n");
|
||
|
flint_printf("cflags = %wu\n\n", cflags);
|
||
|
abort();
|
||
|
}
|
||
|
|
||
|
fmpq_poly_clear(a);
|
||
|
fmpq_poly_clear(b);
|
||
|
}
|
||
|
|
||
|
/* Check (a / n1) / n2 = a / (n1 * n2) */
|
||
|
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
|
||
|
{
|
||
|
fmpq_poly_t a, b, c;
|
||
|
ulong n1 = n_randbits(state, FLINT_BITS / 2);
|
||
|
ulong n2 = n_randbits(state, FLINT_BITS / 2);
|
||
|
if (n1 == UWORD(0))
|
||
|
n1 = UWORD(1);
|
||
|
if (n2 == UWORD(0))
|
||
|
n2 = UWORD(1);
|
||
|
|
||
|
fmpq_poly_init(a);
|
||
|
fmpq_poly_init(b);
|
||
|
fmpq_poly_init(c);
|
||
|
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
|
||
|
|
||
|
fmpq_poly_scalar_div_ui(b, a, n1);
|
||
|
fmpq_poly_scalar_div_ui(c, b, n2);
|
||
|
fmpq_poly_scalar_div_ui(b, a, n1 * n2);
|
||
|
|
||
|
cflags |= fmpq_poly_is_canonical(b) ? 0 : 1;
|
||
|
cflags |= fmpq_poly_is_canonical(c) ? 0 : 2;
|
||
|
result = (fmpq_poly_equal(b, c) && !cflags);
|
||
|
if (!result)
|
||
|
{
|
||
|
flint_printf("FAIL:\n");
|
||
|
flint_printf(" n1 = %wu, n2 = %wu:\n\n", n1, n2);
|
||
|
fmpq_poly_debug(a), flint_printf("\n\n");
|
||
|
fmpq_poly_debug(b), flint_printf("\n\n");
|
||
|
fmpq_poly_debug(c), flint_printf("\n\n");
|
||
|
flint_printf("cflags = %wu\n\n", cflags);
|
||
|
abort();
|
||
|
}
|
||
|
|
||
|
fmpq_poly_clear(a);
|
||
|
fmpq_poly_clear(b);
|
||
|
fmpq_poly_clear(c);
|
||
|
}
|
||
|
|
||
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
||
|
flint_printf("PASS\n");
|
||
|
return 0;
|
||
|
}
|