mirror of
https://github.com/vale981/arb
synced 2025-03-06 09:51:39 -05:00
113 lines
3.2 KiB
C
113 lines
3.2 KiB
C
/*=============================================================================
|
|
|
|
This file is part of acb.
|
|
|
|
acb is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
acb is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with acb; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
=============================================================================*/
|
|
/******************************************************************************
|
|
|
|
Copyright (C) 2012 Fredrik Johansson
|
|
|
|
******************************************************************************/
|
|
|
|
#include "acb.h"
|
|
|
|
int main()
|
|
{
|
|
slong iter;
|
|
flint_rand_t state;
|
|
|
|
printf("rising_ui....");
|
|
fflush(stdout);
|
|
|
|
flint_randinit(state);
|
|
|
|
/* check functional equation */
|
|
for (iter = 0; iter < 1000; iter++)
|
|
{
|
|
acb_t x, xn, y, z;
|
|
ulong n, m;
|
|
|
|
acb_init(x);
|
|
acb_init(xn);
|
|
acb_init(y);
|
|
acb_init(z);
|
|
|
|
acb_randtest(x, state, 1 + n_randint(state, 4000), 10);
|
|
n = n_randint(state, 80);
|
|
m = n_randint(state, 40);
|
|
acb_add_ui(xn, x, n, 1 + n_randint(state, 4000));
|
|
|
|
acb_rising_ui(y, x, n, 2 + n_randint(state, 4000));
|
|
acb_rising_ui(z, xn, m, 2 + n_randint(state, 4000));
|
|
acb_mul(y, y, z, 2 + n_randint(state, 4000));
|
|
|
|
acb_rising_ui(z, x, n + m, 2 + n_randint(state, 4000));
|
|
|
|
if (!acb_overlaps(y, z))
|
|
{
|
|
printf("FAIL: overlap\n\n");
|
|
printf("n = %lu\n", n);
|
|
printf("m = %lu\n", m);
|
|
printf("x = "); acb_print(x); printf("\n\n");
|
|
printf("xn = "); acb_print(xn); printf("\n\n");
|
|
printf("y = "); acb_print(y); printf("\n\n");
|
|
printf("z = "); acb_print(z); printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
acb_clear(x);
|
|
acb_clear(xn);
|
|
acb_clear(y);
|
|
acb_clear(z);
|
|
}
|
|
|
|
/* aliasing of y and x */
|
|
for (iter = 0; iter < 1000; iter++)
|
|
{
|
|
acb_t x, y;
|
|
ulong n;
|
|
slong prec;
|
|
|
|
acb_init(x);
|
|
acb_init(y);
|
|
|
|
acb_randtest(x, state, 1 + n_randint(state, 200), 10);
|
|
acb_randtest(y, state, 1 + n_randint(state, 200), 10);
|
|
n = n_randint(state, 100);
|
|
|
|
prec = 2 + n_randint(state, 4000);
|
|
acb_rising_ui(y, x, n, prec);
|
|
acb_rising_ui(x, x, n, prec);
|
|
|
|
if (!acb_equal(x, y))
|
|
{
|
|
printf("FAIL: aliasing\n\n");
|
|
printf("x = "); acb_print(x); printf("\n\n");
|
|
printf("y = "); acb_print(y); printf("\n\n");
|
|
printf("n = %lu\n", n);
|
|
abort();
|
|
}
|
|
|
|
acb_clear(x);
|
|
acb_clear(y);
|
|
}
|
|
|
|
flint_randclear(state);
|
|
flint_cleanup();
|
|
printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|