/*============================================================================= This file is part of FLINT. FLINT 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. FLINT 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 FLINT; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA =============================================================================*/ /****************************************************************************** Copyright (C) 2009 William Hart Copyright (C) 2010 Sebastian Pancratz Copyright (C) 2011 Fredrik Johansson ******************************************************************************/ #include #include #include #include "nmod_vec.h" #include "nmod_poly.h" #include "ulong_extras.h" int main(void) { int i, result; FLINT_TEST_INIT(state); flint_printf("compose_series_brent_kung...."); fflush(stdout); /* Check aliasing of the first argument */ for (i = 0; i < 10 * flint_test_multiplier(); i++) { nmod_poly_t f, g, h; mp_limb_t m; slong n; m = n_randtest_prime(state, 0); nmod_poly_init(f, m); nmod_poly_init(g, m); nmod_poly_init(h, m); nmod_poly_randtest(g, state, n_randint(state, 40)); nmod_poly_randtest(h, state, n_randint(state, 20)); nmod_poly_set_coeff_ui(h, 0, 0); n = n_randint(state, 20); nmod_poly_compose_series_brent_kung(f, g, h, n); nmod_poly_compose_series_brent_kung(g, g, h, n); result = (nmod_poly_equal(f, g)); if (!result) { flint_printf("FAIL (aliasing 1):\n"); nmod_poly_print(f), flint_printf("\n\n"); nmod_poly_print(g), flint_printf("\n\n"); abort(); } nmod_poly_clear(f); nmod_poly_clear(g); nmod_poly_clear(h); } /* Check aliasing of the second argument */ for (i = 0; i < 10 * flint_test_multiplier(); i++) { nmod_poly_t f, g, h; mp_limb_t m; slong n; m = n_randtest_prime(state, 0); nmod_poly_init(f, m); nmod_poly_init(g, m); nmod_poly_init(h, m); nmod_poly_randtest(g, state, n_randint(state, 40)); nmod_poly_randtest(h, state, n_randint(state, 20)); nmod_poly_set_coeff_ui(h, 0, 0); n = n_randint(state, 20); nmod_poly_compose_series_brent_kung(f, g, h, n); nmod_poly_compose_series_brent_kung(h, g, h, n); result = (nmod_poly_equal(f, h)); if (!result) { flint_printf("FAIL (aliasing 2):\n"); nmod_poly_print(f), flint_printf("\n\n"); nmod_poly_print(h), flint_printf("\n\n"); abort(); } nmod_poly_clear(f); nmod_poly_clear(g); nmod_poly_clear(h); } /* Compare with compose */ for (i = 0; i < 10 * flint_test_multiplier(); i++) { nmod_poly_t f, g, h, s, t; mp_limb_t m; slong n; m = n_randtest_prime(state, 0); nmod_poly_init(f, m); nmod_poly_init(g, m); nmod_poly_init(h, m); nmod_poly_init(s, m); nmod_poly_init(t, m); nmod_poly_randtest(g, state, n_randint(state, 40)); nmod_poly_randtest(h, state, n_randint(state, 20)); nmod_poly_set_coeff_ui(h, 0, 0); n = n_randint(state, 20); nmod_poly_compose(s, g, h); nmod_poly_truncate(s, n); nmod_poly_compose_series_brent_kung(f, g, h, n); result = (nmod_poly_equal(f, s)); if (!result) { flint_printf("FAIL (comparison):\n"); flint_printf("n = %wd\n", n); flint_printf("g = "), nmod_poly_print(g), flint_printf("\n\n"); flint_printf("h = "), nmod_poly_print(h), flint_printf("\n\n"); flint_printf("f = "), nmod_poly_print(f), flint_printf("\n\n"); flint_printf("s = "), nmod_poly_print(s), flint_printf("\n\n"); abort(); } nmod_poly_clear(f); nmod_poly_clear(g); nmod_poly_clear(h); nmod_poly_clear(s); nmod_poly_clear(t); } FLINT_TEST_CLEANUP(state); flint_printf("PASS\n"); return 0; }