/*
Copyright (C) 2011 Sebastian Pancratz
Copyright (C) 2009 Bill Hart
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See .
*/
#include
#include
#include
#include "flint.h"
#include "fmpz.h"
#include "ulong_extras.h"
#include "long_extras.h"
#include "padic_poly.h"
int
main(void)
{
int i, result;
fmpz_t p;
slong N;
padic_ctx_t ctx;
FLINT_TEST_INIT(state);
flint_printf("sub... ");
fflush(stdout);
/* Check a - b = a + neg(b) */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
padic_poly_t a, b, c, d;
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_init2(d, 0, N);
padic_poly_randtest(a, state, n_randint(state, 100), ctx);
padic_poly_randtest(b, state, n_randint(state, 100), ctx);
padic_poly_sub(c, a, b, ctx);
padic_poly_neg(b, b, ctx);
padic_poly_add(d, a, b, ctx);
result = (padic_poly_equal(c, d) && padic_poly_is_reduced(c, 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");
padic_poly_print(d, ctx), flint_printf("\n\n");
abort();
}
padic_poly_clear(a);
padic_poly_clear(b);
padic_poly_clear(c);
padic_poly_clear(d);
fmpz_clear(p);
padic_ctx_clear(ctx);
}
/* Check aliasing of a and c */
for (i = 0; i < 1000 * flint_test_multiplier(); 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_randtest(b, state, n_randint(state, 100), ctx);
padic_poly_sub(c, a, b, ctx);
padic_poly_sub(a, a, 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);
fmpz_clear(p);
padic_ctx_clear(ctx);
}
/* Check aliasing of b and c */
for (i = 0; i < 1000 * flint_test_multiplier(); 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_randtest(b, state, n_randint(state, 100), ctx);
padic_poly_sub(c, a, b, ctx);
padic_poly_sub(b, a, 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);
fmpz_clear(p);
padic_ctx_clear(ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}