arb/acb/test/t-mul_naive.c
2015-11-05 17:43:36 +00:00

221 lines
6.1 KiB
C

/*=============================================================================
This file is part of ARB.
ARB 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.
ARB 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 ARB; 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("mul_naive....");
fflush(stdout);
flint_randinit(state);
/* test aliasing of c and a */
for (iter = 0; iter < 100000; iter++)
{
acb_t a, b, c;
slong prec;
acb_init(a);
acb_init(b);
acb_init(c);
acb_randtest(a, state, 1 + n_randint(state, 200), 10);
acb_randtest(b, state, 1 + n_randint(state, 200), 10);
acb_randtest(c, state, 1 + n_randint(state, 200), 10);
prec = 2 + n_randint(state, 200);
acb_mul_naive(c, a, b, prec);
acb_mul_naive(a, a, b, prec);
if (!acb_equal(a, c))
{
printf("FAIL: aliasing c, a\n\n");
printf("a = "); acb_print(a); printf("\n\n");
printf("b = "); acb_print(b); printf("\n\n");
printf("c = "); acb_print(c); printf("\n\n");
abort();
}
acb_clear(a);
acb_clear(b);
acb_clear(c);
}
/* test aliasing of c and b */
for (iter = 0; iter < 100000; iter++)
{
acb_t a, b, c;
slong prec;
acb_init(a);
acb_init(b);
acb_init(c);
acb_randtest(a, state, 1 + n_randint(state, 200), 10);
acb_randtest(b, state, 1 + n_randint(state, 200), 10);
acb_randtest(c, state, 1 + n_randint(state, 200), 10);
prec = 2 + n_randint(state, 200);
acb_mul_naive(c, a, b, prec);
acb_mul_naive(b, a, b, prec);
if (!acb_equal(b, c))
{
printf("FAIL: aliasing b, a\n\n");
printf("a = "); acb_print(a); printf("\n\n");
printf("b = "); acb_print(b); printf("\n\n");
printf("c = "); acb_print(c); printf("\n\n");
abort();
}
acb_clear(a);
acb_clear(b);
acb_clear(c);
}
/* test aliasing a, a */
for (iter = 0; iter < 100000; iter++)
{
acb_t a, b, c, d;
slong prec;
acb_init(a);
acb_init(b);
acb_init(c);
acb_init(d);
acb_randtest(a, state, 1 + n_randint(state, 200), 10);
acb_randtest(b, state, 1 + n_randint(state, 200), 10);
acb_randtest(c, state, 1 + n_randint(state, 200), 10);
prec = 2 + n_randint(state, 200);
acb_set(b, a);
acb_mul_naive(c, a, a, prec);
acb_mul_naive(d, a, b, prec);
if (!acb_overlaps(c, d))
{
printf("FAIL: aliasing a, a\n\n");
printf("a = "); acb_print(a); printf("\n\n");
printf("b = "); acb_print(b); printf("\n\n");
printf("c = "); acb_print(c); printf("\n\n");
printf("d = "); acb_print(d); printf("\n\n");
abort();
}
acb_clear(a);
acb_clear(b);
acb_clear(c);
acb_clear(d);
}
/* test aliasing a, a, a */
for (iter = 0; iter < 100000; iter++)
{
acb_t a, b, c;
slong prec;
acb_init(a);
acb_init(b);
acb_init(c);
acb_randtest(a, state, 1 + n_randint(state, 200), 10);
acb_randtest(b, state, 1 + n_randint(state, 200), 10);
acb_randtest(c, state, 1 + n_randint(state, 200), 10);
prec = 2 + n_randint(state, 200);
acb_set(b, a);
acb_mul_naive(c, a, b, prec);
acb_mul_naive(a, a, a, prec);
if (!acb_overlaps(a, c))
{
printf("FAIL: aliasing a, a, a\n\n");
printf("a = "); acb_print(a); printf("\n\n");
printf("b = "); acb_print(b); printf("\n\n");
printf("c = "); acb_print(c); printf("\n\n");
abort();
}
acb_clear(a);
acb_clear(b);
acb_clear(c);
}
/* test a*(b+c) = a*b + a*c */
for (iter = 0; iter < 100000; iter++)
{
acb_t a, b, c, d, e, f;
acb_init(a);
acb_init(b);
acb_init(c);
acb_init(d);
acb_init(e);
acb_init(f);
acb_randtest(a, state, 1 + n_randint(state, 200), 10);
acb_randtest(b, state, 1 + n_randint(state, 200), 10);
acb_randtest(c, state, 1 + n_randint(state, 200), 10);
acb_add(d, b, c, 2 + n_randint(state, 200));
acb_mul_naive(e, a, d, 2 + n_randint(state, 200));
acb_mul_naive(d, a, b, 2 + n_randint(state, 200));
acb_mul_naive(f, a, c, 2 + n_randint(state, 200));
acb_add(f, d, f, 2 + n_randint(state, 200));
if (!acb_overlaps(e, f))
{
printf("FAIL: a*(b+c) = a*b + a*c\n\n");
printf("a = "); acb_print(a); printf("\n\n");
printf("b = "); acb_print(b); printf("\n\n");
printf("c = "); acb_print(c); printf("\n\n");
printf("e = "); acb_print(e); printf("\n\n");
printf("f = "); acb_print(f); printf("\n\n");
abort();
}
acb_clear(a);
acb_clear(b);
acb_clear(c);
acb_clear(d);
acb_clear(e);
acb_clear(f);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}