 |
My Project
debian-1:4.1.1-p2+ds-4
|
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) |
|
ideal | pcvP2CV (ideal p, int d0, int d1) |
|
lists | pcvCV2P (lists cvl, int d0, int d1) |
|
ideal | pcvCV2P (ideal cv, 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 410 of file pcv.cc.
418 for(
int d=d0,
i=0;d<d1;d++)
◆ pcvBasis() [2/3]
Definition at line 423 of file pcv.cc.
431 int d0=(int)(
long)
h->Data();
433 int d1=(int)(
long)
h->Data();
◆ pcvBasis() [3/3]
int pcvBasis |
( |
lists |
b, |
|
|
int |
i, |
|
|
poly |
m, |
|
|
int |
d, |
|
|
int |
n |
|
) |
| |
Definition at line 390 of file pcv.cc.
395 for(
int k=0,
l=d;
k<=
l;
k++,d--)
◆ pcvClean()
◆ pcvCV2P() [1/4]
ideal pcvCV2P |
( |
ideal |
cv, |
|
|
int |
d0, |
|
|
int |
d1 |
|
) |
| |
◆ pcvCV2P() [2/4]
Definition at line 338 of file pcv.cc.
348 int d0=(int)(
long)
h->Data();
350 int d1=(int)(
long)
h->Data();
◆ pcvCV2P() [3/4]
Definition at line 299 of file pcv.cc.
305 for(
int i=cvl->
nr;
i>=0;
i--)
◆ pcvCV2P() [4/4]
poly pcvCV2P |
( |
poly |
cv, |
|
|
int |
d0, |
|
|
int |
d1 |
|
) |
| |
◆ pcvDeg()
◆ pcvDim() [1/2]
int pcvDim |
( |
int |
d0, |
|
|
int |
d1 |
|
) |
| |
◆ pcvDim() [2/2]
Definition at line 370 of file pcv.cc.
378 int d0=(int)(
long)
h->Data();
380 int d1=(int)(
long)
h->Data();
◆ pcvInit()
◆ pcvLAddL() [1/2]
◆ pcvLAddL() [2/2]
◆ pcvM2N()
◆ pcvMinDeg() [1/3]
◆ pcvMinDeg() [2/3]
Definition at line 121 of file pcv.cc.
131 if((d>=0&&md>d)||md==-1) md=d;
◆ pcvMinDeg() [3/3]
◆ pcvN2M()
◆ pcvP2CV() [1/4]
ideal pcvP2CV |
( |
ideal |
p, |
|
|
int |
d0, |
|
|
int |
d1 |
|
) |
| |
◆ pcvP2CV() [2/4]
Definition at line 316 of file pcv.cc.
326 int d0=(int)(
long)
h->Data();
328 int d1=(int)(
long)
h->Data();
◆ pcvP2CV() [3/4]
◆ pcvP2CV() [4/4]
poly pcvP2CV |
( |
poly |
p, |
|
|
int |
d0, |
|
|
int |
d1 |
|
) |
| |
◆ pcvPMulL() [1/2]
Definition at line 85 of file pcv.cc.
91 poly
p=(poly)
h->Data();
◆ pcvPMulL() [2/2]
Definition at line 55 of file pcv.cc.
60 for(
int i=l1->
nr;
i>=0;
i--)
#define pGetComp(p)
Component.
#define MATELEM(mat, i, j)
#define pGetExp(p, i)
Exponent.
const CanonicalForm CFMap CFMap & N
int pcvBasis(lists b, int i, poly m, int d, int n)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
lists pcvPMulL(poly p, lists l1)
#define omFreeSize(addr, size)
poly pcvCV2P(poly cv, int d0, int d1)
static unsigned ** pcvIndex
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
int pcvDim(int d0, int d1)
poly pcvP2CV(poly p, int d0, int d1)
void WerrorS(const char *s)
static unsigned * pcvTable
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
lists pcvLAddL(lists l1, lists l2)
INLINE_THIS void Init(int l=0)
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 (...
#define pCopy(p)
return a copy of the poly
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy