flint-sys 0.9.0

Bindings to the FLINT C library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95

/*
    Copyright (C) 2025 Fredrik Johansson

    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 "ulong_extras.h"
#include "nmod_poly.h"

TEST_FUNCTION_START(nmod_poly_mullow_fft_small_repack, state)
{
    slong an, bn, zn, znlo;
    nn_ptr a, b, z, w;
    nmod_t mod;

    slong i, j;

    for (i = 0; i < 1000 * flint_test_multiplier(); i++)
    {
        nmod_init(&mod, n_randtest_not_zero(state));

        if (n_randint(state, 2))
        {
            an = 1 + n_randtest(state) % 10000;
            bn = 1 + n_randtest(state) % 10000;
            zn = 1 + n_randtest(state) % 10000;
        }
        else
        {
            an = 1 + n_randtest(state) % 1000;
            bn = 1 + n_randtest(state) % 1000;
            zn = 1 + n_randtest(state) % 1000;
        }

        zn = FLINT_MIN(zn, an + bn - 1);
        znlo = n_randint(state, zn);

        a = flint_malloc(sizeof(ulong) * an);
        b = flint_malloc(sizeof(ulong) * bn);
        z = flint_malloc(sizeof(ulong) * (zn + 1));
        w = flint_malloc(sizeof(ulong) * zn);

        _nmod_vec_randtest(a, state, an, mod);
        _nmod_vec_randtest(b, state, bn, mod);
        _nmod_vec_randtest(z, state, zn, mod);

        if (n_randint(state, 2))
        {
            for (j = 0; j < an; j++) a[j] = n_randint(state, mod.n);
            for (j = 0; j < bn; j++) b[j] = n_randint(state, mod.n);
        }

        /* Additional check that the unpacking doesn't write one
           coefficient too much */
        z[zn] = 31337;
        if (znlo != 0)
            z[znlo - 1] = 31337;

        if (_nmod_poly_mulmid_fft_small_repack(z + znlo, a, an, b, bn, znlo, zn, mod))
        {
            if (z[zn] != 31337)
                flint_abort();
            if (znlo != 0 && z[znlo - 1] != 31337)
                flint_abort();

            if (an >= bn)
                _nmod_poly_mullow_KS(w, a, an, b, bn, zn, mod);
            else
                _nmod_poly_mullow_KS(w, b, bn, a, an, zn, mod);

            if (!_nmod_vec_equal(z + znlo, w + znlo, zn - znlo))
            {
                flint_printf("znlo = %wd, zn = %wd\n", znlo, zn);
                flint_printf("a = %{ulong*}\n\n", a, an);
                flint_printf("b = %{ulong*}\n\n", b, bn);
                flint_printf("z = %{ulong*}\n\n", z, zn);
                flint_printf("w = %{ulong*}\n\n", w, zn);
                flint_abort();
            }
        }

        flint_free(a);
        flint_free(b);
        flint_free(z);
        flint_free(w);
    }

    TEST_FUNCTION_END(state);
}