176 lines
5.2 KiB
C
176 lines
5.2 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) 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("sqr_reorder... ");
|
|
fflush(stdout);
|
|
|
|
/* Check aliasing: a = a * a */
|
|
for (i = 0; i < 2000; i++)
|
|
{
|
|
slong len;
|
|
TEMPLATE(T, ctx_t) ctx;
|
|
|
|
TEMPLATE(T, poly_t) a, c;
|
|
|
|
len = n_randint(state, 50) + 1;
|
|
TEMPLATE(T, ctx_randtest) (ctx, state);
|
|
TEMPLATE(T, poly_init) (a, ctx);
|
|
TEMPLATE(T, poly_init) (c, ctx);
|
|
|
|
TEMPLATE(T, poly_randtest) (a, state, len, ctx);
|
|
|
|
TEMPLATE(T, poly_sqr_reorder) (c, a, ctx);
|
|
TEMPLATE(T, poly_sqr_reorder) (a, a, ctx);
|
|
|
|
result = (TEMPLATE(T, poly_equal) (a, c, 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("c = "), TEMPLATE(T, poly_print_pretty) (c, "X", ctx),
|
|
flint_printf("\n");
|
|
abort();
|
|
}
|
|
|
|
TEMPLATE(T, poly_clear) (a, ctx);
|
|
TEMPLATE(T, poly_clear) (c, ctx);
|
|
|
|
TEMPLATE(T, ctx_clear) (ctx);
|
|
}
|
|
|
|
/* Check that a^2 + a^2 == a * (a + a) */
|
|
for (i = 0; i < 2000; i++)
|
|
{
|
|
slong len;
|
|
TEMPLATE(T, ctx_t) ctx;
|
|
|
|
TEMPLATE(T, poly_t) a, b, c, d;
|
|
|
|
len = n_randint(state, 50) + 1;
|
|
TEMPLATE(T, ctx_randtest) (ctx, state);
|
|
TEMPLATE(T, poly_init) (a, ctx);
|
|
TEMPLATE(T, poly_init) (b, ctx);
|
|
TEMPLATE(T, poly_init) (c, ctx);
|
|
TEMPLATE(T, poly_init) (d, ctx);
|
|
|
|
TEMPLATE(T, poly_randtest) (a, state, len, ctx);
|
|
|
|
TEMPLATE(T, poly_sqr_reorder) (b, a, ctx);
|
|
TEMPLATE(T, poly_add) (c, b, b, ctx);
|
|
|
|
TEMPLATE(T, poly_add) (d, a, a, ctx);
|
|
TEMPLATE(T, poly_mul) (d, a, d, ctx);
|
|
|
|
result = (TEMPLATE(T, poly_equal) (c, d, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL (a^2 + a^2 == a(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");
|
|
flint_printf("c = "), TEMPLATE(T, poly_print_pretty) (c, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("d = "), TEMPLATE(T, poly_print_pretty) (d, "X", ctx),
|
|
flint_printf("\n");
|
|
abort();
|
|
}
|
|
|
|
TEMPLATE(T, poly_clear) (a, ctx);
|
|
TEMPLATE(T, poly_clear) (b, ctx);
|
|
TEMPLATE(T, poly_clear) (c, ctx);
|
|
TEMPLATE(T, poly_clear) (d, ctx);
|
|
|
|
TEMPLATE(T, ctx_clear) (ctx);
|
|
}
|
|
|
|
/* Compare mul() */
|
|
for (i = 0; i < 2000; i++)
|
|
{
|
|
slong len;
|
|
TEMPLATE(T, ctx_t) ctx;
|
|
|
|
TEMPLATE(T, poly_t) a, b, c;
|
|
|
|
len = n_randint(state, 50) + 1;
|
|
TEMPLATE(T, ctx_randtest) (ctx, state);
|
|
TEMPLATE(T, poly_init) (a, ctx);
|
|
TEMPLATE(T, poly_init) (b, ctx);
|
|
TEMPLATE(T, poly_init) (c, ctx);
|
|
|
|
TEMPLATE(T, poly_randtest) (a, state, len, ctx);
|
|
|
|
TEMPLATE(T, poly_mul) (b, a, a, ctx);
|
|
TEMPLATE(T, poly_sqr_reorder) (c, a, ctx);
|
|
|
|
result = (TEMPLATE(T, poly_equal) (b, c, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL (cmp with mul):\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");
|
|
flint_printf("c = "), TEMPLATE(T, poly_print_pretty) (c, "X", ctx),
|
|
flint_printf("\n");
|
|
abort();
|
|
}
|
|
|
|
TEMPLATE(T, poly_clear) (a, ctx);
|
|
TEMPLATE(T, poly_clear) (b, ctx);
|
|
TEMPLATE(T, poly_clear) (c, ctx);
|
|
|
|
TEMPLATE(T, ctx_clear) (ctx);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
|
|
|
|
#endif
|