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

129 lines
3.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) 2010 William Hart
Copyright (C) 2011 Fredrik Johansson
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "nmod_poly.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result = 1;
FLINT_TEST_INIT(state);
flint_printf("cosh_series....");
fflush(stdout);
/* Check cosh(A)^2-1 = sinh(A)^2 */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
nmod_poly_t A, coshA, sinhA, B, C, one;
slong n;
mp_limb_t mod;
do { mod = n_randtest_prime(state, 0); } while (mod == 2);
n = 1 + n_randtest(state) % 100;
n = FLINT_MIN(n, mod);
nmod_poly_init(A, mod);
nmod_poly_init(coshA, mod);
nmod_poly_init(sinhA, mod);
nmod_poly_init(B, mod);
nmod_poly_init(C, mod);
nmod_poly_init(one, mod);
nmod_poly_randtest(A, state, n_randint(state, 100));
nmod_poly_set_coeff_ui(A, 0, UWORD(0));
nmod_poly_cosh_series(coshA, A, n);
nmod_poly_sinh_series(sinhA, A, n);
nmod_poly_mullow(B, coshA, coshA, n);
nmod_poly_set_coeff_ui(one, 0, UWORD(1));
nmod_poly_sub(B, B, one);
nmod_poly_mullow(C, sinhA, sinhA, n);
result = nmod_poly_equal(B, C);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("n = %wd, mod = %wu\n", n, mod);
flint_printf("A: "); nmod_poly_print(A), flint_printf("\n\n");
flint_printf("cosh(A): "); nmod_poly_print(coshA), flint_printf("\n\n");
flint_printf("cosh(A)^2-1: "); nmod_poly_print(B), flint_printf("\n\n");
flint_printf("sinh(A)^2: "); nmod_poly_print(C), flint_printf("\n\n");
abort();
}
nmod_poly_clear(A);
nmod_poly_clear(coshA);
nmod_poly_clear(sinhA);
nmod_poly_clear(B);
nmod_poly_clear(C);
nmod_poly_clear(one);
}
/* Check aliasing */
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
nmod_poly_t A, B;
slong n;
mp_limb_t mod;
mod = n_randtest_prime(state, 0);
n = n_randtest(state) % 50;
n = FLINT_MIN(n, mod);
nmod_poly_init(A, mod);
nmod_poly_init(B, mod);
nmod_poly_randtest(A, state, n_randint(state, 50));
nmod_poly_set_coeff_ui(A, 0, UWORD(0));
nmod_poly_cosh_series(B, A, n);
nmod_poly_cosh_series(A, A, n);
result = nmod_poly_equal(A, B);
if (!result)
{
flint_printf("FAIL:\n");
nmod_poly_print(A), flint_printf("\n\n");
nmod_poly_print(B), flint_printf("\n\n");
abort();
}
nmod_poly_clear(A);
nmod_poly_clear(B);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}