Go to the source code of this file.
|
intvec * | hHstdSeries (ideal S, intvec *modulweight, intvec *wdegree, ideal Q=NULL, ring tailRing=currRing) |
|
intvec * | hFirstSeries (ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL, ring tailRing=currRing) |
|
intvec * | hSecondSeries (intvec *hseries1) |
|
void | hLookSeries (ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL, ring tailRing=currRing) |
|
void | sortMonoIdeal_pCompare (ideal I) |
|
◆ hFirstSeries()
◆ hHstdSeries()
Definition at line 1328 of file hilb.cc.
1332 return hSeries(S, modulweight, 0, wdegree,
Q, tailRing);
◆ hLookSeries()
Definition at line 1418 of file hilb.cc.
1427 const int l = hseries1->
length()-1;
1436 if ((
l == 1) &&(
mu == 0))
◆ hSecondSeries()
Definition at line 1345 of file hilb.cc.
1350 if (hseries1 ==
NULL)
1352 work =
new intvec(hseries1);
1355 for (
i =
k-1;
i >= 0;
i--)
1359 if ((
s != 0) || (
k == 1))
1364 for (
i =
k-1;
i >= 0;
i--)
1373 for (
i =
k-1;
i >= 0;
i--)
1374 (*hseries2)[
i] = (*work)[
i];
1375 (*hseries2)[
k] = (*work)[
l];
◆ sortMonoIdeal_pCompare()
void sortMonoIdeal_pCompare |
( |
ideal |
I | ) |
|
static intvec * hSeries(ideal S, intvec *modulweight, int, intvec *wdegree, ideal Q, ring tailRing)