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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126

/*
    Copyright (C) 2021 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 "mpoly.h"

/*
    Fill in the indices that partition A into univariate chunks.
    D will be allocated to at least one more than its length so that
        D->coeffs[D->length] = Alen
*/
void mpoly1_fill_marks(
    ulong ** Dcoeffs,
    slong * Dlength,
    slong * Dalloc,
    const ulong * Aexps,
    slong Alen,
    flint_bitcnt_t Abits,
    const mpoly_ctx_t mctx)
{
    slong off0, shift0;
    ulong mask = (-UWORD(1)) >> (FLINT_BITS - Abits);
    slong i, N = mpoly_words_per_exp_sp(Abits, mctx);
    ulong e0;

    FLINT_ASSERT(mctx->ord == ORD_LEX);
    FLINT_ASSERT(mctx->nvars >= 1);

    mpoly_gen_offset_shift_sp(&off0, &shift0, 0, Abits, mctx);

    *Dlength = 0;
    i = 0;
    while (i < Alen)
    {
        if (*Dalloc < *Dlength + 1)
        {
            *Dalloc = FLINT_MAX(*Dlength + 1, *Dalloc + *Dalloc/2);
            *Dcoeffs = FLINT_ARRAY_REALLOC(*Dcoeffs, *Dalloc, ulong);
        }
        (*Dcoeffs)[*Dlength] = i;
        *Dlength = *Dlength + 1;

        e0 = (Aexps[N*i + off0] >> shift0) & mask;
        while (1)
        {
            i++;
            if (i >= Alen)
                break;
            if (((Aexps[N*i + off0] >> shift0) & mask) != e0)
                break;
        }
    }

    if (*Dalloc < *Dlength + 1)
    {
        *Dalloc = FLINT_MAX(*Dlength + 1, *Dalloc + *Dalloc/2);
        *Dcoeffs = FLINT_ARRAY_REALLOC(*Dcoeffs, *Dalloc, ulong);
    }
    (*Dcoeffs)[*Dlength] = Alen;
}

/*
    Fill in the indices that partition A into bivariate chunks.
    D will be allocated to at least one more than its length so that
        D->coeffs[D->length] = Alen
*/
void mpoly2_fill_marks(
    ulong ** Dcoeffs,
    slong * Dlength,
    slong * Dalloc,
    const ulong * Aexps,
    slong Alen,
    flint_bitcnt_t Abits,
    const mpoly_ctx_t mctx)
{
    slong off0, off1, shift0, shift1;
    ulong mask = (-UWORD(1)) >> (FLINT_BITS - Abits);
    slong i, N = mpoly_words_per_exp_sp(Abits, mctx);
    ulong e0, e1;

    FLINT_ASSERT(mctx->ord == ORD_LEX);
    FLINT_ASSERT(mctx->nvars >= 2);

    mpoly_gen_offset_shift_sp(&off0, &shift0, 0, Abits, mctx);
    mpoly_gen_offset_shift_sp(&off1, &shift1, 1, Abits, mctx);

    *Dlength = 0;
    i = 0;
    while (i < Alen)
    {
        if (*Dalloc < *Dlength + 1)
        {
            *Dalloc = FLINT_MAX(*Dlength + 1, *Dalloc + *Dalloc/2);
            *Dcoeffs = FLINT_ARRAY_REALLOC(*Dcoeffs, *Dalloc, ulong);
        }
        (*Dcoeffs)[*Dlength] = i;
        *Dlength = *Dlength + 1;

        e0 = (Aexps[N*i + off0] >> shift0) & mask;
        e1 = (Aexps[N*i + off1] >> shift1) & mask;
        while (1)
        {
            i++;
            if (i >= Alen)
                break;
            if (((Aexps[N*i + off0] >> shift0) & mask) != e0)
                break;
            if (((Aexps[N*i + off1] >> shift1) & mask) != e1)
                break;
        }
    }

    if (*Dalloc < *Dlength + 1)
    {
        *Dalloc = FLINT_MAX(*Dlength + 1, *Dalloc + *Dalloc/2);
        *Dcoeffs = FLINT_ARRAY_REALLOC(*Dcoeffs, *Dalloc, ulong);
    }
    (*Dcoeffs)[*Dlength] = Alen;
}