void sample(void * arg, ulong count)
{
info_t * info = (info_t *) arg;
slong length = info->length, i, j;
int monic = info->monic;
int scale;
scale = 1000;
if (length >= 50) scale = 100;
if (length >= 500) scale = 40;
flint_rand_t state;
flint_randinit(state);
fmpq_poly_t pol;
nf_t nf;
nf_elem_t a;
fmpq_t norm;
fmpq_poly_init(pol);
fmpq_init(norm);
for (i = 0; i < count; i++)
{
random_fmpq_poly(pol, state, length);
if (monic)
{
fmpz_one(fmpq_poly_denref(pol));
fmpq_poly_set_coeff_ui(pol, length - 1, 1);
}
nf_init(nf, pol);
nf_elem_init(a, nf);
random_nf_elem(a, state, nf);
if (monic)
fmpz_one(fmpq_poly_denref(NF_ELEM(a)));
prof_start();
for (j = 0; j < scale; j++)
{
nf_elem_trace(norm, a, nf);
}
prof_stop();
}
fmpq_clear(norm);
nf_elem_clear(a, nf);
nf_clear(nf);
fmpq_poly_clear(pol);
flint_randclear(state);
}
int main()
{
fmpq_poly_t P, Q;
mpz_t t;
slong k, n;
FLINT_TEST_INIT(state);
flint_printf("bernoulli_polynomial....");
fflush(stdout);
for (n = 0; n <= 100; n++)
{
fmpq_poly_init(P);
fmpq_poly_init(Q);
mpz_init(t);
for (k = 0; k <= n; k++)
{
arith_bernoulli_polynomial(P, k);
flint_mpz_bin_uiui(t, n+1, k);
fmpq_poly_scalar_mul_mpz(P, P, t);
fmpq_poly_add(Q, Q, P);
}
fmpq_poly_scalar_div_ui(Q, Q, n+1);
mpz_clear(t);
fmpq_poly_zero(P);
fmpq_poly_set_coeff_ui(P, n, UWORD(1));
if (!fmpq_poly_equal(P, Q))
{
flint_printf("ERROR: sum up to n = %wd did not add to x^n\n", n);
flint_printf("Sum: ");
fmpq_poly_print_pretty(Q, "x");
flint_printf("\nExpected: ");
fmpq_poly_print_pretty(P, "x");
flint_printf("\n");
abort();
}
fmpq_poly_clear(P);
fmpq_poly_clear(Q);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int main()
{
fmpq_poly_t Pn, Pn1, Pn2, R;
long n;
printf("legendre_polynomial....");
fflush(stdout);
fmpq_poly_init(Pn);
fmpq_poly_init(Pn1);
fmpq_poly_init(Pn2);
fmpq_poly_init(R);
fmpq_poly_set_ui(Pn, 1UL);
fmpq_poly_set_coeff_ui(Pn1, 1, 1UL);
for (n = 0; n <= 500; n++)
{
legendre_polynomial(R, n);
if (!fmpq_poly_equal(Pn, R))
{
printf("FAIL: n = %ld\n", n);
printf("Direct: "); fmpq_poly_print_pretty(R, "x"); printf("\n");
printf("Recur.: "); fmpq_poly_print_pretty(Pn, "x"); printf("\n");
abort();
}
fmpq_poly_shift_left(Pn2, Pn1, 1);
fmpq_poly_scalar_mul_ui(Pn2, Pn2, 2*n + 3);
fmpq_poly_scalar_mul_si(Pn, Pn, -(n+1));
fmpq_poly_add(Pn2, Pn2, Pn);
fmpq_poly_scalar_div_ui(Pn2, Pn2, n+2);
fmpq_poly_swap(Pn, Pn1);
fmpq_poly_swap(Pn1, Pn2);
}
fmpq_poly_clear(Pn);
fmpq_poly_clear(Pn1);
fmpq_poly_clear(Pn2);
fmpq_poly_clear(R);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
int main()
{
long iter;
flint_rand_t state;
printf("log_series....");
fflush(stdout);
flint_randinit(state);
/* compare with fmpq_poly */
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2;
fmpq_poly_t A, B;
acb_poly_t a, b;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
fmpq_poly_init(B);
acb_poly_init(a);
acb_poly_init(b);
fmpq_poly_randtest_not_zero(A, state, m, qbits);
fmpq_poly_set_coeff_ui(A, 0, 1UL);
fmpq_poly_log_series(B, A, n);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_randtest(b, state, 1 + n_randint(state, 20), rbits1, 5);
acb_poly_log_series(b, a, n, rbits2);
if (!acb_poly_contains_fmpq_poly(b, B))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("B = "); fmpq_poly_print(B); printf("\n\n");
printf("a = "); acb_poly_printd(a, 15); printf("\n\n");
printf("b = "); acb_poly_printd(b, 15); printf("\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
acb_poly_clear(a);
acb_poly_clear(b);
}
/* test aliasing */
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2;
fmpq_poly_t A;
acb_poly_t a, b;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
acb_poly_init(a);
acb_poly_init(b);
do {
fmpq_poly_randtest_not_zero(A, state, m, qbits);
} while (fmpz_sgn(A->coeffs + 0) <= 0);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_log_series(b, a, n, rbits2);
acb_poly_log_series(a, a, n, rbits2);
if (!acb_poly_equal(a, b))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("a = "); acb_poly_printd(a, 15); printf("\n\n");
printf("b = "); acb_poly_printd(b, 15); printf("\n\n");
abort();
}
fmpq_poly_clear(A);
acb_poly_clear(a);
acb_poly_clear(b);
}
/* test that exp(log(f)) contains f */
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2, rbits3;
fmpq_poly_t A;
acb_poly_t a, b, c;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
acb_poly_init(a);
acb_poly_init(b);
acb_poly_init(c);
do {
fmpq_poly_randtest_not_zero(A, state, m, qbits);
} while (fmpz_sgn(A->coeffs + 0) <= 0);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_randtest(b, state, 1 + n_randint(state, 20), rbits1, 5);
acb_poly_log_series(b, a, n, rbits2);
acb_poly_exp_series_basecase(c, b, n, rbits3);
fmpq_poly_truncate(A, n);
if (!acb_poly_contains_fmpq_poly(c, A))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("bits3 = %ld\n", rbits3);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("a = "); acb_poly_printd(a, 15); printf("\n\n");
printf("b = "); acb_poly_printd(b, 15); printf("\n\n");
printf("c = "); acb_poly_printd(c, 15); printf("\n\n");
abort();
}
fmpq_poly_clear(A);
acb_poly_clear(a);
acb_poly_clear(b);
acb_poly_clear(c);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("revert_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
slong qbits1, rbits1, rbits2, n;
fmpq_poly_t A, B;
acb_poly_t a, b, c;
qbits1 = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
n = 2 + n_randint(state, 25);
fmpq_poly_init(A);
fmpq_poly_init(B);
acb_poly_init(a);
acb_poly_init(b);
acb_poly_init(c);
do {
fmpq_poly_randtest(A, state, 1 + n_randint(state, 25), qbits1);
fmpq_poly_set_coeff_ui(A, 0, 0);
} while (A->length < 2 || fmpz_is_zero(A->coeffs + 1));
fmpq_poly_revert_series(B, A, n);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_revert_series(b, a, n, rbits2);
if (!acb_poly_contains_fmpq_poly(b, B))
{
flint_printf("FAIL\n\n");
flint_printf("n = %wd, bits2 = %wd\n", n, rbits2);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("B = "); fmpq_poly_print(B); flint_printf("\n\n");
flint_printf("a = "); acb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); acb_poly_printd(b, 15); flint_printf("\n\n");
abort();
}
acb_poly_set(c, a);
acb_poly_revert_series(c, c, n, rbits2);
if (!acb_poly_equal(c, b))
{
flint_printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
acb_poly_clear(a);
acb_poly_clear(b);
acb_poly_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("compose_series_horner....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 3000 * arb_test_multiplier(); iter++)
{
slong qbits1, qbits2, rbits1, rbits2, rbits3, n;
fmpq_poly_t A, B, C;
acb_poly_t a, b, c, d;
qbits1 = 2 + n_randint(state, 200);
qbits2 = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
n = 2 + n_randint(state, 25);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(C);
acb_poly_init(a);
acb_poly_init(b);
acb_poly_init(c);
acb_poly_init(d);
fmpq_poly_randtest(A, state, 1 + n_randint(state, 25), qbits1);
fmpq_poly_randtest(B, state, 1 + n_randint(state, 25), qbits2);
fmpq_poly_set_coeff_ui(B, 0, 0);
fmpq_poly_compose_series(C, A, B, n);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_set_fmpq_poly(b, B, rbits2);
acb_poly_compose_series_horner(c, a, b, n, rbits3);
if (!acb_poly_contains_fmpq_poly(c, C))
{
flint_printf("FAIL\n\n");
flint_printf("n = %wd, bits3 = %wd\n", n, rbits3);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("B = "); fmpq_poly_print(B); flint_printf("\n\n");
flint_printf("C = "); fmpq_poly_print(C); flint_printf("\n\n");
flint_printf("a = "); acb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); acb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); acb_poly_printd(c, 15); flint_printf("\n\n");
abort();
}
acb_poly_set(d, a);
acb_poly_compose_series_horner(d, d, b, n, rbits3);
if (!acb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 1)\n\n");
abort();
}
acb_poly_set(d, b);
acb_poly_compose_series_horner(d, a, d, n, rbits3);
if (!acb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 2)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(C);
acb_poly_clear(a);
acb_poly_clear(b);
acb_poly_clear(c);
acb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
ulong cflags = UWORD(0);
FLINT_TEST_INIT(state);
flint_printf("sqrt_series....");
fflush(stdout);
/* Check aliasing of a and c */
for (i = 0; i < 50 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b;
slong n = n_randint(state, 50) + 1;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 50) + 1, 50);
fmpq_poly_set_coeff_ui(a, 0, UWORD(1));
fmpq_poly_canonicalise(a);
fmpq_poly_sqrt_series(b, a, n);
fmpq_poly_sqrt_series(a, a, n);
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
result = (fmpq_poly_equal(a, b) && !cflags);
if (!result)
{
flint_printf("FAIL:\n");
fmpq_poly_debug(a), flint_printf("\n\n");
fmpq_poly_debug(b), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
}
/* Check sqrt(a)^2 = a */
for (i = 0; i < 50 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b, c;
slong n = n_randint(state, 80) + 1;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_init(c);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 80) + 1, 80);
fmpq_poly_set_coeff_ui(a, 0, UWORD(1));
fmpq_poly_sqrt_series(b, a, n);
fmpq_poly_mullow(c, b, b, n);
fmpq_poly_truncate(a, n);
cflags |= fmpq_poly_is_canonical(b) ? 0 : 1;
result = (fmpq_poly_equal(c, a) && !cflags);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a = "), fmpq_poly_debug(a), flint_printf("\n\n");
flint_printf("b = "), fmpq_poly_debug(b), flint_printf("\n\n");
flint_printf("c = "), fmpq_poly_debug(c), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
fmpq_poly_clear(c);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
int i, result;
ulong cflags = UWORD(0);
FLINT_TEST_INIT(state);
flint_printf("asinh_series....");
fflush(stdout);
/* Check aliasing of a and c */
for (i = 0; i < 20 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b;
slong n = n_randint(state, 50) + 1;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 50) + 1, 50);
fmpq_poly_set_coeff_ui(a, 0, UWORD(0));
fmpq_poly_canonicalise(a);
fmpq_poly_asinh_series(b, a, n);
fmpq_poly_asinh_series(a, a, n);
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
result = (fmpq_poly_equal(a, b) && !cflags);
if (!result)
{
flint_printf("FAIL:\n");
fmpq_poly_debug(a), flint_printf("\n\n");
fmpq_poly_debug(b), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
}
/* Check asinh(A) = atanh(A/sqrt(1+A^2)) */
for (i = 0; i < 20 * flint_test_multiplier(); i++)
{
fmpq_poly_t A, B, asinhA, atanhB;
slong n = n_randint(state, 80) + 1;
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(asinhA);
fmpq_poly_init(atanhB);
fmpq_poly_randtest_not_zero(A, state, n_randint(state, 80) + 1, 80);
fmpq_poly_set_coeff_ui(A, 0, UWORD(0));
fmpq_poly_mullow(B, A, A, n);
fmpq_poly_set_coeff_ui(B, 0, UWORD(1));
fmpq_poly_invsqrt_series(B, B, n);
fmpq_poly_mullow(B, A, B, n);
fmpq_poly_asinh_series(asinhA, A, n);
fmpq_poly_atanh_series(atanhB, B, n);
cflags |= fmpq_poly_is_canonical(asinhA) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(atanhB) ? 0 : 2;
result = (fmpq_poly_equal(asinhA, atanhB) && !cflags);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("A = "), fmpq_poly_debug(A), flint_printf("\n\n");
flint_printf("B = "), fmpq_poly_debug(B), flint_printf("\n\n");
flint_printf("asinh(A) = "), fmpq_poly_debug(asinhA), flint_printf("\n\n");
flint_printf("atanh(B) = "), fmpq_poly_debug(atanhB), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(asinhA);
fmpq_poly_clear(atanhB);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
int i, result;
flint_rand_t state;
ulong cflags = 0UL;
printf("sinh_series....");
fflush(stdout);
flint_randinit(state);
/* Check aliasing of a and c */
for (i = 0; i < 200; i++)
{
fmpq_poly_t a, b;
long n = n_randint(state, 50) + 1;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 50) + 1, 50);
fmpq_poly_set_coeff_ui(a, 0, 0UL);
fmpq_poly_canonicalise(a);
fmpq_poly_sinh_series(b, a, n);
fmpq_poly_sinh_series(a, a, n);
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
result = (fmpq_poly_equal(a, b) && !cflags);
if (!result)
{
printf("FAIL:\n");
fmpq_poly_debug(a), printf("\n\n");
fmpq_poly_debug(b), printf("\n\n");
printf("cflags = %lu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
}
/* Check asinh(sinh(a)) = a */
for (i = 0; i < 200; i++)
{
fmpq_poly_t a, sinha, asinhsinha;
long n = n_randint(state, 80) + 1;
fmpq_poly_init(a);
fmpq_poly_init(sinha);
fmpq_poly_init(asinhsinha);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 60) + 1, 80);
fmpq_poly_set_coeff_ui(a, 0, 0UL);
fmpq_poly_sinh_series(sinha, a, n);
fmpq_poly_asinh_series(asinhsinha, sinha, n);
fmpq_poly_truncate(a, n);
cflags |= fmpq_poly_is_canonical(sinha) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(asinhsinha) ? 0 : 2;
result = (fmpq_poly_equal(asinhsinha, a) && !cflags);
if (!result)
{
printf("FAIL:\n");
printf("a = "), fmpq_poly_debug(a), printf("\n\n");
printf("sinh(a) = "), fmpq_poly_debug(sinha), printf("\n\n");
printf("asinh(sinh(a)) = "), fmpq_poly_debug(asinhsinha), printf("\n\n");
printf("cflags = %lu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(sinha);
fmpq_poly_clear(asinhsinha);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("compose_series_brent_kung....");
fflush(stdout);
/* Check aliasing of the first argument */
for (i = 0; i < 10 * flint_test_multiplier(); i++)
{
fmpq_poly_t f, g, h;
slong n;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_randtest(g, state, n_randint(state, 40), 80);
fmpq_poly_randtest(h, state, n_randint(state, 20), 50);
fmpq_poly_set_coeff_ui(h, 0, 0);
n = n_randint(state, 20);
fmpq_poly_compose_series_brent_kung(f, g, h, n);
fmpq_poly_compose_series_brent_kung(g, g, h, n);
result = (fmpq_poly_equal(f, g));
if (!result)
{
flint_printf("FAIL (aliasing 1):\n");
fmpq_poly_print(f), flint_printf("\n\n");
fmpq_poly_print(g), flint_printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
}
/* Check aliasing of the second argument */
for (i = 0; i < 10 * flint_test_multiplier(); i++)
{
fmpq_poly_t f, g, h;
slong n;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_randtest(g, state, n_randint(state, 40), 80);
fmpq_poly_randtest(h, state, n_randint(state, 20), 50);
fmpq_poly_set_coeff_ui(h, 0, 0);
n = n_randint(state, 20);
fmpq_poly_compose_series_brent_kung(f, g, h, n);
fmpq_poly_compose_series_brent_kung(h, g, h, n);
result = (fmpq_poly_equal(f, h));
if (!result)
{
flint_printf("FAIL (aliasing 2):\n");
fmpq_poly_print(f), flint_printf("\n\n");
fmpq_poly_print(h), flint_printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
}
/* Compare with compose */
for (i = 0; i < 20 * flint_test_multiplier(); i++)
{
fmpq_poly_t f, g, h, s, t;
slong n;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_init(s);
fmpq_poly_init(t);
fmpq_poly_randtest(g, state, n_randint(state, 40), 80);
fmpq_poly_randtest(h, state, n_randint(state, 20), 50);
fmpq_poly_set_coeff_ui(h, 0, 0);
n = n_randint(state, 20);
fmpq_poly_compose(s, g, h);
fmpq_poly_truncate(s, n);
fmpq_poly_compose_series_brent_kung(f, g, h, n);
result = (fmpq_poly_equal(f, s));
if (!result)
{
flint_printf("FAIL (comparison):\n");
flint_printf("n = %wd\n", n);
flint_printf("g = "), fmpq_poly_print(g), flint_printf("\n\n");
flint_printf("h = "), fmpq_poly_print(h), flint_printf("\n\n");
flint_printf("f = "), fmpq_poly_print(f), flint_printf("\n\n");
flint_printf("s = "), fmpq_poly_print(s), flint_printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
fmpq_poly_clear(s);
fmpq_poly_clear(t);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
int i, result;
flint_rand_t state;
ulong cflags = 0UL;
printf("exp_series....");
fflush(stdout);
flint_randinit(state);
/* Check aliasing of a and c */
for (i = 0; i < 200; i++)
{
fmpq_poly_t a, b;
long n = n_randint(state, 50) + 1;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 50) + 1, 50);
fmpq_poly_set_coeff_ui(a, 0, 0UL);
fmpq_poly_canonicalise(a);
fmpq_poly_exp_series(b, a, n);
fmpq_poly_exp_series(a, a, n);
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
result = (fmpq_poly_equal(a, b) && !cflags);
if (!result)
{
printf("FAIL:\n");
fmpq_poly_debug(a), printf("\n\n");
fmpq_poly_debug(b), printf("\n\n");
printf("cflags = %lu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
}
/* Check exp(a+b) = exp(a) * exp(b) */
for (i = 0; i < 500; i++)
{
fmpq_poly_t a, b, ab, expa, expb, expab, expa_expb;
long n = n_randint(state, 80) + 1;
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_init(ab);
fmpq_poly_init(expa);
fmpq_poly_init(expb);
fmpq_poly_init(expab);
fmpq_poly_init(expa_expb);
fmpq_poly_randtest_not_zero(a, state, n_randint(state, 60) + 1, 80);
fmpq_poly_set_coeff_ui(a, 0, 0UL);
fmpq_poly_randtest_not_zero(b, state, n_randint(state, 60) + 1, 80);
fmpq_poly_set_coeff_ui(b, 0, 0UL);
fmpq_poly_add(ab, a, b);
fmpq_poly_exp_series(expab, ab, n);
fmpq_poly_exp_series(expa, a, n);
fmpq_poly_exp_series(expb, b, n);
fmpq_poly_mullow(expa_expb, expa, expb, n);
cflags |= fmpq_poly_is_canonical(expa) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(expb) ? 0 : 2;
cflags |= fmpq_poly_is_canonical(expab) ? 0 : 4;
result = (fmpq_poly_equal(expab, expa_expb) && !cflags);
if (!result)
{
printf("FAIL:\n");
printf("a = "), fmpq_poly_debug(a), printf("\n\n");
printf("b = "), fmpq_poly_debug(b), printf("\n\n");
printf("exp(a) = "), fmpq_poly_debug(expa), printf("\n\n");
printf("exp(b) = "), fmpq_poly_debug(expb), printf("\n\n");
printf("exp(ab) = "), fmpq_poly_debug(expab), printf("\n\n");
printf("cflags = %lu\n\n", cflags);
abort();
}
fmpq_poly_clear(a);
fmpq_poly_clear(b);
fmpq_poly_clear(ab);
fmpq_poly_clear(expa);
fmpq_poly_clear(expb);
fmpq_poly_clear(expab);
fmpq_poly_clear(expa_expb);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
