84 lines
2.1 KiB
C
84 lines
2.1 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("submul... ");
|
|
fflush(stdout);
|
|
|
|
|
|
|
|
/* 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(a, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
|
fmpz_poly_q_randtest(b, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
|
fmpz_poly_q_set(c, a);
|
|
|
|
fmpz_poly_q_submul(c, a, b);
|
|
fmpz_poly_q_submul(a, a, b);
|
|
|
|
result = fmpz_poly_q_equal(a, c) && fmpz_poly_q_is_canonical(a);
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
fmpz_poly_q_print(a), flint_printf("\n\n");
|
|
fmpz_poly_q_print(b), 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 aliasing of b 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(a, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
|
fmpz_poly_q_randtest(b, state, n_randint(state, 50), 50, n_randint(state, 50), 50);
|
|
fmpz_poly_q_set(c, b);
|
|
|
|
fmpz_poly_q_submul(c, a, b);
|
|
fmpz_poly_q_submul(b, a, b);
|
|
|
|
result = fmpz_poly_q_equal(b, c);
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
fmpz_poly_q_print(a), flint_printf("\n\n");
|
|
fmpz_poly_q_print(b), 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);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return EXIT_SUCCESS;
|
|
}
|