117 lines
3.0 KiB
C
117 lines
3.0 KiB
C
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
|
||
|
|
#include "fmpz_poly_q.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
main(void)
|
||
|
|
{
|
||
|
|
int i, result;
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
|
||
|
|
flint_printf("mul... ");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/* Check aliasing of a and b */
|
||
|
|
for (i = 0; i < 100; i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_q_t a, b, c;
|
||
|
|
|
||
|
|
fmpz_poly_q_init(a);
|
||
|
|
fmpz_poly_q_init(b);
|
||
|
|
fmpz_poly_q_init(c);
|
||
|
|
fmpz_poly_q_randtest(b, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
fmpz_poly_q_randtest(c, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
|
||
|
|
fmpz_poly_q_mul(a, b, c);
|
||
|
|
fmpz_poly_q_mul(b, b, c);
|
||
|
|
|
||
|
|
result = fmpz_poly_q_equal(a, b);
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL:\n");
|
||
|
|
fmpz_poly_q_print(a), flint_printf("\n\n");
|
||
|
|
fmpz_poly_q_print(b), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_poly_q_clear(a);
|
||
|
|
fmpz_poly_q_clear(b);
|
||
|
|
fmpz_poly_q_clear(c);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check aliasing of a and c */
|
||
|
|
for (i = 0; i < 100; i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_q_t a, b, c;
|
||
|
|
|
||
|
|
fmpz_poly_q_init(a);
|
||
|
|
fmpz_poly_q_init(b);
|
||
|
|
fmpz_poly_q_init(c);
|
||
|
|
fmpz_poly_q_randtest(b, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
fmpz_poly_q_randtest(c, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
|
||
|
|
fmpz_poly_q_mul(a, b, c);
|
||
|
|
fmpz_poly_q_mul(c, b, c);
|
||
|
|
|
||
|
|
result = (fmpz_poly_q_equal(a, c));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL:\n");
|
||
|
|
fmpz_poly_q_print(a), flint_printf("\n\n");
|
||
|
|
fmpz_poly_q_print(c), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_poly_q_clear(a);
|
||
|
|
fmpz_poly_q_clear(b);
|
||
|
|
fmpz_poly_q_clear(c);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check (b*c)+(b*d) = b*(c+d) */
|
||
|
|
for (i = 0; i < 100; i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_q_t a1, a2, b, c, d;
|
||
|
|
|
||
|
|
fmpz_poly_q_init(a1);
|
||
|
|
fmpz_poly_q_init(a2);
|
||
|
|
fmpz_poly_q_init(b);
|
||
|
|
fmpz_poly_q_init(c);
|
||
|
|
fmpz_poly_q_init(d);
|
||
|
|
fmpz_poly_q_randtest(b, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
fmpz_poly_q_randtest(c, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
fmpz_poly_q_randtest(d, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
||
|
|
|
||
|
|
fmpz_poly_q_mul(a1, b, c);
|
||
|
|
fmpz_poly_q_mul(a2, b, d);
|
||
|
|
fmpz_poly_q_add(a1, a1, a2);
|
||
|
|
|
||
|
|
fmpz_poly_q_add(c, c, d);
|
||
|
|
fmpz_poly_q_mul(a2, b, c);
|
||
|
|
|
||
|
|
result = fmpz_poly_q_equal(a1, a2) && fmpz_poly_q_is_canonical(a1);
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL:\n");
|
||
|
|
fmpz_poly_q_print(a1), flint_printf("\n\n");
|
||
|
|
fmpz_poly_q_print(a2), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_poly_q_clear(a1);
|
||
|
|
fmpz_poly_q_clear(a2);
|
||
|
|
fmpz_poly_q_clear(b);
|
||
|
|
fmpz_poly_q_clear(c);
|
||
|
|
fmpz_poly_q_clear(d);
|
||
|
|
}
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return EXIT_SUCCESS;
|
||
|
|
}
|