185 lines
5.8 KiB
C
185 lines
5.8 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) 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("compose_divconquer... ");
|
|
fflush(stdout);
|
|
|
|
/* Check aliasing of the first argument */
|
|
for (i = 0; i < 50; i++)
|
|
{
|
|
TEMPLATE(T, ctx_t) ctx;
|
|
|
|
TEMPLATE(T, poly_t) f, g, h;
|
|
|
|
TEMPLATE(T, ctx_randtest) (ctx, state);
|
|
TEMPLATE(T, poly_init) (f, ctx);
|
|
TEMPLATE(T, poly_init) (g, ctx);
|
|
TEMPLATE(T, poly_init) (h, ctx);
|
|
|
|
TEMPLATE(T, poly_randtest) (f, state, n_randint(state, 40), ctx);
|
|
TEMPLATE(T, poly_randtest) (g, state, n_randint(state, 20), ctx);
|
|
|
|
TEMPLATE(T, poly_compose_divconquer) (h, f, g, ctx);
|
|
TEMPLATE(T, poly_compose_divconquer) (f, f, g, ctx);
|
|
|
|
result = (TEMPLATE(T, poly_equal) (f, h, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n\n");
|
|
flint_printf("f = "), TEMPLATE(T, poly_print_pretty) (f, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("g = "), TEMPLATE(T, poly_print_pretty) (g, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("h = "), TEMPLATE(T, poly_print_pretty) (h, "X", ctx),
|
|
flint_printf("\n");
|
|
abort();
|
|
}
|
|
|
|
TEMPLATE(T, poly_clear) (f, ctx);
|
|
TEMPLATE(T, poly_clear) (g, ctx);
|
|
TEMPLATE(T, poly_clear) (h, ctx);
|
|
|
|
TEMPLATE(T, ctx_clear) (ctx);
|
|
}
|
|
|
|
/* Check aliasing of the second argument */
|
|
for (i = 0; i < 50; i++)
|
|
{
|
|
TEMPLATE(T, ctx_t) ctx;
|
|
|
|
TEMPLATE(T, poly_t) f, g, h;
|
|
|
|
TEMPLATE(T, ctx_randtest) (ctx, state);
|
|
TEMPLATE(T, poly_init) (f, ctx);
|
|
TEMPLATE(T, poly_init) (g, ctx);
|
|
TEMPLATE(T, poly_init) (h, ctx);
|
|
|
|
TEMPLATE(T, poly_randtest) (f, state, n_randint(state, 40), ctx);
|
|
TEMPLATE(T, poly_randtest) (g, state, n_randint(state, 20), ctx);
|
|
|
|
TEMPLATE(T, poly_compose_divconquer) (h, f, g, ctx);
|
|
TEMPLATE(T, poly_compose_divconquer) (g, f, g, ctx);
|
|
|
|
result = (TEMPLATE(T, poly_equal) (g, h, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n\n");
|
|
flint_printf("f = "), TEMPLATE(T, poly_print_pretty) (f, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("g = "), TEMPLATE(T, poly_print_pretty) (g, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("h = "), TEMPLATE(T, poly_print_pretty) (h, "X", ctx),
|
|
flint_printf("\n");
|
|
abort();
|
|
}
|
|
|
|
TEMPLATE(T, poly_clear) (f, ctx);
|
|
TEMPLATE(T, poly_clear) (g, ctx);
|
|
TEMPLATE(T, poly_clear) (h, ctx);
|
|
|
|
TEMPLATE(T, ctx_clear) (ctx);
|
|
}
|
|
|
|
/* Compare with the naive method */
|
|
for (i = 0; i < 50; i++)
|
|
{
|
|
TEMPLATE(T, ctx_t) ctx;
|
|
|
|
TEMPLATE(T, poly_t) f, g, h, s, t;
|
|
slong k;
|
|
|
|
TEMPLATE(T, ctx_randtest) (ctx, state);
|
|
TEMPLATE(T, poly_init) (f, ctx);
|
|
TEMPLATE(T, poly_init) (g, ctx);
|
|
TEMPLATE(T, poly_init) (h, ctx);
|
|
TEMPLATE(T, poly_init) (s, ctx);
|
|
TEMPLATE(T, poly_init) (t, ctx);
|
|
|
|
TEMPLATE(T, poly_randtest) (g, state, n_randint(state, 40), ctx);
|
|
TEMPLATE(T, poly_randtest) (h, state, n_randint(state, 20), ctx);
|
|
|
|
TEMPLATE(T, poly_one) (t, ctx);
|
|
for (k = 0; k < TEMPLATE(T, poly_length) (g, ctx); k++)
|
|
{
|
|
TEMPLATE(T, TEMPLATE(poly_scalar_addmul, T)) (s, t, g->coeffs + k,
|
|
ctx);
|
|
TEMPLATE(T, poly_mul) (t, t, h, ctx);
|
|
}
|
|
|
|
TEMPLATE(T, poly_compose_divconquer) (f, g, h, ctx);
|
|
|
|
result = (TEMPLATE(T, poly_equal) (f, s, ctx));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n\n");
|
|
flint_printf("f = "), TEMPLATE(T, poly_print_pretty) (f, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("g = "), TEMPLATE(T, poly_print_pretty) (g, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("h = "), TEMPLATE(T, poly_print_pretty) (h, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("s = "), TEMPLATE(T, poly_print_pretty) (s, "X", ctx),
|
|
flint_printf("\n");
|
|
flint_printf("t = "), TEMPLATE(T, poly_print_pretty) (t, "X", ctx),
|
|
flint_printf("\n");
|
|
abort();
|
|
}
|
|
|
|
TEMPLATE(T, poly_clear) (f, ctx);
|
|
TEMPLATE(T, poly_clear) (g, ctx);
|
|
TEMPLATE(T, poly_clear) (h, ctx);
|
|
TEMPLATE(T, poly_clear) (s, ctx);
|
|
TEMPLATE(T, poly_clear) (t, ctx);
|
|
|
|
TEMPLATE(T, ctx_clear) (ctx);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
|
|
|
|
#endif
|