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()
Definition at line 1264 of file MinorProcessor.cc.
1265{
1266
1267 poly a = f1; poly
b = f2;
1270 {
1272 }
1274
1276 {
1277
1280 }
1281}
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)
static int pLength(poly a)
◆ elimOperationBucket()
void elimOperationBucket |
( |
poly & | p1, |
|
|
poly & | p2, |
|
|
poly & | p3, |
|
|
poly & | p4, |
|
|
poly & | p5, |
|
|
number & | c5, |
|
|
int | p5Len ) |
Definition at line 1324 of file MinorProcessor.cc.
1326{
1327#ifdef COUNT_AND_PRINT_OPERATIONS
1329 {
1332 }
1334 {
1337 }
1341#endif
1347
1348
1349
1350
1352
1355 {
1356
1357
1358
1362
1363
1365#ifdef COUNT_AND_PRINT_OPERATIONS
1374#endif
1376
1377
1378
1382
1384 }
1387}
static void addOperationBucket(poly f1, poly f2, kBucket_pt bucket)
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...
void kBucketDestroy(kBucket_pt *bucket_pt)
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
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 p_ExpVectorSub(poly p1, poly p2, const ring r)
static poly pReverse(poly p)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#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 1289 of file MinorProcessor.cc.
1290{
1291#ifdef COUNT_AND_PRINT_OPERATIONS
1293 {
1296 }
1298 {
1301 }
1305#endif
1314}
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
◆ getReduction()
Definition at line 437 of file MinorProcessor.cc.
438{
439 if (
i == 0)
return 0;
447}
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 ....
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)