pqc/external/flint-2.4.3/qadic/test/t-exp_balanced.c
2014-05-24 23:16:06 +02:00

152 lines
4.7 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
******************************************************************************/
#include <stdio.h>
#include "qadic.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("exp_balanced... ");
fflush(stdout);
/* Check aliasing */
for (i = 0; i < 1000; i++)
{
fmpz_t p;
slong d, N;
qadic_ctx_t ctx;
qadic_t a, b, c;
int ans1, ans2;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
d = n_randint(state, 10) + 1;
N = n_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0, N-10), FLINT_MAX(0, N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c, N);
qadic_randtest(a, state, ctx);
qadic_set(b, a, ctx);
ans1 = qadic_exp_balanced(c, b, ctx);
ans2 = qadic_exp_balanced(b, b, ctx);
result = ((ans1 == ans2) && (!ans1 || qadic_equal(b, c)));
if (!result)
{
flint_printf("FAIL (alias):\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("c = "), qadic_print_pretty(c, ctx), flint_printf("\n");
flint_printf("ans1 = %d\n", ans1);
flint_printf("ans2 = %d\n", ans2);
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
/* Functional equation: exp(a + b) == exp(a) exp(b) */
for (i = 0; i < 1000; i++)
{
fmpz_t p;
slong deg, N;
qadic_ctx_t ctx;
qadic_t a, b, c, d, e, f, g;
int ans1, ans2, ans3;
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
deg = n_randint(state, 10) + 1;
N = n_randint(state, 50) + 1;
qadic_ctx_init_conway(ctx, p, deg, FLINT_MAX(0, N-10), FLINT_MAX(0, N+10), "a", PADIC_SERIES);
qadic_init2(a, N);
qadic_init2(b, N);
qadic_init2(c, N);
qadic_init2(d, N);
qadic_init2(e, N);
qadic_init2(f, N);
qadic_init2(g, N);
qadic_randtest(a, state, ctx);
qadic_randtest(b, state, ctx);
qadic_add(c, a, b, ctx);
ans1 = qadic_exp_balanced(d, a, ctx);
ans2 = qadic_exp_balanced(e, b, ctx);
qadic_mul(f, d, e, ctx);
ans3 = qadic_exp_balanced(g, c, ctx);
result = (!ans1 || !ans2 || (ans3 && qadic_equal(f, g)));
if (!result)
{
flint_printf("FAIL (functional equation):\n\n");
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
flint_printf("c = a + b = "), qadic_print_pretty(c, ctx), flint_printf("\n");
flint_printf("d = exp(a) = "), qadic_print_pretty(d, ctx), flint_printf("\n");
flint_printf("e = exp(b) = "), qadic_print_pretty(e, ctx), flint_printf("\n");
flint_printf("f = exp(a) exp(b) = "), qadic_print_pretty(f, ctx), flint_printf("\n");
flint_printf("g = exp(a + b) = "), qadic_print_pretty(g, ctx), flint_printf("\n");
abort();
}
qadic_clear(a);
qadic_clear(b);
qadic_clear(c);
qadic_clear(d);
qadic_clear(e);
qadic_clear(f);
qadic_clear(g);
fmpz_clear(p);
qadic_ctx_clear(ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}