flint-sys 0.9.0

/*
    Copyright (C) 2019 Daniel Schultz

    This file is part of FLINT.

    FLINT 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 3 of the License, or
    (at your option) any later version.  See <https://www.gnu.org/licenses/>.
*/

#include "test_helpers.h"
#include "nmod_mpoly.h"

TEST_FUNCTION_START(nmod_mpoly_push_term_ui_fmpz, state)
{
  slong i, j, k;

  /* Check pushback matches add */
  for (i = 0; i < 1000 * flint_test_multiplier(); i++) {
    nmod_mpoly_ctx_t ctx;
    nmod_mpoly_t f1, f2, f3, m;
    flint_bitcnt_t exp_bits;
    fmpz **exp, **exp2, *exp3;
    slong len, nvars;
    ulong c, c2;
    ulong modulus;

    modulus = n_randtest_bits(state, n_randint(state, FLINT_BITS) + 1);
    nmod_mpoly_ctx_init_rand(ctx, state, 10, modulus);
    nmod_mpoly_init(f1, ctx);
    nmod_mpoly_init(f2, ctx);
    nmod_mpoly_init(f3, ctx);
    nmod_mpoly_init(m, ctx);

    nvars = nmod_mpoly_ctx_nvars(ctx);

    exp = (fmpz **)flint_malloc(nvars * sizeof(fmpz *));
    exp2 = (fmpz **)flint_malloc(nvars * sizeof(fmpz *));
    exp3 = (fmpz *)flint_malloc(nvars * sizeof(fmpz));
    for (k = 0; k < nvars; k++) {
      exp[k] = (fmpz *)flint_malloc(sizeof(fmpz));
      fmpz_init(exp[k]);
      exp2[k] = (fmpz *)flint_malloc(sizeof(fmpz));
      fmpz_init(exp2[k]);
      fmpz_init(exp3 + k);
    }

    len = n_randint(state, 20);
    exp_bits = n_randint(state, 200);

    nmod_mpoly_zero(f1, ctx);
    nmod_mpoly_zero(f2, ctx);

    for (j = 0; j < len; j++) {
      /* get random term */
      c = n_randlimb(state);
      for (k = 0; k < nvars; k++) {
        fmpz_randtest_unsigned(exp[k], state, exp_bits);
        fmpz_set(exp3 + k, exp[k]);
      }
      /* add it to f1 */
      nmod_mpoly_zero(m, ctx);
      nmod_mpoly_set_coeff_ui_fmpz(m, c, exp, ctx);
      nmod_mpoly_add(f1, f1, m, ctx);
      nmod_mpoly_assert_canonical(f1, ctx);

      /* push it back on f2 and f3*/
      nmod_mpoly_push_term_ui_fmpz(f2, c, exp, ctx);
      nmod_mpoly_push_term_ui_ffmpz(f3, c, exp3, ctx);

      /* make sure last term matches */
      c2 = nmod_mpoly_get_term_coeff_ui(f2, nmod_mpoly_length(f2, ctx) - 1, ctx);
      nmod_mpoly_get_term_exp_fmpz(exp2, f2, nmod_mpoly_length(f2, ctx) - 1, ctx);
      if ((c % modulus) != c2) {
        printf("FAIL\n");
        flint_printf("Check pushed coefficient matches\ni=%wd, j=%wd\n", i, j);
        fflush(stdout);
        flint_abort();
      }
      for (k = 0; k < nvars; k++) {
        if (!fmpz_equal(exp[k], exp2[k])) {
          printf("FAIL\n");
          flint_printf("Check pushed exponent matches\ni=%wd, j=%wd\n", i, j);
          fflush(stdout);
          flint_abort();
        }
      }
    }

    nmod_mpoly_sort_terms(f2, ctx);
    nmod_mpoly_combine_like_terms(f2, ctx);
    nmod_mpoly_assert_canonical(f2, ctx);

    nmod_mpoly_sort_terms(f3, ctx);
    nmod_mpoly_combine_like_terms(f3, ctx);
    nmod_mpoly_assert_canonical(f3, ctx);

    if (!nmod_mpoly_equal(f1, f2, ctx)) {
      printf("FAIL\n");
      flint_printf("Check pushed polynomial matches add\ni=%wd\n", i, j);
      fflush(stdout);
      flint_abort();
    }

    if (!nmod_mpoly_equal(f1, f3, ctx)) {
      printf("FAIL\n");
      flint_printf("Check pushed ffmpz polynomial matches add\ni=%wd\n", i, j);
      fflush(stdout);
      flint_abort();
    }

    nmod_mpoly_clear(f1, ctx);
    nmod_mpoly_clear(f2, ctx);
    nmod_mpoly_clear(f3, ctx);
    nmod_mpoly_clear(m, ctx);
    nmod_mpoly_ctx_clear(ctx);

    for (k = 0; k < nvars; k++) {
      fmpz_clear(exp2[k]);
      flint_free(exp2[k]);
      fmpz_clear(exp[k]);
      flint_free(exp[k]);
      fmpz_clear(exp3 + k);
    }
    flint_free(exp3);
    flint_free(exp2);
    flint_free(exp);
  }

  TEST_FUNCTION_END(state);
}