-
Notifications
You must be signed in to change notification settings - Fork 1
/
degree.c
292 lines (247 loc) · 7.82 KB
/
degree.c
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
/* This file is part of the MAYLIB libray.
Copyright 2007-2018 Patrick Pelissier
This Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
This Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with th Library; see the file COPYING.LESSER.txt.
If not, write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "may-impl.h"
/* Either it is the first inclusion of this file, and we have to define the functions.
Or it the second (or third) inclusion, and we have to define
the template functions (may_degree / may_ldegree) based on:
MAY_FUNCTION_NAME
MAY_OPERATOR
*/
#ifndef MAY_FUNCTION_NAME
/* Reinclude this file by defining the may_degree function */
#define MAY_FUNCTION_NAME degree
#define MAY_OPERATOR >
#include "degree.c"
/* Reinclude this file by defining the may_ldegree function */
#define MAY_FUNCTION_NAME ldegree
#define MAY_OPERATOR <
#include "degree.c"
#else
/* Template functions for may_degree and may_ldegree:
MAY_FUNCTION_NAME is either degree or ldegree
MAY_OPERATOR is either > or < */
static int
MAY_CONCACT(may_uni, MAY_FUNCTION_NAME) (may_t *coeff, mpz_srcptr *deg, may_t *leader,
may_t x, may_t v)
{
may_size_t i, n;
may_t c, c1, *c1_ptr;
mpz_srcptr d;
MAY_ASSERT (MAY_TYPE (v) == MAY_STRING_T);
MAY_ASSERT (deg != NULL);
/* If it is not a sum, it is a monomial. */
if (MAY_UNLIKELY (MAY_TYPE (x) != MAY_SUM_T)) {
if (leader)
*leader = x;
return may_extract_coeff_deg (coeff, deg, x, v, true);
}
/* Let's the fun begin! */
c1_ptr = coeff != NULL ? &c : NULL;
if (MAY_UNLIKELY (!may_extract_coeff_deg (c1_ptr, &d, MAY_AT (x, 0), v, true)))
return 0;
n = MAY_NODE_SIZE(x);
MAY_ASSERT (n >= 2);
MAY_LOG_MSG(("n=%lu\n", (unsigned long) n));
may_t sum_coeff[n], sum_leader[n];
may_size_t nsum = 1;
sum_coeff[0] = c;
sum_leader[0] = MAY_AT (x, 0);
c1 = NULL;
c1_ptr = coeff != NULL ? &c1 : NULL;
for (i = 1; i < n; i++) {
/* Extract the current monomial */
mpz_srcptr d1;
int cmp;
if (MAY_UNLIKELY (!may_extract_coeff_deg (c1_ptr, &d1, MAY_AT (x, i), v, true)))
return 0;
/* Compare degrees. */
cmp = mpz_cmp (d1, d);
if (cmp MAY_OPERATOR 0) {
d = d1;
sum_coeff[0] = c1;
sum_leader[0] = MAY_AT (x, i);
nsum = 1;
} else if (MAY_UNLIKELY (cmp == 0)) {
MAY_ASSERT (nsum < n);
sum_coeff[nsum] = c1;
sum_leader[nsum ++] = MAY_AT (x, i);
}
}
/* Eval the returned values */
if (MAY_LIKELY (coeff != NULL)) {
may_t tmp = MAY_LIKELY (nsum == 1) ? sum_coeff[0]
: may_eval (may_add_vc (nsum, sum_coeff));
MAY_ASSERT (MAY_EVAL_P (tmp));
*coeff = tmp;
}
if (MAY_LIKELY (leader != NULL)) {
may_t tmp = MAY_LIKELY (nsum == 1) ? sum_leader[0]
: may_eval (may_add_vc (nsum, sum_leader));
MAY_ASSERT (MAY_EVAL_P (tmp));
*leader = tmp;
}
*deg = d;
return 1;
}
static int
MAY_CONCACT(may_multi, MAY_FUNCTION_NAME) (may_t *coeff, mpz_srcptr deg[], may_t *leader,
may_t x, may_size_t numvar,
const may_t var[numvar])
{
may_size_t i, n, nsum;
may_t c;
may_size_t index_var[numvar];
may_t new_var[numvar];
mpz_srcptr d1[numvar];
mpz_srcptr tempdeg[numvar];
may_t tempsum[numvar];
MAY_ASSERT (deg != NULL);
MAY_ASSERT (numvar >= 2);
MAY_LOG_MSG(("numvar=%lu\n", numvar));
/* Sort the vars following the current order.
Since numvar is small, we can use a N ^2 algo */
/* FIXME: BUGS for more than 2 vars ? */
for (i = 0; i < numvar; i++)
index_var[i] = i;
for (i = 0; i < numvar; i++) {
may_size_t j;
may_size_t minimum = i;
for (j = i+1; j < numvar; j++)
if (may_identical (var[index_var[j]], var[index_var[minimum]]) < 0)
minimum = j;
swap (index_var[i], index_var[minimum]);
}
for (i = 0; i < numvar; i++)
new_var[i] = var[index_var[i]];
/* If it is not a sum, it is a monomial. */
if (MAY_TYPE (x) != MAY_SUM_T) {
if (leader)
*leader = x;
return may_extract_coeff_multideg (coeff, deg,
x, numvar, new_var, index_var,
tempdeg, tempsum);
}
/* Let's the fun begin! */
if (!may_extract_coeff_multideg (&c, deg,
MAY_AT (x, 0), numvar, new_var, index_var,
tempdeg, tempsum))
return 0;
n = MAY_NODE_SIZE(x);
MAY_ASSERT (n>=2);
MAY_LOG_MSG(("n=%lu\n", (unsigned long) n));
may_t sum_coeff[n], sum_leader[n];
nsum = 1;
sum_coeff[0] = c;
sum_leader[0] = MAY_AT (x, 0);
for (i = 1; i < n; i++) {
may_t c1;
int cmp;
if (!may_extract_coeff_multideg (&c1, d1, MAY_AT (x, i), numvar, new_var,
index_var, tempdeg, tempsum))
return 0;
cmp = may_cmp_multidegree (numvar, d1, deg);
if (cmp MAY_OPERATOR 0) {
memcpy (deg, d1, sizeof d1);
sum_leader[0] = MAY_AT (x, i);
sum_coeff[0] = c1;
nsum = 1;
} else if (cmp == 0) {
MAY_ASSERT (nsum < n);
sum_leader[nsum] = MAY_AT (x, i);
sum_coeff[nsum ++] = c1;
}
}
/* Eval the returned values */
if (coeff != NULL) {
may_t tmp = MAY_LIKELY (nsum == 1) ? sum_coeff[0]
: may_eval (may_add_vc (nsum, sum_coeff));
MAY_ASSERT (MAY_EVAL_P (tmp));
*coeff = tmp;
}
if (leader != NULL) {
may_t tmp = MAY_LIKELY (nsum == 1) ? sum_leader[0]
: may_eval (may_add_vc (nsum, sum_leader));
MAY_ASSERT (MAY_EVAL_P (tmp));
*leader = tmp;
}
return 1;
}
int
MAY_CONCACT(may_, MAY_FUNCTION_NAME) (may_t *coeff, mpz_srcptr deg[], may_t *leader,
may_t x, size_t numvar, const may_t var[])
{
mpz_srcptr deg_temp[numvar];
may_t temp;
int ret;
MAY_ASSERT (var != NULL);
MAY_ASSERT (numvar >= 1);
MAY_LOG_FUNC (("x='%Y' numvar='%lu' var[0]='%Y'",x,numvar,var[0]));
MAY_RECORD ();
/* Do an expand */
x = may_expand (x);
/* Easy case (after potential expand !) */
if (MAY_UNLIKELY (x == MAY_ZERO)) {
MAY_CLEANUP ();
if (coeff)
*coeff = MAY_ZERO;
if (leader)
*leader = MAY_ZERO;
if (deg) {
may_size_t i;
/* FIXME: We don't have deg(A*B)=deg(A)+deg(B)
because we return -1 for 0. How to handle this? */
for (i = 0; i< numvar; i++)
deg[i] = MAY_INT (MAY_N_ONE);
}
return 1;
}
/* Computing deg is not heavy: always compute it */
if (MAY_UNLIKELY (deg == NULL))
deg = deg_temp;
/* Call respective function */
if (MAY_LIKELY (numvar == 1))
ret = MAY_CONCACT(may_uni, MAY_FUNCTION_NAME) (coeff, °[0], leader, x, var[0]);
else
ret = MAY_CONCACT(may_multi,MAY_FUNCTION_NAME) (coeff, deg, leader, x, numvar, var);
/* Compact and return */
if (ret == 0) {
MAY_CLEANUP ();
return 0;
}
temp = NULL;
if (coeff == NULL)
coeff = &temp;
if (leader == NULL)
leader = &temp;
MAY_COMPACT_2 (*coeff, *leader);
return 1;
}
long
MAY_CONCACT(may_, MAY_CONCACT(MAY_FUNCTION_NAME,_si)) (may_t x, may_t v)
{
mpz_srcptr z;
int ret;
ret = MAY_CONCACT(may_, MAY_FUNCTION_NAME) (NULL, &z, NULL, x, 1, &v);
if (MAY_UNLIKELY (ret == 0) || !mpz_fits_slong_p (z))
return LONG_MAX;
else if (mpz_cmp_si (z, -1) == 0)
return LONG_MIN; /* Return LONG_MIN for x==0 */
else
return mpz_get_si (z);
}
#undef MAY_FUNCTION_NAME
#undef MAY_OPERATOR
#endif