flint-sys 0.9.0

Bindings to the FLINT C library
Documentation
/*
    Copyright (C) 2020 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 "gr_mpoly.h"

FLINT_DLL extern gr_static_method_table _ca_methods;

TEST_FUNCTION_START(gr_mpoly_mul_johnson, state)
{
    slong i, j;

    /* Check f*(g + h) = f*g + f*h */
    for (i = 0; i < 100; i++)
    {
        gr_ctx_t cctx;
        gr_mpoly_ctx_t ctx;
        gr_mpoly_t f, g, h, k1, k2, t;
        slong len, len1, len2;
        flint_bitcnt_t exp_bits, exp_bits1, exp_bits2;
        int status;

        gr_ctx_init_random(cctx, state);
        gr_mpoly_ctx_init_rand(ctx, state, cctx, 4);

        gr_mpoly_init(f, ctx);
        gr_mpoly_init(g, ctx);
        gr_mpoly_init(h, ctx);
        gr_mpoly_init(k1, ctx);
        gr_mpoly_init(k2, ctx);
        gr_mpoly_init(t, ctx);

        if (cctx->methods == _ca_methods)
        {
            len = n_randint(state, 10);
            len1 = n_randint(state, 10);
            len2 = n_randint(state, 10);
        }
        else
        {
            len = n_randint(state, 100);
            len1 = n_randint(state, 100);
            len2 = n_randint(state, 100);
        }

        exp_bits = n_randint(state, 200) + 2;
        exp_bits1 = n_randint(state, 200) + 2;
        exp_bits2 = n_randint(state, 200) + 2;

        /* todo: assert_canonical */

        for (j = 0; j < 10; j++)
        {
            status = GR_SUCCESS;

            status |= gr_mpoly_randtest_bits(f, state, len1, exp_bits1, ctx);
            status |= gr_mpoly_randtest_bits(g, state, len2, exp_bits2, ctx);
            status |= gr_mpoly_randtest_bits(h, state, len, exp_bits, ctx);
            status |= gr_mpoly_randtest_bits(k1, state, len, exp_bits, ctx);
            status |= gr_mpoly_randtest_bits(k2, state, len, exp_bits, ctx);

            status |= gr_mpoly_add(k1, g, h, ctx);

            if (n_randint(state, 2) || (gr_ctx_is_commutative_ring(ctx) != T_TRUE))
                status |= gr_mpoly_mul_johnson(k1, f, k1, ctx);
            else
                status |= gr_mpoly_mul_johnson(k1, k1, f, ctx);

            if (status == GR_SUCCESS)
                gr_mpoly_assert_canonical(k1, ctx);

            status |= gr_mpoly_mul_johnson(k2, f, g, ctx);

            if (status == GR_SUCCESS)
                gr_mpoly_assert_canonical(k2, ctx);

            status |= gr_mpoly_mul_johnson(t, f, h, ctx);

            if (status == GR_SUCCESS)
                gr_mpoly_assert_canonical(t, ctx);

            status |= gr_mpoly_add(k2, k2, t, ctx);

            if (status == GR_SUCCESS && gr_mpoly_equal(k1, k2, ctx) == T_FALSE)
            {
                flint_printf("FAIL: Check (f + g) - g = f\n");
                flint_printf("i = %wd, j = %wd\n", i ,j);
                gr_ctx_println(ctx);
                flint_printf("f = "); gr_mpoly_print_pretty(f, ctx); flint_printf("\n");
                flint_printf("g = "); gr_mpoly_print_pretty(g, ctx); flint_printf("\n");
                flint_printf("h = "); gr_mpoly_print_pretty(h, ctx); flint_printf("\n");
                flint_printf("f * (g + h) = "); gr_mpoly_print_pretty(k1, ctx); flint_printf("\n");
                flint_printf("f * g + f * h = "); gr_mpoly_print_pretty(k2, ctx); flint_printf("\n");
                fflush(stdout);
                flint_abort();
            }
        }

        gr_mpoly_clear(f, ctx);
        gr_mpoly_clear(g, ctx);
        gr_mpoly_clear(h, ctx);
        gr_mpoly_clear(k1, ctx);
        gr_mpoly_clear(k2, ctx);
        gr_mpoly_clear(t, ctx);

        gr_mpoly_ctx_clear(ctx);
        gr_ctx_clear(cctx);
    }

    TEST_FUNCTION_END(state);
}