Go to the source code of this file.
|
lists | pcvLAddL (lists l1, lists l2) |
|
lists | pcvPMulL (poly p, lists l1) |
|
BOOLEAN | pcvLAddL (leftv res, leftv h) |
|
BOOLEAN | pcvPMulL (leftv res, leftv h) |
|
int | pcvDeg (poly p) |
|
int | pcvMinDeg (poly p) |
|
int | pcvMinDeg (matrix m) |
|
BOOLEAN | pcvMinDeg (leftv res, leftv h) |
|
void | pcvInit (int d) |
|
void | pcvClean () |
|
int | pcvM2N (poly m) |
|
poly | pcvN2M (int n) |
|
poly | pcvP2CV (poly p, int d0, int d1) |
|
poly | pcvCV2P (poly cv, int d0, int d1) |
|
lists | pcvP2CV (lists pl, int d0, int d1) |
|
lists | pcvCV2P (lists cvl, int d0, int d1) |
|
BOOLEAN | pcvP2CV (leftv res, leftv h) |
|
BOOLEAN | pcvCV2P (leftv res, leftv h) |
|
int | pcvDim (int d0, int d1) |
|
BOOLEAN | pcvDim (leftv res, leftv h) |
|
int | pcvBasis (lists b, int i, poly m, int d, int n) |
|
lists | pcvBasis (int d0, int d1) |
|
BOOLEAN | pcvBasis (leftv res, leftv h) |
|
◆ pcvBasis() [1/3]
lists pcvBasis |
( |
int |
d0, |
|
|
int |
d1 |
|
) |
| |
Definition at line 450 of file pcv.cc.
451{
452 if(d0<0) d0=0;
453 if(d1<0) d1=0;
457 for(
int d=d0,
i=0;d<d1;d++)
461}
int pcvBasis(lists b, int i, poly m, int d, int n)
int pcvDim(int d0, int d1)
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
◆ pcvBasis() [2/3]
Definition at line 463 of file pcv.cc.
464{
466 {
469 {
470 int d0=(int)(
long)
h->Data();
472 int d1=(int)(
long)
h->Data();
476 }
478 }
481}
void WerrorS(const char *s)
BOOLEAN iiCheckTypes(leftv args, const short *type_list, int report)
check a list of arguemys against a given field of types return TRUE if the types match return FALSE (...
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
◆ pcvBasis() [3/3]
int pcvBasis |
( |
lists |
b, |
|
|
int |
i, |
|
|
poly |
m, |
|
|
int |
d, |
|
|
int |
n |
|
) |
| |
Definition at line 430 of file pcv.cc.
431{
433 {
434 for(
int k=0,
l=d;
k<=
l;
k++,d--)
435 {
438 }
439 }
440 else
441 {
446 }
448}
const CanonicalForm CFMap CFMap & N
#define pCopy(p)
return a copy of the poly
◆ pcvClean()
Definition at line 223 of file pcv.cc.
224{
226 {
229 }
231 {
234 }
235}
#define omFreeSize(addr, size)
STATIC_VAR unsigned * pcvTable
STATIC_VAR unsigned ** pcvIndex
STATIC_VAR int pcvTableSize
STATIC_VAR int pcvIndexSize
◆ pcvCV2P() [1/3]
Definition at line 378 of file pcv.cc.
379{
381 {
384 {
387 int d0=(int)(
long)
h->Data();
389 int d1=(int)(
long)
h->Data();
393 }
395 }
398}
poly pcvCV2P(poly cv, int d0, int d1)
◆ pcvCV2P() [2/3]
Definition at line 339 of file pcv.cc.
340{
344 for(
int i=cvl->
nr;
i>=0;
i--)
345 {
347 {
350 }
351 }
353 return pl;
354}
INLINE_THIS void Init(int l=0)
◆ pcvCV2P() [3/3]
poly pcvCV2P |
( |
poly |
cv, |
|
|
int |
d0, |
|
|
int |
d1 |
|
) |
| |
Definition at line 297 of file pcv.cc.
298{
300 while(cv)
301 {
304 {
306 if(d0<=d&&d<d1)
307 {
310 }
311 }
313 }
315}
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define pGetComp(p)
Component.
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
◆ pcvDeg()
Definition at line 128 of file pcv.cc.
129{
130 int d=0;
132 return d;
133}
#define pGetExp(p, i)
Exponent.
◆ pcvDim() [1/2]
int pcvDim |
( |
int |
d0, |
|
|
int |
d1 |
|
) |
| |
Definition at line 400 of file pcv.cc.
401{
402 if(d0<0) d0=0;
403 if(d1<0) d1=0;
407 return d;
408}
◆ pcvDim() [2/2]
Definition at line 410 of file pcv.cc.
411{
413 {
416 {
417 int d0=(int)(
long)
h->Data();
419 int d1=(int)(
long)
h->Data();
423 }
425 }
428}
◆ pcvInit()
Definition at line 193 of file pcv.cc.
194{
195 if(d<0) d=1;
207 {
210 {
213 {
217 }
219 }
220 }
221}
STATIC_VAR int pcvMaxDegree
◆ pcvLAddL() [1/2]
Definition at line 96 of file pcv.cc.
97{
100 {
107 }
109}
lists pcvLAddL(lists l1, lists l2)
◆ pcvLAddL() [2/2]
Definition at line 31 of file pcv.cc.
32{
38 {
39 if(i<=l1->nr
41 {
43 {
47 }
48 else
49 {
52 }
55 }
56 else
57 if(i<=l2->nr
59 {
61 {
65 }
66 else
67 {
70 }
71 }
72 }
73 return(l0);
74}
poly sBucketPeek(sBucket_pt b)
◆ pcvM2N()
Definition at line 237 of file pcv.cc.
238{
239 unsigned n=0,dn,d=0;
241 {
245 {
248 }
249 else n+=dn;
250 }
251 return n+1;
252}
◆ pcvMinDeg() [1/3]
Definition at line 164 of file pcv.cc.
165{
167 {
169 {
173 }
174 else
176 {
180 }
181 else
183 {
187 }
188 }
191}
◆ pcvMinDeg() [2/3]
Definition at line 149 of file pcv.cc.
150{
152 int md=-1;
154 {
156 {
158 if((d>=0&&md>d)||md==-1) md=d;
159 }
160 }
161 return(md);
162}
#define MATELEM(mat, i, j)
1-based access to matrix
◆ pcvMinDeg() [3/3]
Definition at line 135 of file pcv.cc.
136{
141 {
143 if(d<md) md=d;
145 }
146 return md;
147}
◆ pcvN2M()
Definition at line 254 of file pcv.cc.
255{
256 n--;
260 {
266 }
267 if(n==0)
268 {
272 }
273 else
274 {
277 }
278}
◆ pcvP2CV() [1/3]
Definition at line 356 of file pcv.cc.
357{
359 {
362 {
365 int d0=(int)(
long)
h->Data();
367 int d1=(int)(
long)
h->Data();
371 }
373 }
376}
poly pcvP2CV(poly p, int d0, int d1)
◆ pcvP2CV() [2/3]
Definition at line 317 of file pcv.cc.
318{
322 for(
int i=pl->
nr;
i>=0;
i--)
323 {
325 {
328 }
330 {
333 }
334 }
336 return cvl;
337}
◆ pcvP2CV() [3/3]
poly pcvP2CV |
( |
poly |
p, |
|
|
int |
d0, |
|
|
int |
d1 |
|
) |
| |
Definition at line 280 of file pcv.cc.
281{
284 {
286 if(d0<=d&&d<d1)
287 {
291 }
293 }
294 return cv;
295}
◆ pcvPMulL() [1/2]
Definition at line 111 of file pcv.cc.
112{
117 {
118 poly
p=(poly)
h->Data();
124 }
126}
lists pcvPMulL(poly p, lists l1)
◆ pcvPMulL() [2/2]
Definition at line 76 of file pcv.cc.
77{
80 for(
int i=l1->
nr;
i>=0;
i--)
81 {
83 {
86 }
88 {
91 }
92 }
93 return(l0);
94}
◆ pcvIndex
◆ pcvIndexSize
◆ pcvMaxDegree
◆ pcvTable
◆ pcvTableSize