int main()
{
slong iter;
flint_rand_t state;
flint_printf("sinh....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 200), 3);
arb_randtest(b, state, 1 + n_randint(state, 200), 3);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_sinh(t, t, MPFR_RNDN);
arb_sinh(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_sinh(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("root_ui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c;
ulong k;
slong prec;
prec = 2 + n_randint(state, 2000);
k = n_randtest_not_zero(state);
arb_init(a);
arb_init(b);
arb_init(c);
arb_randtest(a, state, 1 + n_randint(state, 2000), 1 + n_randint(state, 100));
arb_randtest(b, state, 1 + n_randint(state, 2000), 1 + n_randint(state, 100));
arb_root_ui(b, a, k, prec);
arb_pow_ui(c, b, k, prec);
if (!arb_contains(c, a))
{
flint_printf("FAIL: containment\n\n");
flint_printf("k = %wu\n", k);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
arb_root_ui(a, a, k, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("lgamma....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 3000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 3);
arb_lgamma(b, a, prec1);
arb_lgamma(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
arb_lgamma(a, a, prec2);
if (!arb_equal(a, c))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("rsqrt....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
arb_t a, b, c;
slong prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
arb_init(c);
arb_randtest(a, state, 1 + n_randint(state, 200), 10);
arb_rsqrt(b, a, prec);
arb_inv(c, b, prec);
arb_mul(c, c, c, prec);
if (!arb_contains(c, a))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
arb_rsqrt(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
arb_poly_equal(const arb_poly_t A, const arb_poly_t B)
{
slong i;
if (A->length != B->length)
return 0;
for (i = 0; i < A->length; i++)
if (!arb_equal(A->coeffs + i, B->coeffs + i))
return 0;
return 1;
}
int
main(void)
{
int i, result;
flint_rand_t state;
printf("get_coeff_ptr....");
fflush(stdout);
flint_randinit(state);
for (i = 0; i < 1000; i++)
{
arb_poly_t A;
arb_t a;
long n = n_randint(state, 100);
arb_poly_init(A);
arb_poly_randtest(A, state, n_randint(state, 100), 100, 10);
arb_init(a);
arb_poly_get_coeff_arb(a, A, n);
result = n < arb_poly_length(A) ?
arb_equal(a, arb_poly_get_coeff_ptr(A, n)) :
arb_poly_get_coeff_ptr(A, n) == NULL;
if (!result)
{
printf("FAIL:\n");
printf("A = "), arb_poly_printd(A, 10), printf("\n\n");
printf("a = "), arb_print(a), printf("\n\n");
printf("n = %ld\n\n", n);
abort();
}
arb_poly_clear(A);
arb_clear(a);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("agm....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c;
fmpq_t q, r;
mpfr_t t, u;
slong prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
arb_init(c);
fmpq_init(q);
fmpq_init(r);
mpfr_init2(t, prec + 100);
mpfr_init2(u, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 200), 3);
arb_randtest(b, state, 1 + n_randint(state, 200), 3);
arb_randtest(c, state, 1 + n_randint(state, 200), 3);
arb_agm(c, a, b, prec);
if (arb_equal(a, b))
{
if (!arb_contains(c, a))
{
flint_printf("FAIL: containment (identity)\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
}
else
{
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
arb_get_rand_fmpq(r, state, b, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
fmpq_get_mpfr(u, r, MPFR_RNDN);
mpfr_agm(t, t, u, MPFR_RNDN);
if (!arb_contains_mpfr(c, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
fmpq_clear(q);
fmpq_clear(r);
mpfr_clear(t);
mpfr_clear(u);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("sub_si....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arb_t a, b, c, d;
slong x;
slong prec;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_special(a, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(b, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(c, state, 1 + n_randint(state, 2000), 100);
x = z_randtest(state);
prec = 2 + n_randint(state, 2000);
arb_set_si(b, x);
arb_sub_si(c, a, x, prec);
arb_sub(d, a, b, prec);
if (!arb_equal(c, d))
{
flint_printf("FAIL\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* aliasing */
for (iter = 0; iter < 10000; iter++)
{
arb_t a, b, c;
slong x;
slong prec;
arb_init(a);
arb_init(b);
arb_init(c);
arb_randtest_special(a, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(b, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(c, state, 1 + n_randint(state, 2000), 100);
x = z_randtest(state);
prec = 2 + n_randint(state, 2000);
arb_set_si(b, x);
arb_sub_si(c, a, x, prec);
arb_sub_si(a, a, x, prec);
if (!arb_equal(a, c))
{
flint_printf("FAIL (aliasing)\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
long iter;
flint_rand_t state;
printf("union....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
arb_t x, y, z;
long prec;
int alias;
arb_init(x);
arb_init(y);
arb_init(z);
arb_randtest_special(x, state, 200, 10);
arb_randtest_special(y, state, 200, 10);
arb_randtest_special(z, state, 200, 10);
prec = 2 + n_randint(state, 200);
arb_union(z, x, y, prec);
if (!arb_contains(z, x) || !arb_contains(z, y))
{
printf("FAIL:\n\n");
printf("x = "); arb_print(x); printf("\n\n");
printf("y = "); arb_print(y); printf("\n\n");
printf("z = "); arb_print(z); printf("\n\n");
abort();
}
if (n_randint(state, 2))
{
arb_union(x, x, y, prec);
alias = arb_equal(x, z);
}
else
{
arb_union(y, x, y, prec);
alias = arb_equal(y, z);
}
if (!alias)
{
printf("FAIL (aliasing):\n\n");
printf("x = "); arb_print(x); printf("\n\n");
printf("y = "); arb_print(y); printf("\n\n");
printf("z = "); arb_print(z); printf("\n\n");
abort();
}
arb_clear(x);
arb_clear(y);
arb_clear(z);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("atan....");
fflush(stdout);
flint_randinit(state);
/* Compare with MPFR */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 200), 3);
arb_randtest(b, state, 1 + n_randint(state, 200), 3);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_atan(t, t, MPFR_RNDN);
arb_atan(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_atan(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* Check large arguments. */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 100);
arb_atan(b, a, prec1);
arb_atan(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_abort();
}
/* check tan(atan(x)) = x */
arb_sin_cos(c, d, b, prec1);
arb_div(c, c, d, prec1);
if (!arb_contains(c, a))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* Compare with MPFR, higher precision. */
for (iter = 0; iter < 200 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 5000);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 5000), 8);
arb_randtest(b, state, 1 + n_randint(state, 5000), 8);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_atan(t, t, MPFR_RNDN);
arb_atan(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("a = "); arb_printd(a, 50); flint_printf("\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 50); flint_printf("\n\n");
flint_abort();
}
arb_atan(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* Higher precision + large arguments. */
for (iter = 0; iter < 2000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 5000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(a, state, 1 + n_randint(state, 5000), 100);
arb_atan(b, a, prec1);
arb_atan(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_abort();
}
/* check tan(atan(x)) = x */
arb_sin_cos(c, d, b, prec1);
arb_div(c, c, d, prec1);
if (!arb_contains(c, a))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* Check wide arguments. */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 100);
arb_randtest_precise(b, state, 1 + n_randint(state, 1000), 100);
if (n_randint(state, 2))
arb_add(a, a, b, 2 + n_randint(state, 1000));
arb_union(d, a, b, 2 + n_randint(state, 1000));
arb_atan(a, a, 2 + n_randint(state, 2000));
arb_atan(b, b, 2 + n_randint(state, 2000));
arb_atan(c, d, 2 + n_randint(state, 2000));
if (!arb_overlaps(c, a) || !arb_overlaps(c, b))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("rising2_ui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000; iter++)
{
arb_t a, u, v, u2, v2;
fmpz *f;
arb_ptr g;
ulong n;
slong i, prec;
arb_init(a);
arb_init(u);
arb_init(v);
arb_init(u2);
arb_init(v2);
arb_randtest(a, state, 1 + n_randint(state, 4000), 10);
arb_randtest(u, state, 1 + n_randint(state, 4000), 10);
arb_randtest(v, state, 1 + n_randint(state, 4000), 10);
n = n_randint(state, 120);
f = _fmpz_vec_init(n + 1);
g = _arb_vec_init(n + 1);
prec = 2 + n_randint(state, 4000);
arb_rising2_ui(u, v, a, n, prec);
arith_stirling_number_1u_vec(f, n, n + 1);
for (i = 0; i <= n; i++)
arb_set_fmpz(g + i, f + i);
_arb_poly_evaluate(u2, g, n + 1, a, prec);
_arb_poly_derivative(g, g, n + 1, prec);
_arb_poly_evaluate(v2, g, n, a, prec);
if (!arb_overlaps(u, u2) || !arb_overlaps(v, v2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("n = %wu\n", n);
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("u = "); arb_printd(u, 15); flint_printf("\n\n");
flint_printf("u2 = "); arb_printd(u2, 15); flint_printf("\n\n");
flint_printf("v = "); arb_printd(v, 15); flint_printf("\n\n");
flint_printf("v2 = "); arb_printd(v2, 15); flint_printf("\n\n");
abort();
}
arb_set(u2, a);
arb_rising2_ui(u2, v, u2, n, prec);
if (!arb_equal(u2, u))
{
flint_printf("FAIL: aliasing 1\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("u = "); arb_printd(u, 15); flint_printf("\n\n");
flint_printf("u2 = "); arb_printd(u2, 15); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
abort();
}
arb_set(v2, a);
arb_rising2_ui(u, v2, v2, n, prec);
if (!arb_equal(v2, v))
{
flint_printf("FAIL: aliasing 2\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("v = "); arb_printd(v, 15); flint_printf("\n\n");
flint_printf("v2 = "); arb_printd(v2, 15); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
abort();
}
arb_clear(a);
arb_clear(u);
arb_clear(v);
arb_clear(u2);
arb_clear(v2);
_fmpz_vec_clear(f, n + 1);
_arb_vec_clear(g, n + 1);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("sin....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec0, prec;
prec0 = 400;
if (iter % 100 == 0)
prec0 = 8000;
prec = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec0 + 100);
arb_randtest(a, state, 1 + n_randint(state, prec0), 6);
arb_randtest(b, state, 1 + n_randint(state, prec0), 6);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, prec0));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_sin(t, t, MPFR_RNDN);
arb_sin(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
abort();
}
arb_sin(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* check large arguments */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec0, prec1, prec2;
if (iter % 10 == 0)
prec0 = 10000;
else
prec0 = 1000;
prec1 = 2 + n_randint(state, prec0);
prec2 = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_special(a, state, 1 + n_randint(state, prec0), prec0);
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 100);
arb_randtest_special(c, state, 1 + n_randint(state, prec0), 100);
arb_randtest_special(d, state, 1 + n_randint(state, prec0), 100);
arb_sin(b, a, prec1);
arb_sin(c, a, prec2);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
/* check sin(2a) = 2sin(a)cos(a) */
arb_mul_2exp_si(c, a, 1);
arb_sin(c, c, prec1);
arb_cos(d, a, prec1);
arb_mul(b, b, d, prec1);
arb_mul_2exp_si(b, b, 1);
if (!arb_overlaps(b, c))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
flint_rand_t state;
arb_t t, u, v;
double x;
int error, bracket;
char tmp[256];
long i, j;
printf("set_str....");
fflush(stdout);
flint_randinit(state);
arb_init(t);
arb_init(u);
arb_init(v);
flint_randinit(state);
for (i = 0; testdata_floats[i] != NULL; i++)
{
arb_const_pi(t, 53);
error = arb_set_str(t, testdata_floats[i], 53);
x = strtod(testdata_floats[i], NULL);
if (x != x)
{
arb_indeterminate(u);
}
else
{
arf_set_d(arb_midref(u), x);
mag_zero(arb_radref(u));
}
if (error != 0 || !arb_equal(t, u))
{
printf("FAIL (valid input): %s\n", testdata_floats[i]);
arb_printd(t, 15); printf("\n");
arb_printd(u, 15); printf("\n");
abort();
}
}
for (i = 0; testdata_floats[i] != NULL; i++)
{
for (j = 0; testdata_floats[j] != NULL; j++)
{
for (bracket = 0; bracket < 2; bracket++)
{
arb_const_pi(t, 53);
bracket = n_randint(state, 2);
strcpy(tmp, "");
if (bracket)
strcat(tmp, "[");
/* allow empty string for midpoint */
strcat(tmp, (i == 0) ? "" : testdata_floats[i]);
strcat(tmp, "+/-");
strcat(tmp, testdata_floats[j]);
if (bracket)
strcat(tmp, "]");
error = arb_set_str(t, tmp, 53);
x = strtod((i == 0) ? "0" : testdata_floats[i], NULL);
if (x != x)
{
arb_indeterminate(u);
}
else
{
arf_set_d(arb_midref(u), x);
mag_zero(arb_radref(u));
}
x = strtod(testdata_floats[j], NULL);
arf_set_d(arb_midref(v), x);
mag_zero(arb_radref(v));
arb_abs(v, v);
arb_add_error(u, v);
if (error != 0 || !arb_equal(t, u))
{
printf("FAIL (valid input): %s\n", tmp);
arb_printd(t, 15); printf("\n");
arb_printd(u, 15); printf("\n");
abort();
}
}
}
}
for (i = 0; testdata_invalid[i] != NULL; i++)
{
arb_const_pi(t, 53);
error = arb_set_str(t, testdata_invalid[i], 53);
if (error == 0)
{
printf("FAIL (invalid input): %s\n", testdata_invalid[i]);
arb_printd(t, 15); printf("\n");
abort();
}
}
for (i = 0; testdata_invalid[i] != NULL; i++)
{
for (j = 0; testdata_invalid[j] != NULL; j++)
{
for (bracket = 0; bracket < 2; bracket++)
{
arb_const_pi(t, 53);
bracket = n_randint(state, 2);
strcpy(tmp, "");
if (bracket)
strcat(tmp, "[");
strcat(tmp, testdata_invalid[i]);
strcat(tmp, "+/-");
strcat(tmp, testdata_invalid[j]);
if (bracket)
strcat(tmp, "]");
error = arb_set_str(t, tmp, 53);
if (error == 0)
{
printf("FAIL (invalid input): %s\n", tmp);
arb_printd(t, 15); printf("\n");
abort();
}
}
}
}
arb_clear(t);
arb_clear(u);
arb_clear(v);
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter, iter2;
flint_rand_t state;
flint_printf("mul....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c;
fmpq_t x, y, z;
arb_init(a);
arb_init(b);
arb_init(c);
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
arb_randtest(a, state, 1 + n_randint(state, 200), 10);
arb_randtest(b, state, 1 + n_randint(state, 200), 10);
arb_randtest(c, state, 1 + n_randint(state, 200), 10);
arb_get_rand_fmpq(x, state, a, 1 + n_randint(state, 200));
arb_get_rand_fmpq(y, state, b, 1 + n_randint(state, 200));
arb_mul(c, a, b, 2 + n_randint(state, 200));
fmpq_mul(z, x, y);
if (!arb_contains_fmpq(c, z))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("z = "); fmpq_print(z); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
}
/* aliasing of c and a */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t x, y, z;
arb_init(a);
arb_init(b);
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
arb_randtest(a, state, 1 + n_randint(state, 200), 10);
arb_randtest(b, state, 1 + n_randint(state, 200), 10);
arb_get_rand_fmpq(x, state, a, 1 + n_randint(state, 200));
arb_get_rand_fmpq(y, state, b, 1 + n_randint(state, 200));
arb_mul(a, a, b, 2 + n_randint(state, 200));
fmpq_mul(z, x, y);
if (!arb_contains_fmpq(a, z))
{
flint_printf("FAIL: aliasing (c, a)\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("z = "); fmpq_print(z); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
}
/* aliasing of c and b */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t x, y, z;
arb_init(a);
arb_init(b);
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
arb_randtest(a, state, 1 + n_randint(state, 200), 10);
arb_randtest(b, state, 1 + n_randint(state, 200), 10);
arb_get_rand_fmpq(x, state, a, 1 + n_randint(state, 200));
arb_get_rand_fmpq(y, state, b, 1 + n_randint(state, 200));
arb_mul(b, a, b, 2 + n_randint(state, 200));
fmpq_mul(z, x, y);
if (!arb_contains_fmpq(b, z))
{
flint_printf("FAIL: aliasing (c, b)\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("z = "); fmpq_print(z); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
}
/* main test */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t x, y, z, v;
slong prec;
arb_init(x);
arb_init(y);
arb_init(z);
arb_init(v);
for (iter2 = 0; iter2 < 100; iter2++)
{
arb_randtest_special(x, state, n_randint(state,2) ? 2000 : 200, 200);
arb_randtest_special(y, state, n_randint(state,2) ? 2000 : 200, 200);
prec = 2 + n_randint(state, 2000);
switch (n_randint(state, 5))
{
case 0:
arb_mul(z, x, y, prec);
arb_mul_naive(v, x, y, prec);
if (!arf_equal(arb_midref(z), arb_midref(v))
|| !mag_close(arb_radref(z), arb_radref(v)))
{
flint_printf("FAIL!\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("z = "); arb_print(z); flint_printf("\n\n");
flint_printf("v = "); arb_print(v); flint_printf("\n\n");
abort();
}
break;
case 1:
arb_set(y, x);
arb_mul(z, x, y, prec);
arb_mul(v, x, x, prec);
if (!arf_equal(arb_midref(z), arb_midref(v))
|| !mag_close(arb_radref(z), arb_radref(v)))
{
flint_printf("FAIL (aliasing 1)!\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("z = "); arb_print(z); flint_printf("\n\n");
flint_printf("v = "); arb_print(v); flint_printf("\n\n");
abort();
}
break;
case 2:
arb_mul(v, x, x, prec);
arb_mul(x, x, x, prec);
if (!arb_equal(v, x))
{
flint_printf("FAIL (aliasing 2)!\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("z = "); arb_print(z); flint_printf("\n\n");
flint_printf("v = "); arb_print(v); flint_printf("\n\n");
abort();
}
break;
case 3:
arb_mul(v, x, y, prec);
arb_mul(x, x, y, prec);
if (!arb_equal(v, x))
{
flint_printf("FAIL (aliasing 3)!\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("v = "); arb_print(v); flint_printf("\n\n");
abort();
}
break;
default:
arb_mul(v, x, y, prec);
arb_mul(x, y, x, prec);
if (!arf_equal(arb_midref(x), arb_midref(v))
|| !mag_close(arb_radref(x), arb_radref(v)))
{
flint_printf("FAIL (aliasing 4)!\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("v = "); arb_print(v); flint_printf("\n\n");
abort();
}
break;
}
}
arb_clear(x);
arb_clear(y);
arb_clear(z);
arb_clear(v);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
long iter;
flint_rand_t state;
printf("asin....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
long prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, 200), 3);
arb_randtest(b, state, 1 + n_randint(state, 200), 3);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_asin(t, t, MPFR_RNDN);
arb_asin(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
printf("FAIL: containment\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
abort();
}
arb_asin(a, a, prec);
if (!arb_equal(a, b))
{
printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* check large arguments */
for (iter = 0; iter < 10000; iter++)
{
arb_t a, b, c;
long prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 100);
arb_asin(b, a, prec1);
arb_asin(c, a, prec2);
if (!arb_overlaps(b, c))
{
printf("FAIL: overlap\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
abort();
}
/* check sin(asin(x)) = x */
arb_sin(c, b, prec1);
if (!arb_contains(c, a))
{
printf("FAIL: functional equation\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("min....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arf_t a, b, c;
arb_t x, y, z;
slong prec;
arf_init(a);
arf_init(b);
arf_init(c);
arb_init(x);
arb_init(y);
arb_init(z);
_sample_arf_in_arb(a, x, state);
_sample_arf_in_arb(b, y, state);
prec = 2 + n_randint(state, 200);
arf_min(c, a, b);
arb_min(z, x, y, prec);
if (!arb_contains_arf(x, a) ||
!arb_contains_arf(y, b) ||
!arb_contains_arf(z, c))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arf_print(a); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("c = "); arf_print(c); flint_printf("\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("z = "); arb_print(z); flint_printf("\n\n");
abort();
}
/* aliasing */
{
int alias;
if (n_randint(state, 2))
{
arb_min(x, x, y, prec);
alias = arb_equal(x, z);
}
else
{
arb_min(y, x, y, prec);
alias = arb_equal(y, z);
}
if (!alias)
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("z = "); arb_print(z); flint_printf("\n\n");
abort();
}
}
arf_clear(a);
arf_clear(b);
arf_clear(c);
arb_clear(x);
arb_clear(y);
arb_clear(z);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("approx_dot....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_ptr x, y;
arb_t s1, s2, z;
slong i, len, prec, xbits, ybits, ebits;
int initial, subtract, revx, revy;
if (n_randint(state, 100) == 0)
len = n_randint(state, 100);
else if (n_randint(state, 10) == 0)
len = n_randint(state, 10);
else
len = n_randint(state, 3);
if (n_randint(state, 10) != 0 || len > 10)
{
prec = 2 + n_randint(state, 500);
xbits = 2 + n_randint(state, 500);
ybits = 2 + n_randint(state, 500);
}
else
{
prec = 2 + n_randint(state, 4000);
xbits = 2 + n_randint(state, 4000);
ybits = 2 + n_randint(state, 4000);
}
if (n_randint(state, 100) == 0)
ebits = 2 + n_randint(state, 100);
else
ebits = 2 + n_randint(state, 10);
initial = n_randint(state, 2);
subtract = n_randint(state, 2);
revx = n_randint(state, 2);
revy = n_randint(state, 2);
x = _arb_vec_init(len);
y = _arb_vec_init(len);
arb_init(s1);
arb_init(s2);
arb_init(z);
switch (n_randint(state, 3))
{
case 0:
for (i = 0; i < len; i++)
{
arb_randtest(x + i, state, xbits, ebits);
arb_randtest(y + i, state, ybits, ebits);
}
break;
/* Test with cancellation */
case 1:
for (i = 0; i < len; i++)
{
if (i <= len / 2)
{
arb_randtest(x + i, state, xbits, ebits);
arb_randtest(y + i, state, ybits, ebits);
}
else
{
arb_neg(x + i, x + len - i - 1);
arb_set(y + i, y + len - i - 1);
}
}
break;
default:
for (i = 0; i < len; i++)
{
if (i <= len / 2)
{
arb_randtest(x + i, state, xbits, ebits);
arb_randtest(y + i, state, ybits, ebits);
}
else
{
arb_neg_round(x + i, x + len - i - 1, 2 + n_randint(state, 500));
arb_set_round(y + i, y + len - i - 1, 2 + n_randint(state, 500));
}
}
break;
}
arb_randtest(s1, state, 200, 100);
arb_randtest(s2, state, 200, 100);
arb_randtest(z, state, xbits, ebits);
arb_approx_dot(s1, initial ? z : NULL, subtract,
revx ? (x + len - 1) : x, revx ? -1 : 1,
revy ? (y + len - 1) : y, revy ? -1 : 1,
len, prec);
mag_zero(arb_radref(s1));
/* With the fast algorithm, we expect identical results when
reversing the vectors. */
if (ebits <= 12)
{
arb_approx_dot(s2, initial ? z : NULL, subtract,
!revx ? (x + len - 1) : x, !revx ? -1 : 1,
!revy ? (y + len - 1) : y, !revy ? -1 : 1,
len, prec);
mag_zero(arb_radref(s2));
if (!arb_equal(s1, s2))
{
flint_printf("FAIL (reversal)\n\n");
flint_printf("iter = %wd, len = %wd, prec = %wd, ebits = %wd\n\n", iter, len, prec, ebits);
if (initial)
{
flint_printf("z = ", i); arb_printn(z, 100, ARB_STR_MORE); flint_printf(" (%wd)\n\n", arb_bits(z));
}
for (i = 0; i < len; i++)
{
flint_printf("x[%wd] = ", i); arb_printn(x + i, 100, ARB_STR_MORE); flint_printf(" (%wd)\n", arb_bits(x + i));
flint_printf("y[%wd] = ", i); arb_printn(y + i, 100, ARB_STR_MORE); flint_printf(" (%wd)\n", arb_bits(y + i));
}
flint_printf("\n\n");
flint_printf("s1 = "); arb_printn(s1, 100, ARB_STR_MORE); flint_printf("\n\n");
flint_printf("s2 = "); arb_printn(s2, 100, ARB_STR_MORE); flint_printf("\n\n");
flint_abort();
}
}
/* Verify that radii are ignored */
for (i = 0; i < len; i++)
{
arb_get_mid_arb(x + i, x + i);
arb_get_mid_arb(y + i, y + i);
}
arb_get_mid_arb(z, z);
arb_approx_dot(s2, initial ? z : NULL, subtract,
revx ? (x + len - 1) : x, revx ? -1 : 1,
revy ? (y + len - 1) : y, revy ? -1 : 1,
len, prec);
mag_zero(arb_radref(s2));
if (!arb_equal(s1, s2))
{
flint_printf("FAIL (radii)\n\n");
flint_printf("iter = %wd, len = %wd, prec = %wd, ebits = %wd\n\n", iter, len, prec, ebits);
if (initial)
{
flint_printf("z = ", i); arb_printn(z, 100, ARB_STR_MORE); flint_printf(" (%wd)\n\n", arb_bits(z));
}
for (i = 0; i < len; i++)
{
flint_printf("x[%wd] = ", i); arb_printn(x + i, 100, ARB_STR_MORE); flint_printf(" (%wd)\n", arb_bits(x + i));
flint_printf("y[%wd] = ", i); arb_printn(y + i, 100, ARB_STR_MORE); flint_printf(" (%wd)\n", arb_bits(y + i));
}
flint_printf("\n\n");
flint_printf("s1 = "); arb_printn(s1, 100, ARB_STR_MORE); flint_printf("\n\n");
flint_printf("s2 = "); arb_printn(s2, 100, ARB_STR_MORE); flint_printf("\n\n");
flint_abort();
}
/* Compare with arb_dot */
arb_approx_dot(s2, initial ? z : NULL, subtract,
revx ? (x + len - 1) : x, revx ? -1 : 1,
revy ? (y + len - 1) : y, revy ? -1 : 1,
len, prec);
{
mag_t err, xx, yy;
mag_init(err);
mag_init(xx);
mag_init(yy);
if (initial)
arb_get_mag(err, z);
for (i = 0; i < len; i++)
{
arb_get_mag(xx, revx ? x + len - 1 - i : x + i);
arb_get_mag(yy, revx ? y + len - 1 - i : y + i);
mag_addmul(err, xx, yy);
}
mag_mul_2exp_si(err, err, -prec + 2);
arb_add_error_mag(s2, err);
if (!arb_contains(s2, s1))
{
flint_printf("FAIL (inclusion)\n\n");
flint_printf("iter = %wd, len = %wd, prec = %wd, ebits = %wd\n\n", iter, len, prec, ebits);
if (initial)
{
flint_printf("z = ", i); arb_printn(z, 100, ARB_STR_MORE); flint_printf(" (%wd)\n\n", arb_bits(z));
}
for (i = 0; i < len; i++)
{
flint_printf("x[%wd] = ", i); arb_printn(x + i, 100, ARB_STR_MORE); flint_printf(" (%wd)\n", arb_bits(x + i));
flint_printf("y[%wd] = ", i); arb_printn(y + i, 100, ARB_STR_MORE); flint_printf(" (%wd)\n", arb_bits(y + i));
}
flint_printf("\n\n");
flint_printf("s1 = "); arb_printn(s1, 100, ARB_STR_MORE); flint_printf("\n\n");
flint_printf("s2 = "); arb_printn(s2, 100, ARB_STR_MORE); flint_printf("\n\n");
flint_abort();
}
mag_clear(err);
mag_clear(xx);
mag_clear(yy);
}
arb_clear(s1);
arb_clear(s2);
arb_clear(z);
_arb_vec_clear(x, len);
_arb_vec_clear(y, len);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("floor....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
arb_t a, b;
fmpq_t x;
fmpz_t y;
slong prec;
arb_init(a);
arb_init(b);
fmpq_init(x);
fmpz_init(y);
arb_randtest(a, state, 1 + n_randint(state, 200), 10);
arb_randtest(b, state, 1 + n_randint(state, 200), 10);
prec = 2 + n_randint(state, 200);
arb_get_rand_fmpq(x, state, a, 1 + n_randint(state, 200));
arb_floor(b, a, prec);
fmpz_fdiv_q(y, fmpq_numref(x), fmpq_denref(x));
if (!arb_contains_fmpz(b, y))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("y = "); fmpz_print(y); flint_printf("\n\n");
abort();
}
arb_floor(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(x);
fmpz_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
long iter;
flint_rand_t state;
printf("add_fmpz_2exp....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arb_t a, b, c, d;
fmpz_t x, e;
long prec;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
fmpz_init(x);
fmpz_init(e);
arb_randtest_special(a, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(b, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(c, state, 1 + n_randint(state, 2000), 100);
fmpz_randtest(x, state, 1 + n_randint(state, 2000));
fmpz_randtest(e, state, 1 + n_randint(state, 200));
prec = 2 + n_randint(state, 2000);
arb_set_fmpz_2exp(b, x, e);
arb_add_fmpz_2exp(c, a, x, e, prec);
arb_add(d, a, b, prec);
if (!arb_equal(c, d))
{
printf("FAIL\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("b = "); arb_print(b); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
printf("d = "); arb_print(d); printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
fmpz_clear(x);
fmpz_clear(e);
}
/* aliasing */
for (iter = 0; iter < 10000; iter++)
{
arb_t a, c;
fmpz_t x, e;
long prec;
arb_init(a);
arb_init(c);
fmpz_init(x);
fmpz_init(e);
arb_randtest_special(a, state, 1 + n_randint(state, 2000), 100);
arb_randtest_special(c, state, 1 + n_randint(state, 2000), 100);
fmpz_randtest(x, state, 1 + n_randint(state, 2000));
fmpz_randtest(e, state, 1 + n_randint(state, 200));
prec = 2 + n_randint(state, 2000);
arb_add_fmpz_2exp(c, a, x, e, prec);
arb_add_fmpz_2exp(a, a, x, e, prec);
if (!arb_equal(a, c))
{
printf("FAIL (aliasing)\n\n");
printf("a = "); arb_print(a); printf("\n\n");
printf("c = "); arb_print(c); printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(c);
fmpz_clear(x);
fmpz_clear(e);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("rising_ui_rs....");
fflush(stdout);
flint_randinit(state);
/* compare with fmpq */
for (iter = 0; iter < 1000; iter++)
{
arb_t a, b;
fmpq_t x, y, z;
ulong n, step;
slong i;
arb_init(a);
arb_init(b);
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
arb_randtest(a, state, 1 + n_randint(state, 1000), 10);
arb_randtest(b, state, 1 + n_randint(state, 1000), 10);
n = n_randint(state, 80);
arb_get_rand_fmpq(x, state, a, 1 + n_randint(state, 10));
step = n_randint(state, 20);
arb_rising_ui_rs(b, a, n, step, 2 + n_randint(state, 1000));
fmpq_one(y);
for (i = 0; i < n; i++)
{
fmpq_set_si(z, i, 1);
fmpq_add(z, x, z);
fmpq_mul(y, y, z);
}
if (!arb_contains_fmpq(b, y))
{
flint_printf("FAIL: containment\n\n");
flint_printf("n = %wu\n", n);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
}
/* aliasing of y and x */
for (iter = 0; iter < 500; iter++)
{
arb_t x, y;
ulong n, step;
slong prec;
arb_init(x);
arb_init(y);
arb_randtest(x, state, 1 + n_randint(state, 200), 10);
arb_randtest(y, state, 1 + n_randint(state, 200), 10);
n = n_randint(state, 100);
prec = 2 + n_randint(state, 1000);
step = n_randint(state, 20);
arb_rising_ui_rs(y, x, n, step, prec);
arb_rising_ui_rs(x, x, n, step, prec);
if (!arb_equal(x, y))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("y = "); arb_print(y); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
abort();
}
arb_clear(x);
arb_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
FLINT_TEST_INIT(state);
{
ulong k;
arb_t a,b;
arf_t c,d;
fmpq_poly_t p;
arb_init(a);
arb_init(b);
arf_init(c);
arf_init(d);
/* x+1 */
fmpq_poly_init(p);
fmpq_poly_set_coeff_si(p, 0, 1);
fmpq_poly_set_coeff_si(p, 1, 1);
for (iter = 0; iter < 5000; iter++)
{
k = n_randint(state, 10000);
arb_set_si(a, k);
fmpq_poly_evaluate_arb(b, p, a, 30 + n_randint(state, 100));
if (!arb_equal_si(b, k + 1))
{
printf("FAIL (fmpq_poly_evaluate_arb):\n");
printf("a = "); arb_print(a); printf("\n");
printf("b = "); arb_print(b); printf("\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
abort();
}
arf_set_si(c, k);
fmpq_poly_evaluate_arf(d, p, c, 30 + n_randint(state, 100));
if (!arf_equal_si(d, k + 1))
{
printf("FAIL (fmpq_poly_evaluate_arf):\n");
printf("c = "); arf_print(c); printf("\n");
printf("d = "); arf_print(d); printf("\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
abort();
}
}
/* x^2 */
fmpq_poly_zero(p);
fmpq_poly_set_coeff_si(p, 2, 1);
for (iter = 0; iter < 1000; iter++)
{
k = n_randint(state, 10000);
arb_set_si(a, k);
fmpq_poly_evaluate_arb(b, p, a, 30 + n_randint(state, 100));
if (!arb_equal_si(b, k * k))
{
printf("Error (test_fmpq_poly_evaluate_arb):\n");
printf("a = "); arb_print(a); printf("\n");
printf("b = "); arb_print(b); printf("\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
abort();
}
arf_set_si(c, k);
fmpq_poly_evaluate_arf(d, p, c, 30 + n_randint(state, 100));
if (!arf_equal_si(d, k * k))
{
printf("Error (test_fmpq_poly_evaluate_arf):\n");
printf("c = "); arf_print(c); printf("\n");
printf("d = "); arf_print(d); printf("\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
abort();
}
}
fmpq_poly_clear(p);
arb_clear(a);
arb_clear(b);
arf_clear(c);
arf_clear(d);
}
/* check evaluate_arb agains exact evaluate_fmpq */
for (iter = 0; iter < 1000; iter++)
{
fmpq_poly_t p;
fmpq_t x,y;
arb_t a,b;
fmpq_poly_init(p);
fmpq_init(x);
fmpq_init(y);
arb_init(a);
arb_init(b);
fmpq_poly_randtest(p, state, 1 + n_randint(state,100), 10);
fmpq_randtest(x, state, 10);
arb_set_fmpq(a, x, 64);
fmpq_poly_evaluate_fmpq(y, p, x);
fmpq_poly_evaluate_arb(b, p, a, 60);
if (!arb_contains_fmpq(b, y))
{
printf("FAIL (y not in b):\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
printf("x = "); fmpq_print(x); printf("\n");
printf("y = "); fmpq_print(y); printf("\n");
printf("a = "); arb_print(a); printf("\n");
printf("b = "); arb_print(b); printf("\n");
abort();
}
fmpq_poly_evaluate_arb(a, p, a, 60);
if (!arb_equal(a,b))
{
printf("FAIL (a not equal b):\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
printf("x = "); fmpq_print(x); printf("\n");
printf("y = "); fmpq_print(y); printf("\n");
printf("a = "); arb_print(a); printf("\n");
printf("b = "); arb_print(b); printf("\n");
abort();
}
fmpq_poly_clear(p);
fmpq_clear(x);
fmpq_clear(y);
arb_clear(a);
arb_clear(b);
}
/* test aliasing */
for (iter = 0; iter < 1000; iter++)
{
fmpq_poly_t p;
arb_t a,b;
arf_t c,d;
fmpq_poly_init(p);
arb_init(a);
arb_init(b);
arf_init(c);
arf_init(d);
fmpq_poly_randtest(p, state, 1 + n_randint(state,100), 10);
arb_randtest(a, state, 60, 10);
arb_randtest(b, state, 60, 10);
arf_randtest(c, state, 60, 10);
arf_randtest(d, state, 60, 10);
fmpq_poly_evaluate_arb(b, p, a, 60);
fmpq_poly_evaluate_arb(a, p, a, 60);
if (!arb_equal(a, b))
{
printf("FAIL (a not equal b):\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
printf("a = "); arb_print(a); printf("\n");
printf("b = "); arb_print(b); printf("\n");
abort();
}
fmpq_poly_evaluate_arf(d, p, c, 60);
fmpq_poly_evaluate_arf(c, p, c, 60);
if (!arf_equal(c, d))
{
printf("FAIL (c not equal d):\n");
printf("p = "); fmpq_poly_print(p); printf("\n");
printf("c = "); arf_print(c); printf("\n");
printf("d = "); arf_print(d); printf("\n");
}
fmpq_poly_clear(p);
arb_clear(a);
arb_clear(b);
arf_clear(c);
arf_clear(d);
}
FLINT_TEST_CLEANUP(state);
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("log....");
fflush(stdout);
flint_randinit(state);
/* compare with mpfr */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 200);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
do {
arb_randtest(a, state, 1 + n_randint(state, 200), 10);
} while (arb_contains_nonpositive(a));
arb_randtest(b, state, 1 + n_randint(state, 200), 10);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
/* todo: estimate cancellation precisely */
if (mpfr_cmp_d(t, 1 - 1e-10) > 0 && mpfr_cmp_d(t, 1 + 1e-10) < 0)
{
mpfr_set_prec(t, prec + 1000);
fmpq_get_mpfr(t, q, MPFR_RNDN);
}
mpfr_log(t, t, MPFR_RNDN);
arb_log(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
abort();
}
arb_log(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* compare with mpfr (higher precision) */
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec = 2 + n_randint(state, 6000);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
do {
arb_randtest(a, state, 1 + n_randint(state, 6000), 10);
} while (arb_contains_nonpositive(a));
arb_randtest(b, state, 1 + n_randint(state, 6000), 10);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, 200));
fmpq_get_mpfr(t, q, MPFR_RNDN);
/* todo: estimate cancellation precisely */
if (mpfr_cmp_d(t, 1 - 1e-10) > 0 && mpfr_cmp_d(t, 1 + 1e-10) < 0)
{
mpfr_set_prec(t, prec + 10000);
fmpq_get_mpfr(t, q, MPFR_RNDN);
}
mpfr_log(t, t, MPFR_RNDN);
arb_log(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
abort();
}
arb_log(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
/* test large numbers */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, ab, lab, la, lb, lalb;
slong prec = 2 + n_randint(state, 6000);
arb_init(a);
arb_init(b);
arb_init(ab);
arb_init(lab);
arb_init(la);
arb_init(lb);
arb_init(lalb);
arb_randtest(a, state, 1 + n_randint(state, 400), 400);
arb_randtest(b, state, 1 + n_randint(state, 400), 400);
arb_log(la, a, prec);
arb_log(lb, b, prec);
arb_mul(ab, a, b, prec);
arb_log(lab, ab, prec);
arb_add(lalb, la, lb, prec);
if (!arb_overlaps(lab, lalb))
{
flint_printf("FAIL: containment\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("la = "); arb_print(la); flint_printf("\n\n");
flint_printf("lb = "); arb_print(lb); flint_printf("\n\n");
flint_printf("ab = "); arb_print(ab); flint_printf("\n\n");
flint_printf("lab = "); arb_print(lab); flint_printf("\n\n");
flint_printf("lalb = "); arb_print(lalb); flint_printf("\n\n");
abort();
}
arb_log(a, a, prec);
if (!arb_overlaps(a, la))
{
flint_printf("FAIL: aliasing\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(ab);
arb_clear(lab);
arb_clear(la);
arb_clear(lb);
arb_clear(lalb);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("exp....");
fflush(stdout);
flint_randinit(state);
/* check large arguments + compare with exp_simple */
for (iter = 0; iter < 100000 *arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
slong prec0, prec1, prec2, acc1, acc2;
if (iter % 10 == 0)
prec0 = 10000;
else
prec0 = 1000;
prec1 = 2 + n_randint(state, prec0);
prec2 = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_randtest_special(a, state, 1 + n_randint(state, prec0), 100);
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 100);
arb_exp(b, a, prec1);
arb_exp(c, a, prec2);
arb_exp_simple(d, a, prec1);
if (!arb_overlaps(b, c) || !arb_overlaps(b, d) || !arb_overlaps(c, d))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
/* compare accuracy with exp_simple */
acc1 = arb_rel_accuracy_bits(b);
acc2 = arb_rel_accuracy_bits(d);
if (acc2 > 0 && acc1 < acc2 - 1)
{
flint_printf("FAIL: accuracy\n\n");
flint_printf("prec1 = %wd, acc1 = %wd, acc2 = %wd\n\n", prec1, acc1, acc2);
flint_printf("a = "); arb_printd(a, 50); flint_printf("\n\n");
flint_printf("b = "); arb_printd(b, 50); flint_printf("\n\n");
flint_printf("d = "); arb_printd(d, 50); flint_printf("\n\n");
flint_abort();
}
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 100);
/* check exp(a)*exp(b) = exp(a+b) */
arb_exp(c, a, prec1);
arb_exp(d, b, prec1);
arb_mul(c, c, d, prec1);
arb_add(d, a, b, prec1);
arb_exp(d, d, prec1);
if (!arb_overlaps(c, d))
{
flint_printf("FAIL: functional equation\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_printf("c = "); arb_print(c); flint_printf("\n\n");
flint_printf("d = "); arb_print(d); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
}
/* test union */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d, e;
slong prec0, prec1, prec2, prec3, prec4;
if (iter % 10 == 0)
prec0 = 10000;
else
prec0 = 1000;
prec1 = 2 + n_randint(state, prec0);
prec2 = 2 + n_randint(state, prec0);
prec3 = 2 + n_randint(state, prec0);
prec4 = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
arb_init(e);
arb_randtest_special(a, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(b, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(c, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(d, state, 1 + n_randint(state, prec0), 200);
arb_randtest_special(e, state, 1 + n_randint(state, prec0), 200);
arb_exp(c, a, prec1);
arb_exp(d, b, prec2);
arb_union(e, a, b, prec3);
arb_exp(e, e, prec4);
if (!arb_overlaps(e, c) || !arb_overlaps(e, d))
{
flint_printf("FAIL: union\n\n");
flint_printf("a = "); arb_printn(a, 1000, 0); flint_printf("\n\n");
flint_printf("b = "); arb_printn(b, 1000, 0); flint_printf("\n\n");
flint_printf("c = "); arb_printn(c, 1000, 0); flint_printf("\n\n");
flint_printf("d = "); arb_printn(d, 1000, 0); flint_printf("\n\n");
flint_printf("e = "); arb_printn(e, 1000, 0); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
arb_clear(e);
}
/* comparison with mpfr */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t q;
mpfr_t t;
slong prec0, prec;
prec0 = 400;
if (iter % 100 == 0)
prec0 = 10000;
prec = 2 + n_randint(state, prec0);
arb_init(a);
arb_init(b);
fmpq_init(q);
mpfr_init2(t, prec + 100);
arb_randtest(a, state, 1 + n_randint(state, prec0), 4);
arb_randtest(b, state, 1 + n_randint(state, prec0), 4);
arb_get_rand_fmpq(q, state, a, 1 + n_randint(state, prec0));
fmpq_get_mpfr(t, q, MPFR_RNDN);
mpfr_exp(t, t, MPFR_RNDN);
arb_exp(b, a, prec);
if (!arb_contains_mpfr(b, t))
{
flint_printf("FAIL: containment\n\n");
flint_printf("iter = %wd, prec = %wd\n\n", iter, prec);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_exp(a, a, prec);
if (!arb_equal(a, b))
{
flint_printf("FAIL: aliasing\n\n");
flint_printf("iter = %wd, prec = %wd\n\n", iter, prec);
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arb_print(b); flint_printf("\n\n");
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(q);
mpfr_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
