Go to the source code of this file.
|
int | getReduction (const int i, const ideal &iSB) |
|
static void | addOperationBucket (poly f1, poly f2, kBucket_pt bucket) |
|
static void | elimOperationBucketNoDiv (poly &p1, poly p2, poly p3, poly p4) |
|
void | elimOperationBucket (poly &p1, poly &p2, poly &p3, poly &p4, poly &p5, number &c5, int p5Len) |
|
◆ addOperationBucket()
static void addOperationBucket |
( |
poly |
f1, |
|
|
poly |
f2, |
|
|
kBucket_pt |
bucket |
|
) |
| |
|
static |
Definition at line 1261 of file MinorProcessor.cc.
1264 poly a = f1; poly
b = f2;
1268 b = f1; a = f2; bLen = aLen;
static unsigned pLength(poly a)
void kBucket_Plus_mm_Mult_pp(kBucket_pt bucket, poly m, poly p, int l)
Bpoly == Bpoly + m*p; where m is a monom Does not destroy p and m assume (l <= 0 || pLength(p) == l) ...
◆ elimOperationBucket()
void elimOperationBucket |
( |
poly & |
p1, |
|
|
poly & |
p2, |
|
|
poly & |
p3, |
|
|
poly & |
p4, |
|
|
poly & |
p5, |
|
|
number & |
c5, |
|
|
int |
p5Len |
|
) |
| |
Definition at line 1321 of file MinorProcessor.cc.
1324 #ifdef COUNT_AND_PRINT_OPERATIONS 1351 while (bucketLm !=
NULL)
1362 #ifdef COUNT_AND_PRINT_OPERATIONS 1364 multsMonForDiv += p5Len;
1376 helperPoly = bucketLm;
1377 helperPoly->next = p1;
const poly kBucketGetLm(kBucket_pt bucket)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
static void addOperationBucket(poly f1, poly f2, kBucket_pt bucket)
void kBucketDestroy(kBucket_pt *bucket_pt)
static void p_ExpVectorSub(poly p1, poly p2, const ring r)
static unsigned pLength(poly a)
void kBucket_Minus_m_Mult_p(kBucket_pt bucket, poly m, poly p, int *l, poly spNoether)
Bpoly == Bpoly - m*p; where m is a monom Does not destroy p and m assume (*l <= 0 || pLength(p) == *l...
static poly pReverse(poly p)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define pCopy(p)
return a copy of the poly
◆ elimOperationBucketNoDiv()
static void elimOperationBucketNoDiv |
( |
poly & |
p1, |
|
|
poly |
p2, |
|
|
poly |
p3, |
|
|
poly |
p4 |
|
) |
| |
|
static |
Definition at line 1286 of file MinorProcessor.cc.
1288 #ifdef COUNT_AND_PRINT_OPERATIONS void kBucketClear(kBucket_pt bucket, poly *p, int *length)
static void addOperationBucket(poly f1, poly f2, kBucket_pt bucket)
void kBucketDestroy(kBucket_pt *bucket_pt)
static unsigned pLength(poly a)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
#define pCopy(p)
return a copy of the poly
◆ getReduction()
int getReduction |
( |
const int |
i, |
|
|
const ideal & |
iSB |
|
) |
| |
Definition at line 434 of file MinorProcessor.cc.
436 if (
i == 0)
return 0;
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
static FORCE_INLINE long n_Int(number &n, const coeffs r)
conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 ...
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...