pqc/external/flint-2.4.3/fmpq_poly/test/t-pow.c

128 lines
3.6 KiB
C
Raw Normal View History

2014-05-18 22:03:37 +00:00
/*=============================================================================
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("pow....");
fflush(stdout);
/* Check aliasing of a and b */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b;
ulong exp;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_randtest(b, state, n_randint(state, 10), 100);
exp = (ulong) n_randtest(state) % UWORD(20);
fmpq_poly_pow(a, b, exp);
fmpq_poly_pow(b, b, exp);
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");
flint_printf("exp = %wu\n", exp);
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n\n");
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
}
/* Compare with repeated multiplications by the base */
for (i = 0; i < 200 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b, c;
ulong exp;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_init(c);
fmpq_poly_randtest(b, state, n_randint(state, 10), 100);
exp = (ulong) n_randtest(state) % UWORD(20);
fmpq_poly_pow(a, b, exp);
if (exp == 0)
{
fmpq_poly_set_ui(c, 1);
}
else
{
ulong j;
fmpq_poly_set(c, b);
for (j = 1; j < exp; j++)
fmpq_poly_mul(c, c, b);
}
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
result = (fmpq_poly_equal(a, c) && !cflags);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("exp = %wu\n", exp);
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n\n");
flint_printf("c = "), 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;
}