int
arb_richcmp_fallback(const arb_t x, const arb_t y, int op)
{
arf_t xa, xb, ya, yb;
int res;
arf_init(xa);
arf_init(xb);
arf_init(ya);
arf_init(yb);
arb_infimum(xa, x);
arb_supremum(xb, x);
arb_infimum(ya, y);
arb_supremum(yb, y);
if (arf_is_nan(xa) || arf_is_nan(ya))
{
res = 0;
}
else
{
if (op == 0) /* eq */
{
res = arf_equal(xa, xb) && arf_equal(ya, yb) && arf_equal(xa, ya);
}
else if (op == 1) /* ne */
{
res = (arf_cmp(yb, xa) < 0) || (arf_cmp(xb, ya) < 0);
}
else if (op == 2) /* le */
{
res = (arf_cmp(xb, ya) <= 0);
}
else if (op == 3) /* lt */
{
res = (arf_cmp(xb, ya) < 0);
}
else if (op == 4) /* ge */
{
res = (arf_cmp(xa, yb) >= 0);
}
else /* gt */
{
res = (arf_cmp(xa, yb) > 0);
}
}
arf_clear(xa);
arf_clear(xb);
arf_clear(ya);
arf_clear(yb);
return res;
}
void
arb_set_interval_arf(arb_t x, const arf_t a, const arf_t b, slong prec)
{
arf_t t;
int inexact;
if (arf_is_inf(a) && arf_equal(a, b))
{
/* [-inf, -inf] or [+inf, +inf] */
arf_set(arb_midref(x), a);
mag_zero(arb_radref(x));
return;
}
arf_init(t);
arf_sub(t, b, a, MAG_BITS, ARF_RND_UP);
if (arf_sgn(t) < 0)
{
flint_printf("exception: arb_set_interval_arf: endpoints not ordered\n");
abort();
}
arf_get_mag(arb_radref(x), t);
inexact = arf_add(arb_midref(x), a, b, prec, ARB_RND);
if (inexact)
arf_mag_add_ulp(arb_radref(x), arb_radref(x), arb_midref(x), prec);
arb_mul_2exp_si(x, x, -1);
arf_clear(t);
}
int
arf_equal_si(const arf_t x, slong y)
{
arf_t t;
arf_init_set_si(t, y);
return arf_equal(x, t); /* no need to free */
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("set_fmpq....");
fflush(stdout);
flint_randinit(state);
/* test exact roundtrip R -> Q -> R */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
slong bits, res;
arf_t x, z;
fmpq_t y;
bits = 2 + n_randint(state, 200);
arf_init(x);
arf_init(z);
fmpq_init(y);
arf_randtest(x, state, bits, 10);
arf_randtest(z, state, bits, 10);
arf_get_fmpq(y, x);
res = arf_set_fmpq(z, y, bits, ARF_RND_DOWN);
if (!arf_equal(x, z) || res != 0)
{
flint_printf("FAIL\n\n");
flint_printf("bits: %wd\n", bits);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
abort();
}
arf_clear(x);
arf_clear(z);
fmpq_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
arb_contains_arf(const arb_t x, const arf_t y)
{
if (arf_is_nan(y))
{
return arf_is_nan(arb_midref(x));
}
else if (arf_is_nan(arb_midref(x)))
{
return 1;
}
else if (arb_is_exact(x))
{
return arf_equal(arb_midref(x), y);
}
else
{
arf_t t;
arf_struct tmp[3];
int result;
arf_init(t);
/* y >= xm - xr <=> 0 >= xm - xr - y */
arf_init_set_shallow(tmp + 0, arb_midref(x));
arf_init_neg_mag_shallow(tmp + 1, arb_radref(x));
arf_init_neg_shallow(tmp + 2, y);
arf_sum(t, tmp, 3, MAG_BITS, ARF_RND_DOWN);
result = (arf_sgn(t) <= 0);
if (result)
{
/* y <= xm + xr <=> 0 <= xm + xr - y */
arf_init_set_mag_shallow(tmp + 1, arb_radref(x));
arf_sum(t, tmp, 3, MAG_BITS, ARF_RND_DOWN);
result = (arf_sgn(t) >= 0);
}
arf_clear(t);
return result;
}
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("get_mpfr....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
slong bits;
arf_t x, z;
mpfr_t y;
bits = 2 + n_randint(state, 200);
arf_init(x);
arf_init(z);
mpfr_init2(y, bits);
arf_randtest_special(x, state, bits, 10);
arf_get_mpfr(y, x, MPFR_RNDN);
arf_set_mpfr(z, y);
if (!arf_equal(x, z))
{
flint_printf("FAIL\n\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
abort();
}
arf_clear(x);
arf_clear(z);
mpfr_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("set_d....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
double x;
arf_t y, z;
mpfr_t m;
arf_init(y);
arf_init(z);
mpfr_init2(m, 53);
x = d_randtest_special(state, -1200, 1200);
arf_set_d(y, x);
mpfr_set_d(m, x, MPFR_RNDN);
arf_set_mpfr(z, m);
if (!arf_equal(y, z))
{
flint_printf("FAIL:\n\n");
flint_printf("x = %.17g\n\n", x);
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_abort();
}
arf_clear(y);
arf_clear(z);
mpfr_clear(m);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
arf_cmpabs(const arf_t x, const arf_t y)
{
int ec, mc;
mp_size_t xn, yn;
mp_srcptr xp, yp;
if (arf_is_special(x) || arf_is_special(y))
{
if (arf_equal(x, y))
return 0;
if (arf_is_nan(x) || arf_is_nan(y))
return 0;
if (arf_is_zero(x)) return -1;
if (arf_is_zero(y)) return 1;
if (arf_is_inf(x)) return arf_is_inf(y) ? 0 : 1;
if (arf_is_inf(y)) return -1;
return -1;
}
ec = fmpz_cmp(ARF_EXPREF(x), ARF_EXPREF(y));
if (ec != 0)
return (ec < 0) ? -1 : 1;
ARF_GET_MPN_READONLY(xp, xn, x);
ARF_GET_MPN_READONLY(yp, yn, y);
if (xn >= yn)
mc = mpn_cmp(xp + xn - yn, yp, yn);
else
mc = mpn_cmp(xp, yp + yn - xn, xn);
if (mc != 0)
return (mc < 0) ? -1 : 1;
if (xn != yn)
return (xn < yn) ? -1 : 1;
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("set_round_uiui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000000 * arb_test_multiplier(); iter++)
{
arf_t x, y;
slong prec, fix1, fix2;
int ret1, ret2, sgnbit;
mp_limb_t t[2];
arf_rnd_t rnd;
prec = 2 + n_randint(state, 1000);
arf_init(x);
arf_init(y);
arf_randtest_special(x, state, 1 + n_randint(state, 200), 1 + n_randint(state, 100));
arf_randtest_special(y, state, 1 + n_randint(state, 200), 1 + n_randint(state, 100));
do {
t[0] = n_randtest(state);
t[1] = n_randtest(state);
} while (t[0] == 0 && t[1] == 0);
sgnbit = n_randint(state, 2);
switch (n_randint(state, 10))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
if (t[1] != 0)
{
ret1 = _arf_set_round_mpn(x, &fix1, t, 2, sgnbit, prec, rnd);
fmpz_set_si(ARF_EXPREF(x), 2 * FLINT_BITS + fix1);
}
else
{
ret1 = _arf_set_round_mpn(x, &fix1, t, 1, sgnbit, prec, rnd);
fmpz_set_si(ARF_EXPREF(x), FLINT_BITS + fix1);
}
ret2 = _arf_set_round_uiui(y, &fix2, t[1], t[0], sgnbit, prec, rnd);
fmpz_set_si(ARF_EXPREF(y), 2 * FLINT_BITS + fix2);
if (!arf_equal(x, y) || (ret1 != ret2))
{
flint_printf("FAIL\n\n");
flint_printf("prec = %wd", prec); flint_printf("\n\n");
flint_printf("hi = %wu, lo = %wu\n\n", t[1], t[0]);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("ret1 = %d, ret2 = %d\n\n", ret1, ret2);
abort();
}
arf_clear(x);
arf_clear(y);
}
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 < 10000; iter++)
{
arf_t x, y;
int result;
arf_init(x);
arf_init(y);
arf_randtest_special(x, state, 2000, 100);
arf_randtest_special(y, state, 2000, 100);
arf_floor(y, x);
result = 1;
if (arf_is_int(x) || !arf_is_finite(x))
{
result = arf_equal(y, x);
}
else if (!arf_is_int(y))
{
result = 0;
}
else if (arf_cmp(y, x) >= 0)
{
result = 0;
}
else
{
arf_t s, t[3];
/* check floor(x) - x + 1 > 0 */
arf_init(s);
arf_init(t[0]);
arf_init(t[1]);
arf_init(t[2]);
arf_set(t[0], y);
arf_neg(t[1], x);
arf_one(t[2]);
arf_sum(s, (arf_ptr) t, 3, 32, ARF_RND_DOWN);
result = arf_sgn(s) > 0;
arf_clear(s);
arf_clear(t[0]);
arf_clear(t[1]);
arf_clear(t[2]);
}
if (!result)
{
flint_printf("FAIL!\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
abort();
}
arf_floor(x, x);
if (!arf_equal(x, y))
{
flint_printf("FAIL (aliasing)!\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
abort();
}
arf_clear(x);
arf_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("sum....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000000 * arb_test_multiplier(); iter++)
{
slong i, len, prec, bits, expbits;
int res1, res2;
arf_t s1, s2, s3, err;
mag_t err_bound;
arf_struct terms[20];
arf_rnd_t rnd;
len = n_randint(state, 20);
bits = 2 + n_randint(state, 1000);
prec = 2 + n_randint(state, 1000);
expbits = n_randint(state, 14);
arf_init(s1);
arf_init(s2);
arf_init(s3);
arf_init(err);
mag_init(err_bound);
for (i = 0; i < len; i++)
{
arf_init(terms + i);
arf_randtest_special(terms + i, state, bits, expbits);
}
switch (n_randint(state, 4))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
default: rnd = ARF_RND_CEIL; break;
}
res1 = arf_sum(s1, terms, len, prec, rnd);
arf_zero(s2);
for (i = 0; i < len; i++)
arf_add(s2, s2, terms + i, ARF_PREC_EXACT, ARF_RND_DOWN);
res2 = arf_set_round(s3, s2, prec, rnd);
if (!arf_equal(s1, s3) || res1 != res2)
{
flint_printf("FAIL (%wd)\n\n", iter);
flint_printf("prec = %wd\n\n", prec);
for (i = 0; i < len; i++)
{
flint_printf("terms[%wd] = ", i); arf_print(terms + i); flint_printf("\n\n");
}
flint_printf("s1 = "); arf_print(s1); flint_printf("\n\n");
flint_printf("s2 = "); arf_print(s2); flint_printf("\n\n");
flint_printf("s3 = "); arf_print(s3); flint_printf("\n\n");
flint_printf("res1 = %d, res2 = %d\n\n", res1, res2);
abort();
}
arf_sub(err, s1, s2, ARF_PREC_EXACT, ARF_RND_DOWN);
arf_abs(err, err);
if (res1)
arf_mag_set_ulp(err_bound, s1, prec);
else
mag_zero(err_bound);
if (arf_cmpabs_mag(err, err_bound) > 0)
{
flint_printf("FAIL (error bound)!\n");
flint_printf("prec = %wd\n\n", prec);
for (i = 0; i < len; i++)
{
flint_printf("terms[%wd] = ", i); arf_print(terms + i); flint_printf("\n\n");
}
flint_printf("s1 = "); arf_print(s1); flint_printf("\n\n");
flint_printf("s2 = "); arf_print(s2); flint_printf("\n\n");
flint_printf("s3 = "); arf_print(s3); flint_printf("\n\n");
flint_printf("error: "); arf_print(err); flint_printf("\n\n");
flint_printf("error bound: "); mag_print(err_bound); flint_printf("\n\n");
flint_printf("res1 = %d, res2 = %d\n\n", res1, res2);
abort();
}
arf_clear(s1);
arf_clear(s2);
arf_clear(s3);
arf_clear(err);
mag_clear(err_bound);
for (i = 0; i < len; i++)
arf_clear(terms + i);
}
flint_randclear(state);
flint_cleanup();
flint_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, iter2;
flint_rand_t state;
printf("complex_mul....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arf_t e1, f1, e2, f2, a, b, c, d;
long prec, r1, r2;
arf_rnd_t rnd;
arf_init(a);
arf_init(b);
arf_init(c);
arf_init(d);
arf_init(e1);
arf_init(f1);
arf_init(e2);
arf_init(f2);
for (iter2 = 0; iter2 < 100; iter2++)
{
arf_randtest_special(a, state, 3000, 100);
arf_randtest_special(b, state, 3000, 100);
arf_randtest_special(c, state, 3000, 100);
arf_randtest_special(d, state, 3000, 100);
prec = 2 + n_randint(state, 3000);
switch (n_randint(state, 4))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
default: rnd = ARF_RND_CEIL; break;
}
switch (n_randint(state, 5))
{
case 0:
r1 = arf_complex_mul(e1, f1, a, b, c, d, prec, rnd);
r2 = arf_complex_mul_fallback(e2, f2, a, b, c, d, prec, rnd);
if (!arf_equal(e1, e2) || !arf_equal(f1, f2) || r1 != r2)
{
printf("FAIL!\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("a = "); arf_print(a); printf("\n\n");
printf("b = "); arf_print(b); printf("\n\n");
printf("c = "); arf_print(c); printf("\n\n");
printf("d = "); arf_print(d); printf("\n\n");
printf("e1 = "); arf_print(e1); printf("\n\n");
printf("f1 = "); arf_print(f1); printf("\n\n");
printf("e2 = "); arf_print(e2); printf("\n\n");
printf("f2 = "); arf_print(f2); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
case 1:
arf_set(c, a);
arf_set(d, b);
r1 = arf_complex_mul(e1, f1, a, b, a, b, prec, rnd);
r2 = arf_complex_mul_fallback(e2, f2, a, b, c, d, prec, rnd);
if (!arf_equal(e1, e2) || !arf_equal(f1, f2) || r1 != r2)
{
printf("FAIL! (aliasing 1)\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("a = "); arf_print(a); printf("\n\n");
printf("b = "); arf_print(b); printf("\n\n");
printf("c = "); arf_print(c); printf("\n\n");
printf("d = "); arf_print(d); printf("\n\n");
printf("e1 = "); arf_print(e1); printf("\n\n");
printf("f1 = "); arf_print(f1); printf("\n\n");
printf("e2 = "); arf_print(e2); printf("\n\n");
printf("f2 = "); arf_print(f2); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
case 2:
r1 = arf_complex_mul_fallback(e1, f1, a, b, a, b, prec, rnd);
r2 = arf_complex_mul(a, b, a, b, a, b, prec, rnd);
if (!arf_equal(e1, a) || !arf_equal(f1, b) || r1 != r2)
{
printf("FAIL! (aliasing 2)\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("a = "); arf_print(a); printf("\n\n");
printf("b = "); arf_print(b); printf("\n\n");
printf("e1 = "); arf_print(e1); printf("\n\n");
printf("f1 = "); arf_print(f1); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
case 3:
r1 = arf_complex_mul_fallback(e1, f1, a, b, c, d, prec, rnd);
r2 = arf_complex_mul(a, b, a, b, c, d, prec, rnd);
if (!arf_equal(e1, a) || !arf_equal(f1, b) || r1 != r2)
{
printf("FAIL! (aliasing 3)\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("a = "); arf_print(a); printf("\n\n");
printf("b = "); arf_print(b); printf("\n\n");
printf("c = "); arf_print(c); printf("\n\n");
printf("d = "); arf_print(d); printf("\n\n");
printf("e1 = "); arf_print(e1); printf("\n\n");
printf("f1 = "); arf_print(f1); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
default:
r1 = arf_complex_mul_fallback(e1, f1, a, b, c, d, prec, rnd);
r2 = arf_complex_mul(c, d, a, b, c, d, prec, rnd);
if (!arf_equal(e1, c) || !arf_equal(f1, d) || r1 != r2)
{
printf("FAIL! (aliasing 4)\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("a = "); arf_print(a); printf("\n\n");
printf("b = "); arf_print(b); printf("\n\n");
printf("c = "); arf_print(c); printf("\n\n");
printf("d = "); arf_print(d); printf("\n\n");
printf("e1 = "); arf_print(e1); printf("\n\n");
printf("f1 = "); arf_print(f1); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
}
}
arf_clear(a);
arf_clear(b);
arf_clear(c);
arf_clear(d);
arf_clear(e1);
arf_clear(f1);
arf_clear(e2);
arf_clear(f2);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter, iter2;
flint_rand_t state;
flint_printf("add....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arf_t x, y, z, v;
slong prec, r1, r2;
arf_rnd_t rnd;
fmpz_t t;
arf_init(x);
arf_init(y);
arf_init(z);
arf_init(v);
fmpz_init(t);
for (iter2 = 0; iter2 < 100; iter2++)
{
arf_randtest_special(x, state, 2000, 100);
arf_randtest_special(y, state, 2000, 100);
prec = 2 + n_randint(state, 2000);
switch (n_randint(state, 5))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
rnd = ARF_RND_DOWN;
if (arf_is_normal(x) && arf_is_normal(y))
{
fmpz_sub(t, ARF_EXPREF(x), ARF_EXPREF(y));
/* if not too far apart, sometimes test exact addition */
if (fmpz_bits(t) < 10)
{
if (n_randint(state, 10) == 0)
prec = ARF_PREC_EXACT;
}
else if (rnd == ARF_RND_NEAR)
{ /* large shift not supported in add_naive */
rnd = ARF_RND_DOWN;
}
}
switch (n_randint(state, 5))
{
case 0:
r1 = arf_add(z, x, y, prec, rnd);
r2 = arf_add_naive(v, x, y, prec, rnd);
if (!arf_equal(z, v) || r1 != r2)
{
flint_printf("FAIL!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("v = "); arf_print(v); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
case 1:
r1 = arf_add(z, x, x, prec, rnd);
r2 = arf_add_naive(v, x, x, prec, rnd);
if (!arf_equal(z, v) || r1 != r2)
{
flint_printf("FAIL (aliasing 1)!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("v = "); arf_print(v); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
case 2:
r2 = arf_add_naive(v, x, x, prec, rnd);
r1 = arf_add(x, x, x, prec, rnd);
if (!arf_equal(v, x) || r1 != r2)
{
flint_printf("FAIL (aliasing 2)!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("v = "); arf_print(v); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
case 3:
r2 = arf_add_naive(v, x, y, prec, rnd);
r1 = arf_add(x, x, y, prec, rnd);
if (!arf_equal(x, v) || r1 != r2)
{
flint_printf("FAIL (aliasing 3)!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("v = "); arf_print(v); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
default:
r2 = arf_add_naive(v, x, y, prec, rnd);
r1 = arf_add(x, y, x, prec, rnd);
if (!arf_equal(x, v) || r1 != r2)
{
flint_printf("FAIL (aliasing 4)!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("v = "); arf_print(v); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
}
}
arf_clear(x);
arf_clear(y);
arf_clear(z);
arf_clear(v);
fmpz_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("get_d....");
fflush(stdout);
flint_randinit(state);
/* test exact roundtrip */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arf_t x, z;
double y;
arf_rnd_t rnd;
arf_init(x);
arf_init(z);
switch (n_randint(state, 4))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
arf_randtest_special(x, state, 53, 8);
y = arf_get_d(x, rnd);
arf_set_d(z, y);
if (!arf_equal(x, z))
{
flint_printf("FAIL:\n\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = %.17g\n\n", y);
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
abort();
}
arf_clear(x);
arf_clear(z);
}
/* test rounding */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arf_t x, z, w;
arf_rnd_t rnd;
double y;
arf_init(x);
arf_init(z);
arf_init(w);
arf_randtest_special(x, state, 300, 8);
switch (n_randint(state, 4))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
default: rnd = ARF_RND_CEIL; break;
}
y = arf_get_d(x, rnd);
arf_set_d(w, y);
arf_set_round(z, x, 53, rnd);
if (!arf_equal(w, z))
{
flint_printf("FAIL:\n\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = %.17g\n\n", y);
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("w = "); arf_print(w); flint_printf("\n\n");
abort();
}
arf_clear(x);
arf_clear(z);
arf_clear(w);
}
/* compare with mpfr */
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arf_t x, r1, r2;
arf_rnd_t rnd;
mpfr_t t;
double d1, d2;
arf_init(x);
arf_init(r1);
arf_init(r2);
mpfr_init2(t, 300);
arf_randtest_special(x, state, 300, 20);
arf_get_mpfr(t, x, MPFR_RNDD);
switch (n_randint(state, 4))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
d1 = arf_get_d(x, rnd);
d2 = mpfr_get_d(t, rnd_to_mpfr(rnd));
arf_set_d(r1, d1);
arf_set_d(r2, d2);
if (!arf_equal(r1, r2))
{
flint_printf("FAIL:\n\n");
flint_printf("rnd = %i\n\n", rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("d1 = %.17g\n\n", d1);
flint_printf("d2 = %.17g\n\n", d2);
flint_printf("r1 = "); arf_print(r1); flint_printf("\n\n");
flint_printf("r2 = "); arf_print(r2); flint_printf("\n\n");
abort();
}
arf_clear(x);
arf_clear(r1);
arf_clear(r2);
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("is_int_2exp_si....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arf_t x, y;
fmpz_t t;
slong e;
int res1, res2;
arf_init(x);
arf_init(y);
fmpz_init(t);
arf_randtest_special(x, state, 2000, 100);
e = n_randtest(state);
arf_mul_2exp_si(y, x, e);
res1 = arf_is_int(x);
res2 = arf_is_int_2exp_si(y, e);
if (res1 != res2)
{
flint_printf("FAIL! (1)\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("res1 = %d, res2 = %d\n\n", res1, res2);
abort();
}
if (res1)
{
if (n_randint(state, 2))
arf_floor(y, x);
else
arf_ceil(y, x);
if (!arf_equal(x, y) || !arf_is_finite(x))
{
flint_printf("FAIL! (2)\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("res1 = %d\n\n", res1);
abort();
}
}
if (arf_is_finite(x) && !arf_is_zero(x))
{
arf_bot(t, x);
fmpz_neg(t, t);
arf_mul_2exp_fmpz(x, x, t);
res1 = arf_is_int(x);
arf_mul_2exp_si(y, x, -1);
res2 = arf_is_int(y);
if (!arf_is_int(x) || arf_is_int(y))
{
flint_printf("FAIL! (3)\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("res1 = %d, res2 = %d\n\n", res1, res2);
abort();
}
}
arf_clear(x);
arf_clear(y);
fmpz_clear(t);
}
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()
{
long iter, iter2;
flint_rand_t state;
printf("add_fmpz....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
arf_t x, z, v;
fmpz_t y;
long prec, r1, r2;
arf_rnd_t rnd;
arf_init(x);
arf_init(z);
arf_init(v);
fmpz_init(y);
for (iter2 = 0; iter2 < 100; iter2++)
{
arf_randtest_special(x, state, 2000, 10);
fmpz_randtest(y, state, 2000);
prec = 2 + n_randint(state, 2000);
if (n_randint(state, 10) == 0 && fmpz_bits(ARF_EXPREF(x)) < 10)
{
prec = ARF_PREC_EXACT;
}
switch (n_randint(state, 4))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
default: rnd = ARF_RND_CEIL; break;
}
switch (n_randint(state, 2))
{
case 0:
r1 = arf_add_fmpz(z, x, y, prec, rnd);
r2 = arf_add_fmpz_naive(v, x, y, prec, rnd);
if (!arf_equal(z, v) || r1 != r2)
{
printf("FAIL!\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("x = "); arf_print(x); printf("\n\n");
printf("y = "); fmpz_print(y); printf("\n\n");
printf("z = "); arf_print(z); printf("\n\n");
printf("v = "); arf_print(v); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
default:
r2 = arf_add_fmpz_naive(v, x, y, prec, rnd);
r1 = arf_add_fmpz(x, x, y, prec, rnd);
if (!arf_equal(x, v) || r1 != r2)
{
printf("FAIL (aliasing)!\n");
printf("prec = %ld, rnd = %d\n\n", prec, rnd);
printf("x = "); arf_print(x); printf("\n\n");
printf("y = "); fmpz_print(y); printf("\n\n");
printf("v = "); arf_print(v); printf("\n\n");
printf("r1 = %ld, r2 = %ld\n", r1, r2);
abort();
}
break;
}
}
arf_clear(x);
arf_clear(z);
arf_clear(v);
fmpz_clear(y);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter, iter2;
flint_rand_t state;
flint_printf("addmul_si....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000 * arb_test_multiplier(); iter++)
{
arf_t x, z, v;
slong y;
slong prec, r1, r2;
arf_rnd_t rnd;
arf_init(x);
arf_init(z);
arf_init(v);
for (iter2 = 0; iter2 < 100; iter2++)
{
arf_randtest_special(x, state, 2000, 100);
y = z_randtest(state);
arf_randtest_special(z, state, 2000, 100);
arf_set(v, z);
prec = 2 + n_randint(state, 2000);
if (n_randint(state, 10) == 0 &&
fmpz_bits(ARF_EXPREF(x)) < 10 &&
fmpz_bits(ARF_EXPREF(z)) < 10)
{
prec = ARF_PREC_EXACT;
}
switch (n_randint(state, 5))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
switch (n_randint(state, 2))
{
case 0:
r1 = arf_addmul_si(z, x, y, prec, rnd);
r2 = arf_addmul_si_naive(v, x, y, prec, rnd);
if (!arf_equal(z, v) || r1 != r2)
{
flint_printf("FAIL!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = %wd", y); flint_printf("\n\n");
flint_printf("z = "); arf_debug(z); flint_printf("\n\n");
flint_printf("v = "); arf_debug(v); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
default:
r2 = arf_addmul_si_naive(v, v, y, prec, rnd);
r1 = arf_addmul_si(z, z, y, prec, rnd);
if (!arf_equal(v, z) || r1 != r2)
{
flint_printf("FAIL (aliasing)!\n");
flint_printf("prec = %wd, rnd = %d\n\n", prec, rnd);
flint_printf("y = %wd", y); flint_printf("\n\n");
flint_printf("v = "); arf_print(v); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("r1 = %wd, r2 = %wd\n", r1, r2);
abort();
}
break;
}
}
arf_clear(x);
arf_clear(z);
arf_clear(v);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("set_round....");
fflush(stdout);
flint_randinit(state);
{
arf_t x, y, z;
arf_init(x);
arf_init(y);
arf_init(z);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
slong bits1, bits2;
int ret1, ret2;
mpfr_t g1, g2;
fmpz_t e;
arf_rnd_t rnd;
bits1 = 1 + n_randint(state, 1000);
bits2 = 2 + n_randint(state, 1000);
if (n_randint(state, 100) == 0)
bits2 = ARF_PREC_EXACT;
switch (n_randint(state, 5))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
fmpz_init(e);
mpfr_init2(g1, FLINT_MAX(2, bits1));
mpfr_init2(g2, FLINT_MIN(bits2, 10000));
if (n_randint(state, 100) == 0)
{
arf_clear(x); arf_clear(y); arf_clear(z);
arf_init(x); arf_init(y); arf_init(z);
}
/* dirty output variables */
if (n_randint(state, 2))
{
arf_randtest_special(y, state, 1 + n_randint(state, 1000),
1 + n_randint(state, 100));
arf_randtest_special(z, state, 1 + n_randint(state, 1000),
1 + n_randint(state, 100));
}
arf_randtest_special(x, state, bits1, 1 + n_randint(state, 10));
arf_get_mpfr(g1, x, MPFR_RNDD); /* exact */
/* test large exponents */
if (n_randint(state, 4) == 0)
fmpz_randtest(e, state, 1 + n_randint(state, 100));
if (!arf_is_special(x))
fmpz_add(ARF_EXPREF(x), ARF_EXPREF(x), e);
ret1 = arf_set_round(y, x, bits2, rnd);
ret2 = mpfr_set(g2, g1, arf_rnd_to_mpfr(rnd));
arf_set_mpfr(z, g2);
if (!arf_is_special(y))
fmpz_sub(ARF_EXPREF(y), ARF_EXPREF(y), e);
if (!arf_equal(y, z) || ((ret1 == ARF_RESULT_EXACT) != (ret2 == 0)))
{
flint_printf("FAIL\n\n");
flint_printf("bits1: %wd\n", bits1);
flint_printf("bits2: %wd\n", bits2);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("ret1 = %d, ret2 = %d\n\n", ret1, ret2);
flint_abort();
}
if (!arf_is_special(x))
fmpz_add(ARF_EXPREF(x), ARF_EXPREF(x), e);
ret1 = arf_set_round(y, x, bits2, rnd);
arf_set(z, x);
ret2 = arf_set_round(z, z, bits2, rnd);
if (!arf_equal(y, z) || ret1 != ret2)
{
flint_printf("FAIL (aliasing)\n\n");
flint_printf("bits1: %wd\n", bits1);
flint_printf("bits2: %wd\n", bits2);
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("z = "); arf_print(z); flint_printf("\n\n");
flint_printf("ret1 = %d, ret2 = %d\n\n", ret1, ret2);
flint_abort();
}
mpfr_clear(g1);
mpfr_clear(g2);
fmpz_clear(e);
}
arf_clear(x);
arf_clear(y);
arf_clear(z);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
void
arb_mul_naive(arb_t z, const arb_t x, const arb_t y, slong prec)
{
arf_t zm_exact, zm_rounded, zr, t, u;
arf_init(zm_exact);
arf_init(zm_rounded);
arf_init(zr);
arf_init(t);
arf_init(u);
arf_mul(zm_exact, arb_midref(x), arb_midref(y), ARF_PREC_EXACT, ARF_RND_DOWN);
arf_set_round(zm_rounded, zm_exact, prec, ARB_RND);
/* rounding error */
if (arf_equal(zm_exact, zm_rounded))
{
arf_zero(zr);
}
else
{
fmpz_t e;
fmpz_init(e);
/* more accurate, but not what we are testing
arf_sub(zr, zm_exact, zm_rounded, MAG_BITS, ARF_RND_UP);
arf_abs(zr, zr); */
fmpz_sub_ui(e, ARF_EXPREF(zm_rounded), prec);
arf_one(zr);
arf_mul_2exp_fmpz(zr, zr, e);
fmpz_clear(e);
}
/* propagated error */
if (!arb_is_exact(x))
{
arf_set_mag(t, arb_radref(x));
arf_abs(u, arb_midref(y));
arf_addmul(zr, t, u, MAG_BITS, ARF_RND_UP);
}
if (!arb_is_exact(y))
{
arf_set_mag(t, arb_radref(y));
arf_abs(u, arb_midref(x));
arf_addmul(zr, t, u, MAG_BITS, ARF_RND_UP);
}
if (!arb_is_exact(x) && !arb_is_exact(y))
{
arf_set_mag(t, arb_radref(x));
arf_set_mag(u, arb_radref(y));
arf_addmul(zr, t, u, MAG_BITS, ARF_RND_UP);
}
arf_set(arb_midref(z), zm_rounded);
arf_get_mag(arb_radref(z), zr);
arf_clear(zm_exact);
arf_clear(zm_rounded);
arf_clear(zr);
arf_clear(t);
arf_clear(u);
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("set_round_mpz....");
fflush(stdout);
flint_randinit(state);
{
arf_t x, y;
arf_init(x);
arf_init(y);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
slong bits1, bits2;
int ret1, ret2;
fmpz_t a;
mpz_t b;
mpfr_t g;
arf_rnd_t rnd;
bits1 = 1 + n_randint(state, 1000);
bits2 = 2 + n_randint(state, 1000);
if (n_randint(state, 100) == 0)
bits2 = ARF_PREC_EXACT;
fmpz_init(a);
mpz_init(b);
mpfr_init2(g, FLINT_MIN(bits2, 10000));
if (n_randint(state, 100) == 0)
{
arf_clear(x);
arf_clear(y);
arf_init(x);
arf_init(y);
}
/* dirty output variables */
if (n_randint(state, 2))
{
arf_randtest_special(x, state, 1 + n_randint(state, 1000),
1 + n_randint(state, 100));
arf_randtest_special(y, state, 1 + n_randint(state, 1000),
1 + n_randint(state, 100));
}
fmpz_randtest(a, state, bits1);
fmpz_get_mpz(b, a);
switch (n_randint(state, 5))
{
case 0: rnd = ARF_RND_DOWN; break;
case 1: rnd = ARF_RND_UP; break;
case 2: rnd = ARF_RND_FLOOR; break;
case 3: rnd = ARF_RND_CEIL; break;
default: rnd = ARF_RND_NEAR; break;
}
ret1 = arf_set_round_mpz(x, b, bits2, rnd);
ret2 = mpfr_set_z(g, b, arf_rnd_to_mpfr(rnd));
arf_set_mpfr(y, g);
arf_equal(x, y);
if (!arf_equal(x, y) || ((ret1 == ARF_RESULT_EXACT) != (ret2 == 0)))
{
flint_printf("FAIL\n\n");
flint_printf("bits1: %wd\n", bits1);
flint_printf("bits2: %wd\n", bits2);
flint_printf("a = "); fmpz_print(a); flint_printf("\n\n");
flint_printf("x = "); arf_print(x); flint_printf("\n\n");
flint_printf("y = "); arf_print(y); flint_printf("\n\n");
flint_printf("ret1 = %d, ret2 = %d\n\n", ret1, ret2);
abort();
}
fmpz_clear(a);
mpz_clear(b);
mpfr_clear(g);
}
arf_clear(x);
arf_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}