flint3-sys 3.2.3

Rust bindings to the FLINT C library
/*
    Copyright (C) 2023 Jean Kieffer

    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 "acb_mat.h"
#include "acb_theta.h"

TEST_FUNCTION_START(acb_theta_jet_naive_all, state)
{
    slong iter;

    /* Test: values match acb_modular_theta_jet on diagonal matrices */
    for (iter = 0; iter < 10 * flint_test_multiplier(); iter++)
    {
        slong g = 2 + n_randint(state, 2);
        slong mprec = ACB_THETA_LOW_PREC + n_randint(state, 100);
        slong prec = mprec + 50;
        slong bits = n_randint(state, 4);
        slong ord = n_randint(state, 3);
        slong n2 = 1 << (2 * g);
        slong nb = acb_theta_jet_nb(ord, g);
        acb_mat_t tau, tau11;
        acb_ptr z, dth, dth_g1, test;
        acb_t prod, t;
        slong * tups;
        slong k, j, l, ab;

        acb_mat_init(tau, g, g);
        acb_mat_init(tau11, 1, 1);
        z = _acb_vec_init(g);
        dth = _acb_vec_init(nb * n2);
        dth_g1 = _acb_vec_init((ord + 1) * g * 4);
        test = _acb_vec_init(nb * n2);
        acb_init(prod);
        acb_init(t);
        tups = flint_malloc(nb * g * sizeof(slong));

        for (k = 0; k < g; k++)
        {
            acb_siegel_randtest_reduced(tau11, state, prec, bits);
            acb_set(acb_mat_entry(tau, k, k), acb_mat_entry(tau11, 0, 0));
        }
        acb_siegel_randtest_vec(z, state, g, prec);

        acb_theta_jet_naive_all(dth, z, tau, ord, mprec);
        for (k = 0; k < g; k++)
        {
            acb_set(acb_mat_entry(tau11, 0, 0), acb_mat_entry(tau, k, k));
            acb_theta_jet_naive_all(dth_g1 + k * (ord + 1) * 4, &z[k], tau11, ord, prec);
        }

        /* Make test vector using products of derivatives wrt each variable */
        acb_theta_jet_tuples(tups, ord, g);
        for (j = 0; j < nb; j++)
        {
            for (k = 0; k < n2; k++)
            {
                acb_one(prod);
                for (l = 0; l < g; l++)
                {
                    ab = 2 * ((k >> (2 * g - l - 1)) % 2) + ((k >> (g - l - 1)) % 2);
                    acb_mul(prod, prod,
                        &dth_g1[l * (ord + 1) * 4 + ab * (ord + 1) + tups[j * g + l]], prec);
                }
                acb_set(&test[k * nb + j], prod);
            }
        }

        if (!_acb_vec_overlaps(dth, test, n2 * nb))
        {
            flint_printf("FAIL (overlap)\n");
            flint_printf("g = %wd, prec = %wd, ord = %wd\n", g, prec, ord);
            acb_mat_printd(tau, 5);
            _acb_vec_printd(z, g, 5);
            flint_printf("jet_naive_all:\n");
            _acb_vec_printd(dth, nb * n2, 5);
            flint_printf("test:\n");
            _acb_vec_printd(test, nb * n2, 5);
            flint_abort();
        }

        acb_mat_clear(tau);
        acb_mat_clear(tau11);
        _acb_vec_clear(z, g);
        _acb_vec_clear(dth, nb * n2);
        _acb_vec_clear(dth_g1, (ord + 1) * g * 4);
        _acb_vec_clear(test, nb * n2);
        acb_clear(prod);
        acb_clear(t);
        flint_free(tups);
    }

    TEST_FUNCTION_END(state);
}