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
96
97
98
99
100
101
102
103
104
105

/*
    Copyright (C) 2009 William Hart
    Copyright (C) 2010, 2011 Sebastian Pancratz
    Copyright (C) 2012 Lina Kulakova
    Copyright (C) 2013 Mike Hansen
    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 "gr_poly.h"

TEST_FUNCTION_START(gr_poly_mulmod_preinv, state)
{
    slong iter;

    for (iter = 0; iter < 1000; iter++)
    {
        int status;
        gr_ctx_t ctx;
        gr_poly_t a, b, res1, res2, f, finv;

        while (1)
        {
            gr_ctx_init_random(ctx, state);
            if (gr_ctx_is_finite(ctx) == T_TRUE || gr_ctx_has_real_prec(ctx) == T_TRUE)
                break;
            gr_ctx_clear(ctx);
        }

        gr_poly_init(a, ctx);
        gr_poly_init(b, ctx);
        gr_poly_init(res1, ctx);
        gr_poly_init(res2, ctx);
        gr_poly_init(f, ctx);
        gr_poly_init(finv, ctx);

        status = GR_SUCCESS;

        status |= gr_poly_randtest(a, state, 1 + n_randint(state, 20), ctx);
        status |= gr_poly_randtest(b, state, 1 + n_randint(state, 20), ctx);
        status |= gr_poly_randtest(res1, state, 1 + n_randint(state, 20), ctx);
        status |= gr_poly_randtest(res2, state, 1 + n_randint(state, 20), ctx);
        status |= gr_poly_randtest(f, state, 1 + n_randint(state, 20), ctx);
        status |= gr_poly_randtest(finv, state, 1 + n_randint(state, 20), ctx);

        status |= gr_poly_reverse(finv, f, f->length, ctx);
        status |= gr_poly_inv_series(finv, finv, f->length, ctx);

        /* test aliasing */
        switch (n_randint(state, 4))
        {
            case 0:
                status |= gr_poly_set(res1, a, ctx);
                status |= gr_poly_mulmod_preinv(res1, res1, b, f, finv, ctx);
                break;
            case 1:
                status |= gr_poly_set(res1, b, ctx);
                status |= gr_poly_mulmod_preinv(res1, a, res1, f, finv, ctx);
                break;
            case 2:
                status |= gr_poly_set(res1, f, ctx);
                status |= gr_poly_mulmod_preinv(res1, a, b, res1, finv, ctx);
                break;
            default:
                status |= gr_poly_mulmod_preinv(res1, a, b, f, finv, ctx);
                break;
        }

        if (status == GR_SUCCESS)
        {
            status |= gr_poly_mul(res2, a, b, ctx);
            status |= gr_poly_rem(res2, res2, f, ctx);

            if (status == GR_SUCCESS && gr_poly_equal(res1, res2, ctx) == T_FALSE)
            {
                flint_printf("FAIL\n\n");
                flint_printf("a = "); gr_poly_print(a, ctx); flint_printf("\n");
                flint_printf("b = "); gr_poly_print(b, ctx); flint_printf("\n");
                flint_printf("f = "); gr_poly_print(f, ctx); flint_printf("\n");
                flint_printf("res1 = "); gr_poly_print(res1, ctx); flint_printf("\n");
                flint_printf("res2 = "); gr_poly_print(res2, ctx); flint_printf("\n");
                flint_abort();
            }
        }

        gr_poly_clear(a, ctx);
        gr_poly_clear(b, ctx);
        gr_poly_clear(res1, ctx);
        gr_poly_clear(res2, ctx);
        gr_poly_clear(f, ctx);
        gr_poly_clear(finv, ctx);

        gr_ctx_clear(ctx);
    }

    TEST_FUNCTION_END(state);
}