/*============================================================================= This file is part of Antic. Antic is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License (LGPL) as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. See . =============================================================================*/ /****************************************************************************** Copyright (C) 2013 William Hart 2020 Julian RĂ¼th ******************************************************************************/ #include #include "nf.h" #include "nf_elem.h" int main(void) { int i, result; flint_rand_t state; flint_printf("add/sub...."); fflush(stdout); flint_randinit(state); /* test b + c - c = b */ for (i = 0; i < 100 * antic_test_multiplier(); i++) { nf_t nf; nf_elem_t a, b, c, t; nf_init_randtest(nf, state, 40, 200); nf_elem_init(a, nf); nf_elem_init(b, nf); nf_elem_init(c, nf); nf_elem_init(t, nf); nf_elem_randtest(b, state, 200, nf); nf_elem_randtest(c, state, 200, nf); nf_elem_add(t, b, c, nf); nf_elem_sub(a, t, c, nf); result = (nf_elem_equal(a, b, nf)); if (!result) { printf("FAIL:\n"); printf("a = "); nf_elem_print_pretty(a, nf, "x"); printf("\n"); printf("b = "); nf_elem_print_pretty(b, nf, "x"); printf("\n"); printf("c = "); nf_elem_print_pretty(c, nf, "x"); printf("\n"); abort(); } nf_elem_clear(a, nf); nf_elem_clear(b, nf); nf_elem_clear(c, nf); nf_elem_clear(t, nf); nf_clear(nf); } /* test b + c - c = b : exercise common denominator path */ for (i = 0; i < 100 * antic_test_multiplier(); i++) { nf_t nf; nf_elem_t a, b, c, t; nf_init_randtest(nf, state, 3, 200); nf_elem_init(a, nf); nf_elem_init(b, nf); nf_elem_init(c, nf); nf_elem_init(t, nf); nf_elem_randtest(b, state, 200, nf); nf_elem_randtest(c, state, 200, nf); if (nf->flag & NF_QUADRATIC && n_randint(state, 2)) fmpz_set(QNF_ELEM(c)->den, QNF_ELEM(b)->den); nf_elem_add(t, b, c, nf); nf_elem_sub(a, t, c, nf); result = (nf_elem_equal(a, b, nf)); if (!result) { printf("FAIL:\n"); printf("a = "); nf_elem_print_pretty(a, nf, "x"); printf("\n"); printf("b = "); nf_elem_print_pretty(b, nf, "x"); printf("\n"); printf("c = "); nf_elem_print_pretty(c, nf, "x"); printf("\n"); abort(); } nf_elem_clear(a, nf); nf_elem_clear(b, nf); nf_elem_clear(c, nf); nf_elem_clear(t, nf); nf_clear(nf); } /* test aliasing a and b */ for (i = 0; i < 100 * antic_test_multiplier(); i++) { nf_t nf; nf_elem_t a, b, c; nf_init_randtest(nf, state, 40, 200); nf_elem_init(a, nf); nf_elem_init(b, nf); nf_elem_init(c, nf); nf_elem_randtest(b, state, 200, nf); nf_elem_randtest(c, state, 200, nf); nf_elem_set(a, b, nf); nf_elem_add(b, b, c, nf); nf_elem_sub(b, b, c, nf); result = (nf_elem_equal(a, b, nf)); if (!result) { printf("FAIL:\n"); printf("a = "); nf_elem_print_pretty(a, nf, "x"); printf("\n"); printf("b = "); nf_elem_print_pretty(b, nf, "x"); printf("\n"); printf("c = "); nf_elem_print_pretty(c, nf, "x"); printf("\n"); abort(); } nf_elem_clear(a, nf); nf_elem_clear(b, nf); nf_elem_clear(c, nf); nf_clear(nf); } /* test aliasing a and c */ for (i = 0; i < 100 * antic_test_multiplier(); i++) { nf_t nf; nf_elem_t a, b, c; nf_init_randtest(nf, state, 40, 200); nf_elem_init(a, nf); nf_elem_init(b, nf); nf_elem_init(c, nf); nf_elem_randtest(b, state, 200, nf); nf_elem_randtest(c, state, 200, nf); nf_elem_set(a, c, nf); nf_elem_add(c, b, c, nf); nf_elem_sub(a, c, a, nf); result = (nf_elem_equal(a, b, nf)); if (!result) { printf("FAIL:\n"); printf("a = "); nf_elem_print_pretty(a, nf, "x"); printf("\n"); printf("b = "); nf_elem_print_pretty(b, nf, "x"); printf("\n"); printf("c = "); nf_elem_print_pretty(c, nf, "x"); printf("\n"); abort(); } nf_elem_clear(a, nf); nf_elem_clear(b, nf); nf_elem_clear(c, nf); nf_clear(nf); } flint_randclear(state); flint_cleanup(); flint_printf("PASS\n"); return 0; }