int
main(void)
{
int i, result;
flint_rand_t state;
printf("content....");
fflush(stdout);
flint_randinit(state);
/* Check that content(a f) = abs(a) content(f) */
for (i = 0; i < 10000; i++)
{
fmpq_poly_t f, g;
fmpq_t a, b, c;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_init(a);
fmpq_init(b);
fmpq_init(c);
fmpq_poly_randtest_not_zero(f, state, n_randint(state, 100) + 1, 100);
fmpq_randtest_not_zero(a, state, 100);
fmpq_poly_scalar_mul_fmpq(g, f, a);
fmpq_poly_content(b, g);
fmpq_poly_content(c, f);
fmpq_mul(c, a, c);
fmpq_abs(c, c);
result = (fmpq_equal(b, c));
if (!result)
{
printf("FAIL:\n");
fmpq_poly_print(f), printf("\n\n");
fmpq_poly_print(g), printf("\n\n");
fmpq_print(a), printf("\n\n");
fmpq_print(b), printf("\n\n");
fmpq_print(c), printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_clear(a);
fmpq_clear(b);
fmpq_clear(c);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
int
main(void)
{
int i;
FLINT_TEST_INIT(state);
flint_printf("set_si....");
fflush(stdout);
for (i = 0; i < 10000; i++)
{
fmpq_t x, y;
fmpz_t p, q;
slong P, Q;
fmpq_init(x);
fmpq_init(y);
fmpz_init(p);
fmpz_init(q);
P = z_randtest(state);
Q = n_randtest_not_zero(state);
fmpz_set_si(p, P);
fmpz_set_ui(q, Q);
fmpq_set_fmpz_frac(x, p, q);
fmpq_set_si(y, P, Q);
if (!fmpq_is_canonical(y) || !fmpq_equal(x, y))
{
flint_printf("FAIL");
flint_printf("p: "); fmpz_print(p); flint_printf("\n");
flint_printf("q: "); fmpz_print(q); flint_printf("\n");
flint_printf("x: "); fmpq_print(x); flint_printf("\n");
flint_printf("y: "); fmpq_print(y); flint_printf("\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
fmpz_clear(p);
fmpz_clear(q);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int main()
{
printf("seq_set_fmpq_pow....");
fflush(stdout);
{
long i;
fmpq_t t, u;
fmpz_holonomic_t op;
fmpq_t c, initial;
fmpz_holonomic_init(op);
fmpq_init(t);
fmpq_init(u);
fmpq_init(c);
fmpq_init(initial);
fmpq_set_si(c, -7, 3);
fmpz_holonomic_seq_set_fmpq_pow(op, c);
fmpq_set_si(initial, -2, 1);
for (i = 0; i < 20; i++)
{
fmpz_holonomic_get_nth_fmpq(t, op, initial, 0, i);
fmpz_pow_ui(fmpq_numref(u), fmpq_numref(c), i);
fmpz_pow_ui(fmpq_denref(u), fmpq_denref(c), i);
fmpz_mul_si(fmpq_numref(u), fmpq_numref(u), -2);
if (!fmpq_equal(t, u))
{
printf("FAIL\n");
printf("i = %ld, t = ", i); fmpq_print(t);
printf(" u = "); fmpq_print(u);
printf("\n");
abort();
}
}
fmpq_clear(c);
fmpq_clear(t);
fmpq_clear(u);
fmpq_clear(initial);
fmpz_holonomic_clear(op);
}
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i;
flint_rand_t state;
flint_randinit(state);
printf("set_cfrac....");
fflush(stdout);
for (i = 0; i < 10000; i++)
{
fmpq_t x, y, r;
fmpz * c;
long n, bound;
fmpq_init(x);
fmpq_init(y);
fmpq_init(r);
fmpq_randtest(x, state, 1 + n_randint(state, 1000));
bound = fmpq_cfrac_bound(x);
c = _fmpz_vec_init(bound);
n = fmpq_get_cfrac(c, r, x, bound);
fmpq_set_cfrac(y, c, n);
if (!fmpq_equal(x, y))
{
printf("FAIL: x != y\n");
printf("x = "); fmpq_print(x); printf("\n");
printf("y = "); fmpq_print(y); printf("\n");
printf("c = "); _fmpz_vec_print(c, n); printf("\n\n");
abort();
}
_fmpz_vec_clear(c, bound);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(r);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
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; iter++)
{
slong bits, res;
fmpr_t x, z;
fmpq_t y;
bits = 2 + n_randint(state, 200);
fmpr_init(x);
fmpr_init(z);
fmpq_init(y);
fmpr_randtest(x, state, bits, 10);
fmpr_randtest(z, state, bits, 10);
fmpr_get_fmpq(y, x);
res = fmpr_set_fmpq(z, y, bits, FMPR_RND_DOWN);
if (!fmpr_equal(x, z) || !fmpr_check_ulp(z, res, bits))
{
flint_printf("FAIL\n\n");
flint_printf("bits: %wd\n", bits);
flint_printf("x = ");
fmpr_print(x);
flint_printf("\n\n");
flint_printf("y = ");
fmpq_print(y);
flint_printf("\n\n");
flint_printf("z = ");
fmpr_print(z);
flint_printf("\n\n");
abort();
}
fmpr_clear(x);
fmpr_clear(z);
fmpq_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("sin_pi_fmpq....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t s1, s2;
fmpq_t x;
slong prec;
prec = 2 + n_randint(state, 5000);
arb_init(s1);
arb_init(s2);
fmpq_init(x);
fmpq_randtest(x, state, 1 + n_randint(state, 200));
arb_sin_pi_fmpq(s1, x, prec);
arb_const_pi(s2, prec);
arb_mul_fmpz(s2, s2, fmpq_numref(x), prec);
arb_div_fmpz(s2, s2, fmpq_denref(x), prec);
arb_sin(s2, s2, prec);
if (!arb_overlaps(s1, s2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("s1 = "); arb_printd(s1, 15); flint_printf("\n\n");
flint_printf("s2 = "); arb_printd(s2, 15); flint_printf("\n\n");
abort();
}
arb_clear(s1);
arb_clear(s2);
fmpq_clear(x);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
long iter;
flint_rand_t state;
printf("cos_pi_fmpq....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
fmprb_t c1, c2;
fmpq_t x;
long prec;
prec = 2 + n_randint(state, 5000);
fmprb_init(c1);
fmprb_init(c2);
fmpq_init(x);
fmpq_randtest(x, state, 1 + n_randint(state, 200));
fmprb_cos_pi_fmpq(c1, x, prec);
fmprb_const_pi(c2, prec);
fmprb_mul_fmpz(c2, c2, fmpq_numref(x), prec);
fmprb_div_fmpz(c2, c2, fmpq_denref(x), prec);
fmprb_cos(c2, c2, prec);
if (!fmprb_overlaps(c1, c2))
{
printf("FAIL: overlap\n\n");
printf("x = "); fmpq_print(x); printf("\n\n");
printf("c1 = "); fmprb_printd(c1, 15); printf("\n\n");
printf("c2 = "); fmprb_printd(c2, 15); printf("\n\n");
abort();
}
fmprb_clear(c1);
fmprb_clear(c2);
fmpq_clear(x);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
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 main()
{
slong iter;
flint_rand_t state;
flint_printf("get_rand_fmpq....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
fmprb_t x;
fmpq_t q;
fmprb_init(x);
fmpq_init(q);
fmprb_randtest(x, state, 1 + n_randint(state, 200), 10);
fmprb_get_rand_fmpq(q, state, x, 1 + n_randint(state, 200));
if (!fmprb_contains_fmpq(x, q) || !fmpq_is_canonical(q))
{
flint_printf("FAIL:\n\n");
flint_printf("x = "); fmprb_print(x); flint_printf("\n\n");
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
abort();
}
fmprb_clear(x);
fmpq_clear(q);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("contains_arf....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a;
arf_t b;
fmpq_t am, ar, bm, t;
int c1, c2;
arb_init(a);
arf_init(b);
fmpq_init(am);
fmpq_init(ar);
fmpq_init(bm);
fmpq_init(t);
arb_randtest(a, state, 1 + n_randint(state, 500), 14);
arf_randtest(b, state, 1 + n_randint(state, 500), 14);
arf_get_fmpq(am, arb_midref(a));
mag_get_fmpq(ar, arb_radref(a));
arf_get_fmpq(bm, b);
c1 = arb_contains_arf(a, b);
fmpq_sub(t, am, ar);
c2 = fmpq_cmp(t, bm) <= 0;
fmpq_add(t, am, ar);
c2 = c2 && (fmpq_cmp(t, bm) >= 0);
if (c1 != c2)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "); arb_print(a); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("am = "); fmpq_print(am); flint_printf("\n\n");
flint_printf("ar = "); fmpq_print(ar); flint_printf("\n\n");
flint_printf("bm = "); fmpq_print(bm); flint_printf("\n\n");
flint_printf("t = "); fmpq_print(t); flint_printf("\n\n");
flint_printf("c1 = %d, c2 = %d\n\n", c1, c2);
abort();
}
arb_clear(a);
arf_clear(b);
fmpq_clear(am);
fmpq_clear(ar);
fmpq_clear(bm);
fmpq_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("fundamental_domain_approx....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
fmpq_t x, y;
psl2z_t g;
arf_t one_minus_eps, tol;
acb_t z, w, w2;
arb_t t;
slong prec;
fmpq_init(x);
fmpq_init(y);
psl2z_init(g);
acb_init(z);
acb_init(w);
acb_init(w2);
arf_init(one_minus_eps);
arf_init(tol);
arb_init(t);
/* pick an exact point in the upper half plane */
fmpq_randtest(x, state, 1 + n_randint(state, 500));
do {
fmpq_randtest(y, state, 1 + n_randint(state, 500));
} while (fmpz_sgn(fmpq_numref(y)) <= 0);
/* pick a tolerance */
arf_set_ui_2exp_si(tol, 1, -(slong) n_randint(state, 500));
/* now increase the precision until convergence */
for (prec = 32; ; prec *= 2)
{
if (prec > 16384)
{
flint_printf("FAIL (no convergence)\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("z = "); acb_printd(z, 50); flint_printf("\n\n");
flint_printf("w = "); acb_printd(w, 50); flint_printf("\n\n");
flint_printf("w2 = "); acb_printd(w2, 50); flint_printf("\n\n");
flint_printf("g = "); psl2z_print(g); flint_printf("\n\n");
abort();
}
arb_set_fmpq(acb_realref(z), x, prec);
arb_set_fmpq(acb_imagref(z), y, prec);
arf_set_ui_2exp_si(one_minus_eps, 1, -prec / 4);
arf_sub_ui(one_minus_eps, one_minus_eps, 1, prec, ARF_RND_DOWN);
arf_neg(one_minus_eps, one_minus_eps);
acb_modular_fundamental_domain_approx(w, g, z, one_minus_eps, prec);
acb_modular_transform(w2, g, z, prec);
if (!psl2z_is_correct(g) || !acb_overlaps(w, w2))
{
flint_printf("FAIL (incorrect transformation)\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("z = "); acb_printd(z, 50); flint_printf("\n\n");
flint_printf("w = "); acb_printd(w, 50); flint_printf("\n\n");
flint_printf("w2 = "); acb_printd(w2, 50); flint_printf("\n\n");
flint_printf("g = "); psl2z_print(g); flint_printf("\n\n");
abort();
}
/* success */
if (acb_modular_is_in_fundamental_domain(w, tol, prec))
break;
}
/* check that g^(-1) * w contains x+yi */
psl2z_inv(g, g);
acb_modular_transform(w2, g, w, 2 + n_randint(state, 1000));
if (!arb_contains_fmpq(acb_realref(w2), x) ||
!arb_contains_fmpq(acb_imagref(w2), y))
{
flint_printf("FAIL (inverse containment)\n");
flint_printf("x = "); fmpq_print(x); flint_printf("\n\n");
flint_printf("y = "); fmpq_print(y); flint_printf("\n\n");
flint_printf("z = "); acb_printd(z, 50); flint_printf("\n\n");
flint_printf("w = "); acb_printd(w, 50); flint_printf("\n\n");
flint_printf("w2 = "); acb_printd(w2, 50); flint_printf("\n\n");
flint_printf("g = "); psl2z_print(g); flint_printf("\n\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
psl2z_clear(g);
acb_clear(z);
acb_clear(w);
acb_clear(w2);
arf_clear(one_minus_eps);
arf_clear(tol);
arb_clear(t);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
flint_rand_t state;
flint_randinit(state);
printf("mul_fmpz....");
fflush(stdout);
/* Aliasing x = x*z */
for (i = 0; i < 10000; i++)
{
fmpq_t x, y;
fmpz_t z;
fmpq_init(x);
fmpq_init(y);
fmpz_init(z);
fmpq_randtest(x, state, 200);
fmpz_randtest(z, state, 200);
fmpq_mul_fmpz(y, x, z);
fmpq_mul_fmpz(x, x, z);
result = (fmpq_is_canonical(x) && fmpq_is_canonical(y) && fmpq_equal(x, y));
if (!result)
{
printf("FAIL (alias):\n");
printf("x = "), fmpq_print(x), printf("\n");
printf("y = "), fmpq_print(y), printf("\n");
printf("z = "), fmpz_print(z), printf("\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
fmpz_clear(z);
}
/* Compare with fmpq_mul */
for (i = 0; i < 10000; i++)
{
fmpq_t x, y, z;
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
fmpq_randtest(x, state, 200);
fmpz_randtest(fmpq_numref(z), state, 200);
fmpq_mul_fmpz(y, x, fmpq_numref(z));
fmpq_mul(x, x, z);
result = (fmpq_is_canonical(x) && fmpq_is_canonical(y) && fmpq_equal(x, y));
if (!result)
{
printf("FAIL (cmp):\n");
printf("x = "), fmpq_print(x), printf("\n");
printf("y = "), fmpq_print(y), printf("\n");
printf("z = "), fmpq_print(z), printf("\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("one....");
fflush(stdout);
/* x == 1 * x */
for (i = 0; i < 10000; i++)
{
fmpq_t x, y, z;
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
fmpq_randtest(x, state, 200);
fmpq_one(y);
fmpq_mul(z, y, x);
result = fmpq_is_canonical(z) && fmpq_equal(x, z);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("x = "), fmpq_print(x), flint_printf("\n");
flint_printf("y = "), fmpq_print(y), flint_printf("\n");
flint_printf("z = "), fmpq_print(z), flint_printf("\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
}
/* x/x == 1 */
for (i = 0; i < 10000; i++)
{
fmpq_t x, y;
fmpq_init(x);
fmpq_init(y);
while (fmpq_is_zero(x))
fmpq_randtest(x, state, 200);
fmpq_div(y, x, x);
result = fmpq_is_canonical(y) && fmpq_is_one(y);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("x = "), fmpq_print(x), flint_printf("\n");
flint_printf("y = "), fmpq_print(y), flint_printf("\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("evaluate_fmpz....");
fflush(stdout);
/* Check that (f+g)(a) = f(a) + g(a) */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
fmpz_t a;
fmpq_poly_t f, g, h;
fmpq_t x, y;
fmpq_init(x);
fmpq_init(y);
fmpz_init(a);
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_randtest(f, state, n_randint(state, 100), 200);
fmpq_poly_randtest(g, state, n_randint(state, 100), 200);
fmpz_randtest(a, state, n_randint(state, 100));
fmpq_poly_evaluate_fmpz(x, f, a);
fmpq_poly_evaluate_fmpz(y, g, a);
fmpq_add(x, x, y);
fmpq_poly_add(h, f, g);
fmpq_poly_evaluate_fmpz(y, h, a);
result = (fmpq_equal(x, y));
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("f = "), fmpq_poly_debug(f), flint_printf("\n");
flint_printf("g = "), fmpq_poly_debug(g), flint_printf("\n");
flint_printf("a = "), fmpz_print(a), flint_printf("\n");
flint_printf("f(a) + g(a) = "), fmpq_print(x), flint_printf("\n\n");
flint_printf("(f + g)(a) = "), fmpq_print(y), flint_printf("\n\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
fmpz_clear(a);
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
}
/* Check that (f*g)(a) = f(a) * g(a) */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
fmpz_t a;
fmpq_poly_t f, g;
fmpq_t x, y;
fmpq_init(x);
fmpq_init(y);
fmpz_init(a);
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_randtest(f, state, n_randint(state, 100), 200);
fmpq_poly_randtest(g, state, n_randint(state, 100), 200);
fmpz_randtest(a, state, n_randint(state, 100));
fmpq_poly_evaluate_fmpz(x, f, a);
fmpq_poly_evaluate_fmpz(y, g, a);
fmpq_mul(x, x, y);
fmpq_poly_mul(f, f, g);
fmpq_poly_evaluate_fmpz(y, f, a);
result = (fmpq_equal(x, y));
if (!result)
{
flint_printf("FAIL:\n");
fmpz_print(a), flint_printf("\n\n");
abort();
}
fmpq_clear(x);
fmpq_clear(y);
fmpz_clear(a);
fmpq_poly_clear(f);
fmpq_poly_clear(g);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int
main(void)
{
int i;
flint_rand_t state;
flint_randinit(state);
printf("canonicalise....");
fflush(stdout);
for (i = 0; i < 10000; i++)
{
fmpq_t x;
fmpz_t mult;
fmpq_init(x);
fmpq_randtest(x, state, 200);
if (!fmpq_is_canonical(x))
{
printf("FAIL: expected fmpq_randtest output to be canonical\n");
fmpq_print(x);
printf("\n");
abort();
}
fmpz_init(mult);
fmpz_randtest_not_zero(mult, state, 200);
fmpz_add_ui(mult, mult, 1UL);
fmpz_mul(&x->num, &x->num, mult);
fmpz_mul(&x->den, &x->den, mult);
if (fmpq_is_canonical(x))
{
printf("FAIL: expected fmpq_is_canonical to detect common factor\n");
fmpq_print(x);
printf("\n");
abort();
}
fmpq_canonicalise(x);
if (!fmpq_is_canonical(x))
{
printf("FAIL: result not canonical after calling fmpq_canonicalise\n");
fmpq_print(x);
printf("\n");
abort();
}
fmpz_neg(&x->den, &x->den);
if (fmpq_is_canonical(x))
{
printf("FAIL: negative denominator reported as being canonical\n");
fmpq_print(x);
printf("\n");
abort();
}
fmpq_canonicalise(x);
if (!fmpq_is_canonical(x))
{
printf("FAIL: result not canonical after calling fmpq_canonicalise\n");
fmpq_print(x);
printf("\n");
abort();
}
fmpz_clear(mult);
fmpq_clear(x);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("overlaps....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000 * arb_test_multiplier(); iter++)
{
arb_t a, b;
fmpq_t am, ar, bm, br, t, u;
int c1, c2;
arb_init(a);
arb_init(b);
fmpq_init(am);
fmpq_init(ar);
fmpq_init(bm);
fmpq_init(br);
fmpq_init(t);
fmpq_init(u);
arb_randtest(a, state, 1 + n_randint(state, 500), 14);
arb_randtest(b, state, 1 + n_randint(state, 500), 14);
arf_get_fmpq(am, arb_midref(a));
mag_get_fmpq(ar, arb_radref(a));
arf_get_fmpq(bm, arb_midref(b));
mag_get_fmpq(br, arb_radref(b));
fmpq_sub(t, am, bm);
fmpz_abs(fmpq_numref(t), fmpq_numref(t));
fmpq_add(u, ar, br);
c1 = arb_overlaps(a, b);
c2 = (fmpq_cmp(t, u) <= 0);
if (c1 != c2)
{
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("am = "); fmpq_print(am); flint_printf("\n\n");
flint_printf("ar = "); fmpq_print(ar); flint_printf("\n\n");
flint_printf("bm = "); fmpq_print(bm); flint_printf("\n\n");
flint_printf("br = "); fmpq_print(br); flint_printf("\n\n");
flint_printf("t = "); fmpq_print(t); flint_printf("\n\n");
flint_printf("u = "); fmpq_print(u); flint_printf("\n\n");
flint_printf("c1 = %d, c2 = %d\n\n", c1, c2);
flint_abort();
}
arb_clear(a);
arb_clear(b);
fmpq_clear(am);
fmpq_clear(ar);
fmpq_clear(bm);
fmpq_clear(br);
fmpq_clear(t);
fmpq_clear(u);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("det....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
fmpq_mat_t Q;
fmpq_t Qdet;
arb_mat_t A;
arb_t Adet;
slong n, qbits, prec;
n = n_randint(state, 8);
qbits = 1 + n_randint(state, 100);
prec = 2 + n_randint(state, 200);
fmpq_mat_init(Q, n, n);
fmpq_init(Qdet);
arb_mat_init(A, n, n);
arb_init(Adet);
fmpq_mat_randtest(Q, state, qbits);
fmpq_mat_det(Qdet, Q);
arb_mat_set_fmpq_mat(A, Q, prec);
arb_mat_det(Adet, A, prec);
if (!arb_contains_fmpq(Adet, Qdet))
{
flint_printf("FAIL (containment, iter = %wd)\n", iter);
flint_printf("n = %wd, prec = %wd\n", n, prec);
flint_printf("\n");
flint_printf("Q = \n"); fmpq_mat_print(Q); flint_printf("\n\n");
flint_printf("Qdet = \n"); fmpq_print(Qdet); flint_printf("\n\n");
flint_printf("A = \n"); arb_mat_printd(A, 15); flint_printf("\n\n");
flint_printf("Adet = \n"); arb_printd(Adet, 15); flint_printf("\n\n");
flint_printf("Adet = \n"); arb_print(Adet); flint_printf("\n\n");
abort();
}
fmpq_mat_clear(Q);
fmpq_clear(Qdet);
arb_mat_clear(A);
arb_clear(Adet);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("frobenius_norm....");
fflush(stdout);
flint_randinit(state);
/* compare to the exact rational norm */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
fmpq_mat_t Q;
fmpq_t q;
arb_mat_t A;
slong n, qbits, prec;
n = n_randint(state, 8);
qbits = 1 + n_randint(state, 100);
prec = 2 + n_randint(state, 200);
fmpq_mat_init(Q, n, n);
fmpq_init(q);
arb_mat_init(A, n, n);
fmpq_mat_randtest(Q, state, qbits);
_fmpq_mat_sum_of_squares(q, Q);
arb_mat_set_fmpq_mat(A, Q, prec);
/* check that the arb interval contains the exact value */
{
arb_t a;
arb_init(a);
arb_mat_frobenius_norm(a, A, prec);
arb_mul(a, a, a, prec);
if (!arb_contains_fmpq(a, q))
{
flint_printf("FAIL (containment, iter = %wd)\n", iter);
flint_printf("n = %wd, prec = %wd\n", n, prec);
flint_printf("\n");
flint_printf("Q = \n");
fmpq_mat_print(Q);
flint_printf("\n\n");
flint_printf("frobenius_norm(Q)^2 = \n");
fmpq_print(q);
flint_printf("\n\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("frobenius_norm(A)^2 = \n");
arb_printd(a, 15);
flint_printf("\n\n");
flint_printf("frobenius_norm(A)^2 = \n");
arb_print(a);
flint_printf("\n\n");
abort();
}
arb_clear(a);
}
/* check that the upper bound is not less than the exact value */
{
mag_t b;
fmpq_t y;
mag_init(b);
fmpq_init(y);
arb_mat_bound_frobenius_norm(b, A);
mag_mul(b, b, b);
mag_get_fmpq(y, b);
if (fmpq_cmp(q, y) > 0)
{
flint_printf("FAIL (bound, iter = %wd)\n", iter);
flint_printf("n = %wd, prec = %wd\n", n, prec);
flint_printf("\n");
flint_printf("Q = \n");
fmpq_mat_print(Q);
flint_printf("\n\n");
flint_printf("frobenius_norm(Q)^2 = \n");
fmpq_print(q);
flint_printf("\n\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("bound_frobenius_norm(A)^2 = \n");
mag_printd(b, 15);
flint_printf("\n\n");
flint_printf("bound_frobenius_norm(A)^2 = \n");
mag_print(b);
flint_printf("\n\n");
abort();
}
mag_clear(b);
fmpq_clear(y);
}
fmpq_mat_clear(Q);
fmpq_clear(q);
arb_mat_clear(A);
}
/* check trace(A^T A) = frobenius_norm(A)^2 */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong m, n, prec;
arb_mat_t A, AT, ATA;
arb_t t;
prec = 2 + n_randint(state, 200);
m = n_randint(state, 10);
n = n_randint(state, 10);
arb_mat_init(A, m, n);
arb_mat_init(AT, n, m);
arb_mat_init(ATA, n, n);
arb_init(t);
arb_mat_randtest(A, state, 2 + n_randint(state, 100), 10);
arb_mat_transpose(AT, A);
arb_mat_mul(ATA, AT, A, prec);
arb_mat_trace(t, ATA, prec);
arb_sqrt(t, t, prec);
/* check the norm bound */
{
mag_t low, frobenius;
mag_init(low);
arb_get_mag_lower(low, t);
mag_init(frobenius);
arb_mat_bound_frobenius_norm(frobenius, A);
if (mag_cmp(low, frobenius) > 0)
{
flint_printf("FAIL (bound)\n", iter);
flint_printf("m = %wd, n = %wd, prec = %wd\n", m, n, prec);
flint_printf("\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("lower(sqrt(trace(A^T A))) = \n");
mag_printd(low, 15);
flint_printf("\n\n");
flint_printf("bound_frobenius_norm(A) = \n");
mag_printd(frobenius, 15);
flint_printf("\n\n");
abort();
}
mag_clear(low);
mag_clear(frobenius);
}
/* check the norm interval */
{
arb_t frobenius;
arb_init(frobenius);
arb_mat_frobenius_norm(frobenius, A, prec);
if (!arb_overlaps(t, frobenius))
{
flint_printf("FAIL (overlap)\n", iter);
flint_printf("m = %wd, n = %wd, prec = %wd\n", m, n, prec);
flint_printf("\n");
flint_printf("A = \n");
arb_mat_printd(A, 15);
flint_printf("\n\n");
flint_printf("sqrt(trace(A^T A)) = \n");
arb_printd(t, 15);
flint_printf("\n\n");
flint_printf("frobenius_norm(A) = \n");
arb_printd(frobenius, 15);
flint_printf("\n\n");
abort();
}
arb_clear(frobenius);
}
arb_mat_clear(A);
arb_mat_clear(AT);
arb_mat_clear(ATA);
arb_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_abs_lbound_arf....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t x;
arf_t b, b2, b3;
fmpq_t q;
arb_init(x);
arf_init(b);
arf_init(b2);
arf_init(b3);
fmpq_init(q);
arb_randtest(x, state, 1 + n_randint(state, 200), 10);
arb_get_abs_lbound_arf(b, x, 2 + n_randint(state, 200));
arb_get_rand_fmpq(q, state, x, 1 + n_randint(state, 200));
arf_mul_fmpz(b2, b, fmpq_denref(q), ARF_PREC_EXACT, ARF_RND_DOWN);
arf_set_fmpz(b3, fmpq_numref(q));
arf_abs(b3, b3);
if (arf_cmp(b2, b3) > 0)
{
flint_printf("FAIL (abs_lbound):\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("b2 = "); arf_print(b2); flint_printf("\n\n");
flint_printf("b3 = "); arf_print(b3); flint_printf("\n\n");
flint_abort();
}
arb_get_abs_ubound_arf(b, x, 2 + n_randint(state, 200));
arb_get_rand_fmpq(q, state, x, 1 + n_randint(state, 200));
arf_mul_fmpz(b2, b, fmpq_denref(q), ARF_PREC_EXACT, ARF_RND_DOWN);
arf_set_fmpz(b3, fmpq_numref(q));
arf_abs(b3, b3);
if (arf_cmp(b2, b3) < 0)
{
flint_printf("FAIL (abs_ubound):\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("b2 = "); arf_print(b2); flint_printf("\n\n");
flint_printf("b3 = "); arf_print(b3); flint_printf("\n\n");
flint_abort();
}
arb_randtest_special(x, state, 1 + n_randint(state, 200), 1 + n_randint(state, 10));
arb_get_abs_lbound_arf(b, x, 2 + n_randint(state, 200));
arb_get_abs_ubound_arf(b2, x, 2 + n_randint(state, 200));
if (arf_cmp(b, b2) > 0)
{
flint_printf("FAIL:\n\n");
flint_printf("x = "); arb_print(x); flint_printf("\n\n");
flint_printf("b = "); arf_print(b); flint_printf("\n\n");
flint_printf("b2 = "); arf_print(b2); flint_printf("\n\n");
flint_abort();
}
arb_clear(x);
fmpq_clear(q);
arf_clear(b);
arf_clear(b2);
arf_clear(b3);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("gamma_fmpq....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t r, s;
fmpq_t q;
slong accuracy, prec, pp, qq;
prec = 2 + n_randint(state, 1 << n_randint(state, 12));
prec += 20;
arb_init(r);
arb_init(s);
fmpq_init(q);
pp = -100 + n_randint(state, 10000);
qq = 1 + n_randint(state, 20);
fmpq_set_si(q, pp, qq);
arb_gamma_fmpq(r, q, prec);
arb_set_fmpq(s, q, prec);
arb_gamma(s, s, prec);
if (!arb_overlaps(r, s))
{
flint_printf("FAIL: containment\n\n");
flint_printf("prec = %wd\n", prec);
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
flint_printf("r = "); arb_printd(r, prec / 3.33); flint_printf("\n\n");
flint_printf("s = "); arb_printd(s, prec / 3.33); flint_printf("\n\n");
abort();
}
if (!(fmpz_is_one(fmpq_denref(q)) && fmpz_sgn(fmpq_numref(q)) <= 0)
&& FLINT_ABS(pp / qq) < 10)
{
accuracy = arb_rel_accuracy_bits(r);
if (accuracy < prec - 6)
{
flint_printf("FAIL: poor accuracy\n\n");
flint_printf("prec = %wd\n", prec);
flint_printf("q = "); fmpq_print(q); flint_printf("\n\n");
flint_printf("r = "); arb_printd(r, prec / 3.33); flint_printf("\n\n");
abort();
}
}
arb_clear(r);
arb_clear(s);
fmpq_clear(q);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int
main(void)
{
int i, result;
ulong cflags = UWORD(0);
FLINT_TEST_INIT(state);
flint_printf("scalar_div_fmpq....");
fflush(stdout);
/* Check aliasing of a and b */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b;
fmpq_t z;
fmpq_init(z);
fmpq_randtest_not_zero(z, state, 100);
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
fmpq_poly_scalar_div_fmpq(b, a, z);
fmpq_poly_scalar_div_fmpq(a, a, z);
cflags |= fmpq_poly_is_canonical(a) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(b) ? 0 : 2;
result = (fmpq_poly_equal(a, b) && !cflags);
if (!result)
{
flint_printf("FAIL (aliasing):\n\n");
fmpq_poly_debug(a), flint_printf("\n\n");
fmpq_poly_debug(b), flint_printf("\n\n");
fmpq_print(z), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_clear(z);
fmpq_poly_clear(a);
fmpq_poly_clear(b);
}
/* Check that (a / n1) / n2 == a / (n1 * n2) */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, lhs, rhs;
fmpq_t z1, z2, z;
fmpq_init(z1);
fmpq_init(z2);
fmpq_init(z);
fmpq_randtest_not_zero(z1, state, 100);
fmpq_randtest_not_zero(z2, state, 100);
fmpq_mul(z, z1, z2);
fmpq_poly_init(a);
fmpq_poly_init(lhs);
fmpq_poly_init(rhs);
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
fmpq_poly_scalar_div_fmpq(lhs, a, z1);
fmpq_poly_scalar_div_fmpq(lhs, lhs, z2);
fmpq_poly_scalar_div_fmpq(rhs, a, z);
cflags |= fmpq_poly_is_canonical(lhs) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(rhs) ? 0 : 2;
result = (fmpq_poly_equal(lhs, rhs) && !cflags);
if (!result)
{
flint_printf("FAIL (a / n1 / n2):\n");
fmpq_poly_debug(a), flint_printf("\n\n");
fmpq_print(z1), flint_printf("\n\n");
fmpq_print(z2), flint_printf("\n\n");
fmpq_print(z), flint_printf("\n\n");
fmpq_poly_debug(lhs), flint_printf("\n\n");
fmpq_poly_debug(rhs), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_clear(z1);
fmpq_clear(z2);
fmpq_clear(z);
fmpq_poly_clear(a);
fmpq_poly_clear(lhs);
fmpq_poly_clear(rhs);
}
/* Check that (a + b) / n == a/n + b/n */
for (i = 0; i < 1000 * flint_test_multiplier(); i++)
{
fmpq_poly_t a, b, lhs, rhs;
fmpq_t z;
fmpq_init(z);
fmpq_randtest_not_zero(z, state, 100);
fmpq_poly_init(a);
fmpq_poly_init(b);
fmpq_poly_init(lhs);
fmpq_poly_init(rhs);
fmpq_poly_randtest(a, state, n_randint(state, 100), 200);
fmpq_poly_randtest(b, state, n_randint(state, 100), 200);
fmpq_poly_scalar_div_fmpq(lhs, a, z);
fmpq_poly_scalar_div_fmpq(rhs, b, z);
fmpq_poly_add(rhs, lhs, rhs);
fmpq_poly_add(lhs, a, b);
fmpq_poly_scalar_div_fmpq(lhs, lhs, z);
cflags |= fmpq_poly_is_canonical(lhs) ? 0 : 1;
cflags |= fmpq_poly_is_canonical(rhs) ? 0 : 2;
result = (fmpq_poly_equal(lhs, rhs) && !cflags);
if (!result)
{
flint_printf("FAIL ((a + b) / n):\n");
fmpq_poly_debug(a), flint_printf("\n\n");
fmpq_poly_debug(b), flint_printf("\n\n");
fmpq_print(z), flint_printf("\n\n");
fmpq_poly_debug(lhs), flint_printf("\n\n");
fmpq_poly_debug(rhs), flint_printf("\n\n");
flint_printf("cflags = %wu\n\n", cflags);
abort();
}
fmpq_clear(z);
fmpq_poly_clear(a);
fmpq_poly_clear(b);
fmpq_poly_clear(lhs);
fmpq_poly_clear(rhs);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("evaluate_vec_fast....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong i, n, qbits1, qbits2, rbits1, rbits2, rbits3;
fmpq_poly_t F;
fmpq * X, * Y;
arb_poly_t f;
arb_ptr x, y;
qbits1 = 2 + n_randint(state, 100);
qbits2 = 2 + n_randint(state, 100);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
n = n_randint(state, 10);
fmpq_poly_init(F);
X = _fmpq_vec_init(n);
Y = _fmpq_vec_init(n);
arb_poly_init(f);
x = _arb_vec_init(n);
y = _arb_vec_init(n);
fmpq_poly_randtest(F, state, 1 + n_randint(state, 20), qbits1);
for (i = 0; i < n; i++)
fmpq_randtest(X + i, state, qbits2);
for (i = 0; i < n; i++)
fmpq_poly_evaluate_fmpq(Y + i, F, X + i);
arb_poly_set_fmpq_poly(f, F, rbits1);
for (i = 0; i < n; i++)
arb_set_fmpq(x + i, X + i, rbits2);
arb_poly_evaluate_vec_fast(y, f, x, n, rbits3);
for (i = 0; i < n; i++)
{
if (!arb_contains_fmpq(y + i, Y + i))
{
flint_printf("FAIL (%wd of %wd)\n\n", i, n);
flint_printf("F = "); fmpq_poly_print(F); flint_printf("\n\n");
flint_printf("X = "); fmpq_print(X + i); flint_printf("\n\n");
flint_printf("Y = "); fmpq_print(Y + i); flint_printf("\n\n");
flint_printf("f = "); arb_poly_printd(f, 15); flint_printf("\n\n");
flint_printf("x = "); arb_printd(x + i, 15); flint_printf("\n\n");
flint_printf("y = "); arb_printd(y + i, 15); flint_printf("\n\n");
abort();
}
}
fmpq_poly_clear(F);
_fmpq_vec_clear(X, n);
_fmpq_vec_clear(Y, n);
arb_poly_clear(f);
_arb_vec_clear(x, n);
_arb_vec_clear(y, n);
}
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()
{
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()
{
slong iter;
flint_rand_t state;
flint_printf("evaluate_horner....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
slong qbits1, qbits2, rbits1, rbits2, rbits3;
fmpq_poly_t F;
fmpq_t X, Y;
arb_poly_t f;
arb_t x, y;
qbits1 = 2 + n_randint(state, 200);
qbits2 = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
fmpq_poly_init(F);
fmpq_init(X);
fmpq_init(Y);
arb_poly_init(f);
arb_init(x);
arb_init(y);
fmpq_poly_randtest(F, state, 1 + n_randint(state, 20), qbits1);
fmpq_randtest(X, state, qbits2);
fmpq_poly_evaluate_fmpq(Y, F, X);
arb_poly_set_fmpq_poly(f, F, rbits1);
arb_set_fmpq(x, X, rbits2);
arb_poly_evaluate_horner(y, f, x, rbits3);
if (!arb_contains_fmpq(y, Y))
{
flint_printf("FAIL\n\n");
flint_printf("F = "); fmpq_poly_print(F); flint_printf("\n\n");
flint_printf("X = "); fmpq_print(X); flint_printf("\n\n");
flint_printf("Y = "); fmpq_print(Y); flint_printf("\n\n");
flint_printf("f = "); arb_poly_printd(f, 15); flint_printf("\n\n");
flint_printf("x = "); arb_printd(x, 15); flint_printf("\n\n");
flint_printf("y = "); arb_printd(y, 15); flint_printf("\n\n");
abort();
}
/* aliasing */
arb_poly_evaluate_horner(x, f, x, rbits3);
if (!arb_contains_fmpq(x, Y))
{
flint_printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(F);
fmpq_clear(X);
fmpq_clear(Y);
arb_poly_clear(f);
arb_clear(x);
arb_clear(y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("mul_more....");
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);
}
flint_randclear(state);
flint_cleanup();
flint_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(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("resultant_div....");
fflush(stdout);
for (i = 0; i < 50; i++)
{
fmpq_poly_t f, g, h, p;
fmpq_t x, y, z, zz;
fmpz_t den;
slong nbits;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(p);
fmpq_poly_init(h);
fmpq_init(x);
fmpq_init(y);
fmpq_init(z);
fmpq_init(zz);
fmpz_init(den);
fmpq_poly_randtest(f, state, n_randint(state, 50), 100);
fmpq_poly_randtest(g, state, n_randint(state, 50), 100);
fmpq_poly_randtest(h, state, n_randint(state, 50), 100);
fmpz_set(den, fmpq_poly_denref(f));
fmpq_poly_scalar_mul_fmpz(f, f, den);
fmpz_set(den, fmpq_poly_denref(g));
fmpq_poly_scalar_mul_fmpz(g, g, den);
fmpz_set(den, fmpq_poly_denref(h));
fmpq_poly_scalar_mul_fmpz(h, h, den);
fmpq_poly_mul(p, f, g);
fmpq_poly_resultant(x, f, h);
if (!fmpz_is_one(fmpq_denref(x)))
{
flint_printf("FAIL resultant not integral\n");
flint_printf("f = "), fmpq_poly_print(f), flint_printf("\n\n");
flint_printf("g = "), fmpq_poly_print(g), flint_printf("\n\n");
flint_printf("y = "), fmpq_print(y), flint_printf("\n\n");
abort();
}
fmpq_poly_resultant(y, g, h);
if (!fmpz_is_one(fmpq_denref(y)))
{
flint_printf("FAIL resultant not integral\n");
flint_printf("h = "), fmpq_poly_print(f), flint_printf("\n\n");
flint_printf("g = "), fmpq_poly_print(g), flint_printf("\n\n");
flint_printf("z = "), fmpq_print(y), flint_printf("\n\n");
abort();
}
fmpq_poly_resultant(z, p, h);
if (!fmpz_is_one(fmpq_denref(z)))
{
flint_printf("FAIL resultant not integral\n");
flint_printf("p = "), fmpq_poly_print(f), flint_printf("\n\n");
flint_printf("g = "), fmpq_poly_print(g), flint_printf("\n\n");
flint_printf("y = "), fmpq_print(y), flint_printf("\n\n");
abort();
}
if (fmpq_is_zero(z))
{
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
fmpq_poly_clear(p);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
fmpq_clear(zz);
fmpz_clear(den);
continue;
}
nbits = (slong)fmpz_bits(fmpq_numref(y)) + 1;
fmpq_poly_resultant_div(z, p, h, fmpq_numref(x), nbits);
fmpq_poly_resultant(zz, p, h);
result = fmpq_equal(z, y);
if (!result)
{
flint_printf("FAIL (res(p, g)/div == res(p, g)/div:\n");
flint_printf("p = "), fmpq_poly_print_pretty(p, "x"), flint_printf("\n\n");
flint_printf("h = "), fmpq_poly_print_pretty(h, "x"), flint_printf("\n\n");
flint_printf("res(p, h) = "), fmpq_print(zz), flint_printf("\n\n");
flint_printf("res(p, h) = "), fmpq_print(x), flint_printf(" * "), fmpq_print(y), flint_printf("\n\n");
flint_printf("supplied divisor = "), fmpq_print(x), flint_printf("\n\n");
flint_printf("nbits = %wu\n\n", nbits);
flint_printf("divisor found = "), fmpq_print(z), flint_printf("\n\n");
flint_printf("correct result = "), fmpq_print(y), flint_printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
fmpq_poly_clear(p);
fmpq_clear(x);
fmpq_clear(y);
fmpq_clear(z);
fmpq_clear(zz);
fmpz_clear(den);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("pow_fmpq....");
fflush(stdout);
flint_randinit(state);
/* check large arguments */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
arb_t a, b, c, d;
fmpq_t e1, e2, e3;
slong prec1, prec2;
prec1 = 2 + n_randint(state, 1000);
prec2 = prec1 + 30;
arb_init(a);
arb_init(b);
arb_init(c);
arb_init(d);
fmpq_init(e1);
fmpq_init(e2);
fmpq_init(e3);
arb_randtest_precise(a, state, 1 + n_randint(state, 1000), 200);
arb_randtest_precise(b, state, 1 + n_randint(state, 1000), 200);
fmpq_randtest(e1, state, 200);
fmpq_randtest(e2, state, 200);
arb_pow_fmpq(b, a, e1, prec1);
arb_pow_fmpq(c, a, e1, 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_printf("e1 = "); fmpq_print(e1); flint_printf("\n\n");
abort();
}
/* check a^(e1+e2) = a^e1*a^e2 */
arb_pow_fmpq(c, a, e2, prec1);
arb_mul(d, b, c, prec1);
fmpq_add(e3, e1, e2);
arb_pow_fmpq(c, a, e3, 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_printf("e1 = "); fmpq_print(e1); flint_printf("\n\n");
flint_printf("e2 = "); fmpq_print(e2); flint_printf("\n\n");
abort();
}
arb_clear(a);
arb_clear(b);
arb_clear(c);
arb_clear(d);
fmpq_clear(e1);
fmpq_clear(e2);
fmpq_clear(e3);
}
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;
}
