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, res1, res2;
fmpr_t s1, s2, s3, err, err_bound;
fmpr_struct terms[20];
fmpr_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);
fmpr_init(s1);
fmpr_init(s2);
fmpr_init(s3);
fmpr_init(err);
fmpr_init(err_bound);
for (i = 0; i < len; i++)
{
fmpr_init(terms + i);
fmpr_randtest_special(terms + i, state, bits, expbits);
}
switch (n_randint(state, 4))
{
case 0: rnd = FMPR_RND_DOWN; break;
case 1: rnd = FMPR_RND_UP; break;
case 2: rnd = FMPR_RND_FLOOR; break;
default: rnd = FMPR_RND_CEIL; break;
}
res1 = fmpr_sum(s1, terms, len, prec, rnd);
fmpr_zero(s2);
for (i = 0; i < len; i++)
fmpr_add(s2, s2, terms + i, FMPR_PREC_EXACT, FMPR_RND_DOWN);
res2 = fmpr_set_round(s3, s2, prec, rnd);
if (!fmpr_equal(s1, s3) || res1 != res2 ||
!fmpr_check_ulp(s1, res1, prec) || !fmpr_check_ulp(s3, res2, prec))
{
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); fmpr_print(terms + i); flint_printf("\n\n");
}
flint_printf("s1 = "); fmpr_print(s1); flint_printf("\n\n");
flint_printf("s2 = "); fmpr_print(s2); flint_printf("\n\n");
flint_printf("s3 = "); fmpr_print(s3); flint_printf("\n\n");
flint_printf("res1 = %wd, res2 = %wd\n\n", res1, res2);
abort();
}
fmpr_sub(err, s1, s2, FMPR_PREC_EXACT, FMPR_RND_DOWN);
fmpr_abs(err, err);
fmpr_set_error_result(err_bound, s1, res1);
if (fmpr_cmp(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); fmpr_print(terms + i); flint_printf("\n\n");
}
flint_printf("s1 = "); fmpr_print(s1); flint_printf("\n\n");
flint_printf("s2 = "); fmpr_print(s2); flint_printf("\n\n");
flint_printf("s3 = "); fmpr_print(s3); flint_printf("\n\n");
flint_printf("error: "); fmpr_print(err); flint_printf("\n\n");
flint_printf("error bound: "); fmpr_print(err_bound); flint_printf("\n\n");
flint_printf("res1 = %wd, res2 = %wd\n\n", res1, res2);
abort();
}
fmpr_clear(s1);
fmpr_clear(s2);
fmpr_clear(s3);
fmpr_clear(err);
fmpr_clear(err_bound);
for (i = 0; i < len; i++)
fmpr_clear(terms + i);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
fmprb_contains(const fmprb_t x, const fmprb_t y)
{
fmpr_t t;
fmpr_t u;
fmpr_struct tmp[4];
int left_ok, right_ok;
if (fmprb_is_exact(y))
return fmprb_contains_fmpr(x, fmprb_midref(y));
if (fmpr_is_nan(fmprb_midref(y)))
return fmpr_is_nan(fmprb_midref(x));
fmpr_init(t);
fmpr_init(u);
/* fast check */
fmpr_sub(t, fmprb_midref(x), fmprb_radref(x), 30, FMPR_RND_CEIL);
fmpr_sub(u, fmprb_midref(y), fmprb_radref(y), 30, FMPR_RND_FLOOR);
left_ok = fmpr_cmp(t, u) <= 0;
/* exact check */
if (!left_ok)
{
fmpr_init(tmp + 0);
fmpr_init(tmp + 1);
fmpr_init(tmp + 2);
fmpr_init(tmp + 3);
fmpr_set(tmp + 0, fmprb_midref(x));
fmpr_neg(tmp + 1, fmprb_radref(x));
fmpr_neg(tmp + 2, fmprb_midref(y));
fmpr_set(tmp + 3, fmprb_radref(y));
fmpr_sum(t, tmp, 4, 30, FMPR_RND_DOWN);
left_ok = fmpr_sgn(t) <= 0;
fmpr_clear(tmp + 0);
fmpr_clear(tmp + 1);
fmpr_clear(tmp + 2);
fmpr_clear(tmp + 3);
}
/* fast check */
fmpr_add(t, fmprb_midref(x), fmprb_radref(x), 30, FMPR_RND_FLOOR);
fmpr_add(u, fmprb_midref(y), fmprb_radref(y), 30, FMPR_RND_CEIL);
right_ok = (fmpr_cmp(t, u) >= 0);
/* exact check */
if (!right_ok)
{
fmpr_init(tmp + 0);
fmpr_init(tmp + 1);
fmpr_init(tmp + 2);
fmpr_init(tmp + 3);
fmpr_set(tmp + 0, fmprb_midref(x));
fmpr_set(tmp + 1, fmprb_radref(x));
fmpr_neg(tmp + 2, fmprb_midref(y));
fmpr_neg(tmp + 3, fmprb_radref(y));
fmpr_sum(t, tmp, 4, 30, FMPR_RND_DOWN);
right_ok = fmpr_sgn(t) >= 0;
fmpr_clear(tmp + 0);
fmpr_clear(tmp + 1);
fmpr_clear(tmp + 2);
fmpr_clear(tmp + 3);
}
fmpr_clear(t);
fmpr_clear(u);
return left_ok && right_ok;
}