pqc/external/flint-2.4.3/fq_poly_templates/test/t-neg.c

161 lines
4.4 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) 2012 Sebastian Pancratz
Copyright (C) 2012 Andres Goens
Copyright (C) 2013 Mike Hansen
******************************************************************************/
#ifdef T
#include "templates.h"
#include <stdio.h>
#include <stdlib.h>
#include "ulong_extras.h"
#include "long_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("neg... ");
fflush(stdout);
/* Check aliasing: a = -a */
for (i = 0; i < 2000; i++)
{
slong len;
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b;
len = n_randint(state, 15) + 1;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_randtest) (a, state, len, ctx);
TEMPLATE(T, poly_neg) (b, a, ctx);
TEMPLATE(T, poly_neg) (a, a, ctx);
result = (TEMPLATE(T, poly_equal) (a, b, ctx));
if (!result)
{
flint_printf("FAIL (aliasing):\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
/* Check that -(-a) == a */
for (i = 0; i < 2000; i++)
{
slong len;
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b;
len = n_randint(state, 15) + 1;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_randtest) (a, state, len, ctx);
TEMPLATE(T, poly_neg) (b, a, ctx);
TEMPLATE(T, poly_neg) (b, b, ctx);
result = (TEMPLATE(T, poly_equal) (a, b, ctx));
if (!result)
{
flint_printf("FAIL (-(-a) == a):\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
/* Check that (a + (-a)) == 0 */
for (i = 0; i < 2000; i++)
{
slong len;
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b;
len = n_randint(state, 15) + 1;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_randtest) (a, state, len, ctx);
TEMPLATE(T, poly_neg) (b, a, ctx);
TEMPLATE(T, poly_add) (a, a, b, ctx);
result = (TEMPLATE(T, poly_is_zero) (a, ctx));
if (!result)
{
flint_printf("FAIL (a + (-a) == 0):\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
#endif