140 lines
3.9 KiB
C
140 lines
3.9 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 <stdlib.h>
|
|
|
|
#include "qadic.h"
|
|
#include "ulong_extras.h"
|
|
#include "long_extras.h"
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int i, result;
|
|
FLINT_TEST_INIT(state);
|
|
|
|
flint_printf("teichmuller... ");
|
|
fflush(stdout);
|
|
|
|
|
|
|
|
/* Check aliasing */
|
|
for (i = 0; i < 100; i++)
|
|
{
|
|
fmpz_t p;
|
|
slong d, N;
|
|
qadic_ctx_t ctx;
|
|
|
|
qadic_t a, b, c;
|
|
|
|
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_int(a, state, ctx);
|
|
qadic_set(b, a, ctx);
|
|
|
|
qadic_teichmuller(c, b, ctx);
|
|
qadic_teichmuller(b, b, ctx);
|
|
|
|
result = (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");
|
|
abort();
|
|
}
|
|
|
|
qadic_clear(a);
|
|
qadic_clear(b);
|
|
qadic_clear(c);
|
|
|
|
fmpz_clear(p);
|
|
qadic_ctx_clear(ctx);
|
|
}
|
|
|
|
/* Check x^q == x for units */
|
|
for (i = 0; i < 100; i++)
|
|
{
|
|
fmpz_t p, q;
|
|
slong d, N;
|
|
qadic_ctx_t ctx;
|
|
|
|
qadic_t a, b, c;
|
|
|
|
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);
|
|
|
|
fmpz_init(q);
|
|
fmpz_pow_ui(q, p, d);
|
|
|
|
qadic_init2(a, N);
|
|
qadic_init2(b, N);
|
|
qadic_init2(c, N);
|
|
|
|
qadic_randtest_val(a, state, 0, ctx);
|
|
|
|
qadic_teichmuller(b, a, ctx);
|
|
qadic_pow(c, b, q, ctx);
|
|
|
|
result = (qadic_equal(c, b));
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL (x^q == x):\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("p = "), fmpz_print(p), flint_printf("\n");
|
|
flint_printf("d = %wd\n", d);
|
|
flint_printf("N = %wd\n", N);
|
|
abort();
|
|
}
|
|
|
|
qadic_clear(a);
|
|
qadic_clear(b);
|
|
qadic_clear(c);
|
|
|
|
fmpz_clear(p);
|
|
fmpz_clear(q);
|
|
qadic_ctx_clear(ctx);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|