void
_arb_poly_compose(arb_ptr res,
arb_srcptr poly1, slong len1,
arb_srcptr poly2, slong len2, slong prec)
{
if (len1 == 1)
{
arb_set_round(res, poly1, prec);
}
else if (len2 == 1)
{
_arb_poly_evaluate(res, poly1, len1, poly2, prec);
}
else if (_arb_vec_is_zero(poly2 + 1, len2 - 2))
{
_arb_poly_compose_axnc(res, poly1, len1, poly2, poly2 + len2 - 1, len2 - 1, prec);
}
else if (len1 <= 7)
{
_arb_poly_compose_horner(res, poly1, len1, poly2, len2, prec);
}
else
{
_arb_poly_compose_divconquer(res, poly1, len1, poly2, len2, prec);
}
}
void
_arb_poly_evaluate_vec_iter(arb_ptr ys, arb_srcptr poly, long plen,
arb_srcptr xs, long n, long prec)
{
long i;
for (i = 0; i < n; i++)
_arb_poly_evaluate(ys + i, poly, plen, xs + i, prec);
}
int main()
{
slong iter;
flint_rand_t state;
flint_printf("rising2_ui....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000; iter++)
{
arb_t a, u, v, u2, v2;
fmpz *f;
arb_ptr g;
ulong n;
slong i, prec;
arb_init(a);
arb_init(u);
arb_init(v);
arb_init(u2);
arb_init(v2);
arb_randtest(a, state, 1 + n_randint(state, 4000), 10);
arb_randtest(u, state, 1 + n_randint(state, 4000), 10);
arb_randtest(v, state, 1 + n_randint(state, 4000), 10);
n = n_randint(state, 120);
f = _fmpz_vec_init(n + 1);
g = _arb_vec_init(n + 1);
prec = 2 + n_randint(state, 4000);
arb_rising2_ui(u, v, a, n, prec);
arith_stirling_number_1u_vec(f, n, n + 1);
for (i = 0; i <= n; i++)
arb_set_fmpz(g + i, f + i);
_arb_poly_evaluate(u2, g, n + 1, a, prec);
_arb_poly_derivative(g, g, n + 1, prec);
_arb_poly_evaluate(v2, g, n, a, prec);
if (!arb_overlaps(u, u2) || !arb_overlaps(v, v2))
{
flint_printf("FAIL: overlap\n\n");
flint_printf("n = %wu\n", n);
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("u = "); arb_printd(u, 15); flint_printf("\n\n");
flint_printf("u2 = "); arb_printd(u2, 15); flint_printf("\n\n");
flint_printf("v = "); arb_printd(v, 15); flint_printf("\n\n");
flint_printf("v2 = "); arb_printd(v2, 15); flint_printf("\n\n");
abort();
}
arb_set(u2, a);
arb_rising2_ui(u2, v, u2, n, prec);
if (!arb_equal(u2, u))
{
flint_printf("FAIL: aliasing 1\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("u = "); arb_printd(u, 15); flint_printf("\n\n");
flint_printf("u2 = "); arb_printd(u2, 15); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
abort();
}
arb_set(v2, a);
arb_rising2_ui(u, v2, v2, n, prec);
if (!arb_equal(v2, v))
{
flint_printf("FAIL: aliasing 2\n\n");
flint_printf("a = "); arb_printd(a, 15); flint_printf("\n\n");
flint_printf("v = "); arb_printd(v, 15); flint_printf("\n\n");
flint_printf("v2 = "); arb_printd(v2, 15); flint_printf("\n\n");
flint_printf("n = %wu\n", n);
abort();
}
arb_clear(a);
arb_clear(u);
arb_clear(v);
arb_clear(u2);
arb_clear(v2);
_fmpz_vec_clear(f, n + 1);
_arb_vec_clear(g, n + 1);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
void
_arb_poly_evaluate_vec_fast_precomp(arb_ptr vs, arb_srcptr poly,
long plen, arb_ptr * tree, long len, long prec)
{
long height, i, j, pow, left;
long tree_height;
long tlen;
arb_ptr t, u, swap, pa, pb, pc;
/* avoid worrying about some degenerate cases */
if (len < 2 || plen < 2)
{
if (len == 1)
{
arb_t tmp;
arb_init(tmp);
arb_neg(tmp, tree[0] + 0);
_arb_poly_evaluate(vs + 0, poly, plen, tmp, prec);
arb_clear(tmp);
}
else if (len != 0 && plen == 0)
{
_arb_vec_zero(vs, len);
}
else if (len != 0 && plen == 1)
{
for (i = 0; i < len; i++)
arb_set(vs + i, poly + 0);
}
return;
}
t = _arb_vec_init(len);
u = _arb_vec_init(len);
left = len;
/* Initial reduction. We allow the polynomial to be larger
or smaller than the number of points. */
height = FLINT_BIT_COUNT(plen - 1) - 1;
tree_height = FLINT_CLOG2(len);
while (height >= tree_height)
height--;
pow = 1L << height;
for (i = j = 0; i < len; i += pow, j += (pow + 1))
{
tlen = ((i + pow) <= len) ? pow : len % pow;
_arb_poly_rem(t + i, poly, plen, tree[height] + j, tlen + 1, prec);
}
for (i = height - 1; i >= 0; i--)
{
pow = 1L << i;
left = len;
pa = tree[i];
pb = t;
pc = u;
while (left >= 2 * pow)
{
_arb_poly_rem_2(pc, pb, 2 * pow, pa, pow + 1, prec);
_arb_poly_rem_2(pc + pow, pb, 2 * pow, pa + pow + 1, pow + 1, prec);
pa += 2 * pow + 2;
pb += 2 * pow;
pc += 2 * pow;
left -= 2 * pow;
}
if (left > pow)
{
_arb_poly_rem(pc, pb, left, pa, pow + 1, prec);
_arb_poly_rem(pc + pow, pb, left, pa + pow + 1, left - pow + 1, prec);
}
else if (left > 0)
_arb_vec_set(pc, pb, left);
swap = t;
t = u;
u = swap;
}
_arb_vec_set(vs, t, len);
_arb_vec_clear(t, len);
_arb_vec_clear(u, len);
}
void
arb_poly_evaluate(arb_t res, const arb_poly_t f, const arb_t a, slong prec)
{
_arb_poly_evaluate(res, f->coeffs, f->length, a, prec);
}
