127 lines
3.6 KiB
C
127 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) 2012 Sebastian Pancratz
|
|
|
|
******************************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "padic_poly.h"
|
|
#include "ulong_extras.h"
|
|
#include "long_extras.h"
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int i, result;
|
|
|
|
fmpz_t p;
|
|
slong N;
|
|
padic_ctx_t ctx;
|
|
|
|
FLINT_TEST_INIT(state);
|
|
|
|
flint_printf("neg... ");
|
|
fflush(stdout);
|
|
|
|
/* Aliasing */
|
|
for (i = 0; i < 10000; i++)
|
|
{
|
|
padic_poly_t a, b, c;
|
|
|
|
fmpz_init_set_ui(p, n_randtest_prime(state, 0));
|
|
N = n_randint(state, PADIC_TEST_PREC_MAX - PADIC_TEST_PREC_MIN)
|
|
+ PADIC_TEST_PREC_MIN;
|
|
padic_ctx_init(ctx, p, FLINT_MAX(0, N-10), FLINT_MAX(0, N+10), PADIC_SERIES);
|
|
|
|
padic_poly_init2(a, 0, N);
|
|
padic_poly_init2(b, 0, N);
|
|
padic_poly_init2(c, 0, N);
|
|
|
|
padic_poly_randtest(a, state, n_randint(state, 100), ctx);
|
|
padic_poly_set(b, a, ctx);
|
|
|
|
padic_poly_neg(c, b, ctx);
|
|
padic_poly_neg(b, b, ctx);
|
|
|
|
result = (padic_poly_equal(b, c) && padic_poly_is_reduced(b, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
padic_poly_print(a, ctx), flint_printf("\n\n");
|
|
padic_poly_print(b, ctx), flint_printf("\n\n");
|
|
padic_poly_print(c, ctx), flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
padic_poly_clear(a);
|
|
padic_poly_clear(b);
|
|
padic_poly_clear(c);
|
|
|
|
padic_ctx_clear(ctx);
|
|
fmpz_clear(p);
|
|
}
|
|
|
|
/* Check that --a = a */
|
|
for (i = 0; i < 10000; i++)
|
|
{
|
|
padic_poly_t a, b, c;
|
|
|
|
fmpz_init_set_ui(p, n_randtest_prime(state, 0));
|
|
N = n_randint(state, PADIC_TEST_PREC_MAX - PADIC_TEST_PREC_MIN)
|
|
+ PADIC_TEST_PREC_MIN;
|
|
padic_ctx_init(ctx, p, FLINT_MAX(0, N-10), FLINT_MAX(0, N+10), PADIC_SERIES);
|
|
|
|
padic_poly_init2(a, 0, N);
|
|
padic_poly_init2(b, 0, N);
|
|
padic_poly_init2(c, 0, N);
|
|
|
|
padic_poly_randtest(a, state, n_randint(state, 100), ctx);
|
|
|
|
padic_poly_neg(b, a, ctx);
|
|
padic_poly_neg(c, b, ctx);
|
|
|
|
result = (padic_poly_equal(a, c) && padic_poly_is_reduced(a, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
padic_poly_print(a, ctx), flint_printf("\n\n");
|
|
padic_poly_print(b, ctx), flint_printf("\n\n");
|
|
padic_poly_print(c, ctx), flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
padic_poly_clear(a);
|
|
padic_poly_clear(b);
|
|
padic_poly_clear(c);
|
|
|
|
padic_ctx_clear(ctx);
|
|
fmpz_clear(p);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|