[f41347f] | 1 | /**************************************** |
---|
| 2 | * Computer Algebra System SINGULAR * |
---|
| 3 | ****************************************/ |
---|
[341696] | 4 | /* $Id$ */ |
---|
[f41347f] | 5 | /* |
---|
| 6 | * ABSTRACT: kernel: utils for kStd |
---|
| 7 | */ |
---|
| 8 | |
---|
| 9 | // #define PDEBUG 2 |
---|
| 10 | // #define PDIV_DEBUG |
---|
| 11 | #define KUTIL_CC |
---|
| 12 | #include <stdlib.h> |
---|
| 13 | #include <string.h> |
---|
[599326] | 14 | #include <kernel/mod2.h> |
---|
[645a19] | 15 | |
---|
| 16 | #ifndef NDEBUG |
---|
| 17 | # define MYTEST 0 |
---|
| 18 | #else /* ifndef NDEBUG */ |
---|
| 19 | # define MYTEST 0 |
---|
| 20 | #endif /* ifndef NDEBUG */ |
---|
| 21 | |
---|
| 22 | |
---|
[b1dfaf] | 23 | #include <omalloc/mylimits.h> |
---|
[599326] | 24 | #include <kernel/options.h> |
---|
| 25 | #include <kernel/gring.h> |
---|
| 26 | #include <kernel/sca.h> |
---|
[f41347f] | 27 | #ifdef KDEBUG |
---|
| 28 | #undef KDEBUG |
---|
| 29 | #define KDEBUG 2 |
---|
| 30 | #endif |
---|
| 31 | |
---|
[c90b43] | 32 | #ifdef HAVE_RINGS |
---|
[599326] | 33 | #include <kernel/ideals.h> |
---|
[f41347f] | 34 | #endif |
---|
| 35 | |
---|
| 36 | // define if enterL, enterT should use memmove instead of doing it manually |
---|
| 37 | // on topgun, this is slightly faster (see monodromy_l.tst, homog_gonnet.sing) |
---|
| 38 | #ifndef SunOS_4 |
---|
| 39 | #define ENTER_USE_MEMMOVE |
---|
| 40 | #endif |
---|
| 41 | |
---|
| 42 | // define, if the my_memmove inlines should be used instead of |
---|
| 43 | // system memmove -- it does not seem to pay off, though |
---|
| 44 | // #define ENTER_USE_MYMEMMOVE |
---|
| 45 | |
---|
[599326] | 46 | #include <kernel/kutil.h> |
---|
| 47 | #include <kernel/kbuckets.h> |
---|
| 48 | #include <kernel/febase.h> |
---|
[b1dfaf] | 49 | #include <omalloc/omalloc.h> |
---|
[599326] | 50 | #include <kernel/numbers.h> |
---|
| 51 | #include <kernel/polys.h> |
---|
| 52 | #include <kernel/ring.h> |
---|
| 53 | #include <kernel/ideals.h> |
---|
| 54 | #include <kernel/timer.h> |
---|
[f41347f] | 55 | //#include "cntrlc.h" |
---|
[599326] | 56 | #include <kernel/stairc.h> |
---|
| 57 | #include <kernel/kstd1.h> |
---|
| 58 | #include <kernel/pShallowCopyDelete.h> |
---|
[f41347f] | 59 | |
---|
| 60 | /* shiftgb stuff */ |
---|
[599326] | 61 | #include <kernel/shiftgb.h> |
---|
| 62 | #include <kernel/prCopy.h> |
---|
[f41347f] | 63 | |
---|
[43cbc0] | 64 | #ifdef HAVE_RATGRING |
---|
[599326] | 65 | #include <kernel/ratgring.h> |
---|
[43cbc0] | 66 | #endif |
---|
| 67 | |
---|
[f41347f] | 68 | #ifdef KDEBUG |
---|
| 69 | #undef KDEBUG |
---|
| 70 | #define KDEBUG 2 |
---|
| 71 | #endif |
---|
| 72 | |
---|
| 73 | |
---|
| 74 | #ifdef ENTER_USE_MYMEMMOVE |
---|
| 75 | inline void _my_memmove_d_gt_s(unsigned long* d, unsigned long* s, long l) |
---|
| 76 | { |
---|
| 77 | register unsigned long* _dl = (unsigned long*) d; |
---|
| 78 | register unsigned long* _sl = (unsigned long*) s; |
---|
| 79 | register long _i = l - 1; |
---|
| 80 | |
---|
| 81 | do |
---|
| 82 | { |
---|
| 83 | _dl[_i] = _sl[_i]; |
---|
| 84 | _i--; |
---|
| 85 | } |
---|
| 86 | while (_i >= 0); |
---|
| 87 | } |
---|
| 88 | |
---|
| 89 | inline void _my_memmove_d_lt_s(unsigned long* d, unsigned long* s, long l) |
---|
| 90 | { |
---|
| 91 | register long _ll = l; |
---|
| 92 | register unsigned long* _dl = (unsigned long*) d; |
---|
| 93 | register unsigned long* _sl = (unsigned long*) s; |
---|
| 94 | register long _i = 0; |
---|
| 95 | |
---|
| 96 | do |
---|
| 97 | { |
---|
| 98 | _dl[_i] = _sl[_i]; |
---|
| 99 | _i++; |
---|
| 100 | } |
---|
| 101 | while (_i < _ll); |
---|
| 102 | } |
---|
| 103 | |
---|
| 104 | inline void _my_memmove(void* d, void* s, long l) |
---|
| 105 | { |
---|
| 106 | unsigned long _d = (unsigned long) d; |
---|
| 107 | unsigned long _s = (unsigned long) s; |
---|
| 108 | unsigned long _l = ((l) + SIZEOF_LONG - 1) >> LOG_SIZEOF_LONG; |
---|
| 109 | |
---|
| 110 | if (_d > _s) _my_memmove_d_gt_s(_d, _s, _l); |
---|
| 111 | else _my_memmove_d_lt_s(_d, _s, _l); |
---|
| 112 | } |
---|
| 113 | |
---|
| 114 | #undef memmove |
---|
| 115 | #define memmove(d,s,l) _my_memmove(d, s, l) |
---|
| 116 | #endif |
---|
| 117 | |
---|
| 118 | static poly redMora (poly h,int maxIndex,kStrategy strat); |
---|
| 119 | static poly redBba (poly h,int maxIndex,kStrategy strat); |
---|
| 120 | |
---|
| 121 | #ifdef HAVE_RINGS |
---|
| 122 | #define pDivComp_EQUAL 2 |
---|
| 123 | #define pDivComp_LESS 1 |
---|
| 124 | #define pDivComp_GREATER -1 |
---|
| 125 | #define pDivComp_INCOMP 0 |
---|
| 126 | /* Checks the relation of LM(p) and LM(q) |
---|
| 127 | LM(p) = LM(q) => return pDivComp_EQUAL |
---|
| 128 | LM(p) | LM(q) => return pDivComp_LESS |
---|
| 129 | LM(q) | LM(p) => return pDivComp_GREATER |
---|
| 130 | else return pDivComp_INCOMP */ |
---|
| 131 | static inline int pDivCompRing(poly p, poly q) |
---|
| 132 | { |
---|
| 133 | if (pGetComp(p) == pGetComp(q)) |
---|
| 134 | { |
---|
| 135 | BOOLEAN a=FALSE, b=FALSE; |
---|
| 136 | int i; |
---|
| 137 | unsigned long la, lb; |
---|
| 138 | unsigned long divmask = currRing->divmask; |
---|
| 139 | for (i=0; i<currRing->VarL_Size; i++) |
---|
| 140 | { |
---|
| 141 | la = p->exp[currRing->VarL_Offset[i]]; |
---|
| 142 | lb = q->exp[currRing->VarL_Offset[i]]; |
---|
| 143 | if (la != lb) |
---|
| 144 | { |
---|
| 145 | if (la < lb) |
---|
| 146 | { |
---|
| 147 | if (b) return pDivComp_INCOMP; |
---|
| 148 | if (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)) |
---|
| 149 | return pDivComp_INCOMP; |
---|
| 150 | a = TRUE; |
---|
| 151 | } |
---|
| 152 | else |
---|
| 153 | { |
---|
| 154 | if (a) return pDivComp_INCOMP; |
---|
| 155 | if (((la & divmask) ^ (lb & divmask)) != ((la - lb) & divmask)) |
---|
| 156 | return pDivComp_INCOMP; |
---|
| 157 | b = TRUE; |
---|
| 158 | } |
---|
| 159 | } |
---|
| 160 | } |
---|
| 161 | if (a) return pDivComp_LESS; |
---|
| 162 | if (b) return pDivComp_GREATER; |
---|
| 163 | if (!a & !b) return pDivComp_EQUAL; |
---|
| 164 | } |
---|
[91d286] | 165 | return pDivComp_INCOMP; |
---|
[f41347f] | 166 | } |
---|
| 167 | #endif |
---|
| 168 | |
---|
| 169 | static inline int pDivComp(poly p, poly q) |
---|
| 170 | { |
---|
| 171 | if (pGetComp(p) == pGetComp(q)) |
---|
| 172 | { |
---|
[08500d] | 173 | #ifdef HAVE_RATGRING |
---|
[0b4ec2] | 174 | if (rIsRatGRing(currRing)) |
---|
[f41347f] | 175 | { |
---|
| 176 | if (_p_LmDivisibleByPart(p,currRing, |
---|
| 177 | q,currRing, |
---|
| 178 | currRing->real_var_start, currRing->real_var_end)) |
---|
[9f17c9] | 179 | return 0; |
---|
[f41347f] | 180 | return pLmCmp(q,p); // ONLY FOR GLOBAL ORDER! |
---|
| 181 | } |
---|
| 182 | #endif |
---|
| 183 | BOOLEAN a=FALSE, b=FALSE; |
---|
| 184 | int i; |
---|
| 185 | unsigned long la, lb; |
---|
| 186 | unsigned long divmask = currRing->divmask; |
---|
| 187 | for (i=0; i<currRing->VarL_Size; i++) |
---|
| 188 | { |
---|
| 189 | la = p->exp[currRing->VarL_Offset[i]]; |
---|
| 190 | lb = q->exp[currRing->VarL_Offset[i]]; |
---|
| 191 | if (la != lb) |
---|
| 192 | { |
---|
| 193 | if (la < lb) |
---|
| 194 | { |
---|
| 195 | if (b) return 0; |
---|
| 196 | if (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)) |
---|
| 197 | return 0; |
---|
| 198 | a = TRUE; |
---|
| 199 | } |
---|
| 200 | else |
---|
| 201 | { |
---|
| 202 | if (a) return 0; |
---|
| 203 | if (((la & divmask) ^ (lb & divmask)) != ((la - lb) & divmask)) |
---|
| 204 | return 0; |
---|
| 205 | b = TRUE; |
---|
| 206 | } |
---|
| 207 | } |
---|
| 208 | } |
---|
| 209 | if (a) { /*assume(pLmCmp(q,p)==1);*/ return 1; } |
---|
| 210 | if (b) { /*assume(pLmCmp(q,p)==-1);*/return -1; } |
---|
| 211 | /*assume(pLmCmp(q,p)==0);*/ |
---|
| 212 | } |
---|
| 213 | return 0; |
---|
| 214 | } |
---|
| 215 | |
---|
| 216 | |
---|
| 217 | int HCord; |
---|
| 218 | int Kstd1_deg; |
---|
[c536ff] | 219 | int Kstd1_mu=32000; |
---|
[f41347f] | 220 | |
---|
| 221 | /*2 |
---|
| 222 | *deletes higher monomial of p, re-compute ecart and length |
---|
| 223 | *works only for orderings with ecart =pFDeg(end)-pFDeg(start) |
---|
| 224 | */ |
---|
| 225 | void deleteHC(LObject *L, kStrategy strat, BOOLEAN fromNext) |
---|
| 226 | { |
---|
| 227 | if (strat->kHEdgeFound) |
---|
| 228 | { |
---|
| 229 | kTest_L(L); |
---|
| 230 | poly p1; |
---|
| 231 | poly p = L->GetLmTailRing(); |
---|
| 232 | int l = 1; |
---|
| 233 | kBucket_pt bucket = NULL; |
---|
| 234 | if (L->bucket != NULL) |
---|
| 235 | { |
---|
| 236 | kBucketClear(L->bucket, &pNext(p), &L->pLength); |
---|
| 237 | L->pLength++; |
---|
| 238 | bucket = L->bucket; |
---|
| 239 | L->bucket = NULL; |
---|
| 240 | L->last = NULL; |
---|
| 241 | } |
---|
| 242 | |
---|
| 243 | if (!fromNext && p_Cmp(p,strat->kNoetherTail(), L->tailRing) == -1) |
---|
| 244 | { |
---|
| 245 | L->Delete(); |
---|
| 246 | L->Clear(); |
---|
| 247 | L->ecart = -1; |
---|
| 248 | if (bucket != NULL) kBucketDestroy(&bucket); |
---|
| 249 | return; |
---|
| 250 | } |
---|
| 251 | p1 = p; |
---|
| 252 | while (pNext(p1)!=NULL) |
---|
| 253 | { |
---|
| 254 | if (p_LmCmp(pNext(p1), strat->kNoetherTail(), L->tailRing) == -1) |
---|
| 255 | { |
---|
| 256 | L->last = p1; |
---|
| 257 | p_Delete(&pNext(p1), L->tailRing); |
---|
| 258 | if (p1 == p) |
---|
| 259 | { |
---|
| 260 | if (L->t_p != NULL) |
---|
| 261 | { |
---|
| 262 | assume(L->p != NULL && p == L->t_p); |
---|
| 263 | pNext(L->p) = NULL; |
---|
| 264 | } |
---|
| 265 | L->max = NULL; |
---|
| 266 | } |
---|
| 267 | else if (fromNext) |
---|
| 268 | L->max = p_GetMaxExpP(pNext(L->p), L->tailRing ); // p1; |
---|
| 269 | //if (L->pLength != 0) |
---|
| 270 | L->pLength = l; |
---|
| 271 | // Hmmm when called from updateT, then only |
---|
| 272 | // reset ecart when cut |
---|
| 273 | if (fromNext) |
---|
| 274 | L->ecart = L->pLDeg() - L->GetpFDeg(); |
---|
| 275 | break; |
---|
| 276 | } |
---|
| 277 | l++; |
---|
| 278 | pIter(p1); |
---|
| 279 | } |
---|
| 280 | if (! fromNext) |
---|
| 281 | { |
---|
| 282 | L->SetpFDeg(); |
---|
| 283 | L->ecart = L->pLDeg(strat->LDegLast) - L->GetpFDeg(); |
---|
| 284 | } |
---|
| 285 | if (bucket != NULL) |
---|
| 286 | { |
---|
| 287 | if (L->pLength > 1) |
---|
| 288 | { |
---|
| 289 | kBucketInit(bucket, pNext(p), L->pLength - 1); |
---|
| 290 | pNext(p) = NULL; |
---|
| 291 | if (L->t_p != NULL) pNext(L->t_p) = NULL; |
---|
| 292 | L->pLength = 0; |
---|
| 293 | L->bucket = bucket; |
---|
| 294 | L->last = NULL; |
---|
| 295 | } |
---|
| 296 | else |
---|
| 297 | kBucketDestroy(&bucket); |
---|
| 298 | } |
---|
| 299 | kTest_L(L); |
---|
| 300 | } |
---|
| 301 | } |
---|
| 302 | |
---|
| 303 | void deleteHC(poly* p, int* e, int* l,kStrategy strat) |
---|
| 304 | { |
---|
| 305 | LObject L(*p, currRing, strat->tailRing); |
---|
| 306 | |
---|
| 307 | deleteHC(&L, strat); |
---|
| 308 | *p = L.p; |
---|
| 309 | *e = L.ecart; |
---|
| 310 | *l = L.length; |
---|
| 311 | if (L.t_p != NULL) p_LmFree(L.t_p, strat->tailRing); |
---|
| 312 | } |
---|
| 313 | |
---|
| 314 | /*2 |
---|
| 315 | *tests if p.p=monomial*unit and cancels the unit |
---|
| 316 | */ |
---|
| 317 | void cancelunit (LObject* L,BOOLEAN inNF) |
---|
| 318 | { |
---|
| 319 | int i; |
---|
| 320 | poly h; |
---|
| 321 | |
---|
[f20117] | 322 | if(rHasGlobalOrdering_currRing()) return; |
---|
[f41347f] | 323 | if(TEST_OPT_CANCELUNIT) return; |
---|
| 324 | |
---|
| 325 | ring r = L->tailRing; |
---|
| 326 | poly p = L->GetLmTailRing(); |
---|
| 327 | |
---|
[18ef40] | 328 | #ifdef HAVE_RINGS_LOC |
---|
[f41347f] | 329 | // Leading coef have to be a unit |
---|
| 330 | if ( !(nIsUnit(p_GetCoeff(p, r))) ) return; |
---|
| 331 | #endif |
---|
| 332 | |
---|
| 333 | if(p_GetComp(p, r) != 0 && !p_OneComp(p, r)) return; |
---|
| 334 | |
---|
| 335 | // for(i=r->N;i>0;i--) |
---|
| 336 | // { |
---|
| 337 | // if ((p_GetExp(p,i,r)>0) && (rIsPolyVar(i, r)==TRUE)) return; |
---|
| 338 | // } |
---|
[16f3ec] | 339 | h = pNext(p); |
---|
| 340 | loop |
---|
| 341 | { |
---|
| 342 | if (h==NULL) |
---|
[f41347f] | 343 | { |
---|
[16f3ec] | 344 | p_Delete(&pNext(p), r); |
---|
| 345 | if (!inNF) |
---|
[f41347f] | 346 | { |
---|
[16f3ec] | 347 | number eins=nInit(1); |
---|
| 348 | if (L->p != NULL) pSetCoeff(L->p,eins); |
---|
| 349 | else if (L->t_p != NULL) nDelete(&pGetCoeff(L->t_p)); |
---|
| 350 | if (L->t_p != NULL) pSetCoeff0(L->t_p,eins); |
---|
[f41347f] | 351 | } |
---|
[16f3ec] | 352 | L->ecart = 0; |
---|
| 353 | L->length = 1; |
---|
| 354 | //if (L->pLength > 0) |
---|
| 355 | L->pLength = 1; |
---|
| 356 | if (L->last != NULL) L->last = p; |
---|
| 357 | L->max = NULL; |
---|
| 358 | |
---|
| 359 | if (L->t_p != NULL && pNext(L->t_p) != NULL) |
---|
| 360 | pNext(L->t_p) = NULL; |
---|
| 361 | if (L->p != NULL && pNext(L->p) != NULL) |
---|
| 362 | pNext(L->p) = NULL; |
---|
| 363 | return; |
---|
| 364 | } |
---|
| 365 | i = 0; |
---|
| 366 | loop |
---|
| 367 | { |
---|
| 368 | i++; |
---|
| 369 | if (p_GetExp(p,i,r) > p_GetExp(h,i,r)) return ; // does not divide |
---|
| 370 | if (i == r->N) break; // does divide, try next monom |
---|
[f41347f] | 371 | } |
---|
[16f3ec] | 372 | pIter(h); |
---|
[f41347f] | 373 | } |
---|
| 374 | } |
---|
| 375 | |
---|
| 376 | /*2 |
---|
| 377 | *pp is the new element in s |
---|
| 378 | *returns TRUE (in strat->kHEdgeFound) if |
---|
| 379 | *-HEcke is allowed |
---|
| 380 | *-we are in the last componente of the vector |
---|
| 381 | *-on all axis are monomials (all elements in NotUsedAxis are FALSE) |
---|
| 382 | *returns FALSE for pLexOrderings, |
---|
| 383 | *assumes in module case an ordering of type c* !! |
---|
| 384 | * HEckeTest is only called with strat->kHEdgeFound==FALSE ! |
---|
| 385 | */ |
---|
| 386 | void HEckeTest (poly pp,kStrategy strat) |
---|
| 387 | { |
---|
| 388 | int j,k,p; |
---|
| 389 | |
---|
| 390 | strat->kHEdgeFound=FALSE; |
---|
| 391 | if (pLexOrder || currRing->MixedOrder) |
---|
| 392 | { |
---|
| 393 | return; |
---|
| 394 | } |
---|
| 395 | if (strat->ak > 1) /*we are in the module case*/ |
---|
| 396 | { |
---|
| 397 | return; // until .... |
---|
| 398 | //if (!pVectorOut) /*pVectorOut <=> order = c,* */ |
---|
| 399 | // return FALSE; |
---|
| 400 | //if (pGetComp(pp) < strat->ak) /* ak is the number of the last component */ |
---|
| 401 | // return FALSE; |
---|
| 402 | } |
---|
| 403 | k = 0; |
---|
| 404 | p=pIsPurePower(pp); |
---|
| 405 | if (p!=0) strat->NotUsedAxis[p] = FALSE; |
---|
| 406 | /*- the leading term of pp is a power of the p-th variable -*/ |
---|
| 407 | for (j=pVariables;j>0; j--) |
---|
| 408 | { |
---|
| 409 | if (strat->NotUsedAxis[j]) |
---|
| 410 | { |
---|
| 411 | return; |
---|
| 412 | } |
---|
| 413 | } |
---|
| 414 | strat->kHEdgeFound=TRUE; |
---|
| 415 | } |
---|
| 416 | |
---|
| 417 | /*2 |
---|
| 418 | *utilities for TSet, LSet |
---|
| 419 | */ |
---|
| 420 | inline static intset initec (const int maxnr) |
---|
| 421 | { |
---|
| 422 | return (intset)omAlloc(maxnr*sizeof(int)); |
---|
| 423 | } |
---|
| 424 | |
---|
| 425 | inline static unsigned long* initsevS (const int maxnr) |
---|
| 426 | { |
---|
| 427 | return (unsigned long*)omAlloc0(maxnr*sizeof(unsigned long)); |
---|
| 428 | } |
---|
| 429 | inline static int* initS_2_R (const int maxnr) |
---|
| 430 | { |
---|
| 431 | return (int*)omAlloc0(maxnr*sizeof(int)); |
---|
| 432 | } |
---|
| 433 | |
---|
| 434 | static inline void enlargeT (TSet &T, TObject** &R, unsigned long* &sevT, |
---|
| 435 | int &length, const int incr) |
---|
| 436 | { |
---|
| 437 | assume(T!=NULL); |
---|
| 438 | assume(sevT!=NULL); |
---|
| 439 | assume(R!=NULL); |
---|
| 440 | assume((length+incr) > 0); |
---|
| 441 | |
---|
| 442 | int i; |
---|
| 443 | T = (TSet)omRealloc0Size(T, length*sizeof(TObject), |
---|
| 444 | (length+incr)*sizeof(TObject)); |
---|
| 445 | |
---|
| 446 | sevT = (unsigned long*) omReallocSize(sevT, length*sizeof(long*), |
---|
| 447 | (length+incr)*sizeof(long*)); |
---|
| 448 | |
---|
| 449 | R = (TObject**)omRealloc0Size(R,length*sizeof(TObject*), |
---|
| 450 | (length+incr)*sizeof(TObject*)); |
---|
| 451 | for (i=length-1;i>=0;i--) R[T[i].i_r] = &(T[i]); |
---|
| 452 | length += incr; |
---|
| 453 | } |
---|
| 454 | |
---|
| 455 | void cleanT (kStrategy strat) |
---|
| 456 | { |
---|
| 457 | int i,j; |
---|
| 458 | poly p; |
---|
| 459 | assume(currRing == strat->tailRing || strat->tailRing != NULL); |
---|
| 460 | |
---|
| 461 | pShallowCopyDeleteProc p_shallow_copy_delete = |
---|
| 462 | (strat->tailRing != currRing ? |
---|
| 463 | pGetShallowCopyDeleteProc(strat->tailRing, currRing) : |
---|
| 464 | NULL); |
---|
| 465 | |
---|
| 466 | for (j=0; j<=strat->tl; j++) |
---|
| 467 | { |
---|
| 468 | p = strat->T[j].p; |
---|
| 469 | strat->T[j].p=NULL; |
---|
| 470 | if (strat->T[j].max != NULL) |
---|
| 471 | { |
---|
| 472 | p_LmFree(strat->T[j].max, strat->tailRing); |
---|
| 473 | } |
---|
| 474 | i = -1; |
---|
| 475 | loop |
---|
| 476 | { |
---|
| 477 | i++; |
---|
| 478 | if (i>strat->sl) |
---|
| 479 | { |
---|
| 480 | if (strat->T[j].t_p != NULL) |
---|
| 481 | { |
---|
| 482 | p_Delete(&(strat->T[j].t_p), strat->tailRing); |
---|
| 483 | p_LmFree(p, currRing); |
---|
| 484 | } |
---|
| 485 | else |
---|
| 486 | pDelete(&p); |
---|
| 487 | break; |
---|
| 488 | } |
---|
| 489 | if (p == strat->S[i]) |
---|
| 490 | { |
---|
| 491 | if (strat->T[j].t_p != NULL) |
---|
| 492 | { |
---|
| 493 | assume(p_shallow_copy_delete != NULL); |
---|
| 494 | pNext(p) = p_shallow_copy_delete(pNext(p),strat->tailRing,currRing, |
---|
| 495 | currRing->PolyBin); |
---|
| 496 | p_LmFree(strat->T[j].t_p, strat->tailRing); |
---|
| 497 | } |
---|
| 498 | break; |
---|
| 499 | } |
---|
| 500 | } |
---|
| 501 | } |
---|
| 502 | strat->tl=-1; |
---|
| 503 | } |
---|
| 504 | |
---|
| 505 | //LSet initL () |
---|
| 506 | //{ |
---|
| 507 | // int i; |
---|
| 508 | // LSet l = (LSet)omAlloc(setmaxL*sizeof(LObject)); |
---|
| 509 | // return l; |
---|
| 510 | //} |
---|
| 511 | |
---|
| 512 | static inline void enlargeL (LSet* L,int* length,const int incr) |
---|
| 513 | { |
---|
| 514 | assume((*L)!=NULL); |
---|
| 515 | assume((length+incr)>0); |
---|
| 516 | |
---|
| 517 | *L = (LSet)omReallocSize((*L),(*length)*sizeof(LObject), |
---|
| 518 | ((*length)+incr)*sizeof(LObject)); |
---|
| 519 | (*length) += incr; |
---|
| 520 | } |
---|
| 521 | |
---|
| 522 | void initPairtest(kStrategy strat) |
---|
| 523 | { |
---|
| 524 | strat->pairtest = (BOOLEAN *)omAlloc0((strat->sl+2)*sizeof(BOOLEAN)); |
---|
| 525 | } |
---|
| 526 | |
---|
| 527 | /*2 |
---|
| 528 | *test whether (p1,p2) or (p2,p1) is in L up position length |
---|
| 529 | *it returns TRUE if yes and the position k |
---|
| 530 | */ |
---|
| 531 | BOOLEAN isInPairsetL(int length,poly p1,poly p2,int* k,kStrategy strat) |
---|
| 532 | { |
---|
| 533 | LObject *p=&(strat->L[length]); |
---|
| 534 | |
---|
| 535 | *k = length; |
---|
| 536 | loop |
---|
| 537 | { |
---|
| 538 | if ((*k) < 0) return FALSE; |
---|
| 539 | if (((p1 == (*p).p1) && (p2 == (*p).p2)) |
---|
| 540 | || ((p1 == (*p).p2) && (p2 == (*p).p1))) |
---|
| 541 | return TRUE; |
---|
| 542 | (*k)--; |
---|
| 543 | p--; |
---|
| 544 | } |
---|
| 545 | } |
---|
| 546 | |
---|
| 547 | /*2 |
---|
| 548 | *in B all pairs have the same element p on the right |
---|
| 549 | *it tests whether (q,p) is in B and returns TRUE if yes |
---|
| 550 | *and the position k |
---|
| 551 | */ |
---|
| 552 | BOOLEAN isInPairsetB(poly q,int* k,kStrategy strat) |
---|
| 553 | { |
---|
| 554 | LObject *p=&(strat->B[strat->Bl]); |
---|
| 555 | |
---|
| 556 | *k = strat->Bl; |
---|
| 557 | loop |
---|
| 558 | { |
---|
| 559 | if ((*k) < 0) return FALSE; |
---|
| 560 | if (q == (*p).p1) |
---|
| 561 | return TRUE; |
---|
| 562 | (*k)--; |
---|
| 563 | p--; |
---|
| 564 | } |
---|
| 565 | } |
---|
| 566 | |
---|
| 567 | int kFindInT(poly p, TSet T, int tlength) |
---|
| 568 | { |
---|
| 569 | int i; |
---|
| 570 | |
---|
| 571 | for (i=0; i<=tlength; i++) |
---|
| 572 | { |
---|
| 573 | if (T[i].p == p) return i; |
---|
| 574 | } |
---|
| 575 | return -1; |
---|
| 576 | } |
---|
| 577 | |
---|
| 578 | int kFindInT(poly p, kStrategy strat) |
---|
| 579 | { |
---|
| 580 | int i; |
---|
| 581 | do |
---|
| 582 | { |
---|
| 583 | i = kFindInT(p, strat->T, strat->tl); |
---|
| 584 | if (i >= 0) return i; |
---|
| 585 | strat = strat->next; |
---|
| 586 | } |
---|
| 587 | while (strat != NULL); |
---|
| 588 | return -1; |
---|
| 589 | } |
---|
| 590 | |
---|
| 591 | #ifdef KDEBUG |
---|
| 592 | |
---|
| 593 | void sTObject::wrp() |
---|
| 594 | { |
---|
| 595 | if (t_p != NULL) p_wrp(t_p, tailRing); |
---|
| 596 | else if (p != NULL) p_wrp(p, currRing, tailRing); |
---|
| 597 | else ::wrp(NULL); |
---|
| 598 | } |
---|
| 599 | |
---|
| 600 | #define kFalseReturn(x) do { if (!x) return FALSE;} while (0) |
---|
| 601 | |
---|
| 602 | // check that Lm's of a poly from T are "equal" |
---|
| 603 | static const char* kTest_LmEqual(poly p, poly t_p, ring tailRing) |
---|
| 604 | { |
---|
| 605 | int i; |
---|
| 606 | for (i=1; i<=tailRing->N; i++) |
---|
| 607 | { |
---|
| 608 | if (p_GetExp(p, i, currRing) != p_GetExp(t_p, i, tailRing)) |
---|
| 609 | return "Lm[i] different"; |
---|
| 610 | } |
---|
| 611 | if (p_GetComp(p, currRing) != p_GetComp(t_p, tailRing)) |
---|
| 612 | return "Lm[0] different"; |
---|
| 613 | if (pNext(p) != pNext(t_p)) |
---|
| 614 | return "Lm.next different"; |
---|
| 615 | if (pGetCoeff(p) != pGetCoeff(t_p)) |
---|
| 616 | return "Lm.coeff different"; |
---|
| 617 | return NULL; |
---|
| 618 | } |
---|
| 619 | |
---|
| 620 | static BOOLEAN sloppy_max = FALSE; |
---|
| 621 | BOOLEAN kTest_T(TObject * T, ring strat_tailRing, int i, char TN) |
---|
| 622 | { |
---|
| 623 | ring tailRing = T->tailRing; |
---|
| 624 | if (strat_tailRing == NULL) strat_tailRing = tailRing; |
---|
| 625 | r_assume(strat_tailRing == tailRing); |
---|
| 626 | |
---|
| 627 | poly p = T->p; |
---|
| 628 | ring r = currRing; |
---|
| 629 | |
---|
| 630 | if (T->p == NULL && T->t_p == NULL && i >= 0) |
---|
| 631 | return dReportError("%c[%d].poly is NULL", TN, i); |
---|
| 632 | |
---|
| 633 | if (T->tailRing != currRing) |
---|
| 634 | { |
---|
| 635 | if (T->t_p == NULL && i > 0) |
---|
| 636 | return dReportError("%c[%d].t_p is NULL", TN, i); |
---|
| 637 | pFalseReturn(p_Test(T->t_p, T->tailRing)); |
---|
| 638 | if (T->p != NULL) pFalseReturn(p_LmTest(T->p, currRing)); |
---|
| 639 | if (T->p != NULL && T->t_p != NULL) |
---|
| 640 | { |
---|
| 641 | const char* msg = kTest_LmEqual(T->p, T->t_p, T->tailRing); |
---|
| 642 | if (msg != NULL) |
---|
| 643 | return dReportError("%c[%d] %s", TN, i, msg); |
---|
| 644 | r = T->tailRing; |
---|
| 645 | p = T->t_p; |
---|
| 646 | } |
---|
| 647 | if (T->p == NULL) |
---|
| 648 | { |
---|
| 649 | p = T->t_p; |
---|
| 650 | r = T->tailRing; |
---|
| 651 | } |
---|
| 652 | if (T->t_p != NULL && i >= 0 && TN == 'T') |
---|
| 653 | { |
---|
| 654 | if (pNext(T->t_p) == NULL) |
---|
| 655 | { |
---|
| 656 | if (T->max != NULL) |
---|
| 657 | return dReportError("%c[%d].max is not NULL as it should be", TN, i); |
---|
| 658 | } |
---|
| 659 | else |
---|
| 660 | { |
---|
| 661 | if (T->max == NULL) |
---|
| 662 | return dReportError("%c[%d].max is NULL", TN, i); |
---|
| 663 | if (pNext(T->max) != NULL) |
---|
| 664 | return dReportError("pNext(%c[%d].max) != NULL", TN, i); |
---|
| 665 | |
---|
| 666 | pFalseReturn(p_CheckPolyRing(T->max, tailRing)); |
---|
| 667 | omCheckBinAddrSize(T->max, (tailRing->PolyBin->sizeW)*SIZEOF_LONG); |
---|
| 668 | #if KDEBUG > 0 |
---|
| 669 | if (! sloppy_max) |
---|
| 670 | { |
---|
| 671 | poly test_max = p_GetMaxExpP(pNext(T->t_p), tailRing); |
---|
| 672 | p_Setm(T->max, tailRing); |
---|
| 673 | p_Setm(test_max, tailRing); |
---|
| 674 | BOOLEAN equal = p_ExpVectorEqual(T->max, test_max, tailRing); |
---|
| 675 | if (! equal) |
---|
| 676 | return dReportError("%c[%d].max out of sync", TN, i); |
---|
| 677 | p_LmFree(test_max, tailRing); |
---|
| 678 | } |
---|
| 679 | #endif |
---|
| 680 | } |
---|
| 681 | } |
---|
| 682 | } |
---|
| 683 | else |
---|
| 684 | { |
---|
| 685 | if (T->max != NULL) |
---|
| 686 | return dReportError("%c[%d].max != NULL but tailRing == currRing",TN,i); |
---|
| 687 | if (T->t_p != NULL) |
---|
| 688 | return dReportError("%c[%d].t_p != NULL but tailRing == currRing",TN,i); |
---|
| 689 | if (T->p == NULL && i > 0) |
---|
| 690 | return dReportError("%c[%d].p is NULL", TN, i); |
---|
| 691 | pFalseReturn(p_Test(T->p, currRing)); |
---|
| 692 | } |
---|
| 693 | |
---|
[54c558] | 694 | if (i >= 0 && T->pLength != 0 |
---|
| 695 | && ! rIsSyzIndexRing(currRing) && T->pLength != pLength(p)) |
---|
[f41347f] | 696 | { |
---|
| 697 | int l=T->pLength; |
---|
| 698 | T->pLength=pLength(p); |
---|
| 699 | return dReportError("%c[%d] pLength error: has %d, specified to have %d", |
---|
| 700 | TN, i , pLength(p), l); |
---|
| 701 | } |
---|
| 702 | |
---|
| 703 | // check FDeg, for elements in L and T |
---|
| 704 | if (i >= 0 && (TN == 'T' || TN == 'L')) |
---|
| 705 | { |
---|
| 706 | // FDeg has ir element from T of L set |
---|
| 707 | if (T->FDeg != T->pFDeg()) |
---|
| 708 | { |
---|
| 709 | int d=T->FDeg; |
---|
| 710 | T->FDeg=T->pFDeg(); |
---|
| 711 | return dReportError("%c[%d] FDeg error: has %d, specified to have %d", |
---|
| 712 | TN, i , T->pFDeg(), d); |
---|
| 713 | } |
---|
| 714 | } |
---|
| 715 | |
---|
| 716 | // check is_normalized for elements in T |
---|
| 717 | if (i >= 0 && TN == 'T') |
---|
| 718 | { |
---|
| 719 | if (T->is_normalized && ! nIsOne(pGetCoeff(p))) |
---|
| 720 | return dReportError("T[%d] is_normalized error", i); |
---|
| 721 | |
---|
| 722 | } |
---|
| 723 | return TRUE; |
---|
| 724 | } |
---|
| 725 | |
---|
| 726 | BOOLEAN kTest_L(LObject *L, ring strat_tailRing, |
---|
| 727 | BOOLEAN testp, int lpos, TSet T, int tlength) |
---|
| 728 | { |
---|
| 729 | if (testp) |
---|
| 730 | { |
---|
| 731 | poly pn = NULL; |
---|
| 732 | if (L->bucket != NULL) |
---|
| 733 | { |
---|
| 734 | kFalseReturn(kbTest(L->bucket)); |
---|
| 735 | r_assume(L->bucket->bucket_ring == L->tailRing); |
---|
| 736 | if (L->p != NULL && pNext(L->p) != NULL) |
---|
| 737 | { |
---|
| 738 | pn = pNext(L->p); |
---|
| 739 | pNext(L->p) = NULL; |
---|
| 740 | } |
---|
| 741 | } |
---|
| 742 | kFalseReturn(kTest_T(L, strat_tailRing, lpos, 'L')); |
---|
| 743 | if (pn != NULL) |
---|
| 744 | pNext(L->p) = pn; |
---|
| 745 | |
---|
| 746 | ring r; |
---|
| 747 | poly p; |
---|
| 748 | L->GetLm(p, r); |
---|
| 749 | if (L->sev != 0 && p_GetShortExpVector(p, r) != L->sev) |
---|
| 750 | { |
---|
| 751 | return dReportError("L[%d] wrong sev: has %o, specified to have %o", |
---|
| 752 | lpos, p_GetShortExpVector(p, r), L->sev); |
---|
| 753 | } |
---|
| 754 | if (lpos > 0 && L->last != NULL && pLast(p) != L->last) |
---|
| 755 | { |
---|
| 756 | return dReportError("L[%d] last wrong: has %p specified to have %p", |
---|
| 757 | lpos, pLast(p), L->last); |
---|
| 758 | } |
---|
| 759 | } |
---|
| 760 | if (L->p1 == NULL) |
---|
| 761 | { |
---|
| 762 | // L->p2 either NULL or "normal" poly |
---|
| 763 | pFalseReturn(pp_Test(L->p2, currRing, L->tailRing)); |
---|
| 764 | } |
---|
| 765 | else if (tlength > 0 && T != NULL && (lpos >=0)) |
---|
| 766 | { |
---|
| 767 | // now p1 and p2 must be != NULL and must be contained in T |
---|
| 768 | int i; |
---|
| 769 | i = kFindInT(L->p1, T, tlength); |
---|
| 770 | if (i < 0) |
---|
| 771 | return dReportError("L[%d].p1 not in T",lpos); |
---|
| 772 | i = kFindInT(L->p2, T, tlength); |
---|
| 773 | if (i < 0) |
---|
| 774 | return dReportError("L[%d].p2 not in T",lpos); |
---|
| 775 | } |
---|
| 776 | return TRUE; |
---|
| 777 | } |
---|
| 778 | |
---|
| 779 | BOOLEAN kTest (kStrategy strat) |
---|
| 780 | { |
---|
| 781 | int i; |
---|
| 782 | |
---|
| 783 | // test P |
---|
| 784 | kFalseReturn(kTest_L(&(strat->P), strat->tailRing, |
---|
| 785 | (strat->P.p != NULL && pNext(strat->P.p)!=strat->tail), |
---|
| 786 | -1, strat->T, strat->tl)); |
---|
| 787 | |
---|
| 788 | // test T |
---|
| 789 | if (strat->T != NULL) |
---|
| 790 | { |
---|
| 791 | for (i=0; i<=strat->tl; i++) |
---|
| 792 | { |
---|
| 793 | kFalseReturn(kTest_T(&(strat->T[i]), strat->tailRing, i, 'T')); |
---|
| 794 | if (strat->sevT[i] != pGetShortExpVector(strat->T[i].p)) |
---|
| 795 | return dReportError("strat->sevT[%d] out of sync", i); |
---|
| 796 | } |
---|
| 797 | } |
---|
| 798 | |
---|
| 799 | // test L |
---|
| 800 | if (strat->L != NULL) |
---|
| 801 | { |
---|
| 802 | for (i=0; i<=strat->Ll; i++) |
---|
| 803 | { |
---|
| 804 | kFalseReturn(kTest_L(&(strat->L[i]), strat->tailRing, |
---|
| 805 | strat->L[i].Next() != strat->tail, i, |
---|
| 806 | strat->T, strat->tl)); |
---|
[d3e630] | 807 | // may be unused |
---|
| 808 | //if (strat->use_buckets && strat->L[i].Next() != strat->tail && |
---|
| 809 | // strat->L[i].Next() != NULL && strat->L[i].p1 != NULL) |
---|
| 810 | //{ |
---|
| 811 | // assume(strat->L[i].bucket != NULL); |
---|
| 812 | //} |
---|
[f41347f] | 813 | } |
---|
| 814 | } |
---|
| 815 | |
---|
| 816 | // test S |
---|
| 817 | if (strat->S != NULL) |
---|
| 818 | kFalseReturn(kTest_S(strat)); |
---|
| 819 | |
---|
| 820 | return TRUE; |
---|
| 821 | } |
---|
| 822 | |
---|
| 823 | BOOLEAN kTest_S(kStrategy strat) |
---|
| 824 | { |
---|
| 825 | int i; |
---|
| 826 | BOOLEAN ret = TRUE; |
---|
| 827 | for (i=0; i<=strat->sl; i++) |
---|
| 828 | { |
---|
| 829 | if (strat->S[i] != NULL && |
---|
| 830 | strat->sevS[i] != pGetShortExpVector(strat->S[i])) |
---|
| 831 | { |
---|
| 832 | return dReportError("S[%d] wrong sev: has %o, specified to have %o", |
---|
| 833 | i , pGetShortExpVector(strat->S[i]), strat->sevS[i]); |
---|
| 834 | } |
---|
| 835 | } |
---|
| 836 | return ret; |
---|
| 837 | } |
---|
| 838 | |
---|
| 839 | |
---|
| 840 | |
---|
| 841 | BOOLEAN kTest_TS(kStrategy strat) |
---|
| 842 | { |
---|
| 843 | int i, j; |
---|
| 844 | BOOLEAN ret = TRUE; |
---|
| 845 | kFalseReturn(kTest(strat)); |
---|
| 846 | |
---|
| 847 | // test strat->R, strat->T[i].i_r |
---|
| 848 | for (i=0; i<=strat->tl; i++) |
---|
| 849 | { |
---|
| 850 | if (strat->T[i].i_r < 0 || strat->T[i].i_r > strat->tl) |
---|
| 851 | return dReportError("strat->T[%d].i_r == %d out of bounds", i, |
---|
| 852 | strat->T[i].i_r); |
---|
| 853 | if (strat->R[strat->T[i].i_r] != &(strat->T[i])) |
---|
| 854 | return dReportError("T[%d].i_r with R out of sync", i); |
---|
| 855 | } |
---|
| 856 | // test containment of S inT |
---|
| 857 | if (strat->S != NULL) |
---|
| 858 | { |
---|
| 859 | for (i=0; i<=strat->sl; i++) |
---|
| 860 | { |
---|
| 861 | j = kFindInT(strat->S[i], strat->T, strat->tl); |
---|
| 862 | if (j < 0) |
---|
| 863 | return dReportError("S[%d] not in T", i); |
---|
| 864 | if (strat->S_2_R[i] != strat->T[j].i_r) |
---|
| 865 | return dReportError("S_2_R[%d]=%d != T[%d].i_r=%d\n", |
---|
| 866 | i, strat->S_2_R[i], j, strat->T[j].i_r); |
---|
| 867 | } |
---|
| 868 | } |
---|
| 869 | // test strat->L[i].i_r1 |
---|
| 870 | for (i=0; i<=strat->Ll; i++) |
---|
| 871 | { |
---|
| 872 | if (strat->L[i].p1 != NULL && strat->L[i].p2) |
---|
| 873 | { |
---|
| 874 | if (strat->L[i].i_r1 < 0 || |
---|
| 875 | strat->L[i].i_r1 > strat->tl || |
---|
| 876 | strat->L[i].T_1(strat)->p != strat->L[i].p1) |
---|
| 877 | return dReportError("L[%d].i_r1 out of sync", i); |
---|
| 878 | if (strat->L[i].i_r2 < 0 || |
---|
| 879 | strat->L[i].i_r2 > strat->tl || |
---|
| 880 | strat->L[i].T_2(strat)->p != strat->L[i].p2); |
---|
| 881 | } |
---|
| 882 | else |
---|
| 883 | { |
---|
| 884 | if (strat->L[i].i_r1 != -1) |
---|
| 885 | return dReportError("L[%d].i_r1 out of sync", i); |
---|
| 886 | if (strat->L[i].i_r2 != -1) |
---|
| 887 | return dReportError("L[%d].i_r2 out of sync", i); |
---|
| 888 | } |
---|
| 889 | if (strat->L[i].i_r != -1) |
---|
| 890 | return dReportError("L[%d].i_r out of sync", i); |
---|
| 891 | } |
---|
| 892 | return TRUE; |
---|
| 893 | } |
---|
| 894 | |
---|
| 895 | #endif // KDEBUG |
---|
| 896 | |
---|
| 897 | /*2 |
---|
| 898 | *cancels the i-th polynomial in the standardbase s |
---|
| 899 | */ |
---|
| 900 | void deleteInS (int i,kStrategy strat) |
---|
| 901 | { |
---|
| 902 | #ifdef ENTER_USE_MEMMOVE |
---|
| 903 | memmove(&(strat->S[i]), &(strat->S[i+1]), (strat->sl - i)*sizeof(poly)); |
---|
| 904 | memmove(&(strat->ecartS[i]),&(strat->ecartS[i+1]),(strat->sl - i)*sizeof(int)); |
---|
| 905 | memmove(&(strat->sevS[i]),&(strat->sevS[i+1]),(strat->sl - i)*sizeof(long)); |
---|
| 906 | memmove(&(strat->S_2_R[i]),&(strat->S_2_R[i+1]),(strat->sl - i)*sizeof(int)); |
---|
| 907 | #else |
---|
| 908 | int j; |
---|
| 909 | for (j=i; j<strat->sl; j++) |
---|
| 910 | { |
---|
| 911 | strat->S[j] = strat->S[j+1]; |
---|
| 912 | strat->ecartS[j] = strat->ecartS[j+1]; |
---|
| 913 | strat->sevS[j] = strat->sevS[j+1]; |
---|
| 914 | strat->S_2_R[j] = strat->S_2_R[j+1]; |
---|
| 915 | } |
---|
| 916 | #endif |
---|
| 917 | if (strat->lenS!=NULL) |
---|
| 918 | { |
---|
| 919 | #ifdef ENTER_USE_MEMMOVE |
---|
| 920 | memmove(&(strat->lenS[i]),&(strat->lenS[i+1]),(strat->sl - i)*sizeof(int)); |
---|
| 921 | #else |
---|
| 922 | for (j=i; j<strat->sl; j++) strat->lenS[j] = strat->lenS[j+1]; |
---|
| 923 | #endif |
---|
| 924 | } |
---|
| 925 | if (strat->lenSw!=NULL) |
---|
| 926 | { |
---|
| 927 | #ifdef ENTER_USE_MEMMOVE |
---|
| 928 | memmove(&(strat->lenSw[i]),&(strat->lenSw[i+1]),(strat->sl - i)*sizeof(wlen_type)); |
---|
| 929 | #else |
---|
| 930 | for (j=i; j<strat->sl; j++) strat->lenSw[j] = strat->lenSw[j+1]; |
---|
| 931 | #endif |
---|
| 932 | } |
---|
| 933 | if (strat->fromQ!=NULL) |
---|
| 934 | { |
---|
| 935 | #ifdef ENTER_USE_MEMMOVE |
---|
| 936 | memmove(&(strat->fromQ[i]),&(strat->fromQ[i+1]),(strat->sl - i)*sizeof(int)); |
---|
| 937 | #else |
---|
| 938 | for (j=i; j<strat->sl; j++) |
---|
| 939 | { |
---|
| 940 | strat->fromQ[j] = strat->fromQ[j+1]; |
---|
| 941 | } |
---|
| 942 | #endif |
---|
| 943 | } |
---|
| 944 | strat->S[strat->sl] = NULL; |
---|
| 945 | strat->sl--; |
---|
| 946 | } |
---|
| 947 | |
---|
| 948 | /*2 |
---|
| 949 | *cancels the j-th polynomial in the set |
---|
| 950 | */ |
---|
| 951 | void deleteInL (LSet set, int *length, int j,kStrategy strat) |
---|
| 952 | { |
---|
| 953 | if (set[j].lcm!=NULL) |
---|
| 954 | { |
---|
| 955 | #ifdef HAVE_RINGS |
---|
| 956 | if (pGetCoeff(set[j].lcm) != NULL) |
---|
| 957 | pLmDelete(set[j].lcm); |
---|
| 958 | else |
---|
| 959 | #endif |
---|
| 960 | pLmFree(set[j].lcm); |
---|
| 961 | } |
---|
| 962 | if (set[j].p!=NULL) |
---|
| 963 | { |
---|
| 964 | if (pNext(set[j].p) == strat->tail) |
---|
| 965 | { |
---|
| 966 | #ifdef HAVE_RINGS |
---|
| 967 | if (pGetCoeff(set[j].p) != NULL) |
---|
| 968 | pLmDelete(set[j].p); |
---|
| 969 | else |
---|
| 970 | #endif |
---|
| 971 | pLmFree(set[j].p); |
---|
| 972 | /*- tail belongs to several int spolys -*/ |
---|
| 973 | } |
---|
| 974 | else |
---|
| 975 | { |
---|
| 976 | // search p in T, if it is there, do not delete it |
---|
| 977 | if (pOrdSgn != -1 || kFindInT(set[j].p, strat) < 0) |
---|
| 978 | { |
---|
| 979 | // assure that for global orderings kFindInT fails |
---|
| 980 | assume(pOrdSgn == -1 || kFindInT(set[j].p, strat) < 0); |
---|
| 981 | set[j].Delete(); |
---|
| 982 | } |
---|
| 983 | } |
---|
| 984 | } |
---|
| 985 | if (*length > 0 && j < *length) |
---|
| 986 | { |
---|
| 987 | #ifdef ENTER_USE_MEMMOVE |
---|
| 988 | memmove(&(set[j]), &(set[j+1]), (*length - j)*sizeof(LObject)); |
---|
| 989 | #else |
---|
| 990 | int i; |
---|
| 991 | for (i=j; i < (*length); i++) |
---|
| 992 | set[i] = set[i+1]; |
---|
| 993 | #endif |
---|
| 994 | } |
---|
| 995 | #ifdef KDEBUG |
---|
| 996 | memset(&(set[*length]),0,sizeof(LObject)); |
---|
| 997 | #endif |
---|
| 998 | (*length)--; |
---|
| 999 | } |
---|
| 1000 | |
---|
| 1001 | /*2 |
---|
| 1002 | *enters p at position at in L |
---|
| 1003 | */ |
---|
| 1004 | void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at) |
---|
| 1005 | { |
---|
| 1006 | #ifdef PDEBUG |
---|
| 1007 | /* zaehler++; */ |
---|
| 1008 | #endif /*PDEBUG*/ |
---|
| 1009 | int i; |
---|
| 1010 | // this should be corrected |
---|
| 1011 | assume(p.FDeg == p.pFDeg()); |
---|
| 1012 | |
---|
| 1013 | if ((*length)>=0) |
---|
| 1014 | { |
---|
| 1015 | if ((*length) == (*LSetmax)-1) enlargeL(set,LSetmax,setmaxLinc); |
---|
| 1016 | if (at <= (*length)) |
---|
| 1017 | #ifdef ENTER_USE_MEMMOVE |
---|
| 1018 | memmove(&((*set)[at+1]), &((*set)[at]), ((*length)-at+1)*sizeof(LObject)); |
---|
| 1019 | #else |
---|
| 1020 | for (i=(*length)+1; i>=at+1; i--) (*set)[i] = (*set)[i-1]; |
---|
| 1021 | #endif |
---|
| 1022 | } |
---|
| 1023 | else at = 0; |
---|
| 1024 | (*set)[at] = p; |
---|
| 1025 | (*length)++; |
---|
| 1026 | } |
---|
| 1027 | |
---|
| 1028 | /*2 |
---|
| 1029 | * computes the normal ecart; |
---|
| 1030 | * used in mora case and if pLexOrder & sugar in bba case |
---|
| 1031 | */ |
---|
| 1032 | void initEcartNormal (LObject* h) |
---|
| 1033 | { |
---|
| 1034 | h->FDeg = h->pFDeg(); |
---|
| 1035 | h->ecart = h->pLDeg() - h->FDeg; |
---|
| 1036 | // h->length is set by h->pLDeg |
---|
| 1037 | h->length=h->pLength=pLength(h->p); |
---|
| 1038 | } |
---|
| 1039 | |
---|
| 1040 | void initEcartBBA (LObject* h) |
---|
| 1041 | { |
---|
| 1042 | h->FDeg = h->pFDeg(); |
---|
| 1043 | (*h).ecart = 0; |
---|
| 1044 | h->length=h->pLength=pLength(h->p); |
---|
| 1045 | } |
---|
| 1046 | |
---|
| 1047 | void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG) |
---|
| 1048 | { |
---|
| 1049 | Lp->FDeg = Lp->pFDeg(); |
---|
| 1050 | (*Lp).ecart = 0; |
---|
| 1051 | (*Lp).length = 0; |
---|
| 1052 | } |
---|
| 1053 | |
---|
| 1054 | void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG) |
---|
| 1055 | { |
---|
| 1056 | Lp->FDeg = Lp->pFDeg(); |
---|
| 1057 | (*Lp).ecart = si_max(ecartF,ecartG); |
---|
| 1058 | (*Lp).ecart = (*Lp).ecart- (Lp->FDeg -pFDeg((*Lp).lcm,currRing)); |
---|
| 1059 | (*Lp).length = 0; |
---|
| 1060 | } |
---|
| 1061 | |
---|
| 1062 | /*2 |
---|
| 1063 | *if ecart1<=ecart2 it returns TRUE |
---|
| 1064 | */ |
---|
| 1065 | static inline BOOLEAN sugarDivisibleBy(int ecart1, int ecart2) |
---|
| 1066 | { |
---|
| 1067 | return (ecart1 <= ecart2); |
---|
| 1068 | } |
---|
| 1069 | |
---|
| 1070 | #ifdef HAVE_RINGS |
---|
| 1071 | /*2 |
---|
| 1072 | * put the pair (s[i],p) into the set B, ecart=ecart(p) (ring case) |
---|
| 1073 | */ |
---|
| 1074 | void enterOnePairRing (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR = -1) |
---|
| 1075 | { |
---|
| 1076 | assume(i<=strat->sl); |
---|
| 1077 | int l,j,compare,compareCoeff; |
---|
| 1078 | LObject Lp; |
---|
| 1079 | |
---|
| 1080 | if (strat->interred_flag) return; |
---|
| 1081 | #ifdef KDEBUG |
---|
| 1082 | Lp.ecart=0; Lp.length=0; |
---|
| 1083 | #endif |
---|
| 1084 | /*- computes the lcm(s[i],p) -*/ |
---|
| 1085 | Lp.lcm = pInit(); |
---|
| 1086 | pSetCoeff0(Lp.lcm, nLcm(pGetCoeff(p), pGetCoeff(strat->S[i]), currRing)); |
---|
| 1087 | // Lp.lcm == 0 |
---|
| 1088 | if (nIsZero(pGetCoeff(Lp.lcm))) |
---|
| 1089 | { |
---|
| 1090 | #ifdef KDEBUG |
---|
| 1091 | if (TEST_OPT_DEBUG) |
---|
| 1092 | { |
---|
| 1093 | PrintS("--- Lp.lcm == 0\n"); |
---|
| 1094 | PrintS("p:"); |
---|
| 1095 | wrp(p); |
---|
| 1096 | Print(" strat->S[%d]:", i); |
---|
| 1097 | wrp(strat->S[i]); |
---|
| 1098 | PrintLn(); |
---|
| 1099 | } |
---|
| 1100 | #endif |
---|
| 1101 | strat->cp++; |
---|
| 1102 | pLmDelete(Lp.lcm); |
---|
| 1103 | return; |
---|
| 1104 | } |
---|
| 1105 | // basic product criterion |
---|
| 1106 | pLcm(p,strat->S[i],Lp.lcm); |
---|
| 1107 | pSetm(Lp.lcm); |
---|
| 1108 | assume(!strat->sugarCrit); |
---|
| 1109 | if (pHasNotCF(p,strat->S[i]) && nIsUnit(pGetCoeff(p)) && nIsUnit(pGetCoeff(strat->S[i]))) |
---|
| 1110 | { |
---|
| 1111 | #ifdef KDEBUG |
---|
| 1112 | if (TEST_OPT_DEBUG) |
---|
| 1113 | { |
---|
| 1114 | PrintS("--- product criterion func enterOnePairRing type 1\n"); |
---|
| 1115 | PrintS("p:"); |
---|
| 1116 | wrp(p); |
---|
| 1117 | Print(" strat->S[%d]:", i); |
---|
| 1118 | wrp(strat->S[i]); |
---|
| 1119 | PrintLn(); |
---|
| 1120 | } |
---|
| 1121 | #endif |
---|
| 1122 | strat->cp++; |
---|
| 1123 | pLmDelete(Lp.lcm); |
---|
| 1124 | return; |
---|
| 1125 | } |
---|
| 1126 | assume(!strat->fromT); |
---|
| 1127 | /* |
---|
| 1128 | *the set B collects the pairs of type (S[j],p) |
---|
| 1129 | *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p) != lcm(r,p) |
---|
| 1130 | *if the leading term of s devides lcm(r,p) then (r,p) will be canceled |
---|
| 1131 | *if the leading term of r devides lcm(s,p) then (s,p) will not enter B |
---|
| 1132 | */ |
---|
| 1133 | for(j = strat->Bl;j>=0;j--) |
---|
| 1134 | { |
---|
| 1135 | compare=pDivCompRing(strat->B[j].lcm,Lp.lcm); |
---|
| 1136 | compareCoeff = nDivComp(pGetCoeff(strat->B[j].lcm), pGetCoeff(Lp.lcm)); |
---|
[91d286] | 1137 | if (compareCoeff == pDivComp_EQUAL || compare == compareCoeff) |
---|
[f41347f] | 1138 | { |
---|
| 1139 | if (compare == 1) |
---|
| 1140 | { |
---|
| 1141 | strat->c3++; |
---|
| 1142 | #ifdef KDEBUG |
---|
| 1143 | if (TEST_OPT_DEBUG) |
---|
| 1144 | { |
---|
| 1145 | PrintS("--- chain criterion type 1\n"); |
---|
| 1146 | PrintS("strat->B[j]:"); |
---|
| 1147 | wrp(strat->B[j].lcm); |
---|
| 1148 | PrintS(" Lp.lcm:"); |
---|
| 1149 | wrp(Lp.lcm); |
---|
| 1150 | PrintLn(); |
---|
| 1151 | } |
---|
| 1152 | #endif |
---|
| 1153 | if ((strat->fromQ==NULL) || (isFromQ==0) || (strat->fromQ[i]==0)) |
---|
| 1154 | { |
---|
| 1155 | pLmDelete(Lp.lcm); |
---|
| 1156 | return; |
---|
| 1157 | } |
---|
| 1158 | break; |
---|
| 1159 | } |
---|
| 1160 | else |
---|
| 1161 | if (compare == -1) |
---|
| 1162 | { |
---|
| 1163 | #ifdef KDEBUG |
---|
| 1164 | if (TEST_OPT_DEBUG) |
---|
| 1165 | { |
---|
| 1166 | PrintS("--- chain criterion type 2\n"); |
---|
| 1167 | Print("strat->B[%d].lcm:",j); |
---|
| 1168 | wrp(strat->B[j].lcm); |
---|
| 1169 | PrintS(" Lp.lcm:"); |
---|
| 1170 | wrp(Lp.lcm); |
---|
| 1171 | PrintLn(); |
---|
| 1172 | } |
---|
| 1173 | #endif |
---|
| 1174 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 1175 | strat->c3++; |
---|
| 1176 | } |
---|
| 1177 | } |
---|
| 1178 | if ((compare == pDivComp_EQUAL) && (compareCoeff != 2)) |
---|
| 1179 | { |
---|
| 1180 | if (compareCoeff == pDivComp_LESS) |
---|
| 1181 | { |
---|
| 1182 | #ifdef KDEBUG |
---|
| 1183 | if (TEST_OPT_DEBUG) |
---|
| 1184 | { |
---|
| 1185 | PrintS("--- chain criterion type 3\n"); |
---|
| 1186 | Print("strat->B[%d].lcm:", j); |
---|
| 1187 | wrp(strat->B[j].lcm); |
---|
| 1188 | PrintS(" Lp.lcm:"); |
---|
| 1189 | wrp(Lp.lcm); |
---|
| 1190 | PrintLn(); |
---|
| 1191 | } |
---|
| 1192 | #endif |
---|
| 1193 | strat->c3++; |
---|
| 1194 | if ((strat->fromQ==NULL) || (isFromQ==0) || (strat->fromQ[i]==0)) |
---|
| 1195 | { |
---|
| 1196 | pLmDelete(Lp.lcm); |
---|
| 1197 | return; |
---|
| 1198 | } |
---|
| 1199 | break; |
---|
| 1200 | } |
---|
| 1201 | else |
---|
| 1202 | // Add hint for same LM and LC (later) (TODO Oliver) |
---|
| 1203 | // if (compareCoeff == pDivComp_GREATER) |
---|
| 1204 | { |
---|
| 1205 | #ifdef KDEBUG |
---|
| 1206 | if (TEST_OPT_DEBUG) |
---|
| 1207 | { |
---|
| 1208 | PrintS("--- chain criterion type 4\n"); |
---|
| 1209 | Print("strat->B[%d].lcm:", j); |
---|
| 1210 | wrp(strat->B[j].lcm); |
---|
| 1211 | PrintS(" Lp.lcm:"); |
---|
| 1212 | wrp(Lp.lcm); |
---|
| 1213 | PrintLn(); |
---|
| 1214 | } |
---|
| 1215 | #endif |
---|
| 1216 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 1217 | strat->c3++; |
---|
| 1218 | } |
---|
| 1219 | } |
---|
| 1220 | } |
---|
| 1221 | /* |
---|
| 1222 | *the pair (S[i],p) enters B if the spoly != 0 |
---|
| 1223 | */ |
---|
| 1224 | /*- compute the short s-polynomial -*/ |
---|
| 1225 | if ((strat->S[i]==NULL) || (p==NULL)) { |
---|
| 1226 | #ifdef KDEBUG |
---|
| 1227 | if (TEST_OPT_DEBUG) |
---|
| 1228 | { |
---|
| 1229 | PrintS("--- spoly = NULL\n"); |
---|
| 1230 | } |
---|
| 1231 | #endif |
---|
| 1232 | pLmDelete(Lp.lcm); |
---|
| 1233 | return; |
---|
| 1234 | } |
---|
| 1235 | if ((strat->fromQ!=NULL) && (isFromQ!=0) && (strat->fromQ[i]!=0)) |
---|
| 1236 | { |
---|
| 1237 | // Is from a previous computed GB, therefore we know that spoly will |
---|
| 1238 | // reduce to zero. Oliver. |
---|
| 1239 | WarnS("Could we come here? 8738947389"); |
---|
| 1240 | Lp.p=NULL; |
---|
| 1241 | } |
---|
| 1242 | else |
---|
| 1243 | { |
---|
| 1244 | Lp.p = ksCreateShortSpoly(strat->S[i], p, strat->tailRing); |
---|
| 1245 | } |
---|
| 1246 | if (Lp.p == NULL) |
---|
| 1247 | { |
---|
| 1248 | #ifdef KDEBUG |
---|
| 1249 | if (TEST_OPT_DEBUG) |
---|
| 1250 | { |
---|
| 1251 | PrintS("--- spoly = NULL\n"); |
---|
| 1252 | } |
---|
| 1253 | #endif |
---|
| 1254 | /*- the case that the s-poly is 0 -*/ |
---|
| 1255 | if (strat->pairtest==NULL) initPairtest(strat); |
---|
| 1256 | strat->pairtest[i] = TRUE;/*- hint for spoly(S^[i],p)=0 -*/ |
---|
| 1257 | strat->pairtest[strat->sl+1] = TRUE; |
---|
| 1258 | /*hint for spoly(S[i],p) == 0 for some i,0 <= i <= sl*/ |
---|
| 1259 | /* |
---|
| 1260 | *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is |
---|
| 1261 | *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not |
---|
| 1262 | *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading |
---|
| 1263 | *term of p devides the lcm(s,r) |
---|
| 1264 | *(this canceling should be done here because |
---|
| 1265 | *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit) |
---|
| 1266 | *the first case is handeled in chainCrit |
---|
| 1267 | */ |
---|
| 1268 | pLmDelete(Lp.lcm); |
---|
| 1269 | } |
---|
| 1270 | else |
---|
| 1271 | { |
---|
| 1272 | /*- the pair (S[i],p) enters B -*/ |
---|
| 1273 | Lp.p1 = strat->S[i]; |
---|
| 1274 | Lp.p2 = p; |
---|
| 1275 | |
---|
| 1276 | pNext(Lp.p) = strat->tail; |
---|
| 1277 | |
---|
| 1278 | if (atR >= 0) |
---|
| 1279 | { |
---|
| 1280 | Lp.i_r2 = atR; |
---|
| 1281 | Lp.i_r1 = strat->S_2_R[i]; |
---|
| 1282 | } |
---|
| 1283 | strat->initEcartPair(&Lp,strat->S[i],p,strat->ecartS[i],ecart); |
---|
| 1284 | l = strat->posInL(strat->B,strat->Bl,&Lp,strat); |
---|
| 1285 | enterL(&strat->B,&strat->Bl,&strat->Bmax,Lp,l); |
---|
| 1286 | } |
---|
| 1287 | } |
---|
| 1288 | |
---|
| 1289 | |
---|
| 1290 | /*2 |
---|
| 1291 | * put the lcm(s[i],p) into the set B |
---|
| 1292 | */ |
---|
| 1293 | |
---|
| 1294 | BOOLEAN enterOneStrongPoly (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR = -1) |
---|
| 1295 | { |
---|
| 1296 | number d, s, t; |
---|
| 1297 | assume(i<=strat->sl); |
---|
| 1298 | assume(atR >= 0); |
---|
| 1299 | poly m1, m2, gcd; |
---|
| 1300 | |
---|
| 1301 | d = nExtGcd(pGetCoeff(p), pGetCoeff(strat->S[i]), &s, &t); |
---|
| 1302 | |
---|
| 1303 | if (nIsZero(s) || nIsZero(t)) // evtl. durch divBy tests ersetzen |
---|
| 1304 | { |
---|
| 1305 | nDelete(&d); |
---|
| 1306 | nDelete(&s); |
---|
| 1307 | nDelete(&t); |
---|
| 1308 | return FALSE; |
---|
| 1309 | } |
---|
| 1310 | |
---|
| 1311 | k_GetStrongLeadTerms(p, strat->S[i], currRing, m1, m2, gcd, strat->tailRing); |
---|
[7a4a43] | 1312 | //p_Test(m1,strat->tailRing); |
---|
| 1313 | //p_Test(m2,strat->tailRing); |
---|
[f41347f] | 1314 | while (! kCheckStrongCreation(atR, m1, i, m2, strat) ) |
---|
| 1315 | { |
---|
| 1316 | memset(&(strat->P), 0, sizeof(strat->P)); |
---|
| 1317 | kStratChangeTailRing(strat); |
---|
| 1318 | strat->P = *(strat->R[atR]); |
---|
| 1319 | p_LmFree(m1, strat->tailRing); |
---|
| 1320 | p_LmFree(m2, strat->tailRing); |
---|
| 1321 | p_LmFree(gcd, currRing); |
---|
| 1322 | k_GetStrongLeadTerms(p, strat->S[i], currRing, m1, m2, gcd, strat->tailRing); |
---|
| 1323 | } |
---|
| 1324 | pSetCoeff0(m1, s); |
---|
| 1325 | pSetCoeff0(m2, t); |
---|
| 1326 | pSetCoeff0(gcd, d); |
---|
[7a4a43] | 1327 | p_Test(m1,strat->tailRing); |
---|
| 1328 | p_Test(m2,strat->tailRing); |
---|
[f41347f] | 1329 | |
---|
| 1330 | #ifdef KDEBUG |
---|
| 1331 | if (TEST_OPT_DEBUG) |
---|
| 1332 | { |
---|
| 1333 | // Print("t = %d; s = %d; d = %d\n", nInt(t), nInt(s), nInt(d)); |
---|
| 1334 | PrintS("m1 = "); |
---|
| 1335 | p_wrp(m1, strat->tailRing); |
---|
| 1336 | PrintS(" ; m2 = "); |
---|
| 1337 | p_wrp(m2, strat->tailRing); |
---|
| 1338 | PrintS(" ; gcd = "); |
---|
| 1339 | wrp(gcd); |
---|
| 1340 | PrintS("\n--- create strong gcd poly: "); |
---|
| 1341 | Print("\n p: ", i); |
---|
| 1342 | wrp(p); |
---|
| 1343 | Print("\n strat->S[%d]: ", i); |
---|
| 1344 | wrp(strat->S[i]); |
---|
| 1345 | PrintS(" ---> "); |
---|
| 1346 | } |
---|
| 1347 | #endif |
---|
| 1348 | |
---|
| 1349 | pNext(gcd) = p_Add_q(pp_Mult_mm(pNext(p), m1, strat->tailRing), pp_Mult_mm(pNext(strat->S[i]), m2, strat->tailRing), strat->tailRing); |
---|
| 1350 | p_LmDelete(m1, strat->tailRing); |
---|
| 1351 | p_LmDelete(m2, strat->tailRing); |
---|
| 1352 | |
---|
| 1353 | #ifdef KDEBUG |
---|
| 1354 | if (TEST_OPT_DEBUG) |
---|
| 1355 | { |
---|
| 1356 | wrp(gcd); |
---|
| 1357 | PrintLn(); |
---|
| 1358 | } |
---|
| 1359 | #endif |
---|
| 1360 | |
---|
| 1361 | LObject h; |
---|
| 1362 | h.p = gcd; |
---|
| 1363 | h.tailRing = strat->tailRing; |
---|
| 1364 | int posx; |
---|
| 1365 | h.pCleardenom(); |
---|
| 1366 | strat->initEcart(&h); |
---|
| 1367 | if (strat->Ll==-1) |
---|
| 1368 | posx =0; |
---|
| 1369 | else |
---|
| 1370 | posx = strat->posInL(strat->L,strat->Ll,&h,strat); |
---|
| 1371 | h.sev = pGetShortExpVector(h.p); |
---|
[59c445] | 1372 | if (currRing!=strat->tailRing) |
---|
| 1373 | h.t_p = k_LmInit_currRing_2_tailRing(h.p, strat->tailRing); |
---|
[f41347f] | 1374 | enterL(&strat->L,&strat->Ll,&strat->Lmax,h,posx); |
---|
| 1375 | return TRUE; |
---|
| 1376 | } |
---|
| 1377 | #endif |
---|
| 1378 | |
---|
| 1379 | /*2 |
---|
| 1380 | * put the pair (s[i],p) into the set B, ecart=ecart(p) |
---|
| 1381 | */ |
---|
| 1382 | |
---|
[6c55ae] | 1383 | void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR = -1) |
---|
[f41347f] | 1384 | { |
---|
| 1385 | assume(i<=strat->sl); |
---|
| 1386 | if (strat->interred_flag) return; |
---|
| 1387 | |
---|
| 1388 | int l,j,compare; |
---|
| 1389 | LObject Lp; |
---|
| 1390 | Lp.i_r = -1; |
---|
| 1391 | |
---|
| 1392 | #ifdef KDEBUG |
---|
| 1393 | Lp.ecart=0; Lp.length=0; |
---|
| 1394 | #endif |
---|
| 1395 | /*- computes the lcm(s[i],p) -*/ |
---|
| 1396 | Lp.lcm = pInit(); |
---|
| 1397 | |
---|
[43cbc0] | 1398 | #ifndef HAVE_RATGRING |
---|
[f41347f] | 1399 | pLcm(p,strat->S[i],Lp.lcm); |
---|
[43cbc0] | 1400 | #elif defined(HAVE_RATGRING) |
---|
| 1401 | // if (rIsRatGRing(currRing)) |
---|
| 1402 | pLcmRat(p,strat->S[i],Lp.lcm, currRing->real_var_start); // int rat_shift |
---|
| 1403 | #endif |
---|
[f41347f] | 1404 | pSetm(Lp.lcm); |
---|
| 1405 | |
---|
| 1406 | |
---|
[cce4a2f] | 1407 | if (strat->sugarCrit && ALLOW_PROD_CRIT(strat)) |
---|
[f41347f] | 1408 | { |
---|
| 1409 | if((!((strat->ecartS[i]>0)&&(ecart>0))) |
---|
| 1410 | && pHasNotCF(p,strat->S[i])) |
---|
| 1411 | { |
---|
| 1412 | /* |
---|
| 1413 | *the product criterion has applied for (s,p), |
---|
| 1414 | *i.e. lcm(s,p)=product of the leading terms of s and p. |
---|
| 1415 | *Suppose (s,r) is in L and the leading term |
---|
| 1416 | *of p divides lcm(s,r) |
---|
| 1417 | *(==> the leading term of p divides the leading term of r) |
---|
| 1418 | *but the leading term of s does not divide the leading term of r |
---|
| 1419 | *(notice that tis condition is automatically satisfied if r is still |
---|
| 1420 | *in S), then (s,r) can be cancelled. |
---|
| 1421 | *This should be done here because the |
---|
| 1422 | *case lcm(s,r)=lcm(s,p) is not covered by chainCrit. |
---|
| 1423 | * |
---|
| 1424 | *Moreover, skipping (s,r) holds also for the noncommutative case. |
---|
| 1425 | */ |
---|
| 1426 | strat->cp++; |
---|
| 1427 | pLmFree(Lp.lcm); |
---|
| 1428 | Lp.lcm=NULL; |
---|
| 1429 | return; |
---|
| 1430 | } |
---|
| 1431 | else |
---|
| 1432 | Lp.ecart = si_max(ecart,strat->ecartS[i]); |
---|
| 1433 | if (strat->fromT && (strat->ecartS[i]>ecart)) |
---|
| 1434 | { |
---|
| 1435 | pLmFree(Lp.lcm); |
---|
| 1436 | Lp.lcm=NULL; |
---|
| 1437 | return; |
---|
| 1438 | /*the pair is (s[i],t[.]), discard it if the ecart is too big*/ |
---|
| 1439 | } |
---|
| 1440 | /* |
---|
| 1441 | *the set B collects the pairs of type (S[j],p) |
---|
| 1442 | *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p) |
---|
| 1443 | *if the leading term of s devides lcm(r,p) then (r,p) will be canceled |
---|
| 1444 | *if the leading term of r devides lcm(s,p) then (s,p) will not enter B |
---|
| 1445 | */ |
---|
| 1446 | { |
---|
| 1447 | j = strat->Bl; |
---|
| 1448 | loop |
---|
| 1449 | { |
---|
| 1450 | if (j < 0) break; |
---|
| 1451 | compare=pDivComp(strat->B[j].lcm,Lp.lcm); |
---|
| 1452 | if ((compare==1) |
---|
| 1453 | &&(sugarDivisibleBy(strat->B[j].ecart,Lp.ecart))) |
---|
| 1454 | { |
---|
| 1455 | strat->c3++; |
---|
| 1456 | if ((strat->fromQ==NULL) || (isFromQ==0) || (strat->fromQ[i]==0)) |
---|
| 1457 | { |
---|
| 1458 | pLmFree(Lp.lcm); |
---|
| 1459 | return; |
---|
| 1460 | } |
---|
| 1461 | break; |
---|
| 1462 | } |
---|
| 1463 | else |
---|
| 1464 | if ((compare ==-1) |
---|
| 1465 | && sugarDivisibleBy(Lp.ecart,strat->B[j].ecart)) |
---|
| 1466 | { |
---|
| 1467 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 1468 | strat->c3++; |
---|
| 1469 | } |
---|
| 1470 | j--; |
---|
| 1471 | } |
---|
| 1472 | } |
---|
| 1473 | } |
---|
| 1474 | else /*sugarcrit*/ |
---|
| 1475 | { |
---|
[cce4a2f] | 1476 | if (ALLOW_PROD_CRIT(strat)) |
---|
[f41347f] | 1477 | { |
---|
| 1478 | // if currRing->nc_type!=quasi (or skew) |
---|
| 1479 | // TODO: enable productCrit for super commutative algebras... |
---|
| 1480 | if(/*(strat->ak==0) && productCrit(p,strat->S[i])*/ |
---|
| 1481 | pHasNotCF(p,strat->S[i])) |
---|
| 1482 | { |
---|
| 1483 | /* |
---|
| 1484 | *the product criterion has applied for (s,p), |
---|
| 1485 | *i.e. lcm(s,p)=product of the leading terms of s and p. |
---|
| 1486 | *Suppose (s,r) is in L and the leading term |
---|
| 1487 | *of p devides lcm(s,r) |
---|
| 1488 | *(==> the leading term of p devides the leading term of r) |
---|
| 1489 | *but the leading term of s does not devide the leading term of r |
---|
| 1490 | *(notice that tis condition is automatically satisfied if r is still |
---|
| 1491 | *in S), then (s,r) can be canceled. |
---|
| 1492 | *This should be done here because the |
---|
| 1493 | *case lcm(s,r)=lcm(s,p) is not covered by chainCrit. |
---|
| 1494 | */ |
---|
| 1495 | strat->cp++; |
---|
| 1496 | pLmFree(Lp.lcm); |
---|
| 1497 | Lp.lcm=NULL; |
---|
| 1498 | return; |
---|
| 1499 | } |
---|
| 1500 | if (strat->fromT && (strat->ecartS[i]>ecart)) |
---|
| 1501 | { |
---|
| 1502 | pLmFree(Lp.lcm); |
---|
| 1503 | Lp.lcm=NULL; |
---|
| 1504 | return; |
---|
| 1505 | /*the pair is (s[i],t[.]), discard it if the ecart is too big*/ |
---|
| 1506 | } |
---|
| 1507 | /* |
---|
| 1508 | *the set B collects the pairs of type (S[j],p) |
---|
| 1509 | *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p) |
---|
| 1510 | *if the leading term of s devides lcm(r,p) then (r,p) will be canceled |
---|
| 1511 | *if the leading term of r devides lcm(s,p) then (s,p) will not enter B |
---|
| 1512 | */ |
---|
| 1513 | for(j = strat->Bl;j>=0;j--) |
---|
| 1514 | { |
---|
| 1515 | compare=pDivComp(strat->B[j].lcm,Lp.lcm); |
---|
| 1516 | if (compare==1) |
---|
| 1517 | { |
---|
| 1518 | strat->c3++; |
---|
| 1519 | if ((strat->fromQ==NULL) || (isFromQ==0) || (strat->fromQ[i]==0)) |
---|
| 1520 | { |
---|
| 1521 | pLmFree(Lp.lcm); |
---|
| 1522 | return; |
---|
| 1523 | } |
---|
| 1524 | break; |
---|
| 1525 | } |
---|
| 1526 | else |
---|
| 1527 | if (compare ==-1) |
---|
| 1528 | { |
---|
| 1529 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 1530 | strat->c3++; |
---|
| 1531 | } |
---|
| 1532 | } |
---|
| 1533 | } |
---|
| 1534 | } |
---|
| 1535 | /* |
---|
| 1536 | *the pair (S[i],p) enters B if the spoly != 0 |
---|
| 1537 | */ |
---|
| 1538 | /*- compute the short s-polynomial -*/ |
---|
| 1539 | if (strat->fromT && !TEST_OPT_INTSTRATEGY) |
---|
| 1540 | pNorm(p); |
---|
| 1541 | |
---|
| 1542 | if ((strat->S[i]==NULL) || (p==NULL)) |
---|
| 1543 | return; |
---|
| 1544 | |
---|
| 1545 | if ((strat->fromQ!=NULL) && (isFromQ!=0) && (strat->fromQ[i]!=0)) |
---|
| 1546 | Lp.p=NULL; |
---|
| 1547 | else |
---|
| 1548 | { |
---|
| 1549 | #ifdef HAVE_PLURAL |
---|
[a794e7] | 1550 | if ( rIsPluralRing(currRing) ) |
---|
[f41347f] | 1551 | { |
---|
| 1552 | if(pHasNotCF(p, strat->S[i])) |
---|
| 1553 | { |
---|
[cf218e8] | 1554 | if(ncRingType(currRing) == nc_lie) |
---|
| 1555 | { |
---|
| 1556 | // generalized prod-crit for lie-type |
---|
| 1557 | strat->cp++; |
---|
| 1558 | Lp.p = nc_p_Bracket_qq(pCopy(p),strat->S[i]); |
---|
| 1559 | } |
---|
| 1560 | else |
---|
[cce4a2f] | 1561 | if( ALLOW_PROD_CRIT(strat) ) |
---|
[f41347f] | 1562 | { |
---|
| 1563 | // product criterion for homogeneous case in SCA |
---|
| 1564 | strat->cp++; |
---|
| 1565 | Lp.p = NULL; |
---|
| 1566 | } |
---|
| 1567 | else |
---|
[cf218e8] | 1568 | { |
---|
[9f17c9] | 1569 | Lp.p = // nc_CreateSpoly(strat->S[i],p,currRing); |
---|
[cf218e8] | 1570 | nc_CreateShortSpoly(strat->S[i], p, currRing); |
---|
| 1571 | |
---|
[9f17c9] | 1572 | assume(pNext(Lp.p)==NULL); // TODO: this may be violated whenever ext.prod.crit. for Lie alg. is used |
---|
[cf218e8] | 1573 | pNext(Lp.p) = strat->tail; // !!! |
---|
| 1574 | } |
---|
[f41347f] | 1575 | } |
---|
| 1576 | else |
---|
[cf218e8] | 1577 | { |
---|
[9f17c9] | 1578 | Lp.p = // nc_CreateSpoly(strat->S[i],p,currRing); |
---|
[cf218e8] | 1579 | nc_CreateShortSpoly(strat->S[i], p, currRing); |
---|
| 1580 | |
---|
[9f17c9] | 1581 | assume(pNext(Lp.p)==NULL); // TODO: this may be violated whenever ext.prod.crit. for Lie alg. is used |
---|
[cf218e8] | 1582 | pNext(Lp.p) = strat->tail; // !!! |
---|
| 1583 | |
---|
| 1584 | } |
---|
[f41347f] | 1585 | |
---|
[9f17c9] | 1586 | |
---|
[f41347f] | 1587 | #if MYTEST |
---|
| 1588 | if (TEST_OPT_DEBUG) |
---|
| 1589 | { |
---|
[9982049] | 1590 | PrintS("enterOnePairNormal::\n strat->S[i]: "); pWrite(strat->S[i]); |
---|
[f41347f] | 1591 | PrintS("p: "); pWrite(p); |
---|
| 1592 | PrintS("SPoly: "); pWrite(Lp.p); |
---|
| 1593 | } |
---|
[9f17c9] | 1594 | #endif |
---|
| 1595 | |
---|
[f41347f] | 1596 | } |
---|
| 1597 | else |
---|
| 1598 | #endif |
---|
| 1599 | { |
---|
| 1600 | assume(!rIsPluralRing(currRing)); |
---|
| 1601 | Lp.p = ksCreateShortSpoly(strat->S[i], p, strat->tailRing); |
---|
| 1602 | #if MYTEST |
---|
| 1603 | if (TEST_OPT_DEBUG) |
---|
| 1604 | { |
---|
[9982049] | 1605 | PrintS("enterOnePairNormal::\n strat->S[i]: "); pWrite(strat->S[i]); |
---|
[f41347f] | 1606 | PrintS("p: "); pWrite(p); |
---|
| 1607 | PrintS("commutative SPoly: "); pWrite(Lp.p); |
---|
| 1608 | } |
---|
[9f17c9] | 1609 | #endif |
---|
[f41347f] | 1610 | |
---|
| 1611 | } |
---|
| 1612 | } |
---|
| 1613 | if (Lp.p == NULL) |
---|
| 1614 | { |
---|
| 1615 | /*- the case that the s-poly is 0 -*/ |
---|
| 1616 | if (strat->pairtest==NULL) initPairtest(strat); |
---|
| 1617 | strat->pairtest[i] = TRUE;/*- hint for spoly(S^[i],p)=0 -*/ |
---|
| 1618 | strat->pairtest[strat->sl+1] = TRUE; |
---|
| 1619 | /*hint for spoly(S[i],p) == 0 for some i,0 <= i <= sl*/ |
---|
| 1620 | /* |
---|
| 1621 | *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is |
---|
| 1622 | *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not |
---|
| 1623 | *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading |
---|
| 1624 | *term of p devides the lcm(s,r) |
---|
| 1625 | *(this canceling should be done here because |
---|
| 1626 | *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit) |
---|
| 1627 | *the first case is handeled in chainCrit |
---|
| 1628 | */ |
---|
| 1629 | if (Lp.lcm!=NULL) pLmFree(Lp.lcm); |
---|
| 1630 | } |
---|
| 1631 | else |
---|
| 1632 | { |
---|
| 1633 | /*- the pair (S[i],p) enters B -*/ |
---|
| 1634 | Lp.p1 = strat->S[i]; |
---|
| 1635 | Lp.p2 = p; |
---|
| 1636 | |
---|
[cf218e8] | 1637 | if ( |
---|
| 1638 | (!rIsPluralRing(currRing)) |
---|
[9f17c9] | 1639 | // || (rIsPluralRing(currRing) && (ncRingType(currRing) != nc_lie)) |
---|
[cf218e8] | 1640 | ) |
---|
| 1641 | { |
---|
[9f17c9] | 1642 | assume(pNext(Lp.p)==NULL); // TODO: this may be violated whenever ext.prod.crit. for Lie alg. is used |
---|
[cf218e8] | 1643 | pNext(Lp.p) = strat->tail; // !!! |
---|
| 1644 | } |
---|
[f41347f] | 1645 | |
---|
| 1646 | if (atR >= 0) |
---|
| 1647 | { |
---|
| 1648 | Lp.i_r1 = strat->S_2_R[i]; |
---|
| 1649 | Lp.i_r2 = atR; |
---|
| 1650 | } |
---|
| 1651 | else |
---|
| 1652 | { |
---|
| 1653 | Lp.i_r1 = -1; |
---|
| 1654 | Lp.i_r2 = -1; |
---|
| 1655 | } |
---|
| 1656 | strat->initEcartPair(&Lp,strat->S[i],p,strat->ecartS[i],ecart); |
---|
| 1657 | |
---|
| 1658 | if (TEST_OPT_INTSTRATEGY) |
---|
| 1659 | { |
---|
[a794e7] | 1660 | if (!rIsPluralRing(currRing)) |
---|
[f41347f] | 1661 | nDelete(&(Lp.p->coef)); |
---|
| 1662 | } |
---|
| 1663 | |
---|
| 1664 | l = strat->posInL(strat->B,strat->Bl,&Lp,strat); |
---|
| 1665 | enterL(&strat->B,&strat->Bl,&strat->Bmax,Lp,l); |
---|
| 1666 | } |
---|
| 1667 | } |
---|
| 1668 | |
---|
| 1669 | /*2 |
---|
| 1670 | * put the pair (s[i],p) into the set L, ecart=ecart(p) |
---|
| 1671 | * in the case that s forms a SB of (s) |
---|
| 1672 | */ |
---|
| 1673 | void enterOnePairSpecial (int i,poly p,int ecart,kStrategy strat, int atR = -1) |
---|
| 1674 | { |
---|
| 1675 | //PrintS("try ");wrp(strat->S[i]);PrintS(" and ");wrp(p);PrintLn(); |
---|
| 1676 | if(pHasNotCF(p,strat->S[i])) |
---|
| 1677 | { |
---|
| 1678 | //PrintS("prod-crit\n"); |
---|
[cce4a2f] | 1679 | if(ALLOW_PROD_CRIT(strat)) |
---|
[f41347f] | 1680 | { |
---|
| 1681 | //PrintS("prod-crit\n"); |
---|
| 1682 | strat->cp++; |
---|
| 1683 | return; |
---|
| 1684 | } |
---|
| 1685 | } |
---|
| 1686 | |
---|
| 1687 | int l,j,compare; |
---|
| 1688 | LObject Lp; |
---|
| 1689 | Lp.i_r = -1; |
---|
| 1690 | |
---|
| 1691 | Lp.lcm = pInit(); |
---|
| 1692 | pLcm(p,strat->S[i],Lp.lcm); |
---|
| 1693 | pSetm(Lp.lcm); |
---|
| 1694 | for(j = strat->Ll;j>=0;j--) |
---|
| 1695 | { |
---|
| 1696 | compare=pDivComp(strat->L[j].lcm,Lp.lcm); |
---|
| 1697 | if ((compare==1) || (pLmEqual(strat->L[j].lcm,Lp.lcm))) |
---|
| 1698 | { |
---|
| 1699 | //PrintS("c3-crit\n"); |
---|
| 1700 | strat->c3++; |
---|
| 1701 | pLmFree(Lp.lcm); |
---|
| 1702 | return; |
---|
| 1703 | } |
---|
| 1704 | else if (compare ==-1) |
---|
| 1705 | { |
---|
| 1706 | //Print("c3-crit with L[%d]\n",j); |
---|
| 1707 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 1708 | strat->c3++; |
---|
| 1709 | } |
---|
| 1710 | } |
---|
| 1711 | /*- compute the short s-polynomial -*/ |
---|
| 1712 | |
---|
| 1713 | #ifdef HAVE_PLURAL |
---|
| 1714 | if (rIsPluralRing(currRing)) |
---|
| 1715 | { |
---|
| 1716 | Lp.p = nc_CreateShortSpoly(strat->S[i],p); // ??? strat->tailRing? |
---|
| 1717 | } |
---|
| 1718 | else |
---|
| 1719 | #endif |
---|
| 1720 | Lp.p = ksCreateShortSpoly(strat->S[i],p,strat->tailRing); |
---|
| 1721 | |
---|
| 1722 | if (Lp.p == NULL) |
---|
| 1723 | { |
---|
| 1724 | //PrintS("short spoly==NULL\n"); |
---|
| 1725 | pLmFree(Lp.lcm); |
---|
| 1726 | } |
---|
| 1727 | else |
---|
| 1728 | { |
---|
| 1729 | /*- the pair (S[i],p) enters L -*/ |
---|
| 1730 | Lp.p1 = strat->S[i]; |
---|
| 1731 | Lp.p2 = p; |
---|
| 1732 | if (atR >= 0) |
---|
| 1733 | { |
---|
| 1734 | Lp.i_r1 = strat->S_2_R[i]; |
---|
| 1735 | Lp.i_r2 = atR; |
---|
| 1736 | } |
---|
| 1737 | else |
---|
| 1738 | { |
---|
| 1739 | Lp.i_r1 = -1; |
---|
| 1740 | Lp.i_r2 = -1; |
---|
| 1741 | } |
---|
| 1742 | assume(pNext(Lp.p) == NULL); |
---|
| 1743 | pNext(Lp.p) = strat->tail; |
---|
| 1744 | strat->initEcartPair(&Lp,strat->S[i],p,strat->ecartS[i],ecart); |
---|
| 1745 | if (TEST_OPT_INTSTRATEGY) |
---|
| 1746 | { |
---|
| 1747 | nDelete(&(Lp.p->coef)); |
---|
| 1748 | } |
---|
| 1749 | l = strat->posInL(strat->L,strat->Ll,&Lp,strat); |
---|
| 1750 | //Print("-> L[%d]\n",l); |
---|
| 1751 | enterL(&strat->L,&strat->Ll,&strat->Lmax,Lp,l); |
---|
| 1752 | } |
---|
| 1753 | } |
---|
| 1754 | |
---|
| 1755 | /*2 |
---|
| 1756 | * merge set B into L |
---|
| 1757 | */ |
---|
| 1758 | void kMergeBintoL(kStrategy strat) |
---|
| 1759 | { |
---|
| 1760 | int j=strat->Ll+strat->Bl+1; |
---|
| 1761 | if (j>strat->Lmax) |
---|
| 1762 | { |
---|
| 1763 | j=((j+setmaxLinc-1)/setmaxLinc)*setmaxLinc; |
---|
| 1764 | strat->L = (LSet)omReallocSize(strat->L,strat->Lmax*sizeof(LObject), |
---|
| 1765 | j*sizeof(LObject)); |
---|
| 1766 | strat->Lmax=j; |
---|
| 1767 | } |
---|
| 1768 | j = strat->Ll; |
---|
| 1769 | int i; |
---|
| 1770 | for (i=strat->Bl; i>=0; i--) |
---|
| 1771 | { |
---|
| 1772 | j = strat->posInL(strat->L,j,&(strat->B[i]),strat); |
---|
| 1773 | enterL(&strat->L,&strat->Ll,&strat->Lmax,strat->B[i],j); |
---|
| 1774 | } |
---|
| 1775 | strat->Bl = -1; |
---|
| 1776 | } |
---|
| 1777 | /*2 |
---|
| 1778 | *the pairset B of pairs of type (s[i],p) is complete now. It will be updated |
---|
| 1779 | *using the chain-criterion in B and L and enters B to L |
---|
| 1780 | */ |
---|
[6c55ae] | 1781 | void chainCritNormal (poly p,int ecart,kStrategy strat) |
---|
[f41347f] | 1782 | { |
---|
| 1783 | int i,j,l; |
---|
| 1784 | |
---|
| 1785 | /* |
---|
| 1786 | *pairtest[i] is TRUE if spoly(S[i],p) == 0. |
---|
| 1787 | *In this case all elements in B such |
---|
| 1788 | *that their lcm is divisible by the leading term of S[i] can be canceled |
---|
| 1789 | */ |
---|
| 1790 | if (strat->pairtest!=NULL) |
---|
| 1791 | { |
---|
| 1792 | { |
---|
| 1793 | /*- i.e. there is an i with pairtest[i]==TRUE -*/ |
---|
| 1794 | for (j=0; j<=strat->sl; j++) |
---|
| 1795 | { |
---|
| 1796 | if (strat->pairtest[j]) |
---|
| 1797 | { |
---|
| 1798 | for (i=strat->Bl; i>=0; i--) |
---|
| 1799 | { |
---|
| 1800 | if (pDivisibleBy(strat->S[j],strat->B[i].lcm)) |
---|
| 1801 | { |
---|
| 1802 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 1803 | strat->c3++; |
---|
| 1804 | } |
---|
| 1805 | } |
---|
| 1806 | } |
---|
| 1807 | } |
---|
| 1808 | } |
---|
| 1809 | omFreeSize(strat->pairtest,(strat->sl+2)*sizeof(BOOLEAN)); |
---|
| 1810 | strat->pairtest=NULL; |
---|
| 1811 | } |
---|
| 1812 | if (strat->Gebauer || strat->fromT) |
---|
| 1813 | { |
---|
| 1814 | if (strat->sugarCrit) |
---|
| 1815 | { |
---|
| 1816 | /* |
---|
| 1817 | *suppose L[j] == (s,r) and p/lcm(s,r) |
---|
| 1818 | *and lcm(s,r)#lcm(s,p) and lcm(s,r)#lcm(r,p) |
---|
| 1819 | *and in case the sugar is o.k. then L[j] can be canceled |
---|
| 1820 | */ |
---|
| 1821 | for (j=strat->Ll; j>=0; j--) |
---|
| 1822 | { |
---|
| 1823 | if (sugarDivisibleBy(ecart,strat->L[j].ecart) |
---|
| 1824 | && ((pNext(strat->L[j].p) == strat->tail) || (pOrdSgn==1)) |
---|
| 1825 | && pCompareChain(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 1826 | { |
---|
| 1827 | if (strat->L[j].p == strat->tail) |
---|
| 1828 | { |
---|
| 1829 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 1830 | strat->c3++; |
---|
| 1831 | } |
---|
| 1832 | } |
---|
| 1833 | } |
---|
| 1834 | /* |
---|
| 1835 | *this is GEBAUER-MOELLER: |
---|
| 1836 | *in B all elements with the same lcm except the "best" |
---|
| 1837 | *(i.e. the last one in B with this property) will be canceled |
---|
| 1838 | */ |
---|
| 1839 | j = strat->Bl; |
---|
| 1840 | loop /*cannot be changed into a for !!! */ |
---|
| 1841 | { |
---|
| 1842 | if (j <= 0) break; |
---|
| 1843 | i = j-1; |
---|
| 1844 | loop |
---|
| 1845 | { |
---|
| 1846 | if (i < 0) break; |
---|
| 1847 | if (pLmEqual(strat->B[j].lcm,strat->B[i].lcm)) |
---|
| 1848 | { |
---|
| 1849 | strat->c3++; |
---|
| 1850 | if (sugarDivisibleBy(strat->B[j].ecart,strat->B[i].ecart)) |
---|
| 1851 | { |
---|
| 1852 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 1853 | j--; |
---|
| 1854 | } |
---|
| 1855 | else |
---|
| 1856 | { |
---|
| 1857 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 1858 | break; |
---|
| 1859 | } |
---|
| 1860 | } |
---|
| 1861 | i--; |
---|
| 1862 | } |
---|
| 1863 | j--; |
---|
| 1864 | } |
---|
| 1865 | } |
---|
| 1866 | else /*sugarCrit*/ |
---|
| 1867 | { |
---|
| 1868 | /* |
---|
| 1869 | *suppose L[j] == (s,r) and p/lcm(s,r) |
---|
| 1870 | *and lcm(s,r)#lcm(s,p) and lcm(s,r)#lcm(r,p) |
---|
| 1871 | *and in case the sugar is o.k. then L[j] can be canceled |
---|
| 1872 | */ |
---|
| 1873 | for (j=strat->Ll; j>=0; j--) |
---|
| 1874 | { |
---|
| 1875 | if (pCompareChain(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 1876 | { |
---|
| 1877 | if ((pNext(strat->L[j].p) == strat->tail)||(pOrdSgn==1)) |
---|
| 1878 | { |
---|
| 1879 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 1880 | strat->c3++; |
---|
| 1881 | } |
---|
| 1882 | } |
---|
| 1883 | } |
---|
| 1884 | /* |
---|
| 1885 | *this is GEBAUER-MOELLER: |
---|
| 1886 | *in B all elements with the same lcm except the "best" |
---|
| 1887 | *(i.e. the last one in B with this property) will be canceled |
---|
| 1888 | */ |
---|
| 1889 | j = strat->Bl; |
---|
| 1890 | loop /*cannot be changed into a for !!! */ |
---|
| 1891 | { |
---|
| 1892 | if (j <= 0) break; |
---|
| 1893 | for(i=j-1; i>=0; i--) |
---|
| 1894 | { |
---|
| 1895 | if (pLmEqual(strat->B[j].lcm,strat->B[i].lcm)) |
---|
| 1896 | { |
---|
| 1897 | strat->c3++; |
---|
| 1898 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 1899 | j--; |
---|
| 1900 | } |
---|
| 1901 | } |
---|
| 1902 | j--; |
---|
| 1903 | } |
---|
| 1904 | } |
---|
| 1905 | /* |
---|
| 1906 | *the elements of B enter L |
---|
| 1907 | */ |
---|
| 1908 | kMergeBintoL(strat); |
---|
| 1909 | } |
---|
| 1910 | else |
---|
| 1911 | { |
---|
| 1912 | for (j=strat->Ll; j>=0; j--) |
---|
| 1913 | { |
---|
| 1914 | if (pCompareChain(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 1915 | { |
---|
| 1916 | if ((pNext(strat->L[j].p) == strat->tail)||(pOrdSgn==1)) |
---|
| 1917 | { |
---|
| 1918 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 1919 | strat->c3++; |
---|
| 1920 | } |
---|
| 1921 | } |
---|
| 1922 | } |
---|
| 1923 | /* |
---|
| 1924 | *this is our MODIFICATION of GEBAUER-MOELLER: |
---|
| 1925 | *First the elements of B enter L, |
---|
| 1926 | *then we fix a lcm and the "best" element in L |
---|
| 1927 | *(i.e the last in L with this lcm and of type (s,p)) |
---|
| 1928 | *and cancel all the other elements of type (r,p) with this lcm |
---|
| 1929 | *except the case the element (s,r) has also the same lcm |
---|
| 1930 | *and is on the worst position with respect to (s,p) and (r,p) |
---|
| 1931 | */ |
---|
| 1932 | /* |
---|
| 1933 | *B enters to L/their order with respect to B is permutated for elements |
---|
| 1934 | *B[i].p with the same leading term |
---|
| 1935 | */ |
---|
| 1936 | kMergeBintoL(strat); |
---|
| 1937 | j = strat->Ll; |
---|
| 1938 | loop /*cannot be changed into a for !!! */ |
---|
| 1939 | { |
---|
| 1940 | if (j <= 0) |
---|
| 1941 | { |
---|
| 1942 | /*now L[0] cannot be canceled any more and the tail can be removed*/ |
---|
| 1943 | if (strat->L[0].p2 == strat->tail) strat->L[0].p2 = p; |
---|
| 1944 | break; |
---|
| 1945 | } |
---|
| 1946 | if (strat->L[j].p2 == p) |
---|
| 1947 | { |
---|
| 1948 | i = j-1; |
---|
| 1949 | loop |
---|
| 1950 | { |
---|
| 1951 | if (i < 0) break; |
---|
| 1952 | if ((strat->L[i].p2 == p) && pLmEqual(strat->L[j].lcm,strat->L[i].lcm)) |
---|
| 1953 | { |
---|
| 1954 | /*L[i] could be canceled but we search for a better one to cancel*/ |
---|
| 1955 | strat->c3++; |
---|
| 1956 | if (isInPairsetL(i-1,strat->L[j].p1,strat->L[i].p1,&l,strat) |
---|
| 1957 | && (pNext(strat->L[l].p) == strat->tail) |
---|
| 1958 | && (!pLmEqual(strat->L[i].p,strat->L[l].p)) |
---|
| 1959 | && pDivisibleBy(p,strat->L[l].lcm)) |
---|
| 1960 | { |
---|
| 1961 | /* |
---|
| 1962 | *"NOT equal(...)" because in case of "equal" the element L[l] |
---|
| 1963 | *is "older" and has to be from theoretical point of view behind |
---|
| 1964 | *L[i], but we do not want to reorder L |
---|
| 1965 | */ |
---|
| 1966 | strat->L[i].p2 = strat->tail; |
---|
| 1967 | /* |
---|
| 1968 | *L[l] will be canceled, we cannot cancel L[i] later on, |
---|
| 1969 | *so we mark it with "tail" |
---|
| 1970 | */ |
---|
| 1971 | deleteInL(strat->L,&strat->Ll,l,strat); |
---|
| 1972 | i--; |
---|
| 1973 | } |
---|
| 1974 | else |
---|
| 1975 | { |
---|
| 1976 | deleteInL(strat->L,&strat->Ll,i,strat); |
---|
| 1977 | } |
---|
| 1978 | j--; |
---|
| 1979 | } |
---|
| 1980 | i--; |
---|
| 1981 | } |
---|
| 1982 | } |
---|
| 1983 | else if (strat->L[j].p2 == strat->tail) |
---|
| 1984 | { |
---|
| 1985 | /*now L[j] cannot be canceled any more and the tail can be removed*/ |
---|
| 1986 | strat->L[j].p2 = p; |
---|
| 1987 | } |
---|
| 1988 | j--; |
---|
| 1989 | } |
---|
| 1990 | } |
---|
| 1991 | } |
---|
[e54081] | 1992 | #ifdef HAVE_RATGRING |
---|
[f41347f] | 1993 | void chainCritPart (poly p,int ecart,kStrategy strat) |
---|
| 1994 | { |
---|
| 1995 | int i,j,l; |
---|
| 1996 | |
---|
| 1997 | /* |
---|
| 1998 | *pairtest[i] is TRUE if spoly(S[i],p) == 0. |
---|
| 1999 | *In this case all elements in B such |
---|
| 2000 | *that their lcm is divisible by the leading term of S[i] can be canceled |
---|
| 2001 | */ |
---|
| 2002 | if (strat->pairtest!=NULL) |
---|
| 2003 | { |
---|
| 2004 | { |
---|
| 2005 | /*- i.e. there is an i with pairtest[i]==TRUE -*/ |
---|
| 2006 | for (j=0; j<=strat->sl; j++) |
---|
| 2007 | { |
---|
| 2008 | if (strat->pairtest[j]) |
---|
| 2009 | { |
---|
| 2010 | for (i=strat->Bl; i>=0; i--) |
---|
| 2011 | { |
---|
| 2012 | if (_p_LmDivisibleByPart(strat->S[j],currRing, |
---|
| 2013 | strat->B[i].lcm,currRing, |
---|
| 2014 | currRing->real_var_start,currRing->real_var_end)) |
---|
| 2015 | { |
---|
| 2016 | if(TEST_OPT_DEBUG) |
---|
| 2017 | { |
---|
[9f17c9] | 2018 | Print("chain-crit-part: S[%d]=",j); |
---|
[9441be] | 2019 | p_wrp(strat->S[j],currRing); |
---|
| 2020 | Print(" divide B[%d].lcm=",i); |
---|
| 2021 | p_wrp(strat->B[i].lcm,currRing); |
---|
| 2022 | PrintLn(); |
---|
[f41347f] | 2023 | } |
---|
| 2024 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 2025 | strat->c3++; |
---|
| 2026 | } |
---|
| 2027 | } |
---|
| 2028 | } |
---|
| 2029 | } |
---|
| 2030 | } |
---|
| 2031 | omFreeSize(strat->pairtest,(strat->sl+2)*sizeof(BOOLEAN)); |
---|
| 2032 | strat->pairtest=NULL; |
---|
| 2033 | } |
---|
| 2034 | if (strat->Gebauer || strat->fromT) |
---|
| 2035 | { |
---|
| 2036 | if (strat->sugarCrit) |
---|
| 2037 | { |
---|
| 2038 | /* |
---|
| 2039 | *suppose L[j] == (s,r) and p/lcm(s,r) |
---|
| 2040 | *and lcm(s,r)#lcm(s,p) and lcm(s,r)#lcm(r,p) |
---|
| 2041 | *and in case the sugar is o.k. then L[j] can be canceled |
---|
| 2042 | */ |
---|
| 2043 | for (j=strat->Ll; j>=0; j--) |
---|
| 2044 | { |
---|
| 2045 | if (sugarDivisibleBy(ecart,strat->L[j].ecart) |
---|
| 2046 | && ((pNext(strat->L[j].p) == strat->tail) || (pOrdSgn==1)) |
---|
| 2047 | && pCompareChainPart(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 2048 | { |
---|
| 2049 | if (strat->L[j].p == strat->tail) |
---|
| 2050 | { |
---|
| 2051 | if(TEST_OPT_DEBUG) |
---|
| 2052 | { |
---|
[9f17c9] | 2053 | PrintS("chain-crit-part: pCompareChainPart p="); |
---|
[9441be] | 2054 | p_wrp(p,currRing); |
---|
| 2055 | Print(" delete L[%d]",j); |
---|
| 2056 | p_wrp(strat->L[j].lcm,currRing); |
---|
| 2057 | PrintLn(); |
---|
[f41347f] | 2058 | } |
---|
| 2059 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 2060 | strat->c3++; |
---|
| 2061 | } |
---|
| 2062 | } |
---|
| 2063 | } |
---|
| 2064 | /* |
---|
| 2065 | *this is GEBAUER-MOELLER: |
---|
| 2066 | *in B all elements with the same lcm except the "best" |
---|
| 2067 | *(i.e. the last one in B with this property) will be canceled |
---|
| 2068 | */ |
---|
| 2069 | j = strat->Bl; |
---|
| 2070 | loop /*cannot be changed into a for !!! */ |
---|
| 2071 | { |
---|
| 2072 | if (j <= 0) break; |
---|
| 2073 | i = j-1; |
---|
| 2074 | loop |
---|
| 2075 | { |
---|
| 2076 | if (i < 0) break; |
---|
| 2077 | if (pLmEqual(strat->B[j].lcm,strat->B[i].lcm)) |
---|
| 2078 | { |
---|
| 2079 | strat->c3++; |
---|
| 2080 | if (sugarDivisibleBy(strat->B[j].ecart,strat->B[i].ecart)) |
---|
| 2081 | { |
---|
| 2082 | if(TEST_OPT_DEBUG) |
---|
| 2083 | { |
---|
[9f17c9] | 2084 | Print("chain-crit-part: sugar B[%d].lcm=",j); |
---|
[9441be] | 2085 | p_wrp(strat->B[j].lcm,currRing); |
---|
| 2086 | Print(" delete B[%d]",i); |
---|
| 2087 | p_wrp(strat->B[i].lcm,currRing); |
---|
| 2088 | PrintLn(); |
---|
[f41347f] | 2089 | } |
---|
| 2090 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 2091 | j--; |
---|
| 2092 | } |
---|
| 2093 | else |
---|
| 2094 | { |
---|
| 2095 | if(TEST_OPT_DEBUG) |
---|
| 2096 | { |
---|
[9f17c9] | 2097 | Print("chain-crit-part: sugar B[%d].lcm=",i); |
---|
[9441be] | 2098 | p_wrp(strat->B[i].lcm,currRing); |
---|
| 2099 | Print(" delete B[%d]",j); |
---|
| 2100 | p_wrp(strat->B[j].lcm,currRing); |
---|
| 2101 | PrintLn(); |
---|
[f41347f] | 2102 | } |
---|
| 2103 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 2104 | break; |
---|
| 2105 | } |
---|
| 2106 | } |
---|
| 2107 | i--; |
---|
| 2108 | } |
---|
| 2109 | j--; |
---|
| 2110 | } |
---|
| 2111 | } |
---|
| 2112 | else /*sugarCrit*/ |
---|
| 2113 | { |
---|
| 2114 | /* |
---|
| 2115 | *suppose L[j] == (s,r) and p/lcm(s,r) |
---|
| 2116 | *and lcm(s,r)#lcm(s,p) and lcm(s,r)#lcm(r,p) |
---|
| 2117 | *and in case the sugar is o.k. then L[j] can be canceled |
---|
| 2118 | */ |
---|
| 2119 | for (j=strat->Ll; j>=0; j--) |
---|
| 2120 | { |
---|
| 2121 | if (pCompareChainPart(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 2122 | { |
---|
| 2123 | if ((pNext(strat->L[j].p) == strat->tail)||(pOrdSgn==1)) |
---|
| 2124 | { |
---|
| 2125 | if(TEST_OPT_DEBUG) |
---|
| 2126 | { |
---|
[9f17c9] | 2127 | PrintS("chain-crit-part: sugar:pCompareChainPart p="); |
---|
[9441be] | 2128 | p_wrp(p,currRing); |
---|
| 2129 | Print(" delete L[%d]",j); |
---|
| 2130 | p_wrp(strat->L[j].lcm,currRing); |
---|
| 2131 | PrintLn(); |
---|
[f41347f] | 2132 | } |
---|
| 2133 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 2134 | strat->c3++; |
---|
| 2135 | } |
---|
| 2136 | } |
---|
| 2137 | } |
---|
| 2138 | /* |
---|
| 2139 | *this is GEBAUER-MOELLER: |
---|
| 2140 | *in B all elements with the same lcm except the "best" |
---|
| 2141 | *(i.e. the last one in B with this property) will be canceled |
---|
| 2142 | */ |
---|
| 2143 | j = strat->Bl; |
---|
| 2144 | loop /*cannot be changed into a for !!! */ |
---|
| 2145 | { |
---|
| 2146 | if (j <= 0) break; |
---|
| 2147 | for(i=j-1; i>=0; i--) |
---|
| 2148 | { |
---|
| 2149 | if (pLmEqual(strat->B[j].lcm,strat->B[i].lcm)) |
---|
| 2150 | { |
---|
| 2151 | if(TEST_OPT_DEBUG) |
---|
| 2152 | { |
---|
[9f17c9] | 2153 | Print("chain-crit-part: equal lcm B[%d].lcm=",j); |
---|
[9441be] | 2154 | p_wrp(strat->B[j].lcm,currRing); |
---|
| 2155 | Print(" delete B[%d]\n",i); |
---|
[f41347f] | 2156 | } |
---|
| 2157 | strat->c3++; |
---|
| 2158 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 2159 | j--; |
---|
| 2160 | } |
---|
| 2161 | } |
---|
| 2162 | j--; |
---|
| 2163 | } |
---|
| 2164 | } |
---|
| 2165 | /* |
---|
| 2166 | *the elements of B enter L |
---|
| 2167 | */ |
---|
| 2168 | kMergeBintoL(strat); |
---|
| 2169 | } |
---|
| 2170 | else |
---|
| 2171 | { |
---|
| 2172 | for (j=strat->Ll; j>=0; j--) |
---|
| 2173 | { |
---|
| 2174 | if (pCompareChainPart(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 2175 | { |
---|
| 2176 | if ((pNext(strat->L[j].p) == strat->tail)||(pOrdSgn==1)) |
---|
| 2177 | { |
---|
| 2178 | if(TEST_OPT_DEBUG) |
---|
| 2179 | { |
---|
[9f17c9] | 2180 | PrintS("chain-crit-part: pCompareChainPart p="); |
---|
[9441be] | 2181 | p_wrp(p,currRing); |
---|
| 2182 | Print(" delete L[%d]",j); |
---|
| 2183 | p_wrp(strat->L[j].lcm,currRing); |
---|
| 2184 | PrintLn(); |
---|
[f41347f] | 2185 | } |
---|
| 2186 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 2187 | strat->c3++; |
---|
| 2188 | } |
---|
| 2189 | } |
---|
| 2190 | } |
---|
| 2191 | /* |
---|
| 2192 | *this is our MODIFICATION of GEBAUER-MOELLER: |
---|
| 2193 | *First the elements of B enter L, |
---|
| 2194 | *then we fix a lcm and the "best" element in L |
---|
| 2195 | *(i.e the last in L with this lcm and of type (s,p)) |
---|
| 2196 | *and cancel all the other elements of type (r,p) with this lcm |
---|
| 2197 | *except the case the element (s,r) has also the same lcm |
---|
| 2198 | *and is on the worst position with respect to (s,p) and (r,p) |
---|
| 2199 | */ |
---|
| 2200 | /* |
---|
| 2201 | *B enters to L/their order with respect to B is permutated for elements |
---|
| 2202 | *B[i].p with the same leading term |
---|
| 2203 | */ |
---|
| 2204 | kMergeBintoL(strat); |
---|
| 2205 | j = strat->Ll; |
---|
| 2206 | loop /*cannot be changed into a for !!! */ |
---|
| 2207 | { |
---|
| 2208 | if (j <= 0) |
---|
| 2209 | { |
---|
| 2210 | /*now L[0] cannot be canceled any more and the tail can be removed*/ |
---|
| 2211 | if (strat->L[0].p2 == strat->tail) strat->L[0].p2 = p; |
---|
| 2212 | break; |
---|
| 2213 | } |
---|
| 2214 | if (strat->L[j].p2 == p) |
---|
| 2215 | { |
---|
| 2216 | i = j-1; |
---|
| 2217 | loop |
---|
| 2218 | { |
---|
| 2219 | if (i < 0) break; |
---|
| 2220 | if ((strat->L[i].p2 == p) && pLmEqual(strat->L[j].lcm,strat->L[i].lcm)) |
---|
| 2221 | { |
---|
| 2222 | /*L[i] could be canceled but we search for a better one to cancel*/ |
---|
| 2223 | strat->c3++; |
---|
| 2224 | if (isInPairsetL(i-1,strat->L[j].p1,strat->L[i].p1,&l,strat) |
---|
| 2225 | && (pNext(strat->L[l].p) == strat->tail) |
---|
| 2226 | && (!pLmEqual(strat->L[i].p,strat->L[l].p)) |
---|
| 2227 | && _p_LmDivisibleByPart(p,currRing, |
---|
| 2228 | strat->L[l].lcm,currRing, |
---|
| 2229 | currRing->real_var_start, currRing->real_var_end)) |
---|
| 2230 | |
---|
| 2231 | { |
---|
| 2232 | /* |
---|
| 2233 | *"NOT equal(...)" because in case of "equal" the element L[l] |
---|
| 2234 | *is "older" and has to be from theoretical point of view behind |
---|
| 2235 | *L[i], but we do not want to reorder L |
---|
| 2236 | */ |
---|
| 2237 | strat->L[i].p2 = strat->tail; |
---|
| 2238 | /* |
---|
| 2239 | *L[l] will be canceled, we cannot cancel L[i] later on, |
---|
| 2240 | *so we mark it with "tail" |
---|
| 2241 | */ |
---|
| 2242 | if(TEST_OPT_DEBUG) |
---|
| 2243 | { |
---|
[9f17c9] | 2244 | PrintS("chain-crit-part: divisible_by p="); |
---|
[9441be] | 2245 | p_wrp(p,currRing); |
---|
| 2246 | Print(" delete L[%d]",l); |
---|
| 2247 | p_wrp(strat->L[l].lcm,currRing); |
---|
| 2248 | PrintLn(); |
---|
[f41347f] | 2249 | } |
---|
| 2250 | deleteInL(strat->L,&strat->Ll,l,strat); |
---|
| 2251 | i--; |
---|
| 2252 | } |
---|
| 2253 | else |
---|
| 2254 | { |
---|
| 2255 | if(TEST_OPT_DEBUG) |
---|
| 2256 | { |
---|
[9f17c9] | 2257 | PrintS("chain-crit-part: divisible_by(2) p="); |
---|
[9441be] | 2258 | p_wrp(p,currRing); |
---|
| 2259 | Print(" delete L[%d]",i); |
---|
| 2260 | p_wrp(strat->L[i].lcm,currRing); |
---|
| 2261 | PrintLn(); |
---|
[f41347f] | 2262 | } |
---|
| 2263 | deleteInL(strat->L,&strat->Ll,i,strat); |
---|
| 2264 | } |
---|
| 2265 | j--; |
---|
| 2266 | } |
---|
| 2267 | i--; |
---|
| 2268 | } |
---|
| 2269 | } |
---|
| 2270 | else if (strat->L[j].p2 == strat->tail) |
---|
| 2271 | { |
---|
| 2272 | /*now L[j] cannot be canceled any more and the tail can be removed*/ |
---|
| 2273 | strat->L[j].p2 = p; |
---|
| 2274 | } |
---|
| 2275 | j--; |
---|
| 2276 | } |
---|
| 2277 | } |
---|
| 2278 | } |
---|
[e54081] | 2279 | #endif |
---|
[f41347f] | 2280 | |
---|
| 2281 | /*2 |
---|
| 2282 | *(s[0],h),...,(s[k],h) will be put to the pairset L |
---|
| 2283 | */ |
---|
| 2284 | void initenterpairs (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR = -1) |
---|
| 2285 | { |
---|
| 2286 | |
---|
| 2287 | if ((strat->syzComp==0) |
---|
| 2288 | || (pGetComp(h)<=strat->syzComp)) |
---|
| 2289 | { |
---|
| 2290 | int j; |
---|
| 2291 | BOOLEAN new_pair=FALSE; |
---|
| 2292 | |
---|
| 2293 | if (pGetComp(h)==0) |
---|
| 2294 | { |
---|
| 2295 | /* for Q!=NULL: build pairs (f,q),(f1,f2), but not (q1,q2)*/ |
---|
| 2296 | if ((isFromQ)&&(strat->fromQ!=NULL)) |
---|
| 2297 | { |
---|
| 2298 | for (j=0; j<=k; j++) |
---|
| 2299 | { |
---|
| 2300 | if (!strat->fromQ[j]) |
---|
| 2301 | { |
---|
| 2302 | new_pair=TRUE; |
---|
[6c55ae] | 2303 | strat->enterOnePair(j,h,ecart,isFromQ,strat, atR); |
---|
[f41347f] | 2304 | //Print("j:%d, Ll:%d\n",j,strat->Ll); |
---|
| 2305 | } |
---|
| 2306 | } |
---|
| 2307 | } |
---|
| 2308 | else |
---|
| 2309 | { |
---|
| 2310 | new_pair=TRUE; |
---|
| 2311 | for (j=0; j<=k; j++) |
---|
| 2312 | { |
---|
[6c55ae] | 2313 | strat->enterOnePair(j,h,ecart,isFromQ,strat, atR); |
---|
[f41347f] | 2314 | //Print("j:%d, Ll:%d\n",j,strat->Ll); |
---|
| 2315 | } |
---|
| 2316 | } |
---|
| 2317 | } |
---|
| 2318 | else |
---|
| 2319 | { |
---|
| 2320 | for (j=0; j<=k; j++) |
---|
| 2321 | { |
---|
| 2322 | if ((pGetComp(h)==pGetComp(strat->S[j])) |
---|
| 2323 | || (pGetComp(strat->S[j])==0)) |
---|
| 2324 | { |
---|
| 2325 | new_pair=TRUE; |
---|
[6c55ae] | 2326 | strat->enterOnePair(j,h,ecart,isFromQ,strat, atR); |
---|
[f41347f] | 2327 | //Print("j:%d, Ll:%d\n",j,strat->Ll); |
---|
| 2328 | } |
---|
| 2329 | } |
---|
| 2330 | } |
---|
| 2331 | |
---|
[9f17c9] | 2332 | if (new_pair) |
---|
[f41347f] | 2333 | { |
---|
[43cbc0] | 2334 | #ifdef HAVE_RATGRING |
---|
| 2335 | if (currRing->real_var_start>0) |
---|
| 2336 | chainCritPart(h,ecart,strat); |
---|
| 2337 | else |
---|
| 2338 | #endif |
---|
[6c55ae] | 2339 | strat->chainCrit(h,ecart,strat); |
---|
[f41347f] | 2340 | } |
---|
| 2341 | } |
---|
| 2342 | } |
---|
| 2343 | |
---|
| 2344 | #ifdef HAVE_RINGS |
---|
| 2345 | /*2 |
---|
| 2346 | *the pairset B of pairs of type (s[i],p) is complete now. It will be updated |
---|
| 2347 | *using the chain-criterion in B and L and enters B to L |
---|
| 2348 | */ |
---|
| 2349 | void chainCritRing (poly p,int ecart,kStrategy strat) |
---|
| 2350 | { |
---|
| 2351 | int i,j,l; |
---|
| 2352 | /* |
---|
| 2353 | *pairtest[i] is TRUE if spoly(S[i],p) == 0. |
---|
| 2354 | *In this case all elements in B such |
---|
| 2355 | *that their lcm is divisible by the leading term of S[i] can be canceled |
---|
| 2356 | */ |
---|
| 2357 | if (strat->pairtest!=NULL) |
---|
| 2358 | { |
---|
| 2359 | { |
---|
| 2360 | /*- i.e. there is an i with pairtest[i]==TRUE -*/ |
---|
| 2361 | for (j=0; j<=strat->sl; j++) |
---|
| 2362 | { |
---|
| 2363 | if (strat->pairtest[j]) |
---|
| 2364 | { |
---|
| 2365 | for (i=strat->Bl; i>=0; i--) |
---|
| 2366 | { |
---|
| 2367 | if (pDivisibleBy(strat->S[j],strat->B[i].lcm)) |
---|
| 2368 | { |
---|
| 2369 | #ifdef KDEBUG |
---|
| 2370 | if (TEST_OPT_DEBUG) |
---|
| 2371 | { |
---|
| 2372 | PrintS("--- chain criterion func chainCritRing type 1\n"); |
---|
| 2373 | PrintS("strat->S[j]:"); |
---|
| 2374 | wrp(strat->S[j]); |
---|
| 2375 | PrintS(" strat->B[i].lcm:"); |
---|
| 2376 | wrp(strat->B[i].lcm); |
---|
| 2377 | PrintLn(); |
---|
| 2378 | } |
---|
| 2379 | #endif |
---|
| 2380 | deleteInL(strat->B,&strat->Bl,i,strat); |
---|
| 2381 | strat->c3++; |
---|
| 2382 | } |
---|
| 2383 | } |
---|
| 2384 | } |
---|
| 2385 | } |
---|
| 2386 | } |
---|
| 2387 | omFreeSize(strat->pairtest,(strat->sl+2)*sizeof(BOOLEAN)); |
---|
| 2388 | strat->pairtest=NULL; |
---|
| 2389 | } |
---|
| 2390 | assume(!(strat->Gebauer || strat->fromT)); |
---|
| 2391 | for (j=strat->Ll; j>=0; j--) |
---|
| 2392 | { |
---|
| 2393 | if (strat->L[j].lcm != NULL && nDivBy(pGetCoeff(strat->L[j].lcm), pGetCoeff(p))) |
---|
| 2394 | { |
---|
| 2395 | if (pCompareChain(p,strat->L[j].p1,strat->L[j].p2,strat->L[j].lcm)) |
---|
| 2396 | { |
---|
| 2397 | if ((pNext(strat->L[j].p) == strat->tail) || (pOrdSgn==1)) |
---|
| 2398 | { |
---|
| 2399 | deleteInL(strat->L,&strat->Ll,j,strat); |
---|
| 2400 | strat->c3++; |
---|
| 2401 | #ifdef KDEBUG |
---|
| 2402 | if (TEST_OPT_DEBUG) |
---|
| 2403 | { |
---|
| 2404 | PrintS("--- chain criterion func chainCritRing type 2\n"); |
---|
| 2405 | PrintS("strat->L[j].p:"); |
---|
| 2406 | wrp(strat->L[j].p); |
---|
| 2407 | PrintS(" p:"); |
---|
| 2408 | wrp(p); |
---|
| 2409 | PrintLn(); |
---|
| 2410 | } |
---|
| 2411 | #endif |
---|
| 2412 | } |
---|
| 2413 | } |
---|
| 2414 | } |
---|
| 2415 | } |
---|
| 2416 | /* |
---|
| 2417 | *this is our MODIFICATION of GEBAUER-MOELLER: |
---|
| 2418 | *First the elements of B enter L, |
---|
| 2419 | *then we fix a lcm and the "best" element in L |
---|
| 2420 | *(i.e the last in L with this lcm and of type (s,p)) |
---|
| 2421 | *and cancel all the other elements of type (r,p) with this lcm |
---|
| 2422 | *except the case the element (s,r) has also the same lcm |
---|
| 2423 | *and is on the worst position with respect to (s,p) and (r,p) |
---|
| 2424 | */ |
---|
| 2425 | /* |
---|
| 2426 | *B enters to L/their order with respect to B is permutated for elements |
---|
| 2427 | *B[i].p with the same leading term |
---|
| 2428 | */ |
---|
| 2429 | kMergeBintoL(strat); |
---|
| 2430 | j = strat->Ll; |
---|
| 2431 | loop /*cannot be changed into a for !!! */ |
---|
| 2432 | { |
---|
| 2433 | if (j <= 0) |
---|
| 2434 | { |
---|
| 2435 | /*now L[0] cannot be canceled any more and the tail can be removed*/ |
---|
| 2436 | if (strat->L[0].p2 == strat->tail) strat->L[0].p2 = p; |
---|
| 2437 | break; |
---|
| 2438 | } |
---|
| 2439 | if (strat->L[j].p2 == p) // Was the element added from B? |
---|
| 2440 | { |
---|
| 2441 | i = j-1; |
---|
| 2442 | loop |
---|
| 2443 | { |
---|
| 2444 | if (i < 0) break; |
---|
| 2445 | // Element is from B and has the same lcm as L[j] |
---|
| 2446 | if ((strat->L[i].p2 == p) && nDivBy(pGetCoeff(strat->L[j].lcm), pGetCoeff(strat->L[i].lcm)) |
---|
| 2447 | && pLmEqual(strat->L[j].lcm,strat->L[i].lcm)) |
---|
| 2448 | { |
---|
| 2449 | /*L[i] could be canceled but we search for a better one to cancel*/ |
---|
| 2450 | strat->c3++; |
---|
| 2451 | #ifdef KDEBUG |
---|
| 2452 | if (TEST_OPT_DEBUG) |
---|
| 2453 | { |
---|
| 2454 | PrintS("--- chain criterion func chainCritRing type 3\n"); |
---|
| 2455 | PrintS("strat->L[j].lcm:"); |
---|
| 2456 | wrp(strat->L[j].lcm); |
---|
| 2457 | PrintS(" strat->L[i].lcm:"); |
---|
| 2458 | wrp(strat->L[i].lcm); |
---|
| 2459 | PrintLn(); |
---|
| 2460 | } |
---|
| 2461 | #endif |
---|
| 2462 | if (isInPairsetL(i-1,strat->L[j].p1,strat->L[i].p1,&l,strat) |
---|
| 2463 | && (pNext(strat->L[l].p) == strat->tail) |
---|
| 2464 | && (!pLmEqual(strat->L[i].p,strat->L[l].p)) |
---|
| 2465 | && pDivisibleBy(p,strat->L[l].lcm)) |
---|
| 2466 | { |
---|
| 2467 | /* |
---|
| 2468 | *"NOT equal(...)" because in case of "equal" the element L[l] |
---|
| 2469 | *is "older" and has to be from theoretical point of view behind |
---|
| 2470 | *L[i], but we do not want to reorder L |
---|
| 2471 | */ |
---|
| 2472 | strat->L[i].p2 = strat->tail; |
---|
| 2473 | /* |
---|
| 2474 | *L[l] will be canceled, we cannot cancel L[i] later on, |
---|
| 2475 | *so we mark it with "tail" |
---|
| 2476 | */ |
---|
| 2477 | deleteInL(strat->L,&strat->Ll,l,strat); |
---|
| 2478 | i--; |
---|
| 2479 | } |
---|
| 2480 | else |
---|
| 2481 | { |
---|
| 2482 | deleteInL(strat->L,&strat->Ll,i,strat); |
---|
| 2483 | } |
---|
| 2484 | j--; |
---|
| 2485 | } |
---|
| 2486 | i--; |
---|
| 2487 | } |
---|
| 2488 | } |
---|
| 2489 | else if (strat->L[j].p2 == strat->tail) |
---|
| 2490 | { |
---|
| 2491 | /*now L[j] cannot be canceled any more and the tail can be removed*/ |
---|
| 2492 | strat->L[j].p2 = p; |
---|
| 2493 | } |
---|
| 2494 | j--; |
---|
| 2495 | } |
---|
| 2496 | } |
---|
| 2497 | #endif |
---|
| 2498 | |
---|
[c90b43] | 2499 | #ifdef HAVE_RINGS |
---|
[f41347f] | 2500 | long ind2(long arg) |
---|
| 2501 | { |
---|
| 2502 | long ind = 0; |
---|
| 2503 | if (arg <= 0) return 0; |
---|
| 2504 | while (arg%2 == 0) |
---|
| 2505 | { |
---|
| 2506 | arg = arg / 2; |
---|
| 2507 | ind++; |
---|
| 2508 | } |
---|
| 2509 | return ind; |
---|
| 2510 | } |
---|
| 2511 | |
---|
| 2512 | long ind_fact_2(long arg) |
---|
| 2513 | { |
---|
| 2514 | long ind = 0; |
---|
| 2515 | if (arg <= 0) return 0; |
---|
| 2516 | if (arg%2 == 1) { arg--; } |
---|
| 2517 | while (arg > 0) |
---|
| 2518 | { |
---|
| 2519 | ind += ind2(arg); |
---|
| 2520 | arg = arg - 2; |
---|
| 2521 | } |
---|
| 2522 | return ind; |
---|
| 2523 | } |
---|
| 2524 | #endif |
---|
| 2525 | |
---|
| 2526 | #ifdef HAVE_VANIDEAL |
---|
| 2527 | long twoPow(long arg) |
---|
| 2528 | { |
---|
| 2529 | return 1L << arg; |
---|
| 2530 | } |
---|
| 2531 | |
---|
| 2532 | /*2 |
---|
| 2533 | * put the pair (p, f) in B and f in T |
---|
| 2534 | */ |
---|
| 2535 | void enterOneZeroPairRing (poly f, poly t_p, poly p, int ecart, kStrategy strat, int atR = -1) |
---|
| 2536 | { |
---|
| 2537 | int l,j,compare,compareCoeff; |
---|
| 2538 | LObject Lp; |
---|
| 2539 | |
---|
| 2540 | if (strat->interred_flag) return; |
---|
| 2541 | #ifdef KDEBUG |
---|
| 2542 | Lp.ecart=0; Lp.length=0; |
---|
| 2543 | #endif |
---|
| 2544 | /*- computes the lcm(s[i],p) -*/ |
---|
| 2545 | Lp.lcm = pInit(); |
---|
| 2546 | |
---|
| 2547 | pLcm(p,f,Lp.lcm); |
---|
| 2548 | pSetm(Lp.lcm); |
---|
| 2549 | pSetCoeff(Lp.lcm, nLcm(pGetCoeff(p), pGetCoeff(f), currRing)); |
---|
| 2550 | assume(!strat->sugarCrit); |
---|
| 2551 | assume(!strat->fromT); |
---|
| 2552 | /* |
---|
| 2553 | *the set B collects the pairs of type (S[j],p) |
---|
| 2554 | *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p) != lcm(r,p) |
---|
| 2555 | *if the leading term of s devides lcm(r,p) then (r,p) will be canceled |
---|
| 2556 | *if the leading term of r devides lcm(s,p) then (s,p) will not enter B |
---|
| 2557 | */ |
---|
| 2558 | for(j = strat->Bl;j>=0;j--) |
---|
| 2559 | { |
---|
| 2560 | compare=pDivCompRing(strat->B[j].lcm,Lp.lcm); |
---|
| 2561 | compareCoeff = nDivComp(pGetCoeff(strat->B[j].lcm), pGetCoeff(Lp.lcm)); |
---|
| 2562 | if (compareCoeff == 0 || compare == compareCoeff) |
---|
| 2563 | { |
---|
| 2564 | if (compare == 1) |
---|
| 2565 | { |
---|
| 2566 | strat->c3++; |
---|
| 2567 | pLmDelete(Lp.lcm); |
---|
| 2568 | return; |
---|
| 2569 | } |
---|
| 2570 | else |
---|
| 2571 | if (compare == -1) |
---|
| 2572 | { |
---|
| 2573 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 2574 | strat->c3++; |
---|
| 2575 | } |
---|
| 2576 | } |
---|
| 2577 | if (compare == pDivComp_EQUAL) |
---|
| 2578 | { |
---|
| 2579 | // Add hint for same LM and direction of LC (later) (TODO Oliver) |
---|
| 2580 | if (compareCoeff == 1) |
---|
| 2581 | { |
---|
| 2582 | strat->c3++; |
---|
| 2583 | pLmDelete(Lp.lcm); |
---|
| 2584 | return; |
---|
| 2585 | } |
---|
| 2586 | else |
---|
| 2587 | if (compareCoeff == -1) |
---|
| 2588 | { |
---|
| 2589 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 2590 | strat->c3++; |
---|
| 2591 | } |
---|
| 2592 | } |
---|
| 2593 | } |
---|
| 2594 | /* |
---|
| 2595 | *the pair (S[i],p) enters B if the spoly != 0 |
---|
| 2596 | */ |
---|
| 2597 | /*- compute the short s-polynomial -*/ |
---|
| 2598 | if ((f==NULL) || (p==NULL)) return; |
---|
| 2599 | pNorm(p); |
---|
| 2600 | { |
---|
| 2601 | Lp.p = ksCreateShortSpoly(f, p, strat->tailRing); |
---|
| 2602 | } |
---|
| 2603 | if (Lp.p == NULL) //deactivated, as we are adding pairs with zeropoly and not from S |
---|
| 2604 | { |
---|
| 2605 | /*- the case that the s-poly is 0 -*/ |
---|
| 2606 | // if (strat->pairtest==NULL) initPairtest(strat); |
---|
| 2607 | // strat->pairtest[i] = TRUE;/*- hint for spoly(S^[i],p)=0 -*/ |
---|
| 2608 | // strat->pairtest[strat->sl+1] = TRUE; |
---|
| 2609 | /*hint for spoly(S[i],p) == 0 for some i,0 <= i <= sl*/ |
---|
| 2610 | /* |
---|
| 2611 | *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is |
---|
| 2612 | *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not |
---|
| 2613 | *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading |
---|
| 2614 | *term of p devides the lcm(s,r) |
---|
| 2615 | *(this canceling should be done here because |
---|
| 2616 | *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit) |
---|
| 2617 | *the first case is handeled in chainCrit |
---|
| 2618 | */ |
---|
| 2619 | if (Lp.lcm!=NULL) pLmDelete(Lp.lcm); |
---|
| 2620 | } |
---|
| 2621 | else |
---|
| 2622 | { |
---|
| 2623 | /*- the pair (S[i],p) enters B -*/ |
---|
| 2624 | Lp.p1 = f; |
---|
| 2625 | Lp.p2 = p; |
---|
| 2626 | |
---|
| 2627 | pNext(Lp.p) = strat->tail; |
---|
| 2628 | |
---|
| 2629 | LObject tmp_h(f, currRing, strat->tailRing); |
---|
| 2630 | tmp_h.SetShortExpVector(); |
---|
| 2631 | strat->initEcart(&tmp_h); |
---|
| 2632 | tmp_h.sev = pGetShortExpVector(tmp_h.p); |
---|
| 2633 | tmp_h.t_p = t_p; |
---|
| 2634 | |
---|
| 2635 | enterT(tmp_h, strat, strat->tl + 1); |
---|
| 2636 | |
---|
| 2637 | if (atR >= 0) |
---|
| 2638 | { |
---|
| 2639 | Lp.i_r2 = atR; |
---|
| 2640 | Lp.i_r1 = strat->tl; |
---|
| 2641 | } |
---|
| 2642 | |
---|
| 2643 | strat->initEcartPair(&Lp,f,p,0/*strat->ecartS[i]*/,ecart); // Attention: TODO: break ecart |
---|
| 2644 | l = strat->posInL(strat->B,strat->Bl,&Lp,strat); |
---|
| 2645 | enterL(&strat->B, &strat->Bl, &strat->Bmax, Lp, l); |
---|
| 2646 | } |
---|
| 2647 | } |
---|
| 2648 | |
---|
| 2649 | /* Helper for kCreateZeroPoly |
---|
| 2650 | * enumerating the exponents |
---|
| 2651 | ring r = 2^2, (a, b, c), lp; ideal G0 = system("createG0"); ideal G = interred(G0); ncols(G0); ncols(G); |
---|
| 2652 | */ |
---|
| 2653 | |
---|
| 2654 | int nextZeroSimplexExponent (long exp[], long ind[], long cexp[], long cind[], long* cabsind, long step[], long bound, long N) |
---|
| 2655 | /* gives the next exponent from the set H_1 */ |
---|
| 2656 | { |
---|
| 2657 | long add = ind2(cexp[1] + 2); |
---|
| 2658 | if ((*cabsind < bound) && (*cabsind - step[1] + add < bound)) |
---|
| 2659 | { |
---|
| 2660 | cexp[1] += 2; |
---|
| 2661 | cind[1] += add; |
---|
| 2662 | *cabsind += add; |
---|
| 2663 | } |
---|
| 2664 | else |
---|
| 2665 | { |
---|
| 2666 | // cabsind >= habsind |
---|
| 2667 | if (N == 1) return 0; |
---|
| 2668 | int i = 1; |
---|
| 2669 | while (exp[i] == cexp[i] && i <= N) i++; |
---|
| 2670 | cexp[i] = exp[i]; |
---|
| 2671 | *cabsind -= cind[i]; |
---|
| 2672 | cind[i] = ind[i]; |
---|
| 2673 | step[i] = 500000; |
---|
| 2674 | *cabsind += cind[i]; |
---|
| 2675 | // Print("in: %d\n", *cabsind); |
---|
| 2676 | i += 1; |
---|
| 2677 | if (i > N) return 0; |
---|
| 2678 | do |
---|
| 2679 | { |
---|
| 2680 | step[1] = 500000; |
---|
| 2681 | for (int j = i + 1; j <= N; j++) |
---|
| 2682 | { |
---|
| 2683 | if (step[1] > step[j]) step[1] = step[j]; |
---|
| 2684 | } |
---|
| 2685 | add = ind2(cexp[i] + 2); |
---|
| 2686 | if (*cabsind - step[1] + add >= bound) |
---|
| 2687 | { |
---|
| 2688 | cexp[i] = exp[i]; |
---|
| 2689 | *cabsind -= cind[i]; |
---|
| 2690 | cind[i] = ind[i]; |
---|
| 2691 | *cabsind += cind[i]; |
---|
| 2692 | step[i] = 500000; |
---|
| 2693 | i += 1; |
---|
| 2694 | if (i > N) return 0; |
---|
| 2695 | } |
---|
| 2696 | else step[1] = -1; |
---|
| 2697 | } while (step[1] != -1); |
---|
| 2698 | step[1] = 500000; |
---|
| 2699 | cexp[i] += 2; |
---|
| 2700 | cind[i] += add; |
---|
| 2701 | *cabsind += add; |
---|
| 2702 | if (add < step[i]) step[i] = add; |
---|
| 2703 | for (i = 2; i <= N; i++) |
---|
| 2704 | { |
---|
| 2705 | if (step[1] > step[i]) step[1] = step[i]; |
---|
| 2706 | } |
---|
| 2707 | } |
---|
| 2708 | return 1; |
---|
| 2709 | } |
---|
| 2710 | |
---|
| 2711 | /* |
---|
| 2712 | * Creates the zero Polynomial on position exp |
---|
| 2713 | * long exp[] : exponent of leading term |
---|
| 2714 | * cabsind : total 2-ind of exp (if -1 will be computed) |
---|
| 2715 | * poly* t_p : will hold the LT in tailRing |
---|
| 2716 | * leadRing : ring for the LT |
---|
| 2717 | * tailRing : ring for the tail |
---|
| 2718 | */ |
---|
| 2719 | |
---|
| 2720 | poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing) |
---|
| 2721 | { |
---|
| 2722 | |
---|
| 2723 | poly zeroPoly = NULL; |
---|
| 2724 | |
---|
| 2725 | number tmp1; |
---|
| 2726 | poly tmp2, tmp3; |
---|
| 2727 | |
---|
| 2728 | if (cabsind == -1) |
---|
| 2729 | { |
---|
| 2730 | cabsind = 0; |
---|
| 2731 | for (int i = 1; i <= leadRing->N; i++) |
---|
| 2732 | { |
---|
| 2733 | cabsind += ind_fact_2(exp[i]); |
---|
| 2734 | } |
---|
| 2735 | // Print("cabsind: %d\n", cabsind); |
---|
| 2736 | } |
---|
| 2737 | if (cabsind < leadRing->ch) |
---|
| 2738 | { |
---|
| 2739 | zeroPoly = p_ISet(twoPow(leadRing->ch - cabsind), tailRing); |
---|
| 2740 | } |
---|
| 2741 | else |
---|
| 2742 | { |
---|
| 2743 | zeroPoly = p_ISet(1, tailRing); |
---|
| 2744 | } |
---|
| 2745 | for (int i = 1; i <= leadRing->N; i++) |
---|
| 2746 | { |
---|
| 2747 | for (long j = 1; j <= exp[i]; j++) |
---|
| 2748 | { |
---|
| 2749 | tmp1 = nInit(j); |
---|
| 2750 | tmp2 = p_ISet(1, tailRing); |
---|
| 2751 | p_SetExp(tmp2, i, 1, tailRing); |
---|
| 2752 | p_Setm(tmp2, tailRing); |
---|
| 2753 | if (nIsZero(tmp1)) |
---|
| 2754 | { // should nowbe obsolet, test ! TODO OLIVER |
---|
| 2755 | zeroPoly = p_Mult_q(zeroPoly, tmp2, tailRing); |
---|
| 2756 | } |
---|
| 2757 | else |
---|
| 2758 | { |
---|
| 2759 | tmp3 = p_NSet(nCopy(tmp1), tailRing); |
---|
| 2760 | zeroPoly = p_Mult_q(zeroPoly, p_Add_q(tmp3, tmp2, tailRing), tailRing); |
---|
| 2761 | } |
---|
| 2762 | } |
---|
| 2763 | } |
---|
| 2764 | tmp2 = p_NSet(nCopy(pGetCoeff(zeroPoly)), leadRing); |
---|
| 2765 | for (int i = 1; i <= leadRing->N; i++) |
---|
| 2766 | { |
---|
| 2767 | pSetExp(tmp2, i, p_GetExp(zeroPoly, i, tailRing)); |
---|
| 2768 | } |
---|
| 2769 | p_Setm(tmp2, leadRing); |
---|
| 2770 | *t_p = zeroPoly; |
---|
| 2771 | zeroPoly = pNext(zeroPoly); |
---|
| 2772 | pNext(*t_p) = NULL; |
---|
| 2773 | pNext(tmp2) = zeroPoly; |
---|
| 2774 | return tmp2; |
---|
| 2775 | } |
---|
| 2776 | |
---|
| 2777 | // #define OLI_DEBUG |
---|
| 2778 | |
---|
| 2779 | /* |
---|
| 2780 | * Generate the s-polynomial for the virtual set of zero-polynomials |
---|
| 2781 | */ |
---|
| 2782 | |
---|
| 2783 | void initenterzeropairsRing (poly p, int ecart, kStrategy strat, int atR) |
---|
| 2784 | { |
---|
| 2785 | // Initialize |
---|
| 2786 | long exp[50]; // The exponent of \hat{X} (basepoint) |
---|
| 2787 | long cexp[50]; // The current exponent for iterating over all |
---|
| 2788 | long ind[50]; // The power of 2 in the i-th component of exp |
---|
| 2789 | long cind[50]; // analog for cexp |
---|
| 2790 | long mult[50]; // How to multiply the elements of G |
---|
| 2791 | long cabsind = 0; // The abs. index of cexp, i.e. the sum of cind |
---|
| 2792 | long habsind = 0; // The abs. index of the coefficient of h |
---|
| 2793 | long step[50]; // The last increases |
---|
| 2794 | for (int i = 1; i <= currRing->N; i++) |
---|
| 2795 | { |
---|
| 2796 | exp[i] = p_GetExp(p, i, currRing); |
---|
| 2797 | if (exp[i] & 1 != 0) |
---|
| 2798 | { |
---|
| 2799 | exp[i] = exp[i] - 1; |
---|
| 2800 | mult[i] = 1; |
---|
| 2801 | } |
---|
| 2802 | cexp[i] = exp[i]; |
---|
| 2803 | ind[i] = ind_fact_2(exp[i]); |
---|
| 2804 | cabsind += ind[i]; |
---|
| 2805 | cind[i] = ind[i]; |
---|
| 2806 | step[i] = 500000; |
---|
| 2807 | } |
---|
| 2808 | step[1] = 500000; |
---|
| 2809 | habsind = ind2((long) p_GetCoeff(p, currRing)); |
---|
| 2810 | long bound = currRing->ch - habsind; |
---|
| 2811 | #ifdef OLI_DEBUG |
---|
| 2812 | PrintS("-------------\npoly :"); |
---|
| 2813 | wrp(p); |
---|
| 2814 | Print("\nexp : (%d, %d)\n", exp[1] + mult[1], exp[2] + mult[1]); |
---|
| 2815 | Print("cexp : (%d, %d)\n", cexp[1], cexp[2]); |
---|
| 2816 | Print("cind : (%d, %d)\n", cind[1], cind[2]); |
---|
| 2817 | Print("bound : %d\n", bound); |
---|
| 2818 | Print("cind : %d\n", cabsind); |
---|
| 2819 | #endif |
---|
| 2820 | if (cabsind == 0) |
---|
| 2821 | { |
---|
| 2822 | if (!(nextZeroSimplexExponent(exp, ind, cexp, cind, &cabsind, step, bound, currRing->N))) |
---|
| 2823 | { |
---|
| 2824 | return; |
---|
| 2825 | } |
---|
| 2826 | } |
---|
| 2827 | // Now the whole simplex |
---|
| 2828 | do |
---|
| 2829 | { |
---|
| 2830 | // Build s-polynomial |
---|
| 2831 | // 2**ind-def * mult * g - exp-def * h |
---|
| 2832 | poly t_p; |
---|
| 2833 | poly zeroPoly = kCreateZeroPoly(cexp, cabsind, &t_p, currRing, strat->tailRing); |
---|
| 2834 | #ifdef OLI_DEBUG |
---|
| 2835 | Print("%d, (%d, %d), ind = (%d, %d)\n", cabsind, cexp[1], cexp[2], cind[1], cind[2]); |
---|
| 2836 | Print("zPoly : "); |
---|
| 2837 | wrp(zeroPoly); |
---|
| 2838 | Print("\n"); |
---|
| 2839 | #endif |
---|
| 2840 | enterOneZeroPairRing(zeroPoly, t_p, p, ecart, strat, atR); |
---|
| 2841 | } |
---|
| 2842 | while ( nextZeroSimplexExponent(exp, ind, cexp, cind, &cabsind, step, bound, currRing->N) ); |
---|
| 2843 | } |
---|
| 2844 | |
---|
| 2845 | /* |
---|
| 2846 | * Create the Groebner basis of the vanishing polynomials. |
---|
| 2847 | */ |
---|
| 2848 | |
---|
| 2849 | ideal createG0() |
---|
| 2850 | { |
---|
| 2851 | // Initialize |
---|
| 2852 | long exp[50]; // The exponent of \hat{X} (basepoint) |
---|
| 2853 | long cexp[50]; // The current exponent for iterating over all |
---|
| 2854 | long ind[50]; // The power of 2 in the i-th component of exp |
---|
| 2855 | long cind[50]; // analog for cexp |
---|
| 2856 | long mult[50]; // How to multiply the elements of G |
---|
| 2857 | long cabsind = 0; // The abs. index of cexp, i.e. the sum of cind |
---|
| 2858 | long habsind = 0; // The abs. index of the coefficient of h |
---|
| 2859 | long step[50]; // The last increases |
---|
| 2860 | for (int i = 1; i <= currRing->N; i++) |
---|
| 2861 | { |
---|
| 2862 | exp[i] = 0; |
---|
| 2863 | cexp[i] = exp[i]; |
---|
| 2864 | ind[i] = 0; |
---|
| 2865 | step[i] = 500000; |
---|
| 2866 | cind[i] = ind[i]; |
---|
| 2867 | } |
---|
| 2868 | long bound = currRing->ch; |
---|
| 2869 | step[1] = 500000; |
---|
| 2870 | #ifdef OLI_DEBUG |
---|
| 2871 | PrintS("-------------\npoly :"); |
---|
| 2872 | // wrp(p); |
---|
| 2873 | Print("\nexp : (%d, %d)\n", exp[1] + mult[1], exp[2] + mult[1]); |
---|
| 2874 | Print("cexp : (%d, %d)\n", cexp[1], cexp[2]); |
---|
| 2875 | Print("cind : (%d, %d)\n", cind[1], cind[2]); |
---|
| 2876 | Print("bound : %d\n", bound); |
---|
| 2877 | Print("cind : %d\n", cabsind); |
---|
| 2878 | #endif |
---|
| 2879 | if (cabsind == 0) |
---|
| 2880 | { |
---|
| 2881 | if (!(nextZeroSimplexExponent(exp, ind, cexp, cind, &cabsind, step, bound, currRing->N))) |
---|
| 2882 | { |
---|
| 2883 | return idInit(1, 1); |
---|
| 2884 | } |
---|
| 2885 | } |
---|
| 2886 | ideal G0 = idInit(1, 1); |
---|
| 2887 | // Now the whole simplex |
---|
| 2888 | do |
---|
| 2889 | { |
---|
| 2890 | // Build s-polynomial |
---|
| 2891 | // 2**ind-def * mult * g - exp-def * h |
---|
| 2892 | poly t_p; |
---|
| 2893 | poly zeroPoly = kCreateZeroPoly(cexp, cabsind, &t_p, currRing, currRing); |
---|
| 2894 | #ifdef OLI_DEBUG |
---|
| 2895 | Print("%d, (%d, %d), ind = (%d, %d)\n", cabsind, cexp[1], cexp[2], cind[1], cind[2]); |
---|
| 2896 | Print("zPoly : "); |
---|
| 2897 | wrp(zeroPoly); |
---|
| 2898 | Print("\n"); |
---|
| 2899 | #endif |
---|
| 2900 | // Add to ideal |
---|
| 2901 | pEnlargeSet(&(G0->m), IDELEMS(G0), 1); |
---|
| 2902 | IDELEMS(G0) += 1; |
---|
| 2903 | G0->m[IDELEMS(G0) - 1] = zeroPoly; |
---|
| 2904 | } |
---|
| 2905 | while ( nextZeroSimplexExponent(exp, ind, cexp, cind, &cabsind, step, bound, currRing->N) ); |
---|
| 2906 | idSkipZeroes(G0); |
---|
| 2907 | return G0; |
---|
| 2908 | } |
---|
| 2909 | #endif |
---|
| 2910 | |
---|
| 2911 | #ifdef HAVE_RINGS |
---|
| 2912 | /*2 |
---|
| 2913 | *(s[0],h),...,(s[k],h) will be put to the pairset L |
---|
| 2914 | */ |
---|
| 2915 | void initenterstrongPairs (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR = -1) |
---|
| 2916 | { |
---|
[9524c6] | 2917 | const int iCompH = pGetComp(h); |
---|
[f41347f] | 2918 | if (!nIsOne(pGetCoeff(h))) |
---|
| 2919 | { |
---|
| 2920 | int j; |
---|
| 2921 | BOOLEAN new_pair=FALSE; |
---|
| 2922 | |
---|
| 2923 | for (j=0; j<=k; j++) |
---|
| 2924 | { |
---|
| 2925 | // Print("j:%d, Ll:%d\n",j,strat->Ll); |
---|
| 2926 | // if (((unsigned long) pGetCoeff(h) % (unsigned long) pGetCoeff(strat->S[j]) != 0) && |
---|
| 2927 | // ((unsigned long) pGetCoeff(strat->S[j]) % (unsigned long) pGetCoeff(h) != 0)) |
---|
[91d286] | 2928 | if ( iCompH == pGetComp(strat->S[j]) ) |
---|
[f41347f] | 2929 | { |
---|
[9524c6] | 2930 | { |
---|
| 2931 | if (enterOneStrongPoly(j,h,ecart,isFromQ,strat, atR)) |
---|
| 2932 | new_pair=TRUE; |
---|
| 2933 | } |
---|
[f41347f] | 2934 | } |
---|
| 2935 | } |
---|
| 2936 | } |
---|
| 2937 | /* |
---|
| 2938 | ring r=256,(x,y,z),dp; |
---|
| 2939 | ideal I=12xz-133y, 2xy-z; |
---|
| 2940 | */ |
---|
| 2941 | |
---|
| 2942 | } |
---|
| 2943 | |
---|
| 2944 | /*2 |
---|
| 2945 | * Generates spoly(0, h) if applicable. Assumes ring in Z/2^n. |
---|
| 2946 | */ |
---|
| 2947 | void enterExtendedSpoly(poly h,kStrategy strat) |
---|
| 2948 | { |
---|
| 2949 | if (nIsOne(pGetCoeff(h))) return; |
---|
| 2950 | number gcd; |
---|
| 2951 | bool go = false; |
---|
| 2952 | if (nDivBy((number) 0, pGetCoeff(h))) |
---|
| 2953 | { |
---|
| 2954 | gcd = nIntDiv((number) 0, pGetCoeff(h)); |
---|
| 2955 | go = true; |
---|
| 2956 | } |
---|
| 2957 | else |
---|
| 2958 | gcd = nGcd((number) 0, pGetCoeff(h), strat->tailRing); |
---|
| 2959 | if (go || !nIsOne(gcd)) |
---|
| 2960 | { |
---|
| 2961 | poly p = h->next; |
---|
| 2962 | if (!go) |
---|
| 2963 | { |
---|
| 2964 | number tmp = gcd; |
---|
| 2965 | gcd = nIntDiv(0, gcd); |
---|
| 2966 | nDelete(&tmp); |
---|
| 2967 | } |
---|
[7a4a43] | 2968 | p_Test(p,strat->tailRing); |
---|
[f41347f] | 2969 | p = pp_Mult_nn(p, gcd, strat->tailRing); |
---|
| 2970 | nDelete(&gcd); |
---|
| 2971 | |
---|
| 2972 | if (p != NULL) |
---|
| 2973 | { |
---|
| 2974 | if (TEST_OPT_PROT) |
---|
| 2975 | { |
---|
| 2976 | PrintS("Z"); |
---|
| 2977 | } |
---|
| 2978 | #ifdef KDEBUG |
---|
| 2979 | if (TEST_OPT_DEBUG) |
---|
| 2980 | { |
---|
| 2981 | PrintS("--- create zero spoly: "); |
---|
[7a4a43] | 2982 | p_wrp(h,currRing,strat->tailRing); |
---|
[f41347f] | 2983 | PrintS(" ---> "); |
---|
| 2984 | } |
---|
| 2985 | #endif |
---|
| 2986 | poly tmp = pInit(); |
---|
| 2987 | pSetCoeff0(tmp, pGetCoeff(p)); |
---|
[7a4a43] | 2988 | for (int i = 1; i <= rVar(currRing); i++) |
---|
[f41347f] | 2989 | { |
---|
| 2990 | pSetExp(tmp, i, p_GetExp(p, i, strat->tailRing)); |
---|
| 2991 | } |
---|
[7a4a43] | 2992 | if (rRing_has_Comp(currRing) && rRing_has_Comp(strat->tailRing)) |
---|
| 2993 | { |
---|
[f41347f] | 2994 | p_SetComp(tmp, p_GetComp(p, strat->tailRing), currRing); |
---|
[7a4a43] | 2995 | } |
---|
[f41347f] | 2996 | p_Setm(tmp, currRing); |
---|
| 2997 | p = p_LmFreeAndNext(p, strat->tailRing); |
---|
| 2998 | pNext(tmp) = p; |
---|
| 2999 | LObject h; |
---|
[7a4a43] | 3000 | h.Init(); |
---|
[f41347f] | 3001 | h.p = tmp; |
---|
| 3002 | h.tailRing = strat->tailRing; |
---|
| 3003 | int posx; |
---|
| 3004 | if (h.p!=NULL) |
---|
| 3005 | { |
---|
| 3006 | if (TEST_OPT_INTSTRATEGY) |
---|
| 3007 | { |
---|
| 3008 | //pContent(h.p); |
---|
| 3009 | h.pCleardenom(); // also does a pContent |
---|
| 3010 | } |
---|
| 3011 | else |
---|
| 3012 | { |
---|
| 3013 | h.pNorm(); |
---|
| 3014 | } |
---|
| 3015 | strat->initEcart(&h); |
---|
| 3016 | if (strat->Ll==-1) |
---|
| 3017 | posx =0; |
---|
| 3018 | else |
---|
| 3019 | posx = strat->posInL(strat->L,strat->Ll,&h,strat); |
---|
| 3020 | h.sev = pGetShortExpVector(h.p); |
---|
| 3021 | if (strat->tailRing != currRing) |
---|
| 3022 | { |
---|
[7a4a43] | 3023 | h.t_p = k_LmInit_currRing_2_tailRing(h.p, strat->tailRing); |
---|
[f41347f] | 3024 | } |
---|
| 3025 | #ifdef KDEBUG |
---|
| 3026 | if (TEST_OPT_DEBUG) |
---|
| 3027 | { |
---|
[7a4a43] | 3028 | p_wrp(tmp,currRing,strat->tailRing); |
---|
[f41347f] | 3029 | PrintLn(); |
---|
| 3030 | } |
---|
| 3031 | #endif |
---|
| 3032 | enterL(&strat->L,&strat->Ll,&strat->Lmax,h,posx); |
---|
| 3033 | } |
---|
| 3034 | } |
---|
| 3035 | } |
---|
| 3036 | nDelete(&gcd); |
---|
| 3037 | } |
---|
| 3038 | |
---|
| 3039 | void clearSbatch (poly h,int k,int pos,kStrategy strat) |
---|
| 3040 | { |
---|
| 3041 | int j = pos; |
---|
| 3042 | if ( (!strat->fromT) |
---|
| 3043 | && (1//(strat->syzComp==0) |
---|
| 3044 | //||(pGetComp(h)<=strat->syzComp))) |
---|
| 3045 | )) |
---|
| 3046 | { |
---|
| 3047 | // Print("start clearS k=%d, pos=%d, sl=%d\n",k,pos,strat->sl); |
---|
| 3048 | unsigned long h_sev = pGetShortExpVector(h); |
---|
| 3049 | loop |
---|
| 3050 | { |
---|
| 3051 | if (j > k) break; |
---|
| 3052 | clearS(h,h_sev, &j,&k,strat); |
---|
| 3053 | j++; |
---|
| 3054 | } |
---|
| 3055 | // Print("end clearS sl=%d\n",strat->sl); |
---|
| 3056 | } |
---|
| 3057 | } |
---|
| 3058 | |
---|
| 3059 | /*2 |
---|
| 3060 | * Generates a sufficient set of spolys (maybe just a finite generating |
---|
| 3061 | * set of the syzygys) |
---|
| 3062 | */ |
---|
| 3063 | void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR) |
---|
| 3064 | { |
---|
| 3065 | assume (rField_is_Ring(currRing)); |
---|
| 3066 | // enter also zero divisor * poly, if this is non zero and of smaller degree |
---|
| 3067 | if (!(rField_is_Domain(currRing))) enterExtendedSpoly(h, strat); |
---|
[05eb8c] | 3068 | initenterpairs(h, k, ecart, 0, strat, atR); |
---|
[f41347f] | 3069 | initenterstrongPairs(h, k, ecart, 0, strat, atR); |
---|
| 3070 | clearSbatch(h, k, pos, strat); |
---|
| 3071 | } |
---|
| 3072 | #endif |
---|
| 3073 | |
---|
| 3074 | /*2 |
---|
| 3075 | *(s[0],h),...,(s[k],h) will be put to the pairset L(via initenterpairs) |
---|
| 3076 | *superfluous elements in S will be deleted |
---|
| 3077 | */ |
---|
| 3078 | void enterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR) |
---|
| 3079 | { |
---|
| 3080 | int j=pos; |
---|
| 3081 | |
---|
| 3082 | #ifdef HAVE_RINGS |
---|
| 3083 | assume (!rField_is_Ring(currRing)); |
---|
| 3084 | #endif |
---|
| 3085 | |
---|
| 3086 | initenterpairs(h,k,ecart,0,strat, atR); |
---|
| 3087 | if ( (!strat->fromT) |
---|
| 3088 | && ((strat->syzComp==0) |
---|
| 3089 | ||(pGetComp(h)<=strat->syzComp))) |
---|
| 3090 | { |
---|
| 3091 | //Print("start clearS k=%d, pos=%d, sl=%d\n",k,pos,strat->sl); |
---|
| 3092 | unsigned long h_sev = pGetShortExpVector(h); |
---|
| 3093 | loop |
---|
| 3094 | { |
---|
| 3095 | if (j > k) break; |
---|
| 3096 | clearS(h,h_sev, &j,&k,strat); |
---|
| 3097 | j++; |
---|
| 3098 | } |
---|
| 3099 | //Print("end clearS sl=%d\n",strat->sl); |
---|
| 3100 | } |
---|
| 3101 | // PrintS("end enterpairs\n"); |
---|
| 3102 | } |
---|
| 3103 | |
---|
| 3104 | /*2 |
---|
| 3105 | *(s[0],h),...,(s[k],h) will be put to the pairset L(via initenterpairs) |
---|
| 3106 | *superfluous elements in S will be deleted |
---|
| 3107 | */ |
---|
| 3108 | void enterpairsSpecial (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1) |
---|
| 3109 | { |
---|
| 3110 | int j; |
---|
[7e67625] | 3111 | const int iCompH = pGetComp(h); |
---|
[f41347f] | 3112 | |
---|
| 3113 | for (j=0; j<=k; j++) |
---|
| 3114 | { |
---|
[7e67625] | 3115 | const int iCompSj = pGetComp(strat->S[j]); |
---|
| 3116 | if ((iCompH==iCompSj) |
---|
| 3117 | || (0==iCompH) // TODO: what about this case??? |
---|
| 3118 | || (0==iCompSj)) |
---|
[f41347f] | 3119 | { |
---|
| 3120 | enterOnePairSpecial(j,h,ecart,strat, atR); |
---|
| 3121 | } |
---|
| 3122 | } |
---|
[b1c0a9] | 3123 | |
---|
| 3124 | if (strat->noClearS) return; |
---|
[9f17c9] | 3125 | |
---|
[f41347f] | 3126 | // #ifdef HAVE_PLURAL |
---|
[b1c0a9] | 3127 | /* |
---|
| 3128 | if (rIsPluralRing(currRing)) |
---|
[f41347f] | 3129 | { |
---|
[b1c0a9] | 3130 | j=pos; |
---|
| 3131 | loop |
---|
| 3132 | { |
---|
| 3133 | if (j > k) break; |
---|
| 3134 | |
---|
| 3135 | if (pLmDivisibleBy(h, strat->S[j])) |
---|
| 3136 | { |
---|
| 3137 | deleteInS(j, strat); |
---|
| 3138 | j--; |
---|
| 3139 | k--; |
---|
| 3140 | } |
---|
[9f17c9] | 3141 | |
---|
[b1c0a9] | 3142 | j++; |
---|
| 3143 | } |
---|
[9f17c9] | 3144 | } |
---|
[b1c0a9] | 3145 | else |
---|
[9f17c9] | 3146 | */ |
---|
| 3147 | // #endif // ??? Why was the following cancelation disabled for non-commutative rings? |
---|
| 3148 | { |
---|
[f41347f] | 3149 | j=pos; |
---|
| 3150 | loop |
---|
| 3151 | { |
---|
| 3152 | unsigned long h_sev = pGetShortExpVector(h); |
---|
| 3153 | if (j > k) break; |
---|
| 3154 | clearS(h,h_sev,&j,&k,strat); |
---|
| 3155 | j++; |
---|
| 3156 | } |
---|
| 3157 | } |
---|
| 3158 | } |
---|
| 3159 | |
---|
| 3160 | /*2 |
---|
| 3161 | *reorders s with respect to posInS, |
---|
| 3162 | *suc is the first changed index or zero |
---|
| 3163 | */ |
---|
| 3164 | |
---|
| 3165 | void reorderS (int* suc,kStrategy strat) |
---|
| 3166 | { |
---|
| 3167 | int i,j,at,ecart, s2r; |
---|
| 3168 | int fq=0; |
---|
| 3169 | unsigned long sev; |
---|
| 3170 | poly p; |
---|
| 3171 | int new_suc=strat->sl+1; |
---|
| 3172 | i= *suc; |
---|
| 3173 | if (i<0) i=0; |
---|
| 3174 | |
---|
| 3175 | for (; i<=strat->sl; i++) |
---|
| 3176 | { |
---|
| 3177 | at = posInS(strat,i-1,strat->S[i],strat->ecartS[i]); |
---|
| 3178 | if (at != i) |
---|
| 3179 | { |
---|
| 3180 | if (new_suc > at) new_suc = at; |
---|
| 3181 | p = strat->S[i]; |
---|
| 3182 | ecart = strat->ecartS[i]; |
---|
| 3183 | sev = strat->sevS[i]; |
---|
| 3184 | s2r = strat->S_2_R[i]; |
---|
| 3185 | if (strat->fromQ!=NULL) fq=strat->fromQ[i]; |
---|
| 3186 | for (j=i; j>=at+1; j--) |
---|
| 3187 | { |
---|
| 3188 | strat->S[j] = strat->S[j-1]; |
---|
| 3189 | strat->ecartS[j] = strat->ecartS[j-1]; |
---|
| 3190 | strat->sevS[j] = strat->sevS[j-1]; |
---|
| 3191 | strat->S_2_R[j] = strat->S_2_R[j-1]; |
---|
| 3192 | } |
---|
| 3193 | strat->S[at] = p; |
---|
| 3194 | strat->ecartS[at] = ecart; |
---|
| 3195 | strat->sevS[at] = sev; |
---|
| 3196 | strat->S_2_R[at] = s2r; |
---|
| 3197 | if (strat->fromQ!=NULL) |
---|
| 3198 | { |
---|
| 3199 | for (j=i; j>=at+1; j--) |
---|
| 3200 | { |
---|
| 3201 | strat->fromQ[j] = strat->fromQ[j-1]; |
---|
| 3202 | } |
---|
| 3203 | strat->fromQ[at]=fq; |
---|
| 3204 | } |
---|
| 3205 | } |
---|
| 3206 | } |
---|
| 3207 | if (new_suc <= strat->sl) *suc=new_suc; |
---|
| 3208 | else *suc=-1; |
---|
| 3209 | } |
---|
| 3210 | |
---|
| 3211 | |
---|
| 3212 | /*2 |
---|
| 3213 | *looks up the position of p in set |
---|
| 3214 | *set[0] is the smallest with respect to the ordering-procedure deg/pComp |
---|
| 3215 | * Assumption: posInS only depends on the leading term |
---|
| 3216 | * otherwise, bba has to be changed |
---|
| 3217 | */ |
---|
| 3218 | int posInS (const kStrategy strat, const int length,const poly p, |
---|
| 3219 | const int ecart_p) |
---|
| 3220 | { |
---|
| 3221 | if(length==-1) return 0; |
---|
| 3222 | polyset set=strat->S; |
---|
| 3223 | int i; |
---|
| 3224 | int an = 0; |
---|
| 3225 | int en = length; |
---|
| 3226 | int cmp_int = pOrdSgn; |
---|
| 3227 | int pc=pGetComp(p); |
---|
| 3228 | if ((currRing->MixedOrder) |
---|
[6e05dc] | 3229 | #ifdef HAVE_PLURAL |
---|
[f41347f] | 3230 | && (currRing->real_var_start==0) |
---|
[6e05dc] | 3231 | #endif |
---|
[f41347f] | 3232 | #if 0 |
---|
| 3233 | || ((strat->ak>0) && ((currRing->order[0]==ringorder_c)||((currRing->order[0]==ringorder_C)))) |
---|
| 3234 | #endif |
---|
| 3235 | ) |
---|
| 3236 | { |
---|
| 3237 | int o=pWTotaldegree(p); |
---|
| 3238 | int oo=pWTotaldegree(set[length]); |
---|
| 3239 | |
---|
| 3240 | if ((oo<o) |
---|
| 3241 | || ((o==oo) && (pLmCmp(set[length],p)!= cmp_int))) |
---|
| 3242 | return length+1; |
---|
| 3243 | |
---|
| 3244 | loop |
---|
| 3245 | { |
---|
| 3246 | if (an >= en-1) |
---|
| 3247 | { |
---|
| 3248 | if ((pWTotaldegree(set[an])>=o) && (pLmCmp(set[an],p) == cmp_int)) |
---|
| 3249 | { |
---|
| 3250 | return an; |
---|
| 3251 | } |
---|
| 3252 | return en; |
---|
| 3253 | } |
---|
| 3254 | i=(an+en) / 2; |
---|
| 3255 | if ((pWTotaldegree(set[i])>=o) && (pLmCmp(set[i],p) == cmp_int)) en=i; |
---|
| 3256 | else an=i; |
---|
| 3257 | } |
---|
| 3258 | } |
---|
| 3259 | else |
---|
| 3260 | { |
---|
| 3261 | #ifdef HAVE_RINGS |
---|
| 3262 | if (rField_is_Ring(currRing)) |
---|
| 3263 | { |
---|
| 3264 | if (pLmCmp(set[length],p)== -cmp_int) |
---|
| 3265 | return length+1; |
---|
| 3266 | int cmp; |
---|
| 3267 | loop |
---|
| 3268 | { |
---|
| 3269 | if (an >= en-1) |
---|
| 3270 | { |
---|
| 3271 | cmp = pLmCmp(set[an],p); |
---|
| 3272 | if (cmp == cmp_int) return an; |
---|
| 3273 | if (cmp == -cmp_int) return en; |
---|
| 3274 | if (nDivBy(pGetCoeff(p), pGetCoeff(set[an]))) return en; |
---|
| 3275 | return an; |
---|
| 3276 | } |
---|
| 3277 | i = (an+en) / 2; |
---|
| 3278 | cmp = pLmCmp(set[i],p); |
---|
| 3279 | if (cmp == cmp_int) en = i; |
---|
| 3280 | else if (cmp == -cmp_int) an = i; |
---|
| 3281 | else |
---|
| 3282 | { |
---|
| 3283 | if (nDivBy(pGetCoeff(p), pGetCoeff(set[i]))) an = i; |
---|
| 3284 | else en = i; |
---|
| 3285 | } |
---|
| 3286 | } |
---|
| 3287 | } |
---|
| 3288 | else |
---|
| 3289 | #endif |
---|
| 3290 | if (pLmCmp(set[length],p)== -cmp_int) |
---|
| 3291 | return length+1; |
---|
| 3292 | |
---|
| 3293 | loop |
---|
| 3294 | { |
---|
| 3295 | if (an >= en-1) |
---|
| 3296 | { |
---|
| 3297 | if (pLmCmp(set[an],p) == cmp_int) return an; |
---|
| 3298 | if (pLmCmp(set[an],p) == -cmp_int) return en; |
---|
| 3299 | if ((cmp_int!=1) |
---|
| 3300 | && ((strat->ecartS[an])>ecart_p)) |
---|
| 3301 | return an; |
---|
| 3302 | return en; |
---|
| 3303 | } |
---|
| 3304 | i=(an+en) / 2; |
---|
| 3305 | if (pLmCmp(set[i],p) == cmp_int) en=i; |
---|
| 3306 | else if (pLmCmp(set[i],p) == -cmp_int) an=i; |
---|
| 3307 | else |
---|
| 3308 | { |
---|
| 3309 | if ((cmp_int!=1) |
---|
| 3310 | &&((strat->ecartS[i])<ecart_p)) |
---|
| 3311 | en=i; |
---|
| 3312 | else |
---|
| 3313 | an=i; |
---|
| 3314 | } |
---|
| 3315 | } |
---|
| 3316 | } |
---|
| 3317 | } |
---|
| 3318 | |
---|
| 3319 | |
---|
| 3320 | /*2 |
---|
| 3321 | * looks up the position of p in set |
---|
| 3322 | * the position is the last one |
---|
| 3323 | */ |
---|
| 3324 | int posInT0 (const TSet set,const int length,LObject &p) |
---|
| 3325 | { |
---|
| 3326 | return (length+1); |
---|
| 3327 | } |
---|
| 3328 | |
---|
| 3329 | |
---|
| 3330 | /*2 |
---|
| 3331 | * looks up the position of p in T |
---|
| 3332 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3333 | * pComp |
---|
| 3334 | */ |
---|
| 3335 | int posInT1 (const TSet set,const int length,LObject &p) |
---|
| 3336 | { |
---|
| 3337 | if (length==-1) return 0; |
---|
| 3338 | |
---|
| 3339 | if (pLmCmp(set[length].p,p.p)!= pOrdSgn) return length+1; |
---|
| 3340 | |
---|
| 3341 | int i; |
---|
| 3342 | int an = 0; |
---|
| 3343 | int en= length; |
---|
| 3344 | |
---|
| 3345 | loop |
---|
| 3346 | { |
---|
| 3347 | if (an >= en-1) |
---|
| 3348 | { |
---|
| 3349 | if (pLmCmp(set[an].p,p.p) == pOrdSgn) return an; |
---|
| 3350 | return en; |
---|
| 3351 | } |
---|
| 3352 | i=(an+en) / 2; |
---|
| 3353 | if (pLmCmp(set[i].p,p.p) == pOrdSgn) en=i; |
---|
| 3354 | else an=i; |
---|
| 3355 | } |
---|
| 3356 | } |
---|
| 3357 | |
---|
| 3358 | /*2 |
---|
| 3359 | * looks up the position of p in T |
---|
| 3360 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3361 | * length |
---|
| 3362 | */ |
---|
| 3363 | int posInT2 (const TSet set,const int length,LObject &p) |
---|
| 3364 | { |
---|
[c63c70] | 3365 | p.GetpLength(); |
---|
[f41347f] | 3366 | if (length==-1) |
---|
| 3367 | return 0; |
---|
| 3368 | if (set[length].length<p.length) |
---|
| 3369 | return length+1; |
---|
| 3370 | |
---|
| 3371 | int i; |
---|
| 3372 | int an = 0; |
---|
| 3373 | int en= length; |
---|
| 3374 | |
---|
| 3375 | loop |
---|
| 3376 | { |
---|
| 3377 | if (an >= en-1) |
---|
| 3378 | { |
---|
| 3379 | if (set[an].length>p.length) return an; |
---|
| 3380 | return en; |
---|
| 3381 | } |
---|
| 3382 | i=(an+en) / 2; |
---|
| 3383 | if (set[i].length>p.length) en=i; |
---|
| 3384 | else an=i; |
---|
| 3385 | } |
---|
| 3386 | } |
---|
| 3387 | |
---|
| 3388 | /*2 |
---|
| 3389 | * looks up the position of p in T |
---|
| 3390 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3391 | * totaldegree,pComp |
---|
| 3392 | */ |
---|
| 3393 | int posInT11 (const TSet set,const int length,LObject &p) |
---|
| 3394 | /*{ |
---|
| 3395 | * int j=0; |
---|
| 3396 | * int o; |
---|
| 3397 | * |
---|
| 3398 | * o = p.GetpFDeg(); |
---|
| 3399 | * loop |
---|
| 3400 | * { |
---|
| 3401 | * if ((pFDeg(set[j].p) > o) |
---|
| 3402 | * || ((pFDeg(set[j].p) == o) && (pLmCmp(set[j].p,p.p) == pOrdSgn))) |
---|
| 3403 | * { |
---|
| 3404 | * return j; |
---|
| 3405 | * } |
---|
| 3406 | * j++; |
---|
| 3407 | * if (j > length) return j; |
---|
| 3408 | * } |
---|
| 3409 | *} |
---|
| 3410 | */ |
---|
| 3411 | { |
---|
| 3412 | if (length==-1) return 0; |
---|
| 3413 | |
---|
| 3414 | int o = p.GetpFDeg(); |
---|
| 3415 | int op = set[length].GetpFDeg(); |
---|
| 3416 | |
---|
| 3417 | if ((op < o) |
---|
| 3418 | || ((op == o) && (pLmCmp(set[length].p,p.p) != pOrdSgn))) |
---|
| 3419 | return length+1; |
---|
| 3420 | |
---|
| 3421 | int i; |
---|
| 3422 | int an = 0; |
---|
| 3423 | int en= length; |
---|
| 3424 | |
---|
| 3425 | loop |
---|
| 3426 | { |
---|
| 3427 | if (an >= en-1) |
---|
| 3428 | { |
---|
| 3429 | op= set[an].GetpFDeg(); |
---|
| 3430 | if ((op > o) |
---|
| 3431 | || (( op == o) && (pLmCmp(set[an].p,p.p) == pOrdSgn))) |
---|
| 3432 | return an; |
---|
| 3433 | return en; |
---|
| 3434 | } |
---|
| 3435 | i=(an+en) / 2; |
---|
| 3436 | op = set[i].GetpFDeg(); |
---|
| 3437 | if (( op > o) |
---|
| 3438 | || (( op == o) && (pLmCmp(set[i].p,p.p) == pOrdSgn))) |
---|
| 3439 | en=i; |
---|
| 3440 | else |
---|
| 3441 | an=i; |
---|
| 3442 | } |
---|
| 3443 | } |
---|
| 3444 | |
---|
| 3445 | /*2 Pos for rings T: Here I am |
---|
| 3446 | * looks up the position of p in T |
---|
| 3447 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3448 | * totaldegree,pComp |
---|
| 3449 | */ |
---|
| 3450 | int posInTrg0 (const TSet set,const int length,LObject &p) |
---|
| 3451 | { |
---|
| 3452 | if (length==-1) return 0; |
---|
| 3453 | int o = p.GetpFDeg(); |
---|
| 3454 | int op = set[length].GetpFDeg(); |
---|
| 3455 | int i; |
---|
| 3456 | int an = 0; |
---|
| 3457 | int en = length; |
---|
| 3458 | int cmp_int = pOrdSgn; |
---|
| 3459 | if ((op < o) || (pLmCmp(set[length].p,p.p)== -cmp_int)) |
---|
| 3460 | return length+1; |
---|
| 3461 | int cmp; |
---|
| 3462 | loop |
---|
| 3463 | { |
---|
| 3464 | if (an >= en-1) |
---|
| 3465 | { |
---|
| 3466 | op = set[an].GetpFDeg(); |
---|
| 3467 | if (op > o) return an; |
---|
| 3468 | if (op < 0) return en; |
---|
| 3469 | cmp = pLmCmp(set[an].p,p.p); |
---|
| 3470 | if (cmp == cmp_int) return an; |
---|
| 3471 | if (cmp == -cmp_int) return en; |
---|
| 3472 | if (nGreater(pGetCoeff(p.p), pGetCoeff(set[an].p))) return en; |
---|
| 3473 | return an; |
---|
| 3474 | } |
---|
| 3475 | i = (an + en) / 2; |
---|
| 3476 | op = set[i].GetpFDeg(); |
---|
| 3477 | if (op > o) en = i; |
---|
| 3478 | else if (op < o) an = i; |
---|
| 3479 | else |
---|
| 3480 | { |
---|
| 3481 | cmp = pLmCmp(set[i].p,p.p); |
---|
| 3482 | if (cmp == cmp_int) en = i; |
---|
| 3483 | else if (cmp == -cmp_int) an = i; |
---|
| 3484 | else if (nGreater(pGetCoeff(p.p), pGetCoeff(set[i].p))) an = i; |
---|
| 3485 | else en = i; |
---|
| 3486 | } |
---|
| 3487 | } |
---|
| 3488 | } |
---|
| 3489 | /* |
---|
| 3490 | int o = p.GetpFDeg(); |
---|
| 3491 | int op = set[length].GetpFDeg(); |
---|
| 3492 | |
---|
| 3493 | if ((op < o) |
---|
| 3494 | || ((op == o) && (pLmCmp(set[length].p,p.p) != pOrdSgn))) |
---|
| 3495 | return length+1; |
---|
| 3496 | |
---|
| 3497 | int i; |
---|
| 3498 | int an = 0; |
---|
| 3499 | int en= length; |
---|
| 3500 | |
---|
| 3501 | loop |
---|
| 3502 | { |
---|
| 3503 | if (an >= en-1) |
---|
| 3504 | { |
---|
| 3505 | op= set[an].GetpFDeg(); |
---|
| 3506 | if ((op > o) |
---|
| 3507 | || (( op == o) && (pLmCmp(set[an].p,p.p) == pOrdSgn))) |
---|
| 3508 | return an; |
---|
| 3509 | return en; |
---|
| 3510 | } |
---|
| 3511 | i=(an+en) / 2; |
---|
| 3512 | op = set[i].GetpFDeg(); |
---|
| 3513 | if (( op > o) |
---|
| 3514 | || (( op == o) && (pLmCmp(set[i].p,p.p) == pOrdSgn))) |
---|
| 3515 | en=i; |
---|
| 3516 | else |
---|
| 3517 | an=i; |
---|
| 3518 | } |
---|
| 3519 | } |
---|
| 3520 | */ |
---|
| 3521 | /*2 |
---|
| 3522 | * looks up the position of p in T |
---|
| 3523 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3524 | * totaldegree,pComp |
---|
| 3525 | */ |
---|
| 3526 | int posInT110 (const TSet set,const int length,LObject &p) |
---|
| 3527 | { |
---|
[93047e] | 3528 | p.GetpLength(); |
---|
[f41347f] | 3529 | if (length==-1) return 0; |
---|
| 3530 | |
---|
| 3531 | int o = p.GetpFDeg(); |
---|
| 3532 | int op = set[length].GetpFDeg(); |
---|
| 3533 | |
---|
| 3534 | if (( op < o) |
---|
| 3535 | || (( op == o) && (set[length].length<p.length)) |
---|
| 3536 | || (( op == o) && (set[length].length == p.length) |
---|
| 3537 | && (pLmCmp(set[length].p,p.p) != pOrdSgn))) |
---|
| 3538 | return length+1; |
---|
| 3539 | |
---|
| 3540 | int i; |
---|
| 3541 | int an = 0; |
---|
| 3542 | int en= length; |
---|
| 3543 | loop |
---|
| 3544 | { |
---|
| 3545 | if (an >= en-1) |
---|
| 3546 | { |
---|
| 3547 | op = set[an].GetpFDeg(); |
---|
| 3548 | if (( op > o) |
---|
| 3549 | || (( op == o) && (set[an].length > p.length)) |
---|
| 3550 | || (( op == o) && (set[an].length == p.length) |
---|
| 3551 | && (pLmCmp(set[an].p,p.p) == pOrdSgn))) |
---|
| 3552 | return an; |
---|
| 3553 | return en; |
---|
| 3554 | } |
---|
| 3555 | i=(an+en) / 2; |
---|
| 3556 | op = set[i].GetpFDeg(); |
---|
| 3557 | if (( op > o) |
---|
| 3558 | || (( op == o) && (set[i].length > p.length)) |
---|
| 3559 | || (( op == o) && (set[i].length == p.length) |
---|
| 3560 | && (pLmCmp(set[i].p,p.p) == pOrdSgn))) |
---|
| 3561 | en=i; |
---|
| 3562 | else |
---|
| 3563 | an=i; |
---|
| 3564 | } |
---|
| 3565 | } |
---|
| 3566 | |
---|
| 3567 | /*2 |
---|
| 3568 | * looks up the position of p in set |
---|
| 3569 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3570 | * pFDeg |
---|
| 3571 | */ |
---|
| 3572 | int posInT13 (const TSet set,const int length,LObject &p) |
---|
| 3573 | { |
---|
| 3574 | if (length==-1) return 0; |
---|
| 3575 | |
---|
| 3576 | int o = p.GetpFDeg(); |
---|
| 3577 | |
---|
| 3578 | if (set[length].GetpFDeg() <= o) |
---|
| 3579 | return length+1; |
---|
| 3580 | |
---|
| 3581 | int i; |
---|
| 3582 | int an = 0; |
---|
| 3583 | int en= length; |
---|
| 3584 | loop |
---|
| 3585 | { |
---|
| 3586 | if (an >= en-1) |
---|
| 3587 | { |
---|
| 3588 | if (set[an].GetpFDeg() > o) |
---|
| 3589 | return an; |
---|
| 3590 | return en; |
---|
| 3591 | } |
---|
| 3592 | i=(an+en) / 2; |
---|
| 3593 | if (set[i].GetpFDeg() > o) |
---|
| 3594 | en=i; |
---|
| 3595 | else |
---|
| 3596 | an=i; |
---|
| 3597 | } |
---|
| 3598 | } |
---|
| 3599 | |
---|
| 3600 | // determines the position based on: 1.) Ecart 2.) pLength |
---|
| 3601 | int posInT_EcartpLength(const TSet set,const int length,LObject &p) |
---|
| 3602 | { |
---|
[c63c70] | 3603 | int ol = p.GetpLength(); |
---|
[f41347f] | 3604 | if (length==-1) return 0; |
---|
| 3605 | |
---|
| 3606 | int op=p.ecart; |
---|
| 3607 | |
---|
| 3608 | int oo=set[length].ecart; |
---|
| 3609 | if ((oo < op) || ((oo==op) && (set[length].length < ol))) |
---|
| 3610 | return length+1; |
---|
| 3611 | |
---|
| 3612 | int i; |
---|
| 3613 | int an = 0; |
---|
| 3614 | int en= length; |
---|
| 3615 | loop |
---|
| 3616 | { |
---|
| 3617 | if (an >= en-1) |
---|
| 3618 | { |
---|
| 3619 | int oo=set[an].ecart; |
---|
| 3620 | if((oo > op) |
---|
| 3621 | || ((oo==op) && (set[an].pLength > ol))) |
---|
| 3622 | return an; |
---|
| 3623 | return en; |
---|
| 3624 | } |
---|
| 3625 | i=(an+en) / 2; |
---|
| 3626 | int oo=set[i].ecart; |
---|
| 3627 | if ((oo > op) |
---|
| 3628 | || ((oo == op) && (set[i].pLength > ol))) |
---|
| 3629 | en=i; |
---|
| 3630 | else |
---|
| 3631 | an=i; |
---|
| 3632 | } |
---|
| 3633 | } |
---|
| 3634 | |
---|
| 3635 | /*2 |
---|
| 3636 | * looks up the position of p in set |
---|
| 3637 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3638 | * maximaldegree, pComp |
---|
| 3639 | */ |
---|
| 3640 | int posInT15 (const TSet set,const int length,LObject &p) |
---|
| 3641 | /*{ |
---|
| 3642 | *int j=0; |
---|
| 3643 | * int o; |
---|
| 3644 | * |
---|
| 3645 | * o = p.GetpFDeg()+p.ecart; |
---|
| 3646 | * loop |
---|
| 3647 | * { |
---|
| 3648 | * if ((set[j].GetpFDeg()+set[j].ecart > o) |
---|
| 3649 | * || ((set[j].GetpFDeg()+set[j].ecart == o) |
---|
| 3650 | * && (pLmCmp(set[j].p,p.p) == pOrdSgn))) |
---|
| 3651 | * { |
---|
| 3652 | * return j; |
---|
| 3653 | * } |
---|
| 3654 | * j++; |
---|
| 3655 | * if (j > length) return j; |
---|
| 3656 | * } |
---|
| 3657 | *} |
---|
| 3658 | */ |
---|
| 3659 | { |
---|
| 3660 | if (length==-1) return 0; |
---|
| 3661 | |
---|
| 3662 | int o = p.GetpFDeg() + p.ecart; |
---|
| 3663 | int op = set[length].GetpFDeg()+set[length].ecart; |
---|
| 3664 | |
---|
| 3665 | if ((op < o) |
---|
| 3666 | || ((op == o) |
---|
| 3667 | && (pLmCmp(set[length].p,p.p) != pOrdSgn))) |
---|
| 3668 | return length+1; |
---|
| 3669 | |
---|
| 3670 | int i; |
---|
| 3671 | int an = 0; |
---|
| 3672 | int en= length; |
---|
| 3673 | loop |
---|
| 3674 | { |
---|
| 3675 | if (an >= en-1) |
---|
| 3676 | { |
---|
| 3677 | op = set[an].GetpFDeg()+set[an].ecart; |
---|
| 3678 | if (( op > o) |
---|
| 3679 | || (( op == o) && (pLmCmp(set[an].p,p.p) == pOrdSgn))) |
---|
| 3680 | return an; |
---|
| 3681 | return en; |
---|
| 3682 | } |
---|
| 3683 | i=(an+en) / 2; |
---|
| 3684 | op = set[i].GetpFDeg()+set[i].ecart; |
---|
| 3685 | if (( op > o) |
---|
| 3686 | || (( op == o) && (pLmCmp(set[i].p,p.p) == pOrdSgn))) |
---|
| 3687 | en=i; |
---|
| 3688 | else |
---|
| 3689 | an=i; |
---|
| 3690 | } |
---|
| 3691 | } |
---|
| 3692 | |
---|
| 3693 | /*2 |
---|
| 3694 | * looks up the position of p in set |
---|
| 3695 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3696 | * pFDeg+ecart, ecart, pComp |
---|
| 3697 | */ |
---|
| 3698 | int posInT17 (const TSet set,const int length,LObject &p) |
---|
| 3699 | /* |
---|
| 3700 | *{ |
---|
| 3701 | * int j=0; |
---|
| 3702 | * int o; |
---|
| 3703 | * |
---|
| 3704 | * o = p.GetpFDeg()+p.ecart; |
---|
| 3705 | * loop |
---|
| 3706 | * { |
---|
| 3707 | * if ((pFDeg(set[j].p)+set[j].ecart > o) |
---|
| 3708 | * || (((pFDeg(set[j].p)+set[j].ecart == o) |
---|
| 3709 | * && (set[j].ecart < p.ecart))) |
---|
| 3710 | * || ((pFDeg(set[j].p)+set[j].ecart == o) |
---|
| 3711 | * && (set[j].ecart==p.ecart) |
---|
| 3712 | * && (pLmCmp(set[j].p,p.p)==pOrdSgn))) |
---|
| 3713 | * return j; |
---|
| 3714 | * j++; |
---|
| 3715 | * if (j > length) return j; |
---|
| 3716 | * } |
---|
| 3717 | * } |
---|
| 3718 | */ |
---|
| 3719 | { |
---|
| 3720 | if (length==-1) return 0; |
---|
| 3721 | |
---|
| 3722 | int o = p.GetpFDeg() + p.ecart; |
---|
| 3723 | int op = set[length].GetpFDeg()+set[length].ecart; |
---|
| 3724 | |
---|
| 3725 | if ((op < o) |
---|
| 3726 | || (( op == o) && (set[length].ecart > p.ecart)) |
---|
| 3727 | || (( op == o) && (set[length].ecart==p.ecart) |
---|
| 3728 | && (pLmCmp(set[length].p,p.p) != pOrdSgn))) |
---|
| 3729 | return length+1; |
---|
| 3730 | |
---|
| 3731 | int i; |
---|
| 3732 | int an = 0; |
---|
| 3733 | int en= length; |
---|
| 3734 | loop |
---|
| 3735 | { |
---|
| 3736 | if (an >= en-1) |
---|
| 3737 | { |
---|
| 3738 | op = set[an].GetpFDeg()+set[an].ecart; |
---|
| 3739 | if (( op > o) |
---|
| 3740 | || (( op == o) && (set[an].ecart < p.ecart)) |
---|
| 3741 | || (( op == o) && (set[an].ecart==p.ecart) |
---|
| 3742 | && (pLmCmp(set[an].p,p.p) == pOrdSgn))) |
---|
| 3743 | return an; |
---|
| 3744 | return en; |
---|
| 3745 | } |
---|
| 3746 | i=(an+en) / 2; |
---|
| 3747 | op = set[i].GetpFDeg()+set[i].ecart; |
---|
| 3748 | if ((op > o) |
---|
| 3749 | || (( op == o) && (set[i].ecart < p.ecart)) |
---|
| 3750 | || (( op == o) && (set[i].ecart == p.ecart) |
---|
| 3751 | && (pLmCmp(set[i].p,p.p) == pOrdSgn))) |
---|
| 3752 | en=i; |
---|
| 3753 | else |
---|
| 3754 | an=i; |
---|
| 3755 | } |
---|
| 3756 | } |
---|
| 3757 | /*2 |
---|
| 3758 | * looks up the position of p in set |
---|
| 3759 | * set[0] is the smallest with respect to the ordering-procedure |
---|
| 3760 | * pGetComp, pFDeg+ecart, ecart, pComp |
---|
| 3761 | */ |
---|
| 3762 | int posInT17_c (const TSet set,const int length,LObject &p) |
---|
| 3763 | { |
---|
| 3764 | if (length==-1) return 0; |
---|
| 3765 | |
---|
| 3766 | int cc = (-1+2*currRing->order[0]==ringorder_c); |
---|
| 3767 | /* cc==1 for (c,..), cc==-1 for (C,..) */ |
---|
| 3768 | int o = p.GetpFDeg() + p.ecart; |
---|
| 3769 | int c = pGetComp(p.p)*cc; |
---|
| 3770 | |
---|
| 3771 | if (pGetComp(set[length].p)*cc < c) |
---|
| 3772 | return length+1; |
---|
| 3773 | if (pGetComp(set[length].p)*cc == c) |
---|
| 3774 | { |
---|
| 3775 | int op = set[length].GetpFDeg()+set[length].ecart; |
---|
| 3776 | if ((op < o) |
---|
| 3777 | || ((op == o) && (set[length].ecart > p.ecart)) |
---|
| 3778 | || ((op == o) && (set[length].ecart==p.ecart) |
---|
| 3779 | && (pLmCmp(set[length].p,p.p) != pOrdSgn))) |
---|
| 3780 | return length+1; |
---|
| 3781 | } |
---|
| 3782 | |
---|
| 3783 | int i; |
---|
| 3784 | int an = 0; |
---|
| 3785 | int en= length; |
---|
| 3786 | loop |
---|
| 3787 | { |
---|
| 3788 | if (an >= en-1) |
---|
| 3789 | { |
---|
| 3790 | if (pGetComp(set[an].p)*cc < c) |
---|
| 3791 | return en; |
---|
| 3792 | if (pGetComp(set[an].p)*cc == c) |
---|
| 3793 | { |
---|
| 3794 | int op = set[an].GetpFDeg()+set[an].ecart; |
---|
| 3795 | if ((op > o) |
---|
| 3796 | || ((op == o) && (set[an].ecart < p.ecart)) |
---|
| 3797 | || ((op == o) && (set[an].ecart==p.ecart) |
---|
| 3798 | && (pLmCmp(set[an].p,p.p) == pOrdSgn))) |
---|
| 3799 | return an; |
---|
| 3800 | } |
---|
| 3801 | return en; |
---|
| 3802 | } |
---|
| 3803 | i=(an+en) / 2; |
---|
| 3804 | if (pGetComp(set[i].p)*cc > c) |
---|
| 3805 | en=i; |
---|
| 3806 | else if (pGetComp(set[i].p)*cc == c) |
---|
| 3807 | { |
---|
| 3808 | int op = set[i].GetpFDeg()+set[i].ecart; |
---|
| 3809 | if ((op > o) |
---|
| 3810 | || ((op == o) && (set[i].ecart < p.ecart)) |
---|
| 3811 | || ((op == o) && (set[i].ecart == p.ecart) |
---|
| 3812 | && (pLmCmp(set[i].p,p.p) == pOrdSgn))) |
---|
| 3813 | en=i; |
---|
| 3814 | else |
---|
| 3815 | an=i; |
---|
| 3816 | } |
---|
| 3817 | else |
---|
| 3818 | an=i; |
---|
| 3819 | } |
---|
| 3820 | } |
---|
| 3821 | |
---|
| 3822 | /*2 |
---|
| 3823 | * looks up the position of p in set |
---|
| 3824 | * set[0] is the smallest with respect to |
---|
| 3825 | * ecart, pFDeg, length |
---|
| 3826 | */ |
---|
| 3827 | int posInT19 (const TSet set,const int length,LObject &p) |
---|
| 3828 | { |
---|
[c63c70] | 3829 | p.GetpLength(); |
---|
[f41347f] | 3830 | if (length==-1) return 0; |
---|
| 3831 | |
---|
| 3832 | int o = p.ecart; |
---|
| 3833 | int op=p.GetpFDeg(); |
---|
| 3834 | |
---|
| 3835 | if (set[length].ecart < o) |
---|
| 3836 | return length+1; |
---|
| 3837 | if (set[length].ecart == o) |
---|
| 3838 | { |
---|
| 3839 | int oo=set[length].GetpFDeg(); |
---|
| 3840 | if ((oo < op) || ((oo==op) && (set[length].length < p.length))) |
---|
| 3841 | return length+1; |
---|
| 3842 | } |
---|
| 3843 | |
---|
| 3844 | int i; |
---|
| 3845 | int an = 0; |
---|
| 3846 | int en= length; |
---|
| 3847 | loop |
---|
| 3848 | { |
---|
| 3849 | if (an >= en-1) |
---|
| 3850 | { |
---|
| 3851 | if (set[an].ecart > o) |
---|
| 3852 | return an; |
---|
| 3853 | if (set[an].ecart == o) |
---|
| 3854 | { |
---|
| 3855 | int oo=set[an].GetpFDeg(); |
---|
| 3856 | if((oo > op) |
---|
| 3857 | || ((oo==op) && (set[an].length > p.length))) |
---|
| 3858 | return an; |
---|
| 3859 | } |
---|
| 3860 | return en; |
---|
| 3861 | } |
---|
| 3862 | i=(an+en) / 2; |
---|
| 3863 | if (set[i].ecart > o) |
---|
| 3864 | en=i; |
---|
| 3865 | else if (set[i].ecart == o) |
---|
| 3866 | { |
---|
| 3867 | int oo=set[i].GetpFDeg(); |
---|
| 3868 | if ((oo > op) |
---|
| 3869 | || ((oo == op) && (set[i].length > p.length))) |
---|
| 3870 | en=i; |
---|
| 3871 | else |
---|
| 3872 | an=i; |
---|
| 3873 | } |
---|
| 3874 | else |
---|
| 3875 | an=i; |
---|
| 3876 | } |
---|
| 3877 | } |
---|
| 3878 | |
---|
| 3879 | /*2 |
---|
| 3880 | *looks up the position of polynomial p in set |
---|
| 3881 | *set[length] is the smallest element in set with respect |
---|
| 3882 | *to the ordering-procedure pComp |
---|
| 3883 | */ |
---|
| 3884 | int posInLSpecial (const LSet set, const int length, |
---|
| 3885 | LObject *p,const kStrategy strat) |
---|
| 3886 | { |
---|
| 3887 | if (length<0) return 0; |
---|
| 3888 | |
---|
| 3889 | int d=p->GetpFDeg(); |
---|
| 3890 | int op=set[length].GetpFDeg(); |
---|
| 3891 | |
---|
| 3892 | if ((op > d) |
---|
| 3893 | || ((op == d) && (p->p1!=NULL)&&(set[length].p1==NULL)) |
---|
| 3894 | || (pLmCmp(set[length].p,p->p)== pOrdSgn)) |
---|
| 3895 | return length+1; |
---|
| 3896 | |
---|
| 3897 | int i; |
---|
| 3898 | int an = 0; |
---|
| 3899 | int en= length; |
---|
| 3900 | loop |
---|
| 3901 | { |
---|
| 3902 | if (an >= en-1) |
---|
| 3903 | { |
---|
| 3904 | op=set[an].GetpFDeg(); |
---|
| 3905 | if ((op > d) |
---|
| 3906 | || ((op == d) && (p->p1!=NULL) && (set[an].p1==NULL)) |
---|
| 3907 | || (pLmCmp(set[an].p,p->p)== pOrdSgn)) |
---|
| 3908 | return en; |
---|
| 3909 | return an; |
---|
| 3910 | } |
---|
| 3911 | i=(an+en) / 2; |
---|
| 3912 | op=set[i].GetpFDeg(); |
---|
| 3913 | if ((op>d) |
---|
| 3914 | || ((op==d) && (p->p1!=NULL) && (set[i].p1==NULL)) |
---|
| 3915 | || (pLmCmp(set[i].p,p->p) == pOrdSgn)) |
---|
| 3916 | an=i; |
---|
| 3917 | else |
---|
| 3918 | en=i; |
---|
| 3919 | } |
---|
| 3920 | } |
---|
| 3921 | |
---|
| 3922 | /*2 |
---|
| 3923 | *looks up the position of polynomial p in set |
---|
| 3924 | *set[length] is the smallest element in set with respect |
---|
| 3925 | *to the ordering-procedure pComp |
---|
| 3926 | */ |
---|
| 3927 | int posInL0 (const LSet set, const int length, |
---|
| 3928 | LObject* p,const kStrategy strat) |
---|
| 3929 | { |
---|
| 3930 | if (length<0) return 0; |
---|
| 3931 | |
---|
| 3932 | if (pLmCmp(set[length].p,p->p)== pOrdSgn) |
---|
| 3933 | return length+1; |
---|
| 3934 | |
---|
| 3935 | int i; |
---|
| 3936 | int an = 0; |
---|
| 3937 | int en= length; |
---|
| 3938 | loop |
---|
| 3939 | { |
---|
| 3940 | if (an >= en-1) |
---|
| 3941 | { |
---|
| 3942 | if (pLmCmp(set[an].p,p->p) == pOrdSgn) return en; |
---|
| 3943 | return an; |
---|
| 3944 | } |
---|
| 3945 | i=(an+en) / 2; |
---|
| 3946 | if (pLmCmp(set[i].p,p->p) == pOrdSgn) an=i; |
---|
| 3947 | else en=i; |
---|
| 3948 | /*aend. fuer lazy == in !=- machen */ |
---|
| 3949 | } |
---|
| 3950 | } |
---|
| 3951 | |
---|
| 3952 | /*2 |
---|
| 3953 | * looks up the position of polynomial p in set |
---|
| 3954 | * e is the ecart of p |
---|
| 3955 | * set[length] is the smallest element in set with respect |
---|
| 3956 | * to the ordering-procedure totaldegree,pComp |
---|
| 3957 | */ |
---|
| 3958 | int posInL11 (const LSet set, const int length, |
---|
| 3959 | LObject* p,const kStrategy strat) |
---|
| 3960 | /*{ |
---|
| 3961 | * int j=0; |
---|
| 3962 | * int o; |
---|
| 3963 | * |
---|
| 3964 | * o = p->GetpFDeg(); |
---|
| 3965 | * loop |
---|
| 3966 | * { |
---|
| 3967 | * if (j > length) return j; |
---|
| 3968 | * if ((set[j].GetpFDeg() < o)) return j; |
---|
| 3969 | * if ((set[j].GetpFDeg() == o) && (pLmCmp(set[j].p,p->p) == -pOrdSgn)) |
---|
| 3970 | * { |
---|
| 3971 | * return j; |
---|
| 3972 | * } |
---|
| 3973 | * j++; |
---|
| 3974 | * } |
---|
| 3975 | *} |
---|
| 3976 | */ |
---|
| 3977 | { |
---|
| 3978 | if (length<0) return 0; |
---|
| 3979 | |
---|
| 3980 | int o = p->GetpFDeg(); |
---|
| 3981 | int op = set[length].GetpFDeg(); |
---|
| 3982 | |
---|
| 3983 | if ((op > o) |
---|
| 3984 | || ((op == o) && (pLmCmp(set[length].p,p->p) != -pOrdSgn))) |
---|
| 3985 | return length+1; |
---|
| 3986 | int i; |
---|
| 3987 | int an = 0; |
---|
| 3988 | int en= length; |
---|
| 3989 | loop |
---|
| 3990 | { |
---|
| 3991 | if (an >= en-1) |
---|
| 3992 | { |
---|
| 3993 | op = set[an].GetpFDeg(); |
---|
| 3994 | if ((op > o) |
---|
| 3995 | || ((op == o) && (pLmCmp(set[an].p,p->p) != -pOrdSgn))) |
---|
| 3996 | return en; |
---|
| 3997 | return an; |
---|
| 3998 | } |
---|
| 3999 | i=(an+en) / 2; |
---|
| 4000 | op = set[i].GetpFDeg(); |
---|
| 4001 | if ((op > o) |
---|
| 4002 | || ((op == o) && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4003 | an=i; |
---|
| 4004 | else |
---|
| 4005 | en=i; |
---|
| 4006 | } |
---|
| 4007 | } |
---|
| 4008 | |
---|
| 4009 | /*2 Position for rings L: Here I am |
---|
| 4010 | * looks up the position of polynomial p in set |
---|
| 4011 | * e is the ecart of p |
---|
| 4012 | * set[length] is the smallest element in set with respect |
---|
| 4013 | * to the ordering-procedure totaldegree,pComp |
---|
| 4014 | */ |
---|
| 4015 | inline int getIndexRng(long coeff) |
---|
| 4016 | { |
---|
| 4017 | if (coeff == 0) return -1; |
---|
| 4018 | long tmp = coeff; |
---|
| 4019 | int ind = 0; |
---|
| 4020 | while (tmp % 2 == 0) |
---|
| 4021 | { |
---|
| 4022 | tmp = tmp / 2; |
---|
| 4023 | ind++; |
---|
| 4024 | } |
---|
| 4025 | return ind; |
---|
| 4026 | } |
---|
| 4027 | |
---|
| 4028 | int posInLrg0 (const LSet set, const int length, |
---|
| 4029 | LObject* p,const kStrategy strat) |
---|
| 4030 | /* if (nGreater(pGetCoeff(p), pGetCoeff(set[an]))) return en; |
---|
| 4031 | if (pLmCmp(set[i],p) == cmp_int) en = i; |
---|
| 4032 | else if (pLmCmp(set[i],p) == -cmp_int) an = i; |
---|
| 4033 | else |
---|
| 4034 | { |
---|
| 4035 | if (nGreater(pGetCoeff(p), pGetCoeff(set[i]))) an = i; |
---|
| 4036 | else en = i; |
---|
| 4037 | }*/ |
---|
| 4038 | { |
---|
| 4039 | if (length < 0) return 0; |
---|
| 4040 | |
---|
| 4041 | int o = p->GetpFDeg(); |
---|
| 4042 | int op = set[length].GetpFDeg(); |
---|
| 4043 | |
---|
| 4044 | if ((op > o) || ((op == o) && (pLmCmp(set[length].p,p->p) != -pOrdSgn))) |
---|
| 4045 | return length + 1; |
---|
| 4046 | int i; |
---|
| 4047 | int an = 0; |
---|
| 4048 | int en = length; |
---|
| 4049 | loop |
---|
| 4050 | { |
---|
| 4051 | if (an >= en - 1) |
---|
| 4052 | { |
---|
| 4053 | op = set[an].GetpFDeg(); |
---|
| 4054 | if ((op > o) || ((op == o) && (pLmCmp(set[an].p,p->p) != -pOrdSgn))) |
---|
| 4055 | return en; |
---|
| 4056 | return an; |
---|
| 4057 | } |
---|
| 4058 | i = (an+en) / 2; |
---|
| 4059 | op = set[i].GetpFDeg(); |
---|
| 4060 | if ((op > o) || ((op == o) && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4061 | an = i; |
---|
| 4062 | else |
---|
| 4063 | en = i; |
---|
| 4064 | } |
---|
| 4065 | } |
---|
| 4066 | |
---|
| 4067 | /*{ |
---|
| 4068 | if (length < 0) return 0; |
---|
| 4069 | |
---|
| 4070 | int o = p->GetpFDeg(); |
---|
| 4071 | int op = set[length].GetpFDeg(); |
---|
| 4072 | |
---|
| 4073 | int inde = getIndexRng((unsigned long) pGetCoeff(set[length].p)); |
---|
| 4074 | int indp = getIndexRng((unsigned long) pGetCoeff(p->p)); |
---|
| 4075 | int inda; |
---|
| 4076 | int indi; |
---|
| 4077 | |
---|
| 4078 | if ((inda > indp) || ((inda == inde) && ((op > o) || ((op == o) && (pLmCmp(set[length].p,p->p) != -pOrdSgn))))) |
---|
| 4079 | return length + 1; |
---|
| 4080 | int i; |
---|
| 4081 | int an = 0; |
---|
| 4082 | inda = getIndexRng((unsigned long) pGetCoeff(set[an].p)); |
---|
| 4083 | int en = length; |
---|
| 4084 | loop |
---|
| 4085 | { |
---|
| 4086 | if (an >= en-1) |
---|
| 4087 | { |
---|
| 4088 | op = set[an].GetpFDeg(); |
---|
| 4089 | if ((indp > inda) || ((indp == inda) && ((op > o) || ((op == o) && (pLmCmp(set[an].p,p->p) != -pOrdSgn))))) |
---|
| 4090 | return en; |
---|
| 4091 | return an; |
---|
| 4092 | } |
---|
| 4093 | i = (an + en) / 2; |
---|
| 4094 | indi = getIndexRng((unsigned long) pGetCoeff(set[i].p)); |
---|
| 4095 | op = set[i].GetpFDeg(); |
---|
| 4096 | if ((indi > indp) || ((indi == indp) && ((op > o) || ((op == o) && (pLmCmp(set[i].p,p->p) != -pOrdSgn))))) |
---|
| 4097 | // if ((op > o) || ((op == o) && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4098 | { |
---|
| 4099 | an = i; |
---|
| 4100 | inda = getIndexRng((unsigned long) pGetCoeff(set[an].p)); |
---|
| 4101 | } |
---|
| 4102 | else |
---|
| 4103 | en = i; |
---|
| 4104 | } |
---|
| 4105 | } */ |
---|
| 4106 | |
---|
| 4107 | /*2 |
---|
| 4108 | * looks up the position of polynomial p in set |
---|
| 4109 | * set[length] is the smallest element in set with respect |
---|
| 4110 | * to the ordering-procedure totaldegree,pLength0 |
---|
| 4111 | */ |
---|
| 4112 | int posInL110 (const LSet set, const int length, |
---|
| 4113 | LObject* p,const kStrategy strat) |
---|
| 4114 | { |
---|
| 4115 | if (length<0) return 0; |
---|
| 4116 | |
---|
| 4117 | int o = p->GetpFDeg(); |
---|
| 4118 | int op = set[length].GetpFDeg(); |
---|
| 4119 | |
---|
| 4120 | if ((op > o) |
---|
| 4121 | || ((op == o) && (set[length].length >p->length)) |
---|
| 4122 | || ((op == o) && (set[length].length <= p->length) |
---|
| 4123 | && (pLmCmp(set[length].p,p->p) != -pOrdSgn))) |
---|
| 4124 | return length+1; |
---|
| 4125 | int i; |
---|
| 4126 | int an = 0; |
---|
| 4127 | int en= length; |
---|
| 4128 | loop |
---|
| 4129 | { |
---|
| 4130 | if (an >= en-1) |
---|
| 4131 | { |
---|
| 4132 | op = set[an].GetpFDeg(); |
---|
| 4133 | if ((op > o) |
---|
| 4134 | || ((op == o) && (set[an].length >p->length)) |
---|
| 4135 | || ((op == o) && (set[an].length <=p->length) |
---|
| 4136 | && (pLmCmp(set[an].p,p->p) != -pOrdSgn))) |
---|
| 4137 | return en; |
---|
| 4138 | return an; |
---|
| 4139 | } |
---|
| 4140 | i=(an+en) / 2; |
---|
| 4141 | op = set[i].GetpFDeg(); |
---|
| 4142 | if ((op > o) |
---|
| 4143 | || ((op == o) && (set[i].length > p->length)) |
---|
| 4144 | || ((op == o) && (set[i].length <= p->length) |
---|
| 4145 | && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4146 | an=i; |
---|
| 4147 | else |
---|
| 4148 | en=i; |
---|
| 4149 | } |
---|
| 4150 | } |
---|
| 4151 | |
---|
| 4152 | /*2 |
---|
| 4153 | * looks up the position of polynomial p in set |
---|
| 4154 | * e is the ecart of p |
---|
| 4155 | * set[length] is the smallest element in set with respect |
---|
| 4156 | * to the ordering-procedure totaldegree |
---|
| 4157 | */ |
---|
| 4158 | int posInL13 (const LSet set, const int length, |
---|
| 4159 | LObject* p,const kStrategy strat) |
---|
| 4160 | { |
---|
| 4161 | if (length<0) return 0; |
---|
| 4162 | |
---|
| 4163 | int o = p->GetpFDeg(); |
---|
| 4164 | |
---|
| 4165 | if (set[length].GetpFDeg() > o) |
---|
| 4166 | return length+1; |
---|
| 4167 | |
---|
| 4168 | int i; |
---|
| 4169 | int an = 0; |
---|
| 4170 | int en= length; |
---|
| 4171 | loop |
---|
| 4172 | { |
---|
| 4173 | if (an >= en-1) |
---|
| 4174 | { |
---|
| 4175 | if (set[an].GetpFDeg() >= o) |
---|
| 4176 | return en; |
---|
| 4177 | return an; |
---|
| 4178 | } |
---|
| 4179 | i=(an+en) / 2; |
---|
| 4180 | if (set[i].GetpFDeg() >= o) |
---|
| 4181 | an=i; |
---|
| 4182 | else |
---|
| 4183 | en=i; |
---|
| 4184 | } |
---|
| 4185 | } |
---|
| 4186 | |
---|
| 4187 | /*2 |
---|
| 4188 | * looks up the position of polynomial p in set |
---|
| 4189 | * e is the ecart of p |
---|
| 4190 | * set[length] is the smallest element in set with respect |
---|
| 4191 | * to the ordering-procedure maximaldegree,pComp |
---|
| 4192 | */ |
---|
| 4193 | int posInL15 (const LSet set, const int length, |
---|
| 4194 | LObject* p,const kStrategy strat) |
---|
| 4195 | /*{ |
---|
| 4196 | * int j=0; |
---|
| 4197 | * int o; |
---|
| 4198 | * |
---|
| 4199 | * o = p->ecart+p->GetpFDeg(); |
---|
| 4200 | * loop |
---|
| 4201 | * { |
---|
| 4202 | * if (j > length) return j; |
---|
| 4203 | * if (set[j].GetpFDeg()+set[j].ecart < o) return j; |
---|
| 4204 | * if ((set[j].GetpFDeg()+set[j].ecart == o) |
---|
| 4205 | * && (pLmCmp(set[j].p,p->p) == -pOrdSgn)) |
---|
| 4206 | * { |
---|
| 4207 | * return j; |
---|
| 4208 | * } |
---|
| 4209 | * j++; |
---|
| 4210 | * } |
---|
| 4211 | *} |
---|
| 4212 | */ |
---|
| 4213 | { |
---|
| 4214 | if (length<0) return 0; |
---|
| 4215 | |
---|
| 4216 | int o = p->GetpFDeg() + p->ecart; |
---|
| 4217 | int op = set[length].GetpFDeg() + set[length].ecart; |
---|
| 4218 | |
---|
| 4219 | if ((op > o) |
---|
| 4220 | || ((op == o) && (pLmCmp(set[length].p,p->p) != -pOrdSgn))) |
---|
| 4221 | return length+1; |
---|
| 4222 | int i; |
---|
| 4223 | int an = 0; |
---|
| 4224 | int en= length; |
---|
| 4225 | loop |
---|
| 4226 | { |
---|
| 4227 | if (an >= en-1) |
---|
| 4228 | { |
---|
| 4229 | op = set[an].GetpFDeg() + set[an].ecart; |
---|
| 4230 | if ((op > o) |
---|
| 4231 | || ((op == o) && (pLmCmp(set[an].p,p->p) != -pOrdSgn))) |
---|
| 4232 | return en; |
---|
| 4233 | return an; |
---|
| 4234 | } |
---|
| 4235 | i=(an+en) / 2; |
---|
| 4236 | op = set[i].GetpFDeg() + set[i].ecart; |
---|
| 4237 | if ((op > o) |
---|
| 4238 | || ((op == o) && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4239 | an=i; |
---|
| 4240 | else |
---|
| 4241 | en=i; |
---|
| 4242 | } |
---|
| 4243 | } |
---|
| 4244 | |
---|
| 4245 | /*2 |
---|
| 4246 | * looks up the position of polynomial p in set |
---|
| 4247 | * e is the ecart of p |
---|
| 4248 | * set[length] is the smallest element in set with respect |
---|
| 4249 | * to the ordering-procedure totaldegree |
---|
| 4250 | */ |
---|
| 4251 | int posInL17 (const LSet set, const int length, |
---|
| 4252 | LObject* p,const kStrategy strat) |
---|
| 4253 | { |
---|
| 4254 | if (length<0) return 0; |
---|
| 4255 | |
---|
| 4256 | int o = p->GetpFDeg() + p->ecart; |
---|
| 4257 | |
---|
| 4258 | if ((set[length].GetpFDeg() + set[length].ecart > o) |
---|
| 4259 | || ((set[length].GetpFDeg() + set[length].ecart == o) |
---|
| 4260 | && (set[length].ecart > p->ecart)) |
---|
| 4261 | || ((set[length].GetpFDeg() + set[length].ecart == o) |
---|
| 4262 | && (set[length].ecart == p->ecart) |
---|
| 4263 | && (pLmCmp(set[length].p,p->p) != -pOrdSgn))) |
---|
| 4264 | return length+1; |
---|
| 4265 | int i; |
---|
| 4266 | int an = 0; |
---|
| 4267 | int en= length; |
---|
| 4268 | loop |
---|
| 4269 | { |
---|
| 4270 | if (an >= en-1) |
---|
| 4271 | { |
---|
| 4272 | if ((set[an].GetpFDeg() + set[an].ecart > o) |
---|
| 4273 | || ((set[an].GetpFDeg() + set[an].ecart == o) |
---|
| 4274 | && (set[an].ecart > p->ecart)) |
---|
| 4275 | || ((set[an].GetpFDeg() + set[an].ecart == o) |
---|
| 4276 | && (set[an].ecart == p->ecart) |
---|
| 4277 | && (pLmCmp(set[an].p,p->p) != -pOrdSgn))) |
---|
| 4278 | return en; |
---|
| 4279 | return an; |
---|
| 4280 | } |
---|
| 4281 | i=(an+en) / 2; |
---|
| 4282 | if ((set[i].GetpFDeg() + set[i].ecart > o) |
---|
| 4283 | || ((set[i].GetpFDeg() + set[i].ecart == o) |
---|
| 4284 | && (set[i].ecart > p->ecart)) |
---|
| 4285 | || ((set[i].GetpFDeg() +set[i].ecart == o) |
---|
| 4286 | && (set[i].ecart == p->ecart) |
---|
| 4287 | && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4288 | an=i; |
---|
| 4289 | else |
---|
| 4290 | en=i; |
---|
| 4291 | } |
---|
| 4292 | } |
---|
| 4293 | /*2 |
---|
| 4294 | * looks up the position of polynomial p in set |
---|
| 4295 | * e is the ecart of p |
---|
| 4296 | * set[length] is the smallest element in set with respect |
---|
| 4297 | * to the ordering-procedure pComp |
---|
| 4298 | */ |
---|
| 4299 | int posInL17_c (const LSet set, const int length, |
---|
| 4300 | LObject* p,const kStrategy strat) |
---|
| 4301 | { |
---|
| 4302 | if (length<0) return 0; |
---|
| 4303 | |
---|
| 4304 | int cc = (-1+2*currRing->order[0]==ringorder_c); |
---|
| 4305 | /* cc==1 for (c,..), cc==-1 for (C,..) */ |
---|
| 4306 | int c = pGetComp(p->p)*cc; |
---|
| 4307 | int o = p->GetpFDeg() + p->ecart; |
---|
| 4308 | |
---|
| 4309 | if (pGetComp(set[length].p)*cc > c) |
---|
| 4310 | return length+1; |
---|
| 4311 | if (pGetComp(set[length].p)*cc == c) |
---|
| 4312 | { |
---|
| 4313 | if ((set[length].GetpFDeg() + set[length].ecart > o) |
---|
| 4314 | || ((set[length].GetpFDeg() + set[length].ecart == o) |
---|
| 4315 | && (set[length].ecart > p->ecart)) |
---|
| 4316 | || ((set[length].GetpFDeg() + set[length].ecart == o) |
---|
| 4317 | && (set[length].ecart == p->ecart) |
---|
| 4318 | && (pLmCmp(set[length].p,p->p) != -pOrdSgn))) |
---|
| 4319 | return length+1; |
---|
| 4320 | } |
---|
| 4321 | int i; |
---|
| 4322 | int an = 0; |
---|
| 4323 | int en= length; |
---|
| 4324 | loop |
---|
| 4325 | { |
---|
| 4326 | if (an >= en-1) |
---|
| 4327 | { |
---|
| 4328 | if (pGetComp(set[an].p)*cc > c) |
---|
| 4329 | return en; |
---|
| 4330 | if (pGetComp(set[an].p)*cc == c) |
---|
| 4331 | { |
---|
| 4332 | if ((set[an].GetpFDeg() + set[an].ecart > o) |
---|
| 4333 | || ((set[an].GetpFDeg() + set[an].ecart == o) |
---|
| 4334 | && (set[an].ecart > p->ecart)) |
---|
| 4335 | || ((set[an].GetpFDeg() + set[an].ecart == o) |
---|
| 4336 | && (set[an].ecart == p->ecart) |
---|
| 4337 | && (pLmCmp(set[an].p,p->p) != -pOrdSgn))) |
---|
| 4338 | return en; |
---|
| 4339 | } |
---|
| 4340 | return an; |
---|
| 4341 | } |
---|
| 4342 | i=(an+en) / 2; |
---|
| 4343 | if (pGetComp(set[i].p)*cc > c) |
---|
| 4344 | an=i; |
---|
| 4345 | else if (pGetComp(set[i].p)*cc == c) |
---|
| 4346 | { |
---|
| 4347 | if ((set[i].GetpFDeg() + set[i].ecart > o) |
---|
| 4348 | || ((set[i].GetpFDeg() + set[i].ecart == o) |
---|
| 4349 | && (set[i].ecart > p->ecart)) |
---|
| 4350 | || ((set[i].GetpFDeg() +set[i].ecart == o) |
---|
| 4351 | && (set[i].ecart == p->ecart) |
---|
| 4352 | && (pLmCmp(set[i].p,p->p) != -pOrdSgn))) |
---|
| 4353 | an=i; |
---|
| 4354 | else |
---|
| 4355 | en=i; |
---|
| 4356 | } |
---|
| 4357 | else |
---|
| 4358 | en=i; |
---|
| 4359 | } |
---|
| 4360 | } |
---|
| 4361 | |
---|
| 4362 | /*************************************************************** |
---|
| 4363 | * |
---|
| 4364 | * Tail reductions |
---|
| 4365 | * |
---|
| 4366 | ***************************************************************/ |
---|
| 4367 | TObject* |
---|
| 4368 | kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T, |
---|
| 4369 | long ecart) |
---|
| 4370 | { |
---|
| 4371 | int j = 0; |
---|
| 4372 | const unsigned long not_sev = ~L->sev; |
---|
| 4373 | const unsigned long* sev = strat->sevS; |
---|
| 4374 | poly p; |
---|
| 4375 | ring r; |
---|
| 4376 | L->GetLm(p, r); |
---|
| 4377 | |
---|
| 4378 | assume(~not_sev == p_GetShortExpVector(p, r)); |
---|
| 4379 | |
---|
| 4380 | if (r == currRing) |
---|
| 4381 | { |
---|
| 4382 | loop |
---|
| 4383 | { |
---|
| 4384 | if (j > pos) return NULL; |
---|
| 4385 | #if defined(PDEBUG) || defined(PDIV_DEBUG) |
---|
| 4386 | if (p_LmShortDivisibleBy(strat->S[j], sev[j], p, not_sev, r) && |
---|
| 4387 | (ecart== LONG_MAX || ecart>= strat->ecartS[j])) |
---|
| 4388 | break; |
---|
| 4389 | #else |
---|
| 4390 | if (!(sev[j] & not_sev) && |
---|
| 4391 | (ecart== LONG_MAX || ecart>= strat->ecartS[j]) && |
---|
| 4392 | p_LmDivisibleBy(strat->S[j], p, r)) |
---|
| 4393 | break; |
---|
| 4394 | |
---|
| 4395 | #endif |
---|
| 4396 | j++; |
---|
| 4397 | } |
---|
| 4398 | // if called from NF, T objects do not exist: |
---|
| 4399 | if (strat->tl < 0 || strat->S_2_R[j] == -1) |
---|
| 4400 | { |
---|
| 4401 | T->Set(strat->S[j], r, strat->tailRing); |
---|
| 4402 | return T; |
---|
| 4403 | } |
---|
| 4404 | else |
---|
| 4405 | { |
---|
| 4406 | ///// assume (j >= 0 && j <= strat->tl && strat->S_2_T(j) != NULL |
---|
| 4407 | ///// && strat->S_2_T(j)->p == strat->S[j]); // wrong? |
---|
| 4408 | // assume (j >= 0 && j <= strat->sl && strat->S_2_T(j) != NULL && strat->S_2_T(j)->p == strat->S[j]); |
---|
| 4409 | return strat->S_2_T(j); |
---|
| 4410 | } |
---|
| 4411 | } |
---|
| 4412 | else |
---|
| 4413 | { |
---|
| 4414 | TObject* t; |
---|
| 4415 | loop |
---|
| 4416 | { |
---|
| 4417 | if (j > pos) return NULL; |
---|
| 4418 | assume(strat->S_2_R[j] != -1); |
---|
| 4419 | #if defined(PDEBUG) || defined(PDIV_DEBUG) |
---|
| 4420 | t = strat->S_2_T(j); |
---|
| 4421 | assume(t != NULL && t->t_p != NULL && t->tailRing == r); |
---|
| 4422 | if (p_LmShortDivisibleBy(t->t_p, sev[j], p, not_sev, r) && |
---|
| 4423 | (ecart== LONG_MAX || ecart>= strat->ecartS[j])) |
---|
| 4424 | return t; |
---|
| 4425 | #else |
---|
| 4426 | if (! (sev[j] & not_sev) && (ecart== LONG_MAX || ecart>= strat->ecartS[j])) |
---|
| 4427 | { |
---|
| 4428 | t = strat->S_2_T(j); |
---|
| 4429 | assume(t != NULL && t->t_p != NULL && t->tailRing == r && t->p == strat->S[j]); |
---|
| 4430 | if (p_LmDivisibleBy(t->t_p, p, r)) return t; |
---|
| 4431 | } |
---|
| 4432 | #endif |
---|
| 4433 | j++; |
---|
| 4434 | } |
---|
| 4435 | } |
---|
| 4436 | } |
---|
| 4437 | |
---|
| 4438 | poly redtail (LObject* L, int pos, kStrategy strat) |
---|
| 4439 | { |
---|
| 4440 | poly h, hn; |
---|
| 4441 | int j; |
---|
| 4442 | unsigned long not_sev; |
---|
| 4443 | strat->redTailChange=FALSE; |
---|
| 4444 | |
---|
| 4445 | poly p = L->p; |
---|
| 4446 | if (strat->noTailReduction || pNext(p) == NULL) |
---|
| 4447 | return p; |
---|
| 4448 | |
---|
| 4449 | LObject Ln(strat->tailRing); |
---|
| 4450 | TObject* With; |
---|
| 4451 | // placeholder in case strat->tl < 0 |
---|
| 4452 | TObject With_s(strat->tailRing); |
---|
| 4453 | h = p; |
---|
| 4454 | hn = pNext(h); |
---|
| 4455 | long op = strat->tailRing->pFDeg(hn, strat->tailRing); |
---|
| 4456 | long e; |
---|
| 4457 | int l; |
---|
| 4458 | BOOLEAN save_HE=strat->kHEdgeFound; |
---|
| 4459 | strat->kHEdgeFound |= |
---|
| 4460 | ((Kstd1_deg>0) && (op<=Kstd1_deg)) || TEST_OPT_INFREDTAIL; |
---|
| 4461 | |
---|
| 4462 | while(hn != NULL) |
---|
| 4463 | { |
---|
| 4464 | op = strat->tailRing->pFDeg(hn, strat->tailRing); |
---|
| 4465 | if ((Kstd1_deg>0)&&(op>Kstd1_deg)) goto all_done; |
---|
| 4466 | e = strat->tailRing->pLDeg(hn, &l, strat->tailRing) - op; |
---|
| 4467 | loop |
---|
| 4468 | { |
---|
| 4469 | Ln.Set(hn, strat->tailRing); |
---|
| 4470 | Ln.sev = p_GetShortExpVector(hn, strat->tailRing); |
---|
| 4471 | if (strat->kHEdgeFound) |
---|
| 4472 | With = kFindDivisibleByInS(strat, pos, &Ln, &With_s); |
---|
| 4473 | else |
---|
| 4474 | With = kFindDivisibleByInS(strat, pos, &Ln, &With_s, e); |
---|
| 4475 | if (With == NULL) break; |
---|
| 4476 | With->length=0; |
---|
| 4477 | With->pLength=0; |
---|
| 4478 | strat->redTailChange=TRUE; |
---|
| 4479 | if (ksReducePolyTail(L, With, h, strat->kNoetherTail())) |
---|
| 4480 | { |
---|
| 4481 | // reducing the tail would violate the exp bound |
---|
| 4482 | if (kStratChangeTailRing(strat, L)) |
---|
| 4483 | { |
---|
| 4484 | strat->kHEdgeFound = save_HE; |
---|
| 4485 | return redtail(L, pos, strat); |
---|
| 4486 | } |
---|
| 4487 | else |
---|
| 4488 | return NULL; |
---|
| 4489 | } |
---|
| 4490 | hn = pNext(h); |
---|
| 4491 | if (hn == NULL) goto all_done; |
---|
| 4492 | op = strat->tailRing->pFDeg(hn, strat->tailRing); |
---|
| 4493 | if ((Kstd1_deg>0)&&(op>Kstd1_deg)) goto all_done; |
---|
| 4494 | e = strat->tailRing->pLDeg(hn, &l, strat->tailRing) - op; |
---|
| 4495 | } |
---|
| 4496 | h = hn; |
---|
| 4497 | hn = pNext(h); |
---|
| 4498 | } |
---|
| 4499 | |
---|
| 4500 | all_done: |
---|
| 4501 | if (strat->redTailChange) |
---|
| 4502 | { |
---|
| 4503 | L->last = 0; |
---|
| 4504 | L->pLength = 0; |
---|
| 4505 | } |
---|
| 4506 | strat->kHEdgeFound = save_HE; |
---|
| 4507 | return p; |
---|
| 4508 | } |
---|
| 4509 | |
---|
| 4510 | poly redtail (poly p, int pos, kStrategy strat) |
---|
| 4511 | { |
---|
| 4512 | LObject L(p, currRing); |
---|
| 4513 | return redtail(&L, pos, strat); |
---|
| 4514 | } |
---|
| 4515 | |
---|
| 4516 | poly redtailBba (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize) |
---|
| 4517 | { |
---|
| 4518 | #define REDTAIL_CANONICALIZE 100 |
---|
| 4519 | strat->redTailChange=FALSE; |
---|
| 4520 | if (strat->noTailReduction) return L->GetLmCurrRing(); |
---|
| 4521 | poly h, p; |
---|
| 4522 | p = h = L->GetLmTailRing(); |
---|
| 4523 | if ((h==NULL) || (pNext(h)==NULL)) |
---|
| 4524 | return L->GetLmCurrRing(); |
---|
| 4525 | |
---|
| 4526 | TObject* With; |
---|
| 4527 | // placeholder in case strat->tl < 0 |
---|
| 4528 | TObject With_s(strat->tailRing); |
---|
| 4529 | |
---|
| 4530 | LObject Ln(pNext(h), strat->tailRing); |
---|
| 4531 | Ln.pLength = L->GetpLength() - 1; |
---|
| 4532 | |
---|
| 4533 | pNext(h) = NULL; |
---|
| 4534 | if (L->p != NULL) pNext(L->p) = NULL; |
---|
| 4535 | L->pLength = 1; |
---|
| 4536 | |
---|
| 4537 | Ln.PrepareRed(strat->use_buckets); |
---|
| 4538 | |
---|
| 4539 | int cnt=REDTAIL_CANONICALIZE; |
---|
| 4540 | while(!Ln.IsNull()) |
---|
| 4541 | { |
---|
| 4542 | loop |
---|
| 4543 | { |
---|
| 4544 | Ln.SetShortExpVector(); |
---|
| 4545 | if (withT) |
---|
| 4546 | { |
---|
| 4547 | int j; |
---|
| 4548 | j = kFindDivisibleByInT(strat->T, strat->sevT, strat->tl, &Ln); |
---|
| 4549 | if (j < 0) break; |
---|
| 4550 | With = &(strat->T[j]); |
---|
| 4551 | } |
---|
| 4552 | else |
---|
| 4553 | { |
---|
| 4554 | With = kFindDivisibleByInS(strat, pos, &Ln, &With_s); |
---|
| 4555 | if (With == NULL) break; |
---|
| 4556 | } |
---|
| 4557 | cnt--; |
---|
| 4558 | if (cnt==0) |
---|
| 4559 | { |
---|
[9f17c9] | 4560 | cnt=REDTAIL_CANONICALIZE; |
---|
| 4561 | poly tmp=Ln.CanonicalizeP(); |
---|
| 4562 | if (normalize) |
---|
[f41347f] | 4563 | { |
---|
| 4564 | Ln.Normalize(); |
---|
| 4565 | //pNormalize(tmp); |
---|
| 4566 | //if (TEST_OPT_PROT) { PrintS("n"); mflush(); } |
---|
| 4567 | } |
---|
| 4568 | } |
---|
| 4569 | if (normalize && (!TEST_OPT_INTSTRATEGY) && (!nIsOne(pGetCoeff(With->p)))) |
---|
| 4570 | { |
---|
| 4571 | With->pNorm(); |
---|
| 4572 | } |
---|
| 4573 | strat->redTailChange=TRUE; |
---|
| 4574 | if (ksReducePolyTail(L, With, &Ln)) |
---|
| 4575 | { |
---|
| 4576 | // reducing the tail would violate the exp bound |
---|
| 4577 | // set a flag and hope for a retry (in bba) |
---|
| 4578 | strat->completeReduce_retry=TRUE; |
---|
[982b30] | 4579 | if ((Ln.p != NULL) && (Ln.t_p != NULL)) Ln.p=NULL; |
---|
[f41347f] | 4580 | do |
---|
| 4581 | { |
---|
| 4582 | pNext(h) = Ln.LmExtractAndIter(); |
---|
| 4583 | pIter(h); |
---|
| 4584 | L->pLength++; |
---|
| 4585 | } while (!Ln.IsNull()); |
---|
| 4586 | goto all_done; |
---|
| 4587 | } |
---|
| 4588 | if (Ln.IsNull()) goto all_done; |
---|
| 4589 | if (! withT) With_s.Init(currRing); |
---|
| 4590 | } |
---|
| 4591 | pNext(h) = Ln.LmExtractAndIter(); |
---|
| 4592 | pIter(h); |
---|
| 4593 | pNormalize(h); |
---|
| 4594 | L->pLength++; |
---|
| 4595 | } |
---|
| 4596 | |
---|
| 4597 | all_done: |
---|
| 4598 | Ln.Delete(); |
---|
| 4599 | if (L->p != NULL) pNext(L->p) = pNext(p); |
---|
| 4600 | |
---|
| 4601 | if (strat->redTailChange) |
---|
| 4602 | { |
---|
| 4603 | L->last = NULL; |
---|
| 4604 | L->length = 0; |
---|
| 4605 | } |
---|
| 4606 | |
---|
| 4607 | //if (TEST_OPT_PROT) { PrintS("N"); mflush(); } |
---|
| 4608 | //L->Normalize(); // HANNES: should have a test |
---|
| 4609 | kTest_L(L); |
---|
| 4610 | return L->GetLmCurrRing(); |
---|
| 4611 | } |
---|
| 4612 | |
---|
[5eb865] | 4613 | #ifdef HAVE_RINGS |
---|
| 4614 | poly redtailBba_Z (LObject* L, int pos, kStrategy strat ) |
---|
| 4615 | // normalize=FALSE, withT=FALSE, coeff=Z |
---|
| 4616 | { |
---|
| 4617 | strat->redTailChange=FALSE; |
---|
| 4618 | if (strat->noTailReduction) return L->GetLmCurrRing(); |
---|
| 4619 | poly h, p; |
---|
| 4620 | p = h = L->GetLmTailRing(); |
---|
| 4621 | if ((h==NULL) || (pNext(h)==NULL)) |
---|
| 4622 | return L->GetLmCurrRing(); |
---|
| 4623 | |
---|
| 4624 | TObject* With; |
---|
| 4625 | // placeholder in case strat->tl < 0 |
---|
| 4626 | TObject With_s(strat->tailRing); |
---|
| 4627 | |
---|
| 4628 | LObject Ln(pNext(h), strat->tailRing); |
---|
| 4629 | Ln.pLength = L->GetpLength() - 1; |
---|
| 4630 | |
---|
| 4631 | pNext(h) = NULL; |
---|
| 4632 | if (L->p != NULL) pNext(L->p) = NULL; |
---|
| 4633 | L->pLength = 1; |
---|
| 4634 | |
---|
| 4635 | Ln.PrepareRed(strat->use_buckets); |
---|
| 4636 | |
---|
| 4637 | int cnt=REDTAIL_CANONICALIZE; |
---|
| 4638 | while(!Ln.IsNull()) |
---|
| 4639 | { |
---|
| 4640 | loop |
---|
| 4641 | { |
---|
| 4642 | Ln.SetShortExpVector(); |
---|
| 4643 | With = kFindDivisibleByInS(strat, pos, &Ln, &With_s); |
---|
| 4644 | if (With == NULL) break; |
---|
| 4645 | cnt--; |
---|
| 4646 | if (cnt==0) |
---|
| 4647 | { |
---|
| 4648 | cnt=REDTAIL_CANONICALIZE; |
---|
| 4649 | poly tmp=Ln.CanonicalizeP(); |
---|
| 4650 | } |
---|
| 4651 | // we are in Z, do not Ccall pNorm |
---|
| 4652 | strat->redTailChange=TRUE; |
---|
| 4653 | // test divisibility of coefs: |
---|
| 4654 | poly p_Ln=Ln.GetLmCurrRing(); |
---|
| 4655 | poly p_With=With->GetLmCurrRing(); |
---|
| 4656 | number z=nIntMod(pGetCoeff(p_Ln),pGetCoeff(p_With)); |
---|
| 4657 | if (!nIsZero(z)) |
---|
| 4658 | { |
---|
| 4659 | // subtract z*Ln, add z.Ln to L |
---|
| 4660 | poly m=pHead(p_Ln); |
---|
| 4661 | pSetCoeff(m,z); |
---|
| 4662 | poly mm=pHead(m); |
---|
| 4663 | pNext(h) = m; |
---|
| 4664 | pIter(h); |
---|
| 4665 | L->pLength++; |
---|
| 4666 | mm=pNeg(mm); |
---|
| 4667 | if (Ln.bucket!=NULL) |
---|
| 4668 | { |
---|
[7a4a43] | 4669 | int dummy=1; |
---|
[5eb865] | 4670 | kBucket_Add_q(Ln.bucket,mm,&dummy); |
---|
| 4671 | } |
---|
| 4672 | else |
---|
| 4673 | { |
---|
| 4674 | if (Ln.p!=NULL) Ln.p=pAdd(Ln.p,mm); |
---|
| 4675 | else if (Ln.t_p!=NULL) Ln.t_p=p_Add_q(Ln.t_p,mm,strat->tailRing); |
---|
| 4676 | } |
---|
| 4677 | } |
---|
| 4678 | else |
---|
| 4679 | nDelete(&z); |
---|
| 4680 | |
---|
| 4681 | if (ksReducePolyTail(L, With, &Ln)) |
---|
| 4682 | { |
---|
| 4683 | // reducing the tail would violate the exp bound |
---|
| 4684 | // set a flag and hope for a retry (in bba) |
---|
| 4685 | strat->completeReduce_retry=TRUE; |
---|
[982b30] | 4686 | if ((Ln.p != NULL) && (Ln.t_p != NULL)) Ln.p=NULL; |
---|
[5eb865] | 4687 | do |
---|
| 4688 | { |
---|
| 4689 | pNext(h) = Ln.LmExtractAndIter(); |
---|
| 4690 | pIter(h); |
---|
| 4691 | L->pLength++; |
---|
| 4692 | } while (!Ln.IsNull()); |
---|
| 4693 | goto all_done; |
---|
| 4694 | } |
---|
| 4695 | if (Ln.IsNull()) goto all_done; |
---|
| 4696 | With_s.Init(currRing); |
---|
| 4697 | } |
---|
| 4698 | pNext(h) = Ln.LmExtractAndIter(); |
---|
| 4699 | pIter(h); |
---|
| 4700 | pNormalize(h); |
---|
| 4701 | L->pLength++; |
---|
| 4702 | } |
---|
| 4703 | |
---|
| 4704 | all_done: |
---|
| 4705 | Ln.Delete(); |
---|
| 4706 | if (L->p != NULL) pNext(L->p) = pNext(p); |
---|
| 4707 | |
---|
| 4708 | if (strat->redTailChange) |
---|
| 4709 | { |
---|
| 4710 | L->last = NULL; |
---|
| 4711 | L->length = 0; |
---|
| 4712 | } |
---|
| 4713 | |
---|
| 4714 | //if (TEST_OPT_PROT) { PrintS("N"); mflush(); } |
---|
| 4715 | //L->Normalize(); // HANNES: should have a test |
---|
| 4716 | kTest_L(L); |
---|
| 4717 | return L->GetLmCurrRing(); |
---|
| 4718 | } |
---|
| 4719 | #endif |
---|
| 4720 | |
---|
[f41347f] | 4721 | /*2 |
---|
| 4722 | *checks the change degree and write progress report |
---|
| 4723 | */ |
---|
| 4724 | void message (int i,int* reduc,int* olddeg,kStrategy strat, int red_result) |
---|
| 4725 | { |
---|
| 4726 | if (i != *olddeg) |
---|
| 4727 | { |
---|
| 4728 | Print("%d",i); |
---|
| 4729 | *olddeg = i; |
---|
| 4730 | } |
---|
[228b631] | 4731 | if (TEST_OPT_OLDSTD) |
---|
[f41347f] | 4732 | { |
---|
| 4733 | if (strat->Ll != *reduc) |
---|
| 4734 | { |
---|
| 4735 | if (strat->Ll != *reduc-1) |
---|
| 4736 | Print("(%d)",strat->Ll+1); |
---|
| 4737 | else |
---|
| 4738 | PrintS("-"); |
---|
| 4739 | *reduc = strat->Ll; |
---|
| 4740 | } |
---|
| 4741 | else |
---|
| 4742 | PrintS("."); |
---|
| 4743 | mflush(); |
---|
| 4744 | } |
---|
| 4745 | else |
---|
| 4746 | { |
---|
| 4747 | if (red_result == 0) |
---|
| 4748 | PrintS("-"); |
---|
| 4749 | else if (red_result < 0) |
---|
| 4750 | PrintS("."); |
---|
| 4751 | if ((red_result > 0) || ((strat->Ll % 100)==99)) |
---|
| 4752 | { |
---|
| 4753 | if (strat->Ll != *reduc && strat->Ll > 0) |
---|
| 4754 | { |
---|
| 4755 | Print("(%d)",strat->Ll+1); |
---|
| 4756 | *reduc = strat->Ll; |
---|
| 4757 | } |
---|
| 4758 | } |
---|
| 4759 | } |
---|
| 4760 | } |
---|
| 4761 | |
---|
| 4762 | /*2 |
---|
| 4763 | *statistics |
---|
| 4764 | */ |
---|
| 4765 | void messageStat (int srmax,int lrmax,int hilbcount,kStrategy strat) |
---|
| 4766 | { |
---|
| 4767 | //PrintS("\nUsage/Allocation of temporary storage:\n"); |
---|
| 4768 | //Print("%d/%d polynomials in standard base\n",srmax,IDELEMS(Shdl)); |
---|
| 4769 | //Print("%d/%d polynomials in set L (for lazy alg.)",lrmax+1,strat->Lmax); |
---|
| 4770 | Print("product criterion:%d chain criterion:%d\n",strat->cp,strat->c3); |
---|
| 4771 | if (hilbcount!=0) Print("hilbert series criterion:%d\n",hilbcount); |
---|
| 4772 | /* in usual case strat->cv is 0, it gets changed only in shift routines */ |
---|
| 4773 | if (strat->cv!=0) Print("shift V criterion:%d\n",strat->cv); |
---|
| 4774 | /*mflush();*/ |
---|
| 4775 | } |
---|
| 4776 | |
---|
| 4777 | #ifdef KDEBUG |
---|
| 4778 | /*2 |
---|
| 4779 | *debugging output: all internal sets, if changed |
---|
| 4780 | *for testing purpuse only/has to be changed for later use |
---|
| 4781 | */ |
---|
| 4782 | void messageSets (kStrategy strat) |
---|
| 4783 | { |
---|
| 4784 | int i; |
---|
| 4785 | if (strat->news) |
---|
| 4786 | { |
---|
| 4787 | PrintS("set S"); |
---|
| 4788 | for (i=0; i<=strat->sl; i++) |
---|
| 4789 | { |
---|
| 4790 | Print("\n %d:",i); |
---|
| 4791 | p_wrp(strat->S[i], currRing, strat->tailRing); |
---|
| 4792 | } |
---|
| 4793 | strat->news = FALSE; |
---|
| 4794 | } |
---|
| 4795 | if (strat->newt) |
---|
| 4796 | { |
---|
| 4797 | PrintS("\nset T"); |
---|
| 4798 | for (i=0; i<=strat->tl; i++) |
---|
| 4799 | { |
---|
| 4800 | Print("\n %d:",i); |
---|
| 4801 | strat->T[i].wrp(); |
---|
[2132395] | 4802 | Print(" o:%ld e:%d l:%d", |
---|
[f41347f] | 4803 | strat->T[i].pFDeg(),strat->T[i].ecart,strat->T[i].length); |
---|
| 4804 | } |
---|
| 4805 | strat->newt = FALSE; |
---|
| 4806 | } |
---|
| 4807 | PrintS("\nset L"); |
---|
| 4808 | for (i=strat->Ll; i>=0; i--) |
---|
| 4809 | { |
---|
| 4810 | Print("\n%d:",i); |
---|
| 4811 | p_wrp(strat->L[i].p1, currRing, strat->tailRing); |
---|
| 4812 | PrintS(" "); |
---|
| 4813 | p_wrp(strat->L[i].p2, currRing, strat->tailRing); |
---|
| 4814 | PrintS(" lcm: ");p_wrp(strat->L[i].lcm, currRing); |
---|
| 4815 | PrintS("\n p : "); |
---|
| 4816 | strat->L[i].wrp(); |
---|
[2132395] | 4817 | Print(" o:%ld e:%d l:%d", |
---|
[f41347f] | 4818 | strat->L[i].pFDeg(),strat->L[i].ecart,strat->L[i].length); |
---|
| 4819 | } |
---|
| 4820 | PrintLn(); |
---|
| 4821 | } |
---|
| 4822 | |
---|
| 4823 | #endif |
---|
| 4824 | |
---|
| 4825 | |
---|
| 4826 | /*2 |
---|
| 4827 | *construct the set s from F |
---|
| 4828 | */ |
---|
| 4829 | void initS (ideal F, ideal Q, kStrategy strat) |
---|
| 4830 | { |
---|
| 4831 | int i,pos; |
---|
| 4832 | |
---|
| 4833 | if (Q!=NULL) i=((IDELEMS(F)+IDELEMS(Q)+(setmaxTinc-1))/setmaxTinc)*setmaxTinc; |
---|
| 4834 | else i=((IDELEMS(F)+(setmaxTinc-1))/setmaxTinc)*setmaxTinc; |
---|
| 4835 | strat->ecartS=initec(i); |
---|
| 4836 | strat->sevS=initsevS(i); |
---|
| 4837 | strat->S_2_R=initS_2_R(i); |
---|
| 4838 | strat->fromQ=NULL; |
---|
| 4839 | strat->Shdl=idInit(i,F->rank); |
---|
| 4840 | strat->S=strat->Shdl->m; |
---|
| 4841 | /*- put polys into S -*/ |
---|
| 4842 | if (Q!=NULL) |
---|
| 4843 | { |
---|
| 4844 | strat->fromQ=initec(i); |
---|
| 4845 | memset(strat->fromQ,0,i*sizeof(int)); |
---|
| 4846 | for (i=0; i<IDELEMS(Q); i++) |
---|
| 4847 | { |
---|
| 4848 | if (Q->m[i]!=NULL) |
---|
| 4849 | { |
---|
| 4850 | LObject h; |
---|
| 4851 | h.p = pCopy(Q->m[i]); |
---|
| 4852 | if (TEST_OPT_INTSTRATEGY) |
---|
| 4853 | { |
---|
| 4854 | //pContent(h.p); |
---|
| 4855 | h.pCleardenom(); // also does a pContent |
---|
| 4856 | } |
---|
| 4857 | else |
---|
| 4858 | { |
---|
| 4859 | h.pNorm(); |
---|
| 4860 | } |
---|
| 4861 | if (pOrdSgn==-1) |
---|
| 4862 | { |
---|
| 4863 | deleteHC(&h, strat); |
---|
| 4864 | } |
---|
| 4865 | if (h.p!=NULL) |
---|
| 4866 | { |
---|
| 4867 | strat->initEcart(&h); |
---|
| 4868 | if (strat->sl==-1) |
---|
| 4869 | pos =0; |
---|
| 4870 | else |
---|
| 4871 | { |
---|
| 4872 | pos = posInS(strat,strat->sl,h.p,h.ecart); |
---|
| 4873 | } |
---|
| 4874 | h.sev = pGetShortExpVector(h.p); |
---|
| 4875 | strat->enterS(h,pos,strat,-1); |
---|
| 4876 | strat->fromQ[pos]=1; |
---|
| 4877 | } |
---|
| 4878 | } |
---|
| 4879 | } |
---|
| 4880 | } |
---|
| 4881 | for (i=0; i<IDELEMS(F); i++) |
---|
| 4882 | { |
---|
| 4883 | if (F->m[i]!=NULL) |
---|
| 4884 | { |
---|
| 4885 | LObject h; |
---|
| 4886 | h.p = pCopy(F->m[i]); |
---|
| 4887 | if (pOrdSgn==-1) |
---|
| 4888 | { |
---|
| 4889 | cancelunit(&h); /*- tries to cancel a unit -*/ |
---|
| 4890 | deleteHC(&h, strat); |
---|
| 4891 | } |
---|
| 4892 | if (h.p!=NULL) |
---|
[e371bf] | 4893 | // do not rely on the input being a SB! |
---|
[f41347f] | 4894 | { |
---|
[e371bf] | 4895 | if (TEST_OPT_INTSTRATEGY) |
---|
| 4896 | { |
---|
| 4897 | //pContent(h.p); |
---|
| 4898 | h.pCleardenom(); // also does a pContent |
---|
| 4899 | } |
---|
| 4900 | else |
---|
| 4901 | { |
---|
| 4902 | h.pNorm(); |
---|
| 4903 | } |
---|
[f41347f] | 4904 | strat->initEcart(&h); |
---|
| 4905 | if (strat->sl==-1) |
---|
| 4906 | pos =0; |
---|
| 4907 | else |
---|
| 4908 | pos = posInS(strat,strat->sl,h.p,h.ecart); |
---|
| 4909 | h.sev = pGetShortExpVector(h.p); |
---|
| 4910 | strat->enterS(h,pos,strat,-1); |
---|
| 4911 | } |
---|
| 4912 | } |
---|
| 4913 | } |
---|
| 4914 | /*- test, if a unit is in F -*/ |
---|
| 4915 | if ((strat->sl>=0) |
---|
| 4916 | #ifdef HAVE_RINGS |
---|
| 4917 | && nIsUnit(pGetCoeff(strat->S[0])) |
---|
| 4918 | #endif |
---|
| 4919 | && pIsConstant(strat->S[0])) |
---|
| 4920 | { |
---|
| 4921 | while (strat->sl>0) deleteInS(strat->sl,strat); |
---|
| 4922 | } |
---|
| 4923 | } |
---|
| 4924 | |
---|
| 4925 | void initSL (ideal F, ideal Q,kStrategy strat) |
---|
| 4926 | { |
---|
| 4927 | int i,pos; |
---|
| 4928 | |
---|
| 4929 | if (Q!=NULL) i=((IDELEMS(Q)+(setmaxTinc-1))/setmaxTinc)*setmaxTinc; |
---|
| 4930 | else i=setmaxT; |
---|
| 4931 | strat->ecartS=initec(i); |
---|
| 4932 | strat->sevS=initsevS(i); |
---|
| 4933 | strat->S_2_R=initS_2_R(i); |
---|
| 4934 | strat->fromQ=NULL; |
---|
| 4935 | strat->Shdl=idInit(i,F->rank); |
---|
| 4936 | strat->S=strat->Shdl->m; |
---|
| 4937 | /*- put polys into S -*/ |
---|
| 4938 | if (Q!=NULL) |
---|
| 4939 | { |
---|
| 4940 | strat->fromQ=initec(i); |
---|
| 4941 | memset(strat->fromQ,0,i*sizeof(int)); |
---|
| 4942 | for (i=0; i<IDELEMS(Q); i++) |
---|
| 4943 | { |
---|
| 4944 | if (Q->m[i]!=NULL) |
---|
| 4945 | { |
---|
| 4946 | LObject h; |
---|
| 4947 | h.p = pCopy(Q->m[i]); |
---|
| 4948 | if (pOrdSgn==-1) |
---|
| 4949 | { |
---|
| 4950 | deleteHC(&h,strat); |
---|
| 4951 | } |
---|
| 4952 | if (TEST_OPT_INTSTRATEGY) |
---|
| 4953 | { |
---|
| 4954 | //pContent(h.p); |
---|
| 4955 | h.pCleardenom(); // also does a pContent |
---|
| 4956 | } |
---|
| 4957 | else |
---|
| 4958 | { |
---|
| 4959 | h.pNorm(); |
---|
| 4960 | } |
---|
| 4961 | if (h.p!=NULL) |
---|
| 4962 | { |
---|
| 4963 | strat->initEcart(&h); |
---|
| 4964 | if (strat->sl==-1) |
---|
| 4965 | pos =0; |
---|
| 4966 | else |
---|
| 4967 | { |
---|
| 4968 | pos = posInS(strat,strat->sl,h.p,h.ecart); |
---|
| 4969 | } |
---|
| 4970 | h.sev = pGetShortExpVector(h.p); |
---|
| 4971 | strat->enterS(h,pos,strat,-1); |
---|
| 4972 | strat->fromQ[pos]=1; |
---|
| 4973 | } |
---|
| 4974 | } |
---|
| 4975 | } |
---|
| 4976 | } |
---|
| 4977 | for (i=0; i<IDELEMS(F); i++) |
---|
| 4978 | { |
---|
| 4979 | if (F->m[i]!=NULL) |
---|
| 4980 | { |
---|
| 4981 | LObject h; |
---|
| 4982 | h.p = pCopy(F->m[i]); |
---|
| 4983 | if (h.p!=NULL) |
---|
| 4984 | { |
---|
| 4985 | if (pOrdSgn==-1) |
---|
| 4986 | { |
---|
| 4987 | cancelunit(&h); /*- tries to cancel a unit -*/ |
---|
| 4988 | deleteHC(&h, strat); |
---|
| 4989 | } |
---|
| 4990 | if (h.p!=NULL) |
---|
| 4991 | { |
---|
| 4992 | if (TEST_OPT_INTSTRATEGY) |
---|
| 4993 | { |
---|
| 4994 | //pContent(h.p); |
---|
| 4995 | h.pCleardenom(); // also does a pContent |
---|
| 4996 | } |
---|
| 4997 | else |
---|
| 4998 | { |
---|
| 4999 | h.pNorm(); |
---|
| 5000 | } |
---|
| 5001 | strat->initEcart(&h); |
---|
| 5002 | if (strat->Ll==-1) |
---|
| 5003 | pos =0; |
---|
| 5004 | else |
---|
| 5005 | pos = strat->posInL(strat->L,strat->Ll,&h,strat); |
---|
| 5006 | h.sev = pGetShortExpVector(h.p); |
---|
| 5007 | enterL(&strat->L,&strat->Ll,&strat->Lmax,h,pos); |
---|
| 5008 | } |
---|
| 5009 | } |
---|
| 5010 | } |
---|
| 5011 | } |
---|
| 5012 | /*- test, if a unit is in F -*/ |
---|
| 5013 | |
---|
[9f17c9] | 5014 | if ((strat->Ll>=0) |
---|
[f41347f] | 5015 | #ifdef HAVE_RINGS |
---|
| 5016 | && nIsUnit(pGetCoeff(strat->L[strat->Ll].p)) |
---|
| 5017 | #endif |
---|
| 5018 | && pIsConstant(strat->L[strat->Ll].p)) |
---|
| 5019 | { |
---|
| 5020 | while (strat->Ll>0) deleteInL(strat->L,&strat->Ll,strat->Ll-1,strat); |
---|
| 5021 | } |
---|
| 5022 | } |
---|
| 5023 | |
---|
| 5024 | |
---|
| 5025 | /*2 |
---|
| 5026 | *construct the set s from F and {P} |
---|
| 5027 | */ |
---|
| 5028 | void initSSpecial (ideal F, ideal Q, ideal P,kStrategy strat) |
---|
| 5029 | { |
---|
| 5030 | int i,pos; |
---|
| 5031 | |
---|
| 5032 | if (Q!=NULL) i=((IDELEMS(Q)+(setmaxTinc-1))/setmaxTinc)*setmaxTinc; |
---|
| 5033 | else i=setmaxT; |
---|
| 5034 | i=((i+IDELEMS(F)+IDELEMS(P)+15)/16)*16; |
---|
| 5035 | strat->ecartS=initec(i); |
---|
| 5036 | strat->sevS=initsevS(i); |
---|
| 5037 | strat->S_2_R=initS_2_R(i); |
---|
| 5038 | strat->fromQ=NULL; |
---|
| 5039 | strat->Shdl=idInit(i,F->rank); |
---|
| 5040 | strat->S=strat->Shdl->m; |
---|
| 5041 | |
---|
| 5042 | /*- put polys into S -*/ |
---|
| 5043 | if (Q!=NULL) |
---|
| 5044 | { |
---|
| 5045 | strat->fromQ=initec(i); |
---|
| 5046 | memset(strat->fromQ,0,i*sizeof(int)); |
---|
| 5047 | for (i=0; i<IDELEMS(Q); i++) |
---|
| 5048 | { |
---|
| 5049 | if (Q->m[i]!=NULL) |
---|
| 5050 | { |
---|
| 5051 | LObject h; |
---|
| 5052 | h.p = pCopy(Q->m[i]); |
---|
| 5053 | //if (TEST_OPT_INTSTRATEGY) |
---|
| 5054 | //{ |
---|
| 5055 | // //pContent(h.p); |
---|
| 5056 | // h.pCleardenom(); // also does a pContent |
---|
| 5057 | //} |
---|
| 5058 | //else |
---|
| 5059 | //{ |
---|
| 5060 | // h.pNorm(); |
---|
| 5061 | //} |
---|
| 5062 | if (pOrdSgn==-1) |
---|
| 5063 | { |
---|
| 5064 | deleteHC(&h,strat); |
---|
| 5065 | } |
---|
| 5066 | if (h.p!=NULL) |
---|
| 5067 | { |
---|
| 5068 | strat->initEcart(&h); |
---|
| 5069 | if (strat->sl==-1) |
---|
| 5070 | pos =0; |
---|
| 5071 | else |
---|
| 5072 | { |
---|
| 5073 | pos = posInS(strat,strat->sl,h.p,h.ecart); |
---|
| 5074 | } |
---|
| 5075 | h.sev = pGetShortExpVector(h.p); |
---|
| 5076 | strat->enterS(h,pos,strat, strat->tl+1); |
---|
| 5077 | enterT(h, strat); |
---|
| 5078 | strat->fromQ[pos]=1; |
---|
| 5079 | } |
---|
| 5080 | } |
---|
| 5081 | } |
---|
| 5082 | } |
---|
| 5083 | /*- put polys into S -*/ |
---|
| 5084 | for (i=0; i<IDELEMS(F); i++) |
---|
| 5085 | { |
---|
| 5086 | if (F->m[i]!=NULL) |
---|
| 5087 | { |
---|
| 5088 | LObject h; |
---|
| 5089 | h.p = pCopy(F->m[i]); |
---|
| 5090 | if (pOrdSgn==-1) |
---|
| 5091 | { |
---|
| 5092 | deleteHC(&h,strat); |
---|
| 5093 | } |
---|
| 5094 | else |
---|
| 5095 | { |
---|
| 5096 | h.p=redtailBba(h.p,strat->sl,strat); |
---|
| 5097 | } |
---|
| 5098 | if (h.p!=NULL) |
---|
| 5099 | { |
---|
| 5100 | strat->initEcart(&h); |
---|
| 5101 | if (strat->sl==-1) |
---|
| 5102 | pos =0; |
---|
| 5103 | else |
---|
| 5104 | pos = posInS(strat,strat->sl,h.p,h.ecart); |
---|
| 5105 | h.sev = pGetShortExpVector(h.p); |
---|
| 5106 | strat->enterS(h,pos,strat, strat->tl+1); |
---|
| 5107 | enterT(h,strat); |
---|
| 5108 | } |
---|
| 5109 | } |
---|
| 5110 | } |
---|
| 5111 | for (i=0; i<IDELEMS(P); i++) |
---|
| 5112 | { |
---|
| 5113 | if (P->m[i]!=NULL) |
---|
| 5114 | { |
---|
| 5115 | LObject h; |
---|
| 5116 | h.p=pCopy(P->m[i]); |
---|
| 5117 | if (TEST_OPT_INTSTRATEGY) |
---|
| 5118 | { |
---|
| 5119 | h.pCleardenom(); |
---|
| 5120 | } |
---|
| 5121 | else |
---|
| 5122 | { |
---|
| 5123 | h.pNorm(); |
---|
| 5124 | } |
---|
| 5125 | if(strat->sl>=0) |
---|
| 5126 | { |
---|
| 5127 | if (pOrdSgn==1) |
---|
| 5128 | { |
---|
| 5129 | h.p=redBba(h.p,strat->sl,strat); |
---|
| 5130 | if (h.p!=NULL) |
---|
| 5131 | { |
---|
| 5132 | h.p=redtailBba(h.p,strat->sl,strat); |
---|
| 5133 | } |
---|
| 5134 | } |
---|
| 5135 | else |
---|
| 5136 | { |
---|
| 5137 | h.p=redMora(h.p,strat->sl,strat); |
---|
| 5138 | } |
---|
| 5139 | if(h.p!=NULL) |
---|
| 5140 | { |
---|
| 5141 | strat->initEcart(&h); |
---|
| 5142 | if (TEST_OPT_INTSTRATEGY) |
---|
| 5143 | { |
---|
| 5144 | h.pCleardenom(); |
---|
| 5145 | } |
---|
| 5146 | else |
---|
| 5147 | { |
---|
| 5148 | h.is_normalized = 0; |
---|
| 5149 | h.pNorm(); |
---|
| 5150 | } |
---|
| 5151 | h.sev = pGetShortExpVector(h.p); |
---|
| 5152 | h.SetpFDeg(); |
---|
| 5153 | pos = posInS(strat,strat->sl,h.p,h.ecart); |
---|
| 5154 | enterpairsSpecial(h.p,strat->sl,h.ecart,pos,strat,strat->tl+1); |
---|
| 5155 | strat->enterS(h,pos,strat, strat->tl+1); |
---|
| 5156 | enterT(h,strat); |
---|
| 5157 | } |
---|
| 5158 | } |
---|
| 5159 | else |
---|
| 5160 | { |
---|
| 5161 | h.sev = pGetShortExpVector(h.p); |
---|
| 5162 | strat->initEcart(&h); |
---|
| 5163 | strat->enterS(h,0,strat, strat->tl+1); |
---|
| 5164 | enterT(h,strat); |
---|
| 5165 | } |
---|
| 5166 | } |
---|
| 5167 | } |
---|
| 5168 | } |
---|
| 5169 | /*2 |
---|
| 5170 | * reduces h using the set S |
---|
| 5171 | * procedure used in cancelunit1 |
---|
| 5172 | */ |
---|
| 5173 | static poly redBba1 (poly h,int maxIndex,kStrategy strat) |
---|
| 5174 | { |
---|
| 5175 | int j = 0; |
---|
| 5176 | unsigned long not_sev = ~ pGetShortExpVector(h); |
---|
| 5177 | |
---|
| 5178 | while (j <= maxIndex) |
---|
| 5179 | { |
---|
| 5180 | if (pLmShortDivisibleBy(strat->S[j],strat->sevS[j],h, not_sev)) |
---|
| 5181 | return ksOldSpolyRedNew(strat->S[j],h,strat->kNoetherTail()); |
---|
| 5182 | else j++; |
---|
| 5183 | } |
---|
| 5184 | return h; |
---|
| 5185 | } |
---|
| 5186 | |
---|
| 5187 | /*2 |
---|
| 5188 | *tests if p.p=monomial*unit and cancels the unit |
---|
| 5189 | */ |
---|
| 5190 | void cancelunit1 (LObject* p,int *suc, int index,kStrategy strat ) |
---|
| 5191 | { |
---|
| 5192 | int k; |
---|
| 5193 | poly r,h,h1,q; |
---|
| 5194 | |
---|
| 5195 | if (!pIsVector((*p).p) && ((*p).ecart != 0)) |
---|
| 5196 | { |
---|
[18ef40] | 5197 | #ifdef HAVE_RINGS_LOC |
---|
[f41347f] | 5198 | // Leading coef have to be a unit |
---|
| 5199 | if ( !(nIsUnit(p_GetCoeff((*p).p, r))) ) return; |
---|
| 5200 | #endif |
---|
| 5201 | k = 0; |
---|
| 5202 | h1 = r = pCopy((*p).p); |
---|
| 5203 | h =pNext(r); |
---|
| 5204 | loop |
---|
| 5205 | { |
---|
| 5206 | if (h==NULL) |
---|
| 5207 | { |
---|
| 5208 | pDelete(&r); |
---|
| 5209 | pDelete(&(pNext((*p).p))); |
---|
| 5210 | (*p).ecart = 0; |
---|
| 5211 | (*p).length = 1; |
---|
[18ef40] | 5212 | #ifdef HAVE_RINGS_LOC |
---|
[f41347f] | 5213 | (*p).pLength = 1; // Why wasn't this set already? |
---|
| 5214 | #endif |
---|
| 5215 | (*suc)=0; |
---|
| 5216 | return; |
---|
| 5217 | } |
---|
| 5218 | if (!pDivisibleBy(r,h)) |
---|
| 5219 | { |
---|
| 5220 | q=redBba1(h,index ,strat); |
---|
| 5221 | if (q != h) |
---|
| 5222 | { |
---|
| 5223 | k++; |
---|
| 5224 | pDelete(&h); |
---|
| 5225 | pNext(h1) = h = q; |
---|
| 5226 | } |
---|
| 5227 | else |
---|
| 5228 | { |
---|
| 5229 | pDelete(&r); |
---|
| 5230 | return; |
---|
| 5231 | } |
---|
| 5232 | } |
---|
| 5233 | else |
---|
| 5234 | { |
---|
| 5235 | h1 = h; |
---|
| 5236 | pIter(h); |
---|
| 5237 | } |
---|
| 5238 | if (k > 10) |
---|
| 5239 | { |
---|
| 5240 | pDelete(&r); |
---|
| 5241 | return; |
---|
| 5242 | } |
---|
| 5243 | } |
---|
| 5244 | } |
---|
| 5245 | } |
---|
| 5246 | |
---|
| 5247 | #if 0 |
---|
| 5248 | /*2 |
---|
| 5249 | * reduces h using the elements from Q in the set S |
---|
| 5250 | * procedure used in updateS |
---|
| 5251 | * must not be used for elements of Q or elements of an ideal ! |
---|
| 5252 | */ |
---|
| 5253 | static poly redQ (poly h, int j, kStrategy strat) |
---|
| 5254 | { |
---|
| 5255 | int start; |
---|
| 5256 | unsigned long not_sev = ~ pGetShortExpVector(h); |
---|
| 5257 | while ((j <= strat->sl) && (pGetComp(strat->S[j])!=0)) j++; |
---|
| 5258 | start=j; |
---|
| 5259 | while (j<=strat->sl) |
---|
| 5260 | { |
---|
| 5261 | if (pLmShortDivisibleBy(strat->S[j],strat->sevS[j], h, not_sev)) |
---|
| 5262 | { |
---|
| 5263 | h = ksOldSpolyRed(strat->S[j],h,strat->kNoetherTail()); |
---|
| 5264 | if (h==NULL) return NULL; |
---|
| 5265 | j = start; |
---|
| 5266 | not_sev = ~ pGetShortExpVector(h); |
---|
| 5267 | } |
---|
| 5268 | else j++; |
---|
| 5269 | } |
---|
| 5270 | return h; |
---|
| 5271 | } |
---|
| 5272 | #endif |
---|
| 5273 | |
---|
| 5274 | /*2 |
---|
| 5275 | * reduces h using the set S |
---|
| 5276 | * procedure used in updateS |
---|
| 5277 | */ |
---|
| 5278 | static poly redBba (poly h,int maxIndex,kStrategy strat) |
---|
| 5279 | { |
---|
| 5280 | int j = 0; |
---|
| 5281 | unsigned long not_sev = ~ pGetShortExpVector(h); |
---|
| 5282 | |
---|
| 5283 | while (j <= maxIndex) |
---|
| 5284 | { |
---|
| 5285 | if (pLmShortDivisibleBy(strat->S[j],strat->sevS[j], h, not_sev)) |
---|
| 5286 | { |
---|
| 5287 | h = ksOldSpolyRed(strat->S[j],h,strat->kNoetherTail()); |
---|
| 5288 | if (h==NULL) return NULL; |
---|
| 5289 | j = 0; |
---|
| 5290 | not_sev = ~ pGetShortExpVector(h); } |
---|
| 5291 | else j++; |
---|
| 5292 | } |
---|
| 5293 | return h; |
---|
| 5294 | } |
---|
| 5295 | |
---|
| 5296 | /*2 |
---|
| 5297 | * reduces h using the set S |
---|
| 5298 | *e is the ecart of h |
---|
| 5299 | *procedure used in updateS |
---|
| 5300 | */ |
---|
| 5301 | static poly redMora (poly h,int maxIndex,kStrategy strat) |
---|
| 5302 | { |
---|
| 5303 | int j=0; |
---|
| 5304 | int e,l; |
---|
| 5305 | unsigned long not_sev = ~ pGetShortExpVector(h); |
---|
| 5306 | |
---|
| 5307 | if (maxIndex >= 0) |
---|
| 5308 | { |
---|
| 5309 | e = pLDeg(h,&l,currRing)-pFDeg(h,currRing); |
---|
| 5310 | do |
---|
| 5311 | { |
---|
| 5312 | if (pLmShortDivisibleBy(strat->S[j],strat->sevS[j], h, not_sev) |
---|
| 5313 | && ((e >= strat->ecartS[j]) || strat->kHEdgeFound)) |
---|
| 5314 | { |
---|
| 5315 | #ifdef KDEBUG |
---|
| 5316 | if (TEST_OPT_DEBUG) |
---|
| 5317 | {PrintS("reduce ");wrp(h);Print(" with S[%d] (",j);wrp(strat->S[j]);} |
---|
| 5318 | #endif |
---|
| 5319 | h = ksOldSpolyRed(strat->S[j],h,strat->kNoetherTail()); |
---|
| 5320 | #ifdef KDEBUG |
---|
| 5321 | if(TEST_OPT_DEBUG) |
---|
| 5322 | {PrintS(")\nto "); wrp(h); PrintLn();} |
---|
| 5323 | #endif |
---|
| 5324 | // pDelete(&h); |
---|
| 5325 | if (h == NULL) return NULL; |
---|
| 5326 | e = pLDeg(h,&l,currRing)-pFDeg(h,currRing); |
---|
| 5327 | j = 0; |
---|
| 5328 | not_sev = ~ pGetShortExpVector(h); |
---|
| 5329 | } |
---|
| 5330 | else j++; |
---|
| 5331 | } |
---|
| 5332 | while (j <= maxIndex); |
---|
| 5333 | } |
---|
| 5334 | return h; |
---|
| 5335 | } |
---|
| 5336 | |
---|
| 5337 | /*2 |
---|
| 5338 | *updates S: |
---|
| 5339 | *the result is a set of polynomials which are in |
---|
| 5340 | *normalform with respect to S |
---|
| 5341 | */ |
---|
| 5342 | void updateS(BOOLEAN toT,kStrategy strat) |
---|
| 5343 | { |
---|
| 5344 | LObject h; |
---|
| 5345 | int i, suc=0; |
---|
| 5346 | poly redSi=NULL; |
---|
| 5347 | BOOLEAN change,any_change; |
---|
| 5348 | // Print("nach initS: updateS start mit sl=%d\n",(strat->sl)); |
---|
| 5349 | // for (i=0; i<=(strat->sl); i++) |
---|
| 5350 | // { |
---|
| 5351 | // Print("s%d:",i); |
---|
| 5352 | // if (strat->fromQ!=NULL) Print("(Q:%d) ",strat->fromQ[i]); |
---|
| 5353 | // pWrite(strat->S[i]); |
---|
| 5354 | // } |
---|
| 5355 | // Print("pOrdSgn=%d\n", pOrdSgn); |
---|
| 5356 | any_change=FALSE; |
---|
| 5357 | if (pOrdSgn==1) |
---|
| 5358 | { |
---|
| 5359 | while (suc != -1) |
---|
| 5360 | { |
---|
| 5361 | i=suc+1; |
---|
| 5362 | while (i<=strat->sl) |
---|
| 5363 | { |
---|
| 5364 | change=FALSE; |
---|
| 5365 | if (((strat->fromQ==NULL) || (strat->fromQ[i]==0)) && (i>0)) |
---|
| 5366 | { |
---|
| 5367 | redSi = pHead(strat->S[i]); |
---|
| 5368 | strat->S[i] = redBba(strat->S[i],i-1,strat); |
---|
| 5369 | //if ((strat->ak!=0)&&(strat->S[i]!=NULL)) |
---|
| 5370 | // strat->S[i]=redQ(strat->S[i],i+1,strat); /*reduce S[i] mod Q*/ |
---|
| 5371 | if (pCmp(redSi,strat->S[i])!=0) |
---|
| 5372 | { |
---|
| 5373 | change=TRUE; |
---|
| 5374 | any_change=TRUE; |
---|
| 5375 | #ifdef KDEBUG |
---|
| 5376 | if (TEST_OPT_DEBUG) |
---|
| 5377 | { |
---|
| 5378 | PrintS("reduce:"); |
---|
| 5379 | wrp(redSi);PrintS(" to ");p_wrp(strat->S[i], currRing, strat->tailRing);PrintLn(); |
---|
| 5380 | } |
---|
| 5381 | #endif |
---|
| 5382 | if (TEST_OPT_PROT) |
---|
| 5383 | { |
---|
| 5384 | if (strat->S[i]==NULL) |
---|
| 5385 | PrintS("V"); |
---|
| 5386 | else |
---|
| 5387 | PrintS("v"); |
---|
| 5388 | mflush(); |
---|
| 5389 | } |
---|
| 5390 | } |
---|
[ce2454] | 5391 | pLmDelete(&redSi); |
---|
[f41347f] | 5392 | if (strat->S[i]==NULL) |
---|
| 5393 | { |
---|
| 5394 | deleteInS(i,strat); |
---|
| 5395 | i--; |
---|
| 5396 | } |
---|
| 5397 | else if (change) |
---|
| 5398 | { |
---|
| 5399 | if (TEST_OPT_INTSTRATEGY) |
---|
| 5400 | { |
---|
| 5401 | //pContent(strat->S[i]); |
---|
[a0d9be] | 5402 | strat->S[i]=p_Cleardenom(strat->S[i], currRing);// also does a pContent |
---|
[f41347f] | 5403 | } |
---|
| 5404 | else |
---|
| 5405 | { |
---|
| 5406 | pNorm(strat->S[i]); |
---|
| 5407 | } |
---|
| 5408 | strat->sevS[i] = pGetShortExpVector(strat->S[i]); |
---|
| 5409 | } |
---|
| 5410 | } |
---|
| 5411 | i++; |
---|
| 5412 | } |
---|
| 5413 | if (any_change) reorderS(&suc,strat); |
---|
| 5414 | else break; |
---|
| 5415 | } |
---|
| 5416 | if (toT) |
---|
| 5417 | { |
---|
| 5418 | for (i=0; i<=strat->sl; i++) |
---|
| 5419 | { |
---|
| 5420 | if ((strat->fromQ==NULL) || (strat->fromQ[i]==0)) |
---|
| 5421 | { |
---|
| 5422 | h.p = redtailBba(strat->S[i],i-1,strat); |
---|
| 5423 | if (TEST_OPT_INTSTRATEGY) |
---|
| 5424 | { |
---|
[c0e2c36] | 5425 | h.pCleardenom();// also does a pContent |
---|
[f41347f] | 5426 | } |
---|
| 5427 | } |
---|
| 5428 | else |
---|
| 5429 | { |
---|
| 5430 | h.p = strat->S[i]; |
---|
| 5431 | } |
---|
| 5432 | strat->initEcart(&h); |
---|
| 5433 | if (strat->honey) |
---|
| 5434 | { |
---|
| 5435 | strat->ecartS[i] = h.ecart; |
---|
| 5436 | } |
---|
| 5437 | if (strat->sevS[i] == 0) {strat->sevS[i] = pGetShortExpVector(h.p);} |
---|
| 5438 | else assume(strat->sevS[i] == pGetShortExpVector(h.p)); |
---|
| 5439 | h.sev = strat->sevS[i]; |
---|
| 5440 | /*puts the elements of S also to T*/ |
---|
| 5441 | enterT(h,strat); |
---|
| 5442 | strat->S_2_R[i] = strat->tl; |
---|
| 5443 | } |
---|
| 5444 | } |
---|
| 5445 | } |
---|
| 5446 | else |
---|
| 5447 | { |
---|
| 5448 | while (suc != -1) |
---|
| 5449 | { |
---|
| 5450 | i=suc; |
---|
| 5451 | while (i<=strat->sl) |
---|
| 5452 | { |
---|
| 5453 | change=FALSE; |
---|
| 5454 | if (((strat->fromQ==NULL) || (strat->fromQ[i]==0)) && (i>0)) |
---|
| 5455 | { |
---|
| 5456 | redSi=pHead((strat->S)[i]); |
---|
| 5457 | (strat->S)[i] = redMora((strat->S)[i],i-1,strat); |
---|
| 5458 | if ((strat->S)[i]==NULL) |
---|
| 5459 | { |
---|
| 5460 | deleteInS(i,strat); |
---|
| 5461 | i--; |
---|
| 5462 | } |
---|
| 5463 | else if (pCmp((strat->S)[i],redSi)!=0) |
---|
| 5464 | { |
---|
| 5465 | any_change=TRUE; |
---|
| 5466 | h.p = strat->S[i]; |
---|
| 5467 | strat->initEcart(&h); |
---|
| 5468 | strat->ecartS[i] = h.ecart; |
---|
| 5469 | if (TEST_OPT_INTSTRATEGY) |
---|
| 5470 | { |
---|
[a0d9be] | 5471 | strat->S[i]=p_Cleardenom(strat->S[i], currRing);// also does a pContent |
---|
[f41347f] | 5472 | } |
---|
| 5473 | else |
---|
| 5474 | { |
---|
| 5475 | pNorm(strat->S[i]); // == h.p |
---|
| 5476 | } |
---|
| 5477 | h.sev = pGetShortExpVector(h.p); |
---|
| 5478 | strat->sevS[i] = h.sev; |
---|
| 5479 | } |
---|
[ce2454] | 5480 | pLmDelete(&redSi); |
---|
[f41347f] | 5481 | kTest(strat); |
---|
| 5482 | } |
---|
| 5483 | i++; |
---|
| 5484 | } |
---|
| 5485 | #ifdef KDEBUG |
---|
| 5486 | kTest(strat); |
---|
| 5487 | #endif |
---|
| 5488 | if (any_change) reorderS(&suc,strat); |
---|
| 5489 | else { suc=-1; break; } |
---|
| 5490 | if (h.p!=NULL) |
---|
| 5491 | { |
---|
| 5492 | if (!strat->kHEdgeFound) |
---|
| 5493 | { |
---|
| 5494 | /*strat->kHEdgeFound =*/ HEckeTest(h.p,strat); |
---|
| 5495 | } |
---|
| 5496 | if (strat->kHEdgeFound) |
---|
| 5497 | newHEdge(strat->S,strat); |
---|
| 5498 | } |
---|
| 5499 | } |
---|
| 5500 | for (i=0; i<=strat->sl; i++) |
---|
| 5501 | { |
---|
| 5502 | if ((strat->fromQ==NULL) || (strat->fromQ[i]==0)) |
---|
| 5503 | { |
---|
| 5504 | strat->S[i] = h.p = redtail(strat->S[i],strat->sl,strat); |
---|
| 5505 | strat->initEcart(&h); |
---|
| 5506 | strat->ecartS[i] = h.ecart; |
---|
| 5507 | h.sev = pGetShortExpVector(h.p); |
---|
| 5508 | strat->sevS[i] = h.sev; |
---|
| 5509 | } |
---|
| 5510 | else |
---|
| 5511 | { |
---|
| 5512 | h.p = strat->S[i]; |
---|
| 5513 | h.ecart=strat->ecartS[i]; |
---|
| 5514 | h.sev = strat->sevS[i]; |
---|
| 5515 | h.length = h.pLength = pLength(h.p); |
---|
| 5516 | } |
---|
| 5517 | if ((strat->fromQ==NULL) || (strat->fromQ[i]==0)) |
---|
| 5518 | cancelunit1(&h,&suc,strat->sl,strat); |
---|
| 5519 | h.SetpFDeg(); |
---|
| 5520 | /*puts the elements of S also to T*/ |
---|
| 5521 | enterT(h,strat); |
---|
| 5522 | strat->S_2_R[i] = strat->tl; |
---|
| 5523 | } |
---|
| 5524 | if (suc!= -1) updateS(toT,strat); |
---|
| 5525 | } |
---|
| 5526 | #ifdef KDEBUG |
---|
| 5527 | kTest(strat); |
---|
| 5528 | #endif |
---|
| 5529 | } |
---|
| 5530 | |
---|
| 5531 | |
---|
| 5532 | /*2 |
---|
| 5533 | * -puts p to the standardbasis s at position at |
---|
| 5534 | * -saves the result in S |
---|
| 5535 | */ |
---|
| 5536 | void enterSBba (LObject p,int atS,kStrategy strat, int atR) |
---|
| 5537 | { |
---|
| 5538 | int i; |
---|
| 5539 | strat->news = TRUE; |
---|
| 5540 | /*- puts p to the standardbasis s at position at -*/ |
---|
| 5541 | if (strat->sl == IDELEMS(strat->Shdl)-1) |
---|
| 5542 | { |
---|
| 5543 | strat->sevS = (unsigned long*) omRealloc0Size(strat->sevS, |
---|
| 5544 | IDELEMS(strat->Shdl)*sizeof(unsigned long), |
---|
| 5545 | (IDELEMS(strat->Shdl)+setmaxTinc) |
---|
| 5546 | *sizeof(unsigned long)); |
---|
| 5547 | strat->ecartS = (intset)omReallocSize(strat->ecartS, |
---|
| 5548 | IDELEMS(strat->Shdl)*sizeof(int), |
---|
| 5549 | (IDELEMS(strat->Shdl)+setmaxTinc) |
---|
| 5550 | *sizeof(int)); |
---|
| 5551 | strat->S_2_R = (int*) omRealloc0Size(strat->S_2_R, |
---|
| 5552 | IDELEMS(strat->Shdl)*sizeof(int), |
---|
| 5553 | (IDELEMS(strat->Shdl)+setmaxTinc) |
---|
| 5554 | *sizeof(int)); |
---|
| 5555 | if (strat->lenS!=NULL) |
---|
| 5556 | strat->lenS=(int*)omRealloc0Size(strat->lenS, |
---|
| 5557 | IDELEMS(strat->Shdl)*sizeof(int), |
---|
| 5558 | (IDELEMS(strat->Shdl)+setmaxTinc) |
---|
| 5559 | *sizeof(int)); |
---|
| 5560 | if (strat->lenSw!=NULL) |
---|
| 5561 | strat->lenSw=(wlen_type*)omRealloc0Size(strat->lenSw, |
---|
| 5562 | IDELEMS(strat->Shdl)*sizeof(wlen_type), |
---|
| 5563 | (IDELEMS(strat->Shdl)+setmaxTinc) |
---|
| 5564 | *sizeof(wlen_type)); |
---|
| 5565 | if (strat->fromQ!=NULL) |
---|
| 5566 | { |
---|
| 5567 | strat->fromQ = (intset)omReallocSize(strat->fromQ, |
---|
| 5568 | IDELEMS(strat->Shdl)*sizeof(int), |
---|
| 5569 | (IDELEMS(strat->Shdl)+setmaxTinc)*sizeof(int)); |
---|
| 5570 | } |
---|
| 5571 | pEnlargeSet(&strat->S,IDELEMS(strat->Shdl),setmaxTinc); |
---|
| 5572 | IDELEMS(strat->Shdl)+=setmaxTinc; |
---|
| 5573 | strat->Shdl->m=strat->S; |
---|
| 5574 | } |
---|
| 5575 | if (atS <= strat->sl) |
---|
| 5576 | { |
---|
| 5577 | #ifdef ENTER_USE_MEMMOVE |
---|
| 5578 | // #if 0 |
---|
| 5579 | memmove(&(strat->S[atS+1]), &(strat->S[atS]), |
---|
| 5580 | (strat->sl - atS + 1)*sizeof(poly)); |
---|
| 5581 | memmove(&(strat->ecartS[atS+1]), &(strat->ecartS[atS]), |
---|
| 5582 | (strat->sl - atS + 1)*sizeof(int)); |
---|
| 5583 | memmove(&(strat->sevS[atS+1]), &(strat->sevS[atS]), |
---|
| 5584 | (strat->sl - atS + 1)*sizeof(unsigned long)); |
---|
| 5585 | memmove(&(strat->S_2_R[atS+1]), &(strat->S_2_R[atS]), |
---|
| 5586 | (strat->sl - atS + 1)*sizeof(int)); |
---|
| 5587 | if (strat->lenS!=NULL) |
---|
| 5588 | memmove(&(strat->lenS[atS+1]), &(strat->lenS[atS]), |
---|
| 5589 | (strat->sl - atS + 1)*sizeof(int)); |
---|
| 5590 | if (strat->lenSw!=NULL) |
---|
| 5591 | memmove(&(strat->lenSw[atS+1]), &(strat->lenSw[atS]), |
---|
| 5592 | (strat->sl - atS + 1)*sizeof(wlen_type)); |
---|
| 5593 | #else |
---|
| 5594 | for (i=strat->sl+1; i>=atS+1; i--) |
---|
| 5595 | { |
---|
| 5596 | strat->S[i] = strat->S[i-1]; |
---|
| 5597 | strat->ecartS[i] = strat->ecartS[i-1]; |
---|
| 5598 | strat->sevS[i] = strat->sevS[i-1]; |
---|
| 5599 | strat->S_2_R[i] = strat->S_2_R[i-1]; |
---|
| 5600 | } |
---|
| 5601 | if (strat->lenS!=NULL) |
---|
| 5602 | for (i=strat->sl+1; i>=atS+1; i--) |
---|
| 5603 | strat->lenS[i] = strat->lenS[i-1]; |
---|
| 5604 | if (strat->lenSw!=NULL) |
---|
| 5605 | for (i=strat->sl+1; i>=atS+1; i--) |
---|
| 5606 | strat->lenSw[i] = strat->lenSw[i-1]; |
---|
| 5607 | #endif |
---|
| 5608 | } |
---|
| 5609 | if (strat->fromQ!=NULL) |
---|
| 5610 | { |
---|
| 5611 | #ifdef ENTER_USE_MEMMOVE |
---|
| 5612 | memmove(&(strat->fromQ[atS+1]), &(strat->fromQ[atS]), |
---|
| 5613 | (strat->sl - atS + 1)*sizeof(int)); |
---|
| 5614 | #else |
---|
| 5615 | for (i=strat->sl+1; i>=atS+1; i--) |
---|
| 5616 | { |
---|
| 5617 | strat->fromQ[i] = strat->fromQ[i-1]; |
---|
| 5618 | } |
---|
| 5619 | #endif |
---|
| 5620 | strat->fromQ[atS]=0; |
---|
| 5621 | } |
---|
| 5622 | |
---|
| 5623 | /*- save result -*/ |
---|
| 5624 | strat->S[atS] = p.p; |
---|
| 5625 | if (strat->honey) strat->ecartS[atS] = p.ecart; |
---|
| 5626 | if (p.sev == 0) |
---|
| 5627 | p.sev = pGetShortExpVector(p.p); |
---|
| 5628 | else |
---|
| 5629 | assume(p.sev == pGetShortExpVector(p.p)); |
---|
| 5630 | strat->sevS[atS] = p.sev; |
---|
| 5631 | strat->ecartS[atS] = p.ecart; |
---|
| 5632 | strat->S_2_R[atS] = atR; |
---|
| 5633 | strat->sl++; |
---|
| 5634 | } |
---|
| 5635 | |
---|
| 5636 | /*2 |
---|
| 5637 | * puts p to the set T at position atT |
---|
| 5638 | */ |
---|
| 5639 | void enterT(LObject p, kStrategy strat, int atT) |
---|
| 5640 | { |
---|
| 5641 | int i; |
---|
| 5642 | |
---|
| 5643 | pp_Test(p.p, currRing, p.tailRing); |
---|
| 5644 | assume(strat->tailRing == p.tailRing); |
---|
| 5645 | // redMoraNF complains about this -- but, we don't really |
---|
| 5646 | // neeed this so far |
---|
[54c558] | 5647 | assume(p.pLength == 0 || pLength(p.p) == p.pLength || rIsSyzIndexRing(currRing)); // modulo syzring |
---|
[f41347f] | 5648 | assume(p.FDeg == p.pFDeg()); |
---|
| 5649 | assume(!p.is_normalized || nIsOne(pGetCoeff(p.p))); |
---|
| 5650 | |
---|
[9f17c9] | 5651 | #ifdef KDEBUG |
---|
[f41347f] | 5652 | // do not put an LObject twice into T: |
---|
| 5653 | for(i=strat->tl;i>=0;i--) |
---|
| 5654 | { |
---|
[9f17c9] | 5655 | if (p.p==strat->T[i].p) |
---|
[f41347f] | 5656 | { |
---|
| 5657 | printf("already in T at pos %d of %d, atT=%d\n",i,strat->tl,atT); |
---|
| 5658 | return; |
---|
| 5659 | } |
---|
| 5660 | } |
---|
[9f17c9] | 5661 | #endif |
---|
[f41347f] | 5662 | strat->newt = TRUE; |
---|
| 5663 | if (atT < 0) |
---|
| 5664 | atT = strat->posInT(strat->T, strat->tl, p); |
---|
| 5665 | if (strat->tl == strat->tmax-1) |
---|
| 5666 | enlargeT(strat->T,strat->R,strat->sevT,strat->tmax,setmaxTinc); |
---|
| 5667 | if (atT <= strat->tl) |
---|
| 5668 | { |
---|
| 5669 | #ifdef ENTER_USE_MEMMOVE |
---|
| 5670 | memmove(&(strat->T[atT+1]), &(strat->T[atT]), |
---|
| 5671 | (strat->tl-atT+1)*sizeof(TObject)); |
---|
| 5672 | memmove(&(strat->sevT[atT+1]), &(strat->sevT[atT]), |
---|
| 5673 | (strat->tl-atT+1)*sizeof(unsigned long)); |
---|
| 5674 | #endif |
---|
| 5675 | for (i=strat->tl+1; i>=atT+1; i--) |
---|
| 5676 | { |
---|
| 5677 | #ifndef ENTER_USE_MEMMOVE |
---|
| 5678 | strat->T[i] = strat->T[i-1]; |
---|
| 5679 | strat->sevT[i] = strat->sevT[i-1]; |
---|
| 5680 | #endif |
---|
| 5681 | strat->R[strat->T[i].i_r] = &(strat->T[i]); |
---|
| 5682 | } |
---|
| 5683 | } |
---|
| 5684 | |
---|
| 5685 | if (strat->tailBin != NULL && (pNext(p.p) != NULL)) |
---|
| 5686 | { |
---|
| 5687 | pNext(p.p)=p_ShallowCopyDelete(pNext(p.p), |
---|
| 5688 | (strat->tailRing != NULL ? |
---|
| 5689 | strat->tailRing : currRing), |
---|
| 5690 | strat->tailBin); |
---|
| 5691 | if (p.t_p != NULL) pNext(p.t_p) = pNext(p.p); |
---|
| 5692 | } |
---|
| 5693 | strat->T[atT] = (TObject) p; |
---|
| 5694 | |
---|
| 5695 | if (strat->tailRing != currRing && pNext(p.p) != NULL) |
---|
| 5696 | strat->T[atT].max = p_GetMaxExpP(pNext(p.p), strat->tailRing); |
---|
| 5697 | else |
---|
| 5698 | strat->T[atT].max = NULL; |
---|
| 5699 | |
---|
| 5700 | strat->tl++; |
---|
| 5701 | strat->R[strat->tl] = &(strat->T[atT]); |
---|
| 5702 | strat->T[atT].i_r = strat->tl; |
---|
| 5703 | assume(p.sev == 0 || pGetShortExpVector(p.p) == p.sev); |
---|
| 5704 | strat->sevT[atT] = (p.sev == 0 ? pGetShortExpVector(p.p) : p.sev); |
---|
| 5705 | kTest_T(&(strat->T[atT])); |
---|
| 5706 | } |
---|
| 5707 | |
---|
| 5708 | void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat) |
---|
| 5709 | { |
---|
| 5710 | if (strat->homog!=isHomog) |
---|
| 5711 | { |
---|
| 5712 | *hilb=NULL; |
---|
| 5713 | } |
---|
| 5714 | } |
---|
| 5715 | |
---|
| 5716 | void initBuchMoraCrit(kStrategy strat) |
---|
| 5717 | { |
---|
[6c55ae] | 5718 | strat->enterOnePair=enterOnePairNormal; |
---|
| 5719 | strat->chainCrit=chainCritNormal; |
---|
[05eb8c] | 5720 | #ifdef HAVE_RINGS |
---|
| 5721 | if (rField_is_Ring(currRing)) |
---|
| 5722 | { |
---|
| 5723 | strat->enterOnePair=enterOnePairRing; |
---|
| 5724 | strat->chainCrit=chainCritRing; |
---|
| 5725 | } |
---|
| 5726 | #endif |
---|
[6bab1a6] | 5727 | #ifdef HAVE_RATGRING |
---|
[0b4ec2] | 5728 | if (rIsRatGRing(currRing)) |
---|
| 5729 | { |
---|
| 5730 | strat->chainCrit=chainCritPart; |
---|
[43cbc0] | 5731 | /* enterOnePairNormal get rational part in it */ |
---|
[0b4ec2] | 5732 | } |
---|
| 5733 | #endif |
---|
[6c55ae] | 5734 | |
---|
[f41347f] | 5735 | strat->sugarCrit = TEST_OPT_SUGARCRIT; |
---|
| 5736 | strat->Gebauer = strat->homog || strat->sugarCrit; |
---|
| 5737 | strat->honey = !strat->homog || strat->sugarCrit || TEST_OPT_WEIGHTM; |
---|
| 5738 | if (TEST_OPT_NOT_SUGAR) strat->honey = FALSE; |
---|
| 5739 | strat->pairtest = NULL; |
---|
| 5740 | /* alway use tailreduction, except: |
---|
| 5741 | * - in local rings, - in lex order case, -in ring over extensions */ |
---|
| 5742 | strat->noTailReduction = !TEST_OPT_REDTAIL; |
---|
| 5743 | |
---|
| 5744 | #ifdef HAVE_PLURAL |
---|
| 5745 | // and r is plural_ring |
---|
[43cbc0] | 5746 | // hence this holds for r a rational_plural_ring |
---|
[f41347f] | 5747 | if( rIsPluralRing(currRing) || (rIsSCA(currRing) && !strat->z2homog) ) |
---|
| 5748 | { //or it has non-quasi-comm type... later |
---|
| 5749 | strat->sugarCrit = FALSE; |
---|
| 5750 | strat->Gebauer = FALSE; |
---|
| 5751 | strat->honey = FALSE; |
---|
| 5752 | } |
---|
| 5753 | #endif |
---|
| 5754 | |
---|
| 5755 | #ifdef HAVE_RINGS |
---|
| 5756 | // Coefficient ring? |
---|
| 5757 | if (rField_is_Ring(currRing)) |
---|
| 5758 | { |
---|
| 5759 | strat->sugarCrit = FALSE; |
---|
| 5760 | strat->Gebauer = FALSE ; |
---|
| 5761 | strat->honey = FALSE; |
---|
| 5762 | } |
---|
| 5763 | #endif |
---|
| 5764 | #ifdef KDEBUG |
---|
| 5765 | if (TEST_OPT_DEBUG) |
---|
| 5766 | { |
---|
| 5767 | if (strat->homog) PrintS("ideal/module is homogeneous\n"); |
---|
| 5768 | else PrintS("ideal/module is not homogeneous\n"); |
---|
| 5769 | } |
---|
| 5770 | #endif |
---|
| 5771 | } |
---|
| 5772 | |
---|
| 5773 | BOOLEAN kPosInLDependsOnLength(int (*pos_in_l) |
---|
| 5774 | (const LSet set, const int length, |
---|
| 5775 | LObject* L,const kStrategy strat)) |
---|
| 5776 | { |
---|
| 5777 | if (pos_in_l == posInL110 || |
---|
| 5778 | pos_in_l == posInL10) |
---|
| 5779 | return TRUE; |
---|
| 5780 | |
---|
| 5781 | return FALSE; |
---|
| 5782 | } |
---|
| 5783 | |
---|
| 5784 | void initBuchMoraPos (kStrategy strat) |
---|
| 5785 | { |
---|
| 5786 | if (pOrdSgn==1) |
---|
| 5787 | { |
---|
| 5788 | if (strat->honey) |
---|
| 5789 | { |
---|
| 5790 | strat->posInL = posInL15; |
---|
| 5791 | // ok -- here is the deal: from my experiments for Singular-2-0 |
---|
| 5792 | // I conclude that that posInT_EcartpLength is the best of |
---|
| 5793 | // posInT15, posInT_EcartFDegpLength, posInT_FDegLength, posInT_pLength |
---|
| 5794 | // see the table at the end of this file |
---|
[228b631] | 5795 | if (TEST_OPT_OLDSTD) |
---|
[f41347f] | 5796 | strat->posInT = posInT15; |
---|
| 5797 | else |
---|
| 5798 | strat->posInT = posInT_EcartpLength; |
---|
| 5799 | } |
---|
| 5800 | else if (pLexOrder && !TEST_OPT_INTSTRATEGY) |
---|
| 5801 | { |
---|
| 5802 | strat->posInL = posInL11; |
---|
| 5803 | strat->posInT = posInT11; |
---|
| 5804 | } |
---|
| 5805 | else if (TEST_OPT_INTSTRATEGY) |
---|
| 5806 | { |
---|
| 5807 | strat->posInL = posInL11; |
---|
| 5808 | strat->posInT = posInT11; |
---|
| 5809 | } |
---|
| 5810 | else |
---|
| 5811 | { |
---|
| 5812 | strat->posInL = posInL0; |
---|
| 5813 | strat->posInT = posInT0; |
---|
| 5814 | } |
---|
| 5815 | //if (strat->minim>0) strat->posInL =posInLSpecial; |
---|
| 5816 | if (strat->homog) |
---|
| 5817 | { |
---|
| 5818 | strat->posInL = posInL110; |
---|
| 5819 | strat->posInT = posInT110; |
---|
| 5820 | } |
---|
| 5821 | } |
---|
| 5822 | else |
---|
| 5823 | { |
---|
| 5824 | if (strat->homog) |
---|
| 5825 | { |
---|
| 5826 | strat->posInL = posInL11; |
---|
| 5827 | strat->posInT = posInT11; |
---|
| 5828 | } |
---|
| 5829 | else |
---|
| 5830 | { |
---|
| 5831 | if ((currRing->order[0]==ringorder_c) |
---|
| 5832 | ||(currRing->order[0]==ringorder_C)) |
---|
| 5833 | { |
---|
| 5834 | strat->posInL = posInL17_c; |
---|
| 5835 | strat->posInT = posInT17_c; |
---|
| 5836 | } |
---|
| 5837 | else |
---|
| 5838 | { |
---|
| 5839 | strat->posInL = posInL17; |
---|
| 5840 | strat->posInT = posInT17; |
---|
| 5841 | } |
---|
| 5842 | } |
---|
| 5843 | } |
---|
| 5844 | if (strat->minim>0) strat->posInL =posInLSpecial; |
---|
| 5845 | // for further tests only |
---|
| 5846 | if ((BTEST1(11)) || (BTEST1(12))) |
---|
| 5847 | strat->posInL = posInL11; |
---|
| 5848 | else if ((BTEST1(13)) || (BTEST1(14))) |
---|
| 5849 | strat->posInL = posInL13; |
---|
| 5850 | else if ((BTEST1(15)) || (BTEST1(16))) |
---|
| 5851 | strat->posInL = posInL15; |
---|
| 5852 | else if ((BTEST1(17)) || (BTEST1(18))) |
---|
| 5853 | strat->posInL = posInL17; |
---|
| 5854 | if (BTEST1(11)) |
---|
| 5855 | strat->posInT = posInT11; |
---|
| 5856 | else if (BTEST1(13)) |
---|
| 5857 | strat->posInT = posInT13; |
---|
| 5858 | else if (BTEST1(15)) |
---|
| 5859 | strat->posInT = posInT15; |
---|
| 5860 | else if ((BTEST1(17))) |
---|
| 5861 | strat->posInT = posInT17; |
---|
| 5862 | else if ((BTEST1(19))) |
---|
| 5863 | strat->posInT = posInT19; |
---|
| 5864 | else if (BTEST1(12) || BTEST1(14) || BTEST1(16) || BTEST1(18)) |
---|
| 5865 | strat->posInT = posInT1; |
---|
| 5866 | #ifdef HAVE_RINGS |
---|
| 5867 | if (rField_is_Ring(currRing)) |
---|
| 5868 | { |
---|
| 5869 | strat->posInL = posInL11; |
---|
| 5870 | strat->posInT = posInT11; |
---|
| 5871 | } |
---|
| 5872 | #endif |
---|
| 5873 | strat->posInLDependsOnLength = kPosInLDependsOnLength(strat->posInL); |
---|
| 5874 | } |
---|
| 5875 | |
---|
| 5876 | void initBuchMora (ideal F,ideal Q,kStrategy strat) |
---|
| 5877 | { |
---|
| 5878 | strat->interpt = BTEST1(OPT_INTERRUPT); |
---|
| 5879 | strat->kHEdge=NULL; |
---|
| 5880 | if (pOrdSgn==1) strat->kHEdgeFound=FALSE; |
---|
| 5881 | /*- creating temp data structures------------------- -*/ |
---|
| 5882 | strat->cp = 0; |
---|
| 5883 | strat->c3 = 0; |
---|
| 5884 | strat->tail = pInit(); |
---|
| 5885 | /*- set s -*/ |
---|
| 5886 | strat->sl = -1; |
---|
| 5887 | /*- set L -*/ |
---|
| 5888 | strat->Lmax = ((IDELEMS(F)+setmaxLinc-1)/setmaxLinc)*setmaxLinc; |
---|
| 5889 | strat->Ll = -1; |
---|
| 5890 | strat->L = initL(((IDELEMS(F)+setmaxLinc-1)/setmaxLinc)*setmaxLinc); |
---|
| 5891 | /*- set B -*/ |
---|
| 5892 | strat->Bmax = setmaxL; |
---|
| 5893 | strat->Bl = -1; |
---|
| 5894 | strat->B = initL(); |
---|
| 5895 | /*- set T -*/ |
---|
| 5896 | strat->tl = -1; |
---|
| 5897 | strat->tmax = setmaxT; |
---|
| 5898 | strat->T = initT(); |
---|
| 5899 | strat->R = initR(); |
---|
| 5900 | strat->sevT = initsevT(); |
---|
| 5901 | /*- init local data struct.---------------------------------------- -*/ |
---|
| 5902 | strat->P.ecart=0; |
---|
| 5903 | strat->P.length=0; |
---|
| 5904 | if (pOrdSgn==-1) |
---|
| 5905 | { |
---|
| 5906 | if (strat->kHEdge!=NULL) pSetComp(strat->kHEdge, strat->ak); |
---|
| 5907 | if (strat->kNoether!=NULL) pSetComp(strat->kNoetherTail(), strat->ak); |
---|
| 5908 | } |
---|
| 5909 | if(TEST_OPT_SB_1) |
---|
| 5910 | { |
---|
| 5911 | int i; |
---|
| 5912 | ideal P=idInit(IDELEMS(F)-strat->newIdeal,F->rank); |
---|
| 5913 | for (i=strat->newIdeal;i<IDELEMS(F);i++) |
---|
| 5914 | { |
---|
| 5915 | P->m[i-strat->newIdeal] = F->m[i]; |
---|
| 5916 | F->m[i] = NULL; |
---|
| 5917 | } |
---|
| 5918 | initSSpecial(F,Q,P,strat); |
---|
| 5919 | for (i=strat->newIdeal;i<IDELEMS(F);i++) |
---|
| 5920 | { |
---|
| 5921 | F->m[i] = P->m[i-strat->newIdeal]; |
---|
| 5922 | P->m[i-strat->newIdeal] = NULL; |
---|
| 5923 | } |
---|
| 5924 | idDelete(&P); |
---|
| 5925 | } |
---|
| 5926 | else |
---|
| 5927 | { |
---|
| 5928 | /*Shdl=*/initSL(F, Q,strat); /*sets also S, ecartS, fromQ */ |
---|
| 5929 | // /*Shdl=*/initS(F, Q,strat); /*sets also S, ecartS, fromQ */ |
---|
| 5930 | } |
---|
| 5931 | strat->kIdeal = NULL; |
---|
| 5932 | strat->fromT = FALSE; |
---|
| 5933 | strat->noTailReduction = !TEST_OPT_REDTAIL; |
---|
| 5934 | if (!TEST_OPT_SB_1) |
---|
| 5935 | { |
---|
| 5936 | updateS(TRUE,strat); |
---|
| 5937 | } |
---|
| 5938 | if (strat->fromQ!=NULL) omFreeSize(strat->fromQ,IDELEMS(strat->Shdl)*sizeof(int)); |
---|
| 5939 | strat->fromQ=NULL; |
---|
| 5940 | } |
---|
| 5941 | |
---|
| 5942 | void exitBuchMora (kStrategy strat) |
---|
| 5943 | { |
---|
| 5944 | /*- release temp data -*/ |
---|
| 5945 | cleanT(strat); |
---|
| 5946 | omFreeSize(strat->T,(strat->tmax)*sizeof(TObject)); |
---|
| 5947 | omFreeSize(strat->R,(strat->tmax)*sizeof(TObject*)); |
---|
| 5948 | omFreeSize(strat->sevT, (strat->tmax)*sizeof(unsigned long)); |
---|
| 5949 | omFreeSize(strat->ecartS,IDELEMS(strat->Shdl)*sizeof(int)); |
---|
| 5950 | omFreeSize(strat->sevS,IDELEMS(strat->Shdl)*sizeof(int)); |
---|
| 5951 | omFreeSize(strat->S_2_R,IDELEMS(strat->Shdl)*sizeof(int)); |
---|
| 5952 | /*- set L: should be empty -*/ |
---|
| 5953 | omFreeSize(strat->L,(strat->Lmax)*sizeof(LObject)); |
---|
| 5954 | /*- set B: should be empty -*/ |
---|
| 5955 | omFreeSize(strat->B,(strat->Bmax)*sizeof(LObject)); |
---|
[ce2454] | 5956 | pLmDelete(&strat->tail); |
---|
[f41347f] | 5957 | strat->syzComp=0; |
---|
| 5958 | if (strat->kIdeal!=NULL) |
---|
| 5959 | { |
---|
| 5960 | omFreeBin(strat->kIdeal, sleftv_bin); |
---|
| 5961 | strat->kIdeal=NULL; |
---|
| 5962 | } |
---|
| 5963 | } |
---|
| 5964 | |
---|
| 5965 | /*2 |
---|
| 5966 | * in the case of a standardbase of a module over a qring: |
---|
| 5967 | * replace polynomials in i by ak vectors, |
---|
| 5968 | * (the polynomial * unit vectors gen(1)..gen(ak) |
---|
| 5969 | * in every case (also for ideals:) |
---|
| 5970 | * deletes divisible vectors/polynomials |
---|
| 5971 | */ |
---|
| 5972 | void updateResult(ideal r,ideal Q, kStrategy strat) |
---|
| 5973 | { |
---|
| 5974 | int l; |
---|
| 5975 | if (strat->ak>0) |
---|
| 5976 | { |
---|
| 5977 | for (l=IDELEMS(r)-1;l>=0;l--) |
---|
| 5978 | { |
---|
| 5979 | if ((r->m[l]!=NULL) && (pGetComp(r->m[l])==0)) |
---|
| 5980 | { |
---|
| 5981 | pDelete(&r->m[l]); // and set it to NULL |
---|
| 5982 | } |
---|
| 5983 | } |
---|
| 5984 | int q; |
---|
| 5985 | poly p; |
---|
| 5986 | for (l=IDELEMS(r)-1;l>=0;l--) |
---|
| 5987 | { |
---|
| 5988 | if ((r->m[l]!=NULL) |
---|
[268ece] | 5989 | //&& (strat->syzComp>0) |
---|
| 5990 | //&& (pGetComp(r->m[l])<=strat->syzComp) |
---|
| 5991 | ) |
---|
[f41347f] | 5992 | { |
---|
| 5993 | for(q=IDELEMS(Q)-1; q>=0;q--) |
---|
| 5994 | { |
---|
| 5995 | if ((Q->m[q]!=NULL) |
---|
| 5996 | &&(pLmDivisibleBy(Q->m[q],r->m[l]))) |
---|
| 5997 | { |
---|
| 5998 | if (TEST_OPT_REDSB) |
---|
| 5999 | { |
---|
| 6000 | p=r->m[l]; |
---|
| 6001 | r->m[l]=kNF(Q,NULL,p); |
---|
| 6002 | pDelete(&p); |
---|
| 6003 | } |
---|
| 6004 | else |
---|
| 6005 | { |
---|
| 6006 | pDelete(&r->m[l]); // and set it to NULL |
---|
| 6007 | } |
---|
| 6008 | break; |
---|
| 6009 | } |
---|
| 6010 | } |
---|
| 6011 | } |
---|
| 6012 | } |
---|
| 6013 | } |
---|
| 6014 | else |
---|
| 6015 | { |
---|
| 6016 | int q; |
---|
| 6017 | poly p; |
---|
[9441be] | 6018 | BOOLEAN reduction_found=FALSE; |
---|
[f41347f] | 6019 | for (l=IDELEMS(r)-1;l>=0;l--) |
---|
| 6020 | { |
---|
| 6021 | if (r->m[l]!=NULL) |
---|
| 6022 | { |
---|
| 6023 | for(q=IDELEMS(Q)-1; q>=0;q--) |
---|
| 6024 | { |
---|
| 6025 | if ((Q->m[q]!=NULL) |
---|
| 6026 | &&(pLmEqual(r->m[l],Q->m[q]))) |
---|
| 6027 | { |
---|
| 6028 | if (TEST_OPT_REDSB) |
---|
| 6029 | { |
---|
| 6030 | p=r->m[l]; |
---|
| 6031 | r->m[l]=kNF(Q,NULL,p); |
---|
| 6032 | pDelete(&p); |
---|
[9441be] | 6033 | reduction_found=TRUE; |
---|
[f41347f] | 6034 | } |
---|
| 6035 | else |
---|
| 6036 | { |
---|
| 6037 | pDelete(&r->m[l]); // and set it to NULL |
---|
| 6038 | } |
---|
| 6039 | break; |
---|
| 6040 | } |
---|
| 6041 | } |
---|
| 6042 | } |
---|
| 6043 | } |
---|
[9441be] | 6044 | if (/*TEST_OPT_REDSB &&*/ reduction_found) |
---|
| 6045 | { |
---|
| 6046 | for (l=IDELEMS(r)-1;l>=0;l--) |
---|
| 6047 | { |
---|
| 6048 | if (r->m[l]!=NULL) |
---|
| 6049 | { |
---|
| 6050 | for(q=IDELEMS(r)-1;q>=0;q--) |
---|
| 6051 | { |
---|
| 6052 | if ((l!=q) |
---|
| 6053 | && (r->m[q]!=NULL) |
---|
| 6054 | &&(pLmDivisibleBy(r->m[l],r->m[q]))) |
---|
| 6055 | { |
---|
| 6056 | pDelete(&r->m[q]); |
---|
| 6057 | } |
---|
| 6058 | } |
---|
| 6059 | } |
---|
| 6060 | } |
---|
| 6061 | } |
---|
[f41347f] | 6062 | } |
---|
| 6063 | idSkipZeroes(r); |
---|
| 6064 | } |
---|
| 6065 | |
---|
| 6066 | void completeReduce (kStrategy strat, BOOLEAN withT) |
---|
| 6067 | { |
---|
| 6068 | int i; |
---|
[06f49a] | 6069 | int low = (((pOrdSgn==1) && (strat->ak==0)) ? 1 : 0); |
---|
[f41347f] | 6070 | LObject L; |
---|
| 6071 | |
---|
| 6072 | #ifdef KDEBUG |
---|
| 6073 | // need to set this: during tailreductions of T[i], T[i].max is out of |
---|
| 6074 | // sync |
---|
| 6075 | sloppy_max = TRUE; |
---|
| 6076 | #endif |
---|
| 6077 | |
---|
| 6078 | strat->noTailReduction = FALSE; |
---|
| 6079 | if (TEST_OPT_PROT) |
---|
| 6080 | { |
---|
| 6081 | PrintLn(); |
---|
| 6082 | if (timerv) writeTime("standard base computed:"); |
---|
| 6083 | } |
---|
| 6084 | if (TEST_OPT_PROT) |
---|
| 6085 | { |
---|
| 6086 | Print("(S:%d)",strat->sl);mflush(); |
---|
| 6087 | } |
---|
| 6088 | for (i=strat->sl; i>=low; i--) |
---|
| 6089 | { |
---|
[9f17c9] | 6090 | int end_pos=strat->sl; |
---|
| 6091 | if ((strat->fromQ!=NULL) && (strat->fromQ[i])) continue; // do not reduce Q_i |
---|
| 6092 | if (strat->ak==0) end_pos=i-1; |
---|
[f41347f] | 6093 | TObject* T_j = strat->s_2_t(i); |
---|
| 6094 | if (T_j != NULL) |
---|
| 6095 | { |
---|
| 6096 | L = *T_j; |
---|
| 6097 | poly p; |
---|
| 6098 | if (pOrdSgn == 1) |
---|
[9f17c9] | 6099 | strat->S[i] = redtailBba(&L, end_pos, strat, withT); |
---|
[f41347f] | 6100 | else |
---|
| 6101 | strat->S[i] = redtail(&L, strat->sl, strat); |
---|
| 6102 | |
---|
| 6103 | if (strat->redTailChange && strat->tailRing != currRing) |
---|
| 6104 | { |
---|
| 6105 | if (T_j->max != NULL) p_LmFree(T_j->max, strat->tailRing); |
---|
| 6106 | if (pNext(T_j->p) != NULL) |
---|
| 6107 | T_j->max = p_GetMaxExpP(pNext(T_j->p), strat->tailRing); |
---|
| 6108 | else |
---|
| 6109 | T_j->max = NULL; |
---|
| 6110 | } |
---|
| 6111 | if (TEST_OPT_INTSTRATEGY) |
---|
| 6112 | T_j->pCleardenom(); |
---|
| 6113 | } |
---|
| 6114 | else |
---|
| 6115 | { |
---|
| 6116 | assume(currRing == strat->tailRing); |
---|
| 6117 | if (pOrdSgn == 1) |
---|
[9f17c9] | 6118 | strat->S[i] = redtailBba(strat->S[i], end_pos, strat, withT); |
---|
[f41347f] | 6119 | else |
---|
| 6120 | strat->S[i] = redtail(strat->S[i], strat->sl, strat); |
---|
| 6121 | if (TEST_OPT_INTSTRATEGY) |
---|
[a0d9be] | 6122 | strat->S[i]=p_Cleardenom(strat->S[i], currRing); |
---|
[f41347f] | 6123 | } |
---|
| 6124 | if (TEST_OPT_PROT) |
---|
| 6125 | PrintS("-"); |
---|
| 6126 | } |
---|
| 6127 | if (TEST_OPT_PROT) PrintLn(); |
---|
| 6128 | #ifdef KDEBUG |
---|
| 6129 | sloppy_max = FALSE; |
---|
| 6130 | #endif |
---|
| 6131 | } |
---|
| 6132 | |
---|
| 6133 | |
---|
| 6134 | /*2 |
---|
| 6135 | * computes the new strat->kHEdge and the new pNoether, |
---|
| 6136 | * returns TRUE, if pNoether has changed |
---|
| 6137 | */ |
---|
| 6138 | BOOLEAN newHEdge(polyset S, kStrategy strat) |
---|
| 6139 | { |
---|
| 6140 | int i,j; |
---|
| 6141 | poly newNoether; |
---|
| 6142 | |
---|
| 6143 | #if 0 |
---|
| 6144 | if (currRing->weight_all_1) |
---|
| 6145 | scComputeHC(strat->Shdl,NULL,strat->ak,strat->kHEdge, strat->tailRing); |
---|
| 6146 | else |
---|
| 6147 | scComputeHCw(strat->Shdl,NULL,strat->ak,strat->kHEdge, strat->tailRing); |
---|
[9f17c9] | 6148 | #else |
---|
[f41347f] | 6149 | scComputeHC(strat->Shdl,NULL,strat->ak,strat->kHEdge, strat->tailRing); |
---|
[9f17c9] | 6150 | #endif |
---|
[f41347f] | 6151 | if (strat->t_kHEdge != NULL) p_LmFree(strat->t_kHEdge, strat->tailRing); |
---|
| 6152 | if (strat->tailRing != currRing) |
---|
| 6153 | strat->t_kHEdge = k_LmInit_currRing_2_tailRing(strat->kHEdge, strat->tailRing); |
---|
| 6154 | /* compare old and new noether*/ |
---|
| 6155 | newNoether = pLmInit(strat->kHEdge); |
---|
| 6156 | j = pFDeg(newNoether,currRing); |
---|
| 6157 | for (i=1; i<=pVariables; i++) |
---|
| 6158 | { |
---|
| 6159 | if (pGetExp(newNoether, i) > 0) pDecrExp(newNoether,i); |
---|
| 6160 | } |
---|
| 6161 | pSetm(newNoether); |
---|
| 6162 | if (j < strat->HCord) /*- statistics -*/ |
---|
| 6163 | { |
---|
| 6164 | if (TEST_OPT_PROT) |
---|
| 6165 | { |
---|
| 6166 | Print("H(%d)",j); |
---|
| 6167 | mflush(); |
---|
| 6168 | } |
---|
| 6169 | strat->HCord=j; |
---|
| 6170 | #ifdef KDEBUG |
---|
| 6171 | if (TEST_OPT_DEBUG) |
---|
| 6172 | { |
---|
| 6173 | Print("H(%d):",j); |
---|
| 6174 | wrp(strat->kHEdge); |
---|
| 6175 | PrintLn(); |
---|
| 6176 | } |
---|
| 6177 | #endif |
---|
| 6178 | } |
---|
| 6179 | if (pCmp(strat->kNoether,newNoether)!=1) |
---|
| 6180 | { |
---|
| 6181 | pDelete(&strat->kNoether); |
---|
| 6182 | strat->kNoether=newNoether; |
---|
| 6183 | if (strat->t_kNoether != NULL) p_LmFree(strat->t_kNoether, strat->tailRing); |
---|
| 6184 | if (strat->tailRing != currRing) |
---|
| 6185 | strat->t_kNoether = k_LmInit_currRing_2_tailRing(strat->kNoether, strat->tailRing); |
---|
| 6186 | |
---|
| 6187 | return TRUE; |
---|
| 6188 | } |
---|
| 6189 | pLmFree(newNoether); |
---|
| 6190 | return FALSE; |
---|
| 6191 | } |
---|
| 6192 | |
---|
| 6193 | /*************************************************************** |
---|
| 6194 | * |
---|
| 6195 | * Routines related for ring changes during std computations |
---|
| 6196 | * |
---|
| 6197 | ***************************************************************/ |
---|
| 6198 | BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2) |
---|
| 6199 | { |
---|
[d5564f8] | 6200 | if (strat->overflow) return FALSE; |
---|
[f41347f] | 6201 | assume(L->p1 != NULL && L->p2 != NULL); |
---|
| 6202 | // shift changes: from 0 to -1 |
---|
| 6203 | assume(L->i_r1 >= -1 && L->i_r1 <= strat->tl); |
---|
| 6204 | assume(L->i_r2 >= -1 && L->i_r2 <= strat->tl); |
---|
| 6205 | assume(strat->tailRing != currRing); |
---|
| 6206 | |
---|
| 6207 | if (! k_GetLeadTerms(L->p1, L->p2, currRing, m1, m2, strat->tailRing)) |
---|
| 6208 | return FALSE; |
---|
| 6209 | // shift changes: extra case inserted |
---|
| 6210 | if ((L->i_r1 == -1) || (L->i_r2 == -1) ) |
---|
| 6211 | { |
---|
| 6212 | return TRUE; |
---|
| 6213 | } |
---|
| 6214 | poly p1_max = (strat->R[L->i_r1])->max; |
---|
| 6215 | poly p2_max = (strat->R[L->i_r2])->max; |
---|
| 6216 | |
---|
| 6217 | if ((p1_max != NULL && !p_LmExpVectorAddIsOk(m1, p1_max, strat->tailRing)) || |
---|
| 6218 | (p2_max != NULL && !p_LmExpVectorAddIsOk(m2, p2_max, strat->tailRing))) |
---|
| 6219 | { |
---|
| 6220 | p_LmFree(m1, strat->tailRing); |
---|
| 6221 | p_LmFree(m2, strat->tailRing); |
---|
| 6222 | m1 = NULL; |
---|
| 6223 | m2 = NULL; |
---|
| 6224 | return FALSE; |
---|
| 6225 | } |
---|
| 6226 | return TRUE; |
---|
| 6227 | } |
---|
| 6228 | |
---|
| 6229 | #ifdef HAVE_RINGS |
---|
| 6230 | /*************************************************************** |
---|
| 6231 | * |
---|
| 6232 | * Checks, if we can compute the gcd poly / strong pair |
---|
| 6233 | * gcd-poly = m1 * R[atR] + m2 * S[atS] |
---|
| 6234 | * |
---|
| 6235 | ***************************************************************/ |
---|
| 6236 | BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat) |
---|
| 6237 | { |
---|
| 6238 | assume(strat->S_2_R[atS] >= -1 && strat->S_2_R[atS] <= strat->tl); |
---|
[59c445] | 6239 | //assume(strat->tailRing != currRing); |
---|
[f41347f] | 6240 | |
---|
| 6241 | poly p1_max = (strat->R[atR])->max; |
---|
| 6242 | poly p2_max = (strat->R[strat->S_2_R[atS]])->max; |
---|
| 6243 | |
---|
| 6244 | if ((p1_max != NULL && !p_LmExpVectorAddIsOk(m1, p1_max, strat->tailRing)) || |
---|
| 6245 | (p2_max != NULL && !p_LmExpVectorAddIsOk(m2, p2_max, strat->tailRing))) |
---|
| 6246 | { |
---|
| 6247 | return FALSE; |
---|
| 6248 | } |
---|
| 6249 | return TRUE; |
---|
| 6250 | } |
---|
| 6251 | #endif |
---|
| 6252 | |
---|
| 6253 | BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject* T, unsigned long expbound) |
---|
| 6254 | { |
---|
[d3e630] | 6255 | assume((strat->tailRing == currRing) || (strat->tailRing->bitmask < currRing->bitmask)); |
---|
| 6256 | /* initial setup or extending */ |
---|
[645a19] | 6257 | |
---|
[f41347f] | 6258 | if (expbound == 0) expbound = strat->tailRing->bitmask << 1; |
---|
| 6259 | if (expbound >= currRing->bitmask) return FALSE; |
---|
[d5564f8] | 6260 | strat->overflow=FALSE; |
---|
[f41347f] | 6261 | ring new_tailRing = rModifyRing(currRing, |
---|
| 6262 | // Hmmm .. the condition pFDeg == pDeg |
---|
| 6263 | // might be too strong |
---|
| 6264 | #ifdef HAVE_RINGS |
---|
| 6265 | (strat->homog && pFDeg == pDeg && !(rField_is_Ring(currRing))), // TODO Oliver |
---|
| 6266 | #else |
---|
[645a19] | 6267 | (strat->homog && pFDeg == pDeg), // omit_degree |
---|
[f41347f] | 6268 | #endif |
---|
[645a19] | 6269 | (strat->ak==0), // omit_comp if the input is an ideal |
---|
| 6270 | expbound); // exp_limit |
---|
| 6271 | |
---|
[f41347f] | 6272 | if (new_tailRing == currRing) return TRUE; |
---|
| 6273 | |
---|
| 6274 | strat->pOrigFDeg_TailRing = new_tailRing->pFDeg; |
---|
| 6275 | strat->pOrigLDeg_TailRing = new_tailRing->pLDeg; |
---|
| 6276 | |
---|
| 6277 | if (currRing->pFDeg != currRing->pFDegOrig) |
---|
| 6278 | { |
---|
| 6279 | new_tailRing->pFDeg = currRing->pFDeg; |
---|
| 6280 | new_tailRing->pLDeg = currRing->pLDeg; |
---|
| 6281 | } |
---|
| 6282 | |
---|
| 6283 | if (TEST_OPT_PROT) |
---|
| 6284 | Print("[%lu:%d", (unsigned long) new_tailRing->bitmask, new_tailRing->ExpL_Size); |
---|
| 6285 | kTest_TS(strat); |
---|
| 6286 | assume(new_tailRing != strat->tailRing); |
---|
| 6287 | pShallowCopyDeleteProc p_shallow_copy_delete |
---|
| 6288 | = pGetShallowCopyDeleteProc(strat->tailRing, new_tailRing); |
---|
| 6289 | |
---|
| 6290 | omBin new_tailBin = omGetStickyBinOfBin(new_tailRing->PolyBin); |
---|
| 6291 | |
---|
| 6292 | int i; |
---|
| 6293 | for (i=0; i<=strat->tl; i++) |
---|
| 6294 | { |
---|
| 6295 | strat->T[i].ShallowCopyDelete(new_tailRing, new_tailBin, |
---|
| 6296 | p_shallow_copy_delete); |
---|
| 6297 | } |
---|
| 6298 | for (i=0; i<=strat->Ll; i++) |
---|
| 6299 | { |
---|
| 6300 | assume(strat->L[i].p != NULL); |
---|
| 6301 | if (pNext(strat->L[i].p) != strat->tail) |
---|
| 6302 | strat->L[i].ShallowCopyDelete(new_tailRing, p_shallow_copy_delete); |
---|
| 6303 | } |
---|
| 6304 | if (strat->P.t_p != NULL || |
---|
| 6305 | (strat->P.p != NULL && pNext(strat->P.p) != strat->tail)) |
---|
| 6306 | strat->P.ShallowCopyDelete(new_tailRing, p_shallow_copy_delete); |
---|
| 6307 | |
---|
| 6308 | if (L != NULL && L->tailRing != new_tailRing) |
---|
| 6309 | { |
---|
| 6310 | if (L->i_r < 0) |
---|
| 6311 | L->ShallowCopyDelete(new_tailRing, p_shallow_copy_delete); |
---|
| 6312 | else |
---|
| 6313 | { |
---|
| 6314 | assume(L->i_r <= strat->tl); |
---|
| 6315 | TObject* t_l = strat->R[L->i_r]; |
---|
| 6316 | assume(t_l != NULL); |
---|
| 6317 | L->tailRing = new_tailRing; |
---|
| 6318 | L->p = t_l->p; |
---|
| 6319 | L->t_p = t_l->t_p; |
---|
| 6320 | L->max = t_l->max; |
---|
| 6321 | } |
---|
| 6322 | } |
---|
| 6323 | |
---|
| 6324 | if (T != NULL && T->tailRing != new_tailRing && T->i_r < 0) |
---|
| 6325 | T->ShallowCopyDelete(new_tailRing, new_tailBin, p_shallow_copy_delete); |
---|
| 6326 | |
---|
| 6327 | omMergeStickyBinIntoBin(strat->tailBin, strat->tailRing->PolyBin); |
---|
| 6328 | if (strat->tailRing != currRing) |
---|
| 6329 | rKillModifiedRing(strat->tailRing); |
---|
| 6330 | |
---|
| 6331 | strat->tailRing = new_tailRing; |
---|
| 6332 | strat->tailBin = new_tailBin; |
---|
| 6333 | strat->p_shallow_copy_delete |
---|
| 6334 | = pGetShallowCopyDeleteProc(currRing, new_tailRing); |
---|
| 6335 | |
---|
| 6336 | if (strat->kHEdge != NULL) |
---|
| 6337 | { |
---|
| 6338 | if (strat->t_kHEdge != NULL) |
---|
| 6339 | p_LmFree(strat->t_kHEdge, strat->tailRing); |
---|
| 6340 | strat->t_kHEdge=k_LmInit_currRing_2_tailRing(strat->kHEdge, new_tailRing); |
---|
| 6341 | } |
---|
| 6342 | |
---|
| 6343 | if (strat->kNoether != NULL) |
---|
| 6344 | { |
---|
| 6345 | if (strat->t_kNoether != NULL) |
---|
| 6346 | p_LmFree(strat->t_kNoether, strat->tailRing); |
---|
| 6347 | strat->t_kNoether=k_LmInit_currRing_2_tailRing(strat->kNoether, |
---|
| 6348 | new_tailRing); |
---|
| 6349 | } |
---|
| 6350 | kTest_TS(strat); |
---|
| 6351 | if (TEST_OPT_PROT) |
---|
| 6352 | PrintS("]"); |
---|
| 6353 | return TRUE; |
---|
| 6354 | } |
---|
| 6355 | |
---|
| 6356 | void kStratInitChangeTailRing(kStrategy strat) |
---|
| 6357 | { |
---|
| 6358 | unsigned long l = 0; |
---|
| 6359 | int i; |
---|
[0b5e3d] | 6360 | long e; |
---|
[f41347f] | 6361 | |
---|
| 6362 | assume(strat->tailRing == currRing); |
---|
| 6363 | |
---|
| 6364 | for (i=0; i<= strat->Ll; i++) |
---|
| 6365 | { |
---|
| 6366 | l = p_GetMaxExpL(strat->L[i].p, currRing, l); |
---|
| 6367 | } |
---|
| 6368 | for (i=0; i<=strat->tl; i++) |
---|
| 6369 | { |
---|
| 6370 | // Hmm ... this we could do in one Step |
---|
| 6371 | l = p_GetMaxExpL(strat->T[i].p, currRing, l); |
---|
| 6372 | } |
---|
| 6373 | if (rField_is_Ring(currRing)) |
---|
| 6374 | { |
---|
| 6375 | l *= 2; |
---|
| 6376 | } |
---|
| 6377 | e = p_GetMaxExp(l, currRing); |
---|
| 6378 | if (e <= 1) e = 2; |
---|
| 6379 | |
---|
| 6380 | kStratChangeTailRing(strat, NULL, NULL, e); |
---|
| 6381 | } |
---|
| 6382 | |
---|
| 6383 | skStrategy::skStrategy() |
---|
| 6384 | { |
---|
| 6385 | memset(this, 0, sizeof(skStrategy)); |
---|
| 6386 | #ifndef NDEBUG |
---|
| 6387 | strat_nr++; |
---|
| 6388 | nr=strat_nr; |
---|
| 6389 | if (strat_fac_debug) Print("s(%d) created\n",nr); |
---|
| 6390 | #endif |
---|
| 6391 | tailRing = currRing; |
---|
| 6392 | P.tailRing = currRing; |
---|
| 6393 | tl = -1; |
---|
| 6394 | sl = -1; |
---|
| 6395 | #ifdef HAVE_LM_BIN |
---|
| 6396 | lmBin = omGetStickyBinOfBin(currRing->PolyBin); |
---|
| 6397 | #endif |
---|
| 6398 | #ifdef HAVE_TAIL_BIN |
---|
| 6399 | tailBin = omGetStickyBinOfBin(currRing->PolyBin); |
---|
| 6400 | #endif |
---|
| 6401 | pOrigFDeg = pFDeg; |
---|
| 6402 | pOrigLDeg = pLDeg; |
---|
| 6403 | } |
---|
| 6404 | |
---|
| 6405 | |
---|
| 6406 | skStrategy::~skStrategy() |
---|
| 6407 | { |
---|
| 6408 | if (lmBin != NULL) |
---|
| 6409 | omMergeStickyBinIntoBin(lmBin, currRing->PolyBin); |
---|
| 6410 | if (tailBin != NULL) |
---|
| 6411 | omMergeStickyBinIntoBin(tailBin, |
---|
| 6412 | (tailRing != NULL ? tailRing->PolyBin: |
---|
| 6413 | currRing->PolyBin)); |
---|
| 6414 | if (t_kHEdge != NULL) |
---|
| 6415 | p_LmFree(t_kHEdge, tailRing); |
---|
| 6416 | if (t_kNoether != NULL) |
---|
| 6417 | p_LmFree(t_kNoether, tailRing); |
---|
| 6418 | |
---|
| 6419 | if (currRing != tailRing) |
---|
| 6420 | rKillModifiedRing(tailRing); |
---|
| 6421 | pRestoreDegProcs(pOrigFDeg, pOrigLDeg); |
---|
| 6422 | } |
---|
| 6423 | |
---|
| 6424 | #if 0 |
---|
| 6425 | Timings for the different possibilities of posInT: |
---|
| 6426 | T15 EDL DL EL L 1-2-3 |
---|
| 6427 | Gonnet 43.26 42.30 38.34 41.98 38.40 100.04 |
---|
| 6428 | Hairer_2_1 1.11 1.15 1.04 1.22 1.08 4.7 |
---|
| 6429 | Twomat3 1.62 1.69 1.70 1.65 1.54 11.32 |
---|
| 6430 | ahml 4.48 4.03 4.03 4.38 4.96 26.50 |
---|
| 6431 | c7 15.02 13.98 15.16 13.24 17.31 47.89 |
---|
| 6432 | c8 505.09 407.46 852.76 413.21 499.19 n/a |
---|
| 6433 | f855 12.65 9.27 14.97 8.78 14.23 33.12 |
---|
| 6434 | gametwo6 11.47 11.35 14.57 11.20 12.02 35.07 |
---|
| 6435 | gerhard_3 2.73 2.83 2.93 2.64 3.12 6.24 |
---|
| 6436 | ilias13 22.89 22.46 24.62 20.60 23.34 53.86 |
---|
| 6437 | noon8 40.68 37.02 37.99 36.82 35.59 877.16 |
---|
| 6438 | rcyclic_19 48.22 42.29 43.99 45.35 51.51 204.29 |
---|
| 6439 | rkat9 82.37 79.46 77.20 77.63 82.54 267.92 |
---|
| 6440 | schwarz_11 16.46 16.81 16.76 16.81 16.72 35.56 |
---|
| 6441 | test016 16.39 14.17 14.40 13.50 14.26 34.07 |
---|
| 6442 | test017 34.70 36.01 33.16 35.48 32.75 71.45 |
---|
| 6443 | test042 10.76 10.99 10.27 11.57 10.45 23.04 |
---|
| 6444 | test058 6.78 6.75 6.51 6.95 6.22 9.47 |
---|
| 6445 | test066 10.71 10.94 10.76 10.61 10.56 19.06 |
---|
| 6446 | test073 10.75 11.11 10.17 10.79 8.63 58.10 |
---|
| 6447 | test086 12.23 11.81 12.88 12.24 13.37 66.68 |
---|
| 6448 | test103 5.05 4.80 5.47 4.64 4.89 11.90 |
---|
| 6449 | test154 12.96 11.64 13.51 12.46 14.61 36.35 |
---|
| 6450 | test162 65.27 64.01 67.35 59.79 67.54 196.46 |
---|
| 6451 | test164 7.50 6.50 7.68 6.70 7.96 17.13 |
---|
| 6452 | virasoro 3.39 3.50 3.35 3.47 3.70 7.66 |
---|
| 6453 | #endif |
---|
| 6454 | |
---|
| 6455 | |
---|
[57fad3a] | 6456 | //#ifdef HAVE_MORE_POS_IN_T |
---|
| 6457 | #if 1 |
---|
[f41347f] | 6458 | // determines the position based on: 1.) Ecart 2.) FDeg 3.) pLength |
---|
| 6459 | int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p) |
---|
| 6460 | { |
---|
| 6461 | |
---|
| 6462 | if (length==-1) return 0; |
---|
| 6463 | |
---|
| 6464 | int o = p.ecart; |
---|
| 6465 | int op=p.GetpFDeg(); |
---|
| 6466 | int ol = p.GetpLength(); |
---|
| 6467 | |
---|
| 6468 | if (set[length].ecart < o) |
---|
| 6469 | return length+1; |
---|
| 6470 | if (set[length].ecart == o) |
---|
| 6471 | { |
---|
| 6472 | int oo=set[length].GetpFDeg(); |
---|
| 6473 | if ((oo < op) || ((oo==op) && (set[length].length < ol))) |
---|
| 6474 | return length+1; |
---|
| 6475 | } |
---|
| 6476 | |
---|
| 6477 | int i; |
---|
| 6478 | int an = 0; |
---|
| 6479 | int en= length; |
---|
| 6480 | loop |
---|
| 6481 | { |
---|
| 6482 | if (an >= en-1) |
---|
| 6483 | { |
---|
| 6484 | if (set[an].ecart > o) |
---|
| 6485 | return an; |
---|
| 6486 | if (set[an].ecart == o) |
---|
| 6487 | { |
---|
| 6488 | int oo=set[an].GetpFDeg(); |
---|
| 6489 | if((oo > op) |
---|
| 6490 | || ((oo==op) && (set[an].pLength > ol))) |
---|
| 6491 | return an; |
---|
| 6492 | } |
---|
| 6493 | return en; |
---|
| 6494 | } |
---|
| 6495 | i=(an+en) / 2; |
---|
| 6496 | if (set[i].ecart > o) |
---|
| 6497 | en=i; |
---|
| 6498 | else if (set[i].ecart == o) |
---|
| 6499 | { |
---|
| 6500 | int oo=set[i].GetpFDeg(); |
---|
| 6501 | if ((oo > op) |
---|
| 6502 | || ((oo == op) && (set[i].pLength > ol))) |
---|
| 6503 | en=i; |
---|
| 6504 | else |
---|
| 6505 | an=i; |
---|
| 6506 | } |
---|
| 6507 | else |
---|
| 6508 | an=i; |
---|
| 6509 | } |
---|
| 6510 | } |
---|
| 6511 | |
---|
| 6512 | // determines the position based on: 1.) FDeg 2.) pLength |
---|
| 6513 | int posInT_FDegpLength(const TSet set,const int length,LObject &p) |
---|
| 6514 | { |
---|
| 6515 | |
---|
| 6516 | if (length==-1) return 0; |
---|
| 6517 | |
---|
| 6518 | int op=p.GetpFDeg(); |
---|
| 6519 | int ol = p.GetpLength(); |
---|
| 6520 | |
---|
| 6521 | int oo=set[length].GetpFDeg(); |
---|
| 6522 | if ((oo < op) || ((oo==op) && (set[length].length < ol))) |
---|
| 6523 | return length+1; |
---|
| 6524 | |
---|
| 6525 | int i; |
---|
| 6526 | int an = 0; |
---|
| 6527 | int en= length; |
---|
| 6528 | loop |
---|
| 6529 | { |
---|
| 6530 | if (an >= en-1) |
---|
| 6531 | { |
---|
| 6532 | int oo=set[an].GetpFDeg(); |
---|
| 6533 | if((oo > op) |
---|
| 6534 | || ((oo==op) && (set[an].pLength > ol))) |
---|
| 6535 | return an; |
---|
| 6536 | return en; |
---|
| 6537 | } |
---|
| 6538 | i=(an+en) / 2; |
---|
| 6539 | int oo=set[i].GetpFDeg(); |
---|
| 6540 | if ((oo > op) |
---|
| 6541 | || ((oo == op) && (set[i].pLength > ol))) |
---|
| 6542 | en=i; |
---|
| 6543 | else |
---|
| 6544 | an=i; |
---|
| 6545 | } |
---|
| 6546 | } |
---|
| 6547 | |
---|
| 6548 | |
---|
[866079] | 6549 | // determines the position based on: 1.) pLength |
---|
[f41347f] | 6550 | int posInT_pLength(const TSet set,const int length,LObject &p) |
---|
| 6551 | { |
---|
[93047e] | 6552 | int ol = p.GetpLength(); |
---|
[f41347f] | 6553 | if (length==-1) |
---|
| 6554 | return 0; |
---|
| 6555 | if (set[length].length<p.length) |
---|
| 6556 | return length+1; |
---|
| 6557 | |
---|
| 6558 | int i; |
---|
| 6559 | int an = 0; |
---|
| 6560 | int en= length; |
---|
| 6561 | |
---|
| 6562 | loop |
---|
| 6563 | { |
---|
| 6564 | if (an >= en-1) |
---|
| 6565 | { |
---|
| 6566 | if (set[an].pLength>ol) return an; |
---|
| 6567 | return en; |
---|
| 6568 | } |
---|
| 6569 | i=(an+en) / 2; |
---|
| 6570 | if (set[i].pLength>ol) en=i; |
---|
| 6571 | else an=i; |
---|
| 6572 | } |
---|
| 6573 | } |
---|
| 6574 | #endif |
---|
| 6575 | |
---|
[79d3879] | 6576 | // kstd1.cc: |
---|
| 6577 | int redFirst (LObject* h,kStrategy strat); |
---|
| 6578 | int redEcart (LObject* h,kStrategy strat); |
---|
| 6579 | void enterSMora (LObject p,int atS,kStrategy strat, int atR=-1); |
---|
| 6580 | void enterSMoraNF (LObject p,int atS,kStrategy strat, int atR=-1); |
---|
| 6581 | // ../Singular/misc.cc: |
---|
| 6582 | char * showOption(); |
---|
| 6583 | |
---|
| 6584 | void kDebugPrint(kStrategy strat) |
---|
| 6585 | { |
---|
| 6586 | PrintS("red: "); |
---|
| 6587 | if (strat->red==redFirst) PrintS("redFirst\n"); |
---|
| 6588 | else if (strat->red==redHoney) PrintS("redHoney\n"); |
---|
| 6589 | else if (strat->red==redEcart) PrintS("redEcart\n"); |
---|
| 6590 | else if (strat->red==redHomog) PrintS("redHomog\n"); |
---|
[ff071e] | 6591 | else Print("%p\n",(void*)strat->red); |
---|
[79d3879] | 6592 | PrintS("posInT: "); |
---|
| 6593 | if (strat->posInT==posInT0) PrintS("posInT0\n"); |
---|
| 6594 | else if (strat->posInT==posInT0) PrintS("posInT0\n"); |
---|
| 6595 | else if (strat->posInT==posInT1) PrintS("posInT1\n"); |
---|
| 6596 | else if (strat->posInT==posInT11) PrintS("posInT11\n"); |
---|
| 6597 | else if (strat->posInT==posInT110) PrintS("posInT110\n"); |
---|
| 6598 | else if (strat->posInT==posInT13) PrintS("posInT13\n"); |
---|
| 6599 | else if (strat->posInT==posInT15) PrintS("posInT15\n"); |
---|
| 6600 | else if (strat->posInT==posInT17) PrintS("posInT17\n"); |
---|
| 6601 | else if (strat->posInT==posInT17_c) PrintS("posInT17_c\n"); |
---|
| 6602 | else if (strat->posInT==posInT19) PrintS("posInT19\n"); |
---|
| 6603 | else if (strat->posInT==posInT2) PrintS("posInT2\n"); |
---|
| 6604 | #ifdef HAVE_MORE_POS_IN_T |
---|
| 6605 | else if (strat->posInT==posInT_EcartFDegpLength) PrintS("posInT_EcartFDegpLength\n"); |
---|
| 6606 | else if (strat->posInT==posInT_FDegpLength) PrintS("posInT_FDegpLength\n"); |
---|
| 6607 | else if (strat->posInT==posInT_pLength) PrintS("posInT_pLength\n"); |
---|
| 6608 | #endif |
---|
| 6609 | else if (strat->posInT==posInT_EcartpLength) PrintS("posInT_EcartpLength\n"); |
---|
| 6610 | else if (strat->posInT==posInTrg0) PrintS("posInTrg0\n"); |
---|
[ff071e] | 6611 | else Print("%p\n",(void*)strat->posInT); |
---|
[79d3879] | 6612 | PrintS("posInL: "); |
---|
| 6613 | if (strat->posInL==posInL0) PrintS("posInL0\n"); |
---|
| 6614 | else if (strat->posInL==posInL10) PrintS("posInL10\n"); |
---|
| 6615 | else if (strat->posInL==posInL11) PrintS("posInL11\n"); |
---|
| 6616 | else if (strat->posInL==posInL110) PrintS("posInL110\n"); |
---|
| 6617 | else if (strat->posInL==posInL13) PrintS("posInL13\n"); |
---|
| 6618 | else if (strat->posInL==posInL15) PrintS("posInL15\n"); |
---|
| 6619 | else if (strat->posInL==posInL17) PrintS("posInL17\n"); |
---|
[57fad3a] | 6620 | else if (strat->posInL==posInL17_c) PrintS("posInL17_c\n"); |
---|
[79d3879] | 6621 | else if (strat->posInL==posInLSpecial) PrintS("posInLSpecial\n"); |
---|
| 6622 | else if (strat->posInL==posInLrg0) PrintS("posInLrg0\n"); |
---|
[ff071e] | 6623 | else Print("%p\n",(void*)strat->posInL); |
---|
[79d3879] | 6624 | PrintS("enterS: "); |
---|
| 6625 | if (strat->enterS==enterSBba) PrintS("enterSBba\n"); |
---|
| 6626 | else if (strat->enterS==enterSMora) PrintS("enterSMora\n"); |
---|
| 6627 | else if (strat->enterS==enterSMoraNF) PrintS("enterSMoraNF\n"); |
---|
[ff071e] | 6628 | else Print("%p\n",(void*)strat->enterS); |
---|
[79d3879] | 6629 | PrintS("initEcart: "); |
---|
| 6630 | if (strat->initEcart==initEcartBBA) PrintS("initEcartBBA\n"); |
---|
| 6631 | else if (strat->initEcart==initEcartNormal) PrintS("initEcartNormal\n"); |
---|
[ff071e] | 6632 | else Print("%p\n",(void*)strat->initEcart); |
---|
[79d3879] | 6633 | PrintS("initEcartPair: "); |
---|
| 6634 | if (strat->initEcartPair==initEcartPairBba) PrintS("initEcartPairBba\n"); |
---|
| 6635 | else if (strat->initEcartPair==initEcartPairMora) PrintS("initEcartPairMora\n"); |
---|
[ff071e] | 6636 | else Print("%p\n",(void*)strat->initEcartPair); |
---|
[79d3879] | 6637 | Print("homog=%d, LazyDegree=%d, LazyPass=%d, ak=%d,\n", |
---|
| 6638 | strat->homog, strat->LazyDegree,strat->LazyPass, strat->ak); |
---|
| 6639 | Print("honey=%d, sugarCrit=%d, Gebauer=%d, noTailReduction=%d\n", |
---|
| 6640 | strat->honey,strat->sugarCrit,strat->Gebauer,strat->noTailReduction,strat->use_buckets); |
---|
| 6641 | Print("posInLDependsOnLength=%d, use_buckets=%d\n", |
---|
| 6642 | strat->posInLDependsOnLength,strat->use_buckets); |
---|
[9c4865b] | 6643 | PrintS(showOption());PrintLn(); |
---|
| 6644 | PrintS("LDeg: "); |
---|
| 6645 | if (currRing->pLDeg==pLDeg0) PrintS("pLDeg0"); |
---|
| 6646 | else if (currRing->pLDeg==pLDeg0c) PrintS("pLDeg0c"); |
---|
| 6647 | else if (currRing->pLDeg==pLDegb) PrintS("pLDegb"); |
---|
| 6648 | else if (currRing->pLDeg==pLDeg1) PrintS("pLDeg1"); |
---|
| 6649 | else if (currRing->pLDeg==pLDeg1c) PrintS("pLDeg1c"); |
---|
| 6650 | else if (currRing->pLDeg==pLDeg1_Deg) PrintS("pLDeg1_Deg"); |
---|
| 6651 | else if (currRing->pLDeg==pLDeg1c_Deg) PrintS("pLDeg1c_Deg"); |
---|
| 6652 | else if (currRing->pLDeg==pLDeg1_Totaldegree) PrintS("pLDeg1_Totaldegree"); |
---|
| 6653 | else if (currRing->pLDeg==pLDeg1c_Totaldegree) PrintS("pLDeg1c_Totaldegree"); |
---|
| 6654 | else if (currRing->pLDeg==pLDeg1_WFirstTotalDegree) PrintS("pLDeg1_WFirstTotalDegree"); |
---|
| 6655 | else if (currRing->pLDeg==pLDeg1c_WFirstTotalDegree) PrintS("pLDeg1c_WFirstTotalDegree"); |
---|
| 6656 | else Print("? (%lx)", (long)currRing->pLDeg); |
---|
| 6657 | PrintS(" / "); |
---|
| 6658 | if (strat->tailRing->pLDeg==pLDeg0) PrintS("pLDeg0"); |
---|
| 6659 | else if (strat->tailRing->pLDeg==pLDeg0c) PrintS("pLDeg0c"); |
---|
| 6660 | else if (strat->tailRing->pLDeg==pLDegb) PrintS("pLDegb"); |
---|
| 6661 | else if (strat->tailRing->pLDeg==pLDeg1) PrintS("pLDeg1"); |
---|
| 6662 | else if (strat->tailRing->pLDeg==pLDeg1c) PrintS("pLDeg1c"); |
---|
| 6663 | else if (strat->tailRing->pLDeg==pLDeg1_Deg) PrintS("pLDeg1_Deg"); |
---|
| 6664 | else if (strat->tailRing->pLDeg==pLDeg1c_Deg) PrintS("pLDeg1c_Deg"); |
---|
| 6665 | else if (strat->tailRing->pLDeg==pLDeg1_Totaldegree) PrintS("pLDeg1_Totaldegree"); |
---|
| 6666 | else if (strat->tailRing->pLDeg==pLDeg1c_Totaldegree) PrintS("pLDeg1c_Totaldegree"); |
---|
| 6667 | else if (strat->tailRing->pLDeg==pLDeg1_WFirstTotalDegree) PrintS("pLDeg1_WFirstTotalDegree"); |
---|
| 6668 | else if (strat->tailRing->pLDeg==pLDeg1c_WFirstTotalDegree) PrintS("pLDeg1c_WFirstTotalDegree"); |
---|
| 6669 | else Print("? (%lx)", (long)strat->tailRing->pLDeg); |
---|
| 6670 | Print(" syzring:%d, syzComp(strat):%d syzComb(ring)\n",rIsSyzIndexRing(currRing),strat->syzComp,rGetCurrSyzLimit()); |
---|
| 6671 | |
---|
[79d3879] | 6672 | } |
---|
| 6673 | |
---|
| 6674 | |
---|
[f41347f] | 6675 | #ifdef HAVE_SHIFTBBA |
---|
| 6676 | poly pMove2CurrTail(poly p, kStrategy strat) |
---|
| 6677 | { |
---|
| 6678 | /* assume: p is completely in currRing */ |
---|
[9f17c9] | 6679 | /* produces an object with LM in curring |
---|
[f41347f] | 6680 | and TAIL in tailring */ |
---|
| 6681 | if (pNext(p)!=NULL) |
---|
| 6682 | { |
---|
| 6683 | pNext(p) = prMoveR(pNext(p), /* src */ currRing, /* dest */ strat->tailRing); |
---|
| 6684 | } |
---|
| 6685 | return(p); |
---|
| 6686 | } |
---|
| 6687 | #endif |
---|
| 6688 | |
---|
| 6689 | #ifdef HAVE_SHIFTBBA |
---|
| 6690 | poly pMoveCurrTail2poly(poly p, kStrategy strat) |
---|
| 6691 | { |
---|
| 6692 | /* assume: p has LM in curring and TAIL in tailring */ |
---|
| 6693 | /* convert it to complete currRing */ |
---|
| 6694 | |
---|
| 6695 | /* check that LM is in currRing */ |
---|
| 6696 | assume(p_LmCheckIsFromRing(p, currRing)); |
---|
| 6697 | |
---|
| 6698 | if (pNext(p)!=NULL) |
---|
| 6699 | { |
---|
| 6700 | pNext(p) = prMoveR(pNext(p), /* src */ strat->tailRing, /* dest */currRing); |
---|
| 6701 | } |
---|
| 6702 | return(p); |
---|
| 6703 | } |
---|
| 6704 | #endif |
---|
| 6705 | |
---|
| 6706 | #ifdef HAVE_SHIFTBBA |
---|
| 6707 | poly pCopyL2p(LObject H, kStrategy strat) |
---|
| 6708 | { |
---|
| 6709 | /* restores a poly in currRing from LObject */ |
---|
| 6710 | LObject h = H; |
---|
| 6711 | h.Copy(); |
---|
| 6712 | poly p; |
---|
| 6713 | if (h.p == NULL) |
---|
| 6714 | { |
---|
| 6715 | if (h.t_p != NULL) |
---|
| 6716 | { |
---|
| 6717 | p = prMoveR(h.t_p, /* source ring: */ strat->tailRing, /* dest. ring: */ currRing); |
---|
| 6718 | return(p); |
---|
| 6719 | } |
---|
| 6720 | else |
---|
| 6721 | { |
---|
| 6722 | /* h.tp == NULL -> the object is NULL */ |
---|
| 6723 | return(NULL); |
---|
| 6724 | } |
---|
| 6725 | } |
---|
| 6726 | /* we're here if h.p != NULL */ |
---|
| 6727 | if (h.t_p == NULL) |
---|
| 6728 | { |
---|
| 6729 | /* then h.p is the whole poly in currRing */ |
---|
| 6730 | p = h.p; |
---|
| 6731 | return(p); |
---|
| 6732 | } |
---|
| 6733 | /* we're here if h.p != NULL and h.t_p != NULL */ |
---|
| 6734 | // clean h.p, get poly from t_p |
---|
| 6735 | pNext(h.p)=NULL; |
---|
| 6736 | pDelete(&h.p); |
---|
| 6737 | p = prMoveR(h.t_p, /* source ring: */ strat->tailRing, |
---|
| 6738 | /* dest. ring: */ currRing); |
---|
| 6739 | // no need to clean h: we re-used the polys |
---|
| 6740 | return(p); |
---|
| 6741 | } |
---|
| 6742 | #endif |
---|
| 6743 | |
---|
| 6744 | //LObject pCopyp2L(poly p, kStrategy strat) |
---|
| 6745 | //{ |
---|
| 6746 | /* creates LObject from the poly in currRing */ |
---|
| 6747 | /* actually put p into L.p and make L.t_p=NULL : does not work */ |
---|
[9f17c9] | 6748 | |
---|
[f41347f] | 6749 | //} |
---|
| 6750 | |
---|
| 6751 | // poly pCopyL2p(LObject H, kStrategy strat) |
---|
| 6752 | // { |
---|
| 6753 | // /* restores a poly in currRing from LObject */ |
---|
| 6754 | // LObject h = H; |
---|
| 6755 | // h.Copy(); |
---|
| 6756 | // poly p; |
---|
| 6757 | // if (h.p == NULL) |
---|
| 6758 | // { |
---|
| 6759 | // if (h.t_p != NULL) |
---|
| 6760 | // { |
---|
| 6761 | // p = p_ShallowCopyDelete(h.t_p, (strat->tailRing != NULL ? strat->tailRing : currRing), strat->tailBin); |
---|
| 6762 | // return(p); |
---|
| 6763 | // } |
---|
| 6764 | // else |
---|
| 6765 | // { |
---|
| 6766 | // /* h.tp == NULL -> the object is NULL */ |
---|
| 6767 | // return(NULL); |
---|
| 6768 | // } |
---|
| 6769 | // } |
---|
| 6770 | // /* we're here if h.p != NULL */ |
---|
| 6771 | |
---|
| 6772 | // if (h.t_p == NULL) |
---|
| 6773 | // { |
---|
| 6774 | // /* then h.p is the whole poly in tailRing */ |
---|
| 6775 | // if (strat->tailBin != NULL && (pNext(h.p) != NULL)) |
---|
| 6776 | // { |
---|
| 6777 | // p = p_ShallowCopyDelete(h.p, (strat->tailRing != NULL ? strat->tailRing : currRing), strat->tailBin); |
---|
[9f17c9] | 6778 | // } |
---|
[f41347f] | 6779 | // return(p); |
---|
| 6780 | // } |
---|
| 6781 | // /* we're here if h.p != NULL and h.t_p != NULL */ |
---|
| 6782 | // p = pCopy(pHead(h.p)); // in currRing |
---|
| 6783 | // if (strat->tailBin != NULL && (pNext(h.p) != NULL)) |
---|
| 6784 | // { |
---|
| 6785 | // // pNext(p) = p_ShallowCopyDelete(pNext(h.t_p), (strat->tailRing != NULL ? strat->tailRing : currRing), strat->tailBin); |
---|
| 6786 | // poly pp = p_Copy(pNext(h.p), strat->tailRing); |
---|
| 6787 | // // poly p3 = p_Copy(pNext(h.p), currRing); // error |
---|
| 6788 | // // p_ShallowCopyDelete(pNext(h.p), currRing, strat->tailBin); // the same as pp |
---|
| 6789 | // poly p5 = p_ShallowCopyDelete(pNext(h.p), strat->tailRing, strat->tailBin); |
---|
| 6790 | // pNext(p) = p_ShallowCopyDelete(h.t_p, strat->tailRing, strat->tailBin); |
---|
| 6791 | // poly p4 = p_Copy(h.t_p, strat->tailRing); |
---|
| 6792 | // // if (p.t_p != NULL) pNext(p.t_p) = pNext(p.p); |
---|
| 6793 | // } |
---|
| 6794 | // // pTest(p); |
---|
| 6795 | // return(p); |
---|
| 6796 | // } |
---|
| 6797 | |
---|
| 6798 | #ifdef HAVE_SHIFTBBA |
---|
| 6799 | /* including the self pairs */ |
---|
| 6800 | void updateSShift(kStrategy strat,int uptodeg,int lV) |
---|
| 6801 | { |
---|
| 6802 | /* to use after updateS(toT=FALSE,strat) */ |
---|
| 6803 | /* fills T with shifted elt's of S */ |
---|
| 6804 | int i; |
---|
| 6805 | LObject h; |
---|
| 6806 | int atT = -1; // or figure out smth better |
---|
| 6807 | strat->tl = -1; // init |
---|
| 6808 | for (i=0; i<=strat->sl; i++) |
---|
| 6809 | { |
---|
| 6810 | memset(&h,0,sizeof(h)); |
---|
| 6811 | h.p = strat->S[i]; // lm in currRing, tail in TR |
---|
| 6812 | strat->initEcart(&h); |
---|
| 6813 | h.sev = strat->sevS[i]; |
---|
| 6814 | h.t_p = NULL; |
---|
| 6815 | h.GetTP(); // creates correct t_p |
---|
| 6816 | /*puts the elements of S with their shifts to T*/ |
---|
| 6817 | // int atT, int uptodeg, int lV) |
---|
| 6818 | strat->S_2_R[i] = strat->tl + 1; // the el't with shift 0 will be inserted first |
---|
| 6819 | // need a small check for above; we insert >=1 elements |
---|
| 6820 | // insert this check into kTest_TS ? |
---|
| 6821 | enterTShift(h,strat,atT,uptodeg,lV); |
---|
| 6822 | } |
---|
| 6823 | /* what about setting strat->tl? */ |
---|
| 6824 | } |
---|
| 6825 | #endif |
---|
| 6826 | |
---|
| 6827 | #ifdef HAVE_SHIFTBBA |
---|
| 6828 | void initBuchMoraShift (ideal F,ideal Q,kStrategy strat) |
---|
| 6829 | { |
---|
| 6830 | strat->interpt = BTEST1(OPT_INTERRUPT); |
---|
| 6831 | strat->kHEdge=NULL; |
---|
| 6832 | if (pOrdSgn==1) strat->kHEdgeFound=FALSE; |
---|
| 6833 | /*- creating temp data structures------------------- -*/ |
---|
| 6834 | strat->cp = 0; |
---|
| 6835 | strat->c3 = 0; |
---|
| 6836 | strat->cv = 0; |
---|
| 6837 | strat->tail = pInit(); |
---|
| 6838 | /*- set s -*/ |
---|
| 6839 | strat->sl = -1; |
---|
| 6840 | /*- set L -*/ |
---|
| 6841 | strat->Lmax = setmaxL; |
---|
| 6842 | strat->Ll = -1; |
---|
| 6843 | strat->L = initL(); |
---|
| 6844 | /*- set B -*/ |
---|
| 6845 | strat->Bmax = setmaxL; |
---|
| 6846 | strat->Bl = -1; |
---|
| 6847 | strat->B = initL(); |
---|
| 6848 | /*- set T -*/ |
---|
| 6849 | strat->tl = -1; |
---|
| 6850 | strat->tmax = setmaxT; |
---|
| 6851 | strat->T = initT(); |
---|
| 6852 | strat->R = initR(); |
---|
| 6853 | strat->sevT = initsevT(); |
---|
| 6854 | /*- init local data struct.---------------------------------------- -*/ |
---|
| 6855 | strat->P.ecart=0; |
---|
| 6856 | strat->P.length=0; |
---|
| 6857 | if (pOrdSgn==-1) |
---|
| 6858 | { |
---|
| 6859 | if (strat->kHEdge!=NULL) pSetComp(strat->kHEdge, strat->ak); |
---|
| 6860 | if (strat->kNoether!=NULL) pSetComp(strat->kNoetherTail(), strat->ak); |
---|
| 6861 | } |
---|
| 6862 | if(TEST_OPT_SB_1) |
---|
| 6863 | { |
---|
| 6864 | int i; |
---|
| 6865 | ideal P=idInit(IDELEMS(F)-strat->newIdeal,F->rank); |
---|
| 6866 | for (i=strat->newIdeal;i<IDELEMS(F);i++) |
---|
| 6867 | { |
---|
| 6868 | P->m[i-strat->newIdeal] = F->m[i]; |
---|
| 6869 | F->m[i] = NULL; |
---|
| 6870 | } |
---|
| 6871 | initSSpecial(F,Q,P,strat); |
---|
| 6872 | for (i=strat->newIdeal;i<IDELEMS(F);i++) |
---|
| 6873 | { |
---|
| 6874 | F->m[i] = P->m[i-strat->newIdeal]; |
---|
| 6875 | P->m[i-strat->newIdeal] = NULL; |
---|
| 6876 | } |
---|
| 6877 | idDelete(&P); |
---|
| 6878 | } |
---|
| 6879 | else |
---|
| 6880 | { |
---|
| 6881 | /*Shdl=*/initSL(F, Q,strat); /*sets also S, ecartS, fromQ */ |
---|
| 6882 | // /*Shdl=*/initS(F, Q,strat); /*sets also S, ecartS, fromQ */ |
---|
| 6883 | } |
---|
| 6884 | strat->kIdeal = NULL; |
---|
| 6885 | strat->fromT = FALSE; |
---|
| 6886 | strat->noTailReduction = !TEST_OPT_REDTAIL; |
---|
| 6887 | if (!TEST_OPT_SB_1) |
---|
| 6888 | { |
---|
| 6889 | /* the only change: we do not fill the set T*/ |
---|
| 6890 | updateS(FALSE,strat); |
---|
| 6891 | } |
---|
| 6892 | if (strat->fromQ!=NULL) omFreeSize(strat->fromQ,IDELEMS(strat->Shdl)*sizeof(int)); |
---|
| 6893 | strat->fromQ=NULL; |
---|
| 6894 | /* more changes: fill the set T with all the shifts of elts of S*/ |
---|
| 6895 | /* is done by other procedure */ |
---|
| 6896 | } |
---|
| 6897 | #endif |
---|
| 6898 | |
---|
| 6899 | #ifdef HAVE_SHIFTBBA |
---|
| 6900 | /*1 |
---|
| 6901 | * put the pairs (sh \dot s[i],p) into the set B, ecart=ecart(p) |
---|
| 6902 | */ |
---|
| 6903 | void enterOnePairManyShifts (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV) |
---|
| 6904 | { |
---|
| 6905 | /* p comes from strat->P.p, that is LObject with LM in currRing and Tail in tailRing */ |
---|
| 6906 | |
---|
| 6907 | assume(p_LmCheckIsFromRing(p,currRing)); |
---|
| 6908 | assume(p_CheckIsFromRing(pNext(p),strat->tailRing)); |
---|
| 6909 | |
---|
| 6910 | /* cycles through all shifts of s[i] until uptodeg - lastVblock(s[i]) */ |
---|
| 6911 | /* that is create the pairs (f, s \dot g) */ |
---|
| 6912 | |
---|
| 6913 | poly qq = strat->S[i]; // lm in currRing, tail in tailRing |
---|
| 6914 | |
---|
| 6915 | // poly q = pCopy(pHead(strat->S[i])); // lm in currRing |
---|
| 6916 | // pNext(q) = prCopyR(pNext(strat->S[i]),strat->tailRing,currRing); // zero shift |
---|
| 6917 | |
---|
| 6918 | /* determine how many elements we have to insert for a given s[i] */ |
---|
| 6919 | /* x(0)y(1)z(2) : lastVblock-1=2, to add until lastVblock=uptodeg-1 */ |
---|
| 6920 | /* hence, a total number of elt's to add is: */ |
---|
| 6921 | /* int toInsert = 1 + (uptodeg-1) - (pLastVblock(p.p, lV) -1); */ |
---|
| 6922 | int toInsert = itoInsert(qq, uptodeg, lV, strat->tailRing); |
---|
| 6923 | |
---|
| 6924 | #ifdef KDEBUG |
---|
| 6925 | if (TEST_OPT_DEBUG) |
---|
| 6926 | { |
---|
| 6927 | // Print("entered ManyShifts: with toInsert=%d",toInsert); PrintLn(); |
---|
| 6928 | } |
---|
| 6929 | #endif |
---|
| 6930 | |
---|
| 6931 | assume(i<=strat->sl); // from OnePair |
---|
| 6932 | if (strat->interred_flag) return; // ? |
---|
| 6933 | |
---|
| 6934 | /* these vars hold for all shifts of s[i] */ |
---|
| 6935 | int ecartq = 0; //Hans says it's ok; we're in the homog case, no ecart |
---|
[9f17c9] | 6936 | |
---|
[f41347f] | 6937 | int qfromQ; |
---|
| 6938 | if (strat->fromQ != NULL) |
---|
| 6939 | { |
---|
[9f17c9] | 6940 | qfromQ = strat->fromQ[i]; |
---|
[f41347f] | 6941 | } |
---|
| 6942 | else |
---|
| 6943 | { |
---|
| 6944 | qfromQ = -1; |
---|
| 6945 | } |
---|
| 6946 | |
---|
| 6947 | int j; |
---|
| 6948 | |
---|
| 6949 | poly q, s; |
---|
| 6950 | |
---|
| 6951 | // for the 0th shift: insert the orig. pair |
---|
| 6952 | enterOnePairShift(qq, p, ecart, isFromQ, strat, -1, ecartq, qfromQ, j, i, uptodeg, lV); |
---|
| 6953 | |
---|
[9f17c9] | 6954 | for (j=1; j<= toInsert; j++) |
---|
[f41347f] | 6955 | { |
---|
| 6956 | // q = pLPshift(strat->S[i],j,uptodeg,lV); |
---|
[9f17c9] | 6957 | q = p_LPshiftT(qq, j, uptodeg, lV, strat, currRing); |
---|
[f41347f] | 6958 | // q = p_mLPshift(qq,j,uptodeg,lV,currRing); // lm in currRing, shift this monomial |
---|
| 6959 | // s = p_LPshift(pNext(qq), j, uptodeg, lV, strat->tailRing); // from tailRing |
---|
| 6960 | // pNext(q) = s; // in tailRing |
---|
| 6961 | /* here we need to call enterOnePair with two polys ... */ |
---|
| 6962 | |
---|
| 6963 | #ifdef KDEBUG |
---|
| 6964 | if (TEST_OPT_DEBUG) |
---|
| 6965 | { |
---|
| 6966 | // PrintS("ManyShifts: calling enterOnePairShift(q,p)"); PrintLn(); |
---|
| 6967 | } |
---|
| 6968 | #endif |
---|
| 6969 | enterOnePairShift(q, p, ecart, isFromQ, strat, -1, ecartq, qfromQ, j, i, uptodeg, lV); |
---|
| 6970 | } |
---|
| 6971 | } |
---|
| 6972 | #endif |
---|
| 6973 | |
---|
| 6974 | #ifdef HAVE_SHIFTBBA |
---|
| 6975 | /*1 |
---|
| 6976 | * put the pairs (sh \dot qq,p) into the set B, ecart=ecart(p) |
---|
| 6977 | * despite the name, not only self shifts |
---|
| 6978 | */ |
---|
| 6979 | void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV) |
---|
| 6980 | { |
---|
| 6981 | |
---|
| 6982 | /* format: p,qq are in LObject form: lm in CR, tail in TR */ |
---|
| 6983 | /* for true self pairs qq ==p */ |
---|
| 6984 | /* we test both qq and p */ |
---|
| 6985 | assume(p_LmCheckIsFromRing(qq,currRing)); |
---|
| 6986 | assume(p_CheckIsFromRing(pNext(qq),strat->tailRing)); |
---|
| 6987 | assume(p_LmCheckIsFromRing(p,currRing)); |
---|
| 6988 | assume(p_CheckIsFromRing(pNext(p),strat->tailRing)); |
---|
| 6989 | |
---|
| 6990 | /* since this proc is applied twice for (h, s*g) and (g,s*h), init j with 1 only */ |
---|
| 6991 | |
---|
| 6992 | // int j = 0; |
---|
| 6993 | int j = 1; |
---|
| 6994 | |
---|
| 6995 | /* for such self pairs start with 1, not with 0 */ |
---|
| 6996 | if (qq == p) j=1; |
---|
| 6997 | |
---|
| 6998 | /* should cycle through all shifts of q until uptodeg - lastVblock(q) */ |
---|
| 6999 | /* that is create the pairs (f, s \dot g) */ |
---|
| 7000 | |
---|
| 7001 | int toInsert = itoInsert(qq, uptodeg, lV, strat->tailRing); |
---|
| 7002 | |
---|
| 7003 | #ifdef KDEBUG |
---|
| 7004 | if (TEST_OPT_DEBUG) |
---|
| 7005 | { |
---|
| 7006 | // Print("entered SelfShifts: with toInsert=%d",toInsert); PrintLn(); |
---|
| 7007 | } |
---|
| 7008 | #endif |
---|
| 7009 | |
---|
| 7010 | poly q, s; |
---|
| 7011 | |
---|
| 7012 | if (strat->interred_flag) return; // ? |
---|
| 7013 | |
---|
| 7014 | /* these vars hold for all shifts of s[i] */ |
---|
| 7015 | int ecartq = 0; //Hans says it's ok; we're in the homog case, no ecart |
---|
[9f17c9] | 7016 | int qfromQ = 0; // strat->fromQ[i]; |
---|
[f41347f] | 7017 | |
---|
| 7018 | for (; j<= toInsert; j++) |
---|
| 7019 | { |
---|
| 7020 | // q = pLPshift(strat->S[i],j,uptodeg,lV); |
---|
| 7021 | /* we increase shifts by one; must delete q there*/ |
---|
| 7022 | // q = qq; q = pMoveCurrTail2poly(q,strat); |
---|
| 7023 | // q = pLPshift(q,j,uptodeg,lV); //,currRing); |
---|
| 7024 | q = p_LPshiftT(qq, j, uptodeg, lV, strat, currRing); |
---|
| 7025 | // q = p_mLPshift(qq,j,uptodeg,lV,currRing); // lm in currRing, shift this monomial |
---|
| 7026 | // s = p_LPshift(pNext(qq), j, uptodeg, lV, strat->tailRing); // from tailRing |
---|
| 7027 | // pNext(q) = s; // in tailRing |
---|
| 7028 | /* here we need to call enterOnePair with two polys ... */ |
---|
| 7029 | #ifdef KDEBUG |
---|
| 7030 | if (TEST_OPT_DEBUG) |
---|
| 7031 | { |
---|
| 7032 | // PrintS("SelfShifts: calling enterOnePairShift(q,p)"); PrintLn(); |
---|
| 7033 | } |
---|
| 7034 | #endif |
---|
| 7035 | enterOnePairShift(q, p, ecart, isFromQ, strat, -1, ecartq, qfromQ, j, -1, uptodeg, lV); |
---|
| 7036 | } |
---|
| 7037 | } |
---|
| 7038 | #endif |
---|
| 7039 | |
---|
| 7040 | #ifdef HAVE_SHIFTBBA |
---|
| 7041 | /*2 |
---|
| 7042 | * put the pair (q,p) into the set B, ecart=ecart(p), q is the shift of some s[i] |
---|
| 7043 | */ |
---|
| 7044 | void enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS, int uptodeg, int lV) |
---|
| 7045 | { |
---|
| 7046 | |
---|
| 7047 | /* Format: q and p are like strat->P.p, so lm in CR, tail in TR */ |
---|
| 7048 | |
---|
| 7049 | /* check this Formats: */ |
---|
| 7050 | assume(p_LmCheckIsFromRing(q,currRing)); |
---|
| 7051 | assume(p_CheckIsFromRing(pNext(q),strat->tailRing)); |
---|
| 7052 | assume(p_LmCheckIsFromRing(p,currRing)); |
---|
| 7053 | assume(p_CheckIsFromRing(pNext(p),strat->tailRing)); |
---|
| 7054 | |
---|
| 7055 | #ifdef KDEBUG |
---|
| 7056 | if (TEST_OPT_DEBUG) |
---|
| 7057 | { |
---|
| 7058 | // PrintS("enterOnePairShift(q,p) invoked with q = "); |
---|
| 7059 | // wrp(q); // wrp(pHead(q)); |
---|
| 7060 | // PrintS(", p = "); |
---|
[9f17c9] | 7061 | // wrp(p); //wrp(pHead(p)); |
---|
[f41347f] | 7062 | // PrintLn(); |
---|
| 7063 | } |
---|
| 7064 | #endif |
---|
| 7065 | |
---|
| 7066 | /* poly q stays for s[i], ecartq = ecart(q), qisFromQ = applies to q */ |
---|
| 7067 | |
---|
| 7068 | int qfromQ = qisFromQ; |
---|
| 7069 | |
---|
| 7070 | /* need additionally: int up_to_degree, poly V0 with the variables in (0) or just the number lV = the length of the first block */ |
---|
| 7071 | |
---|
| 7072 | if (strat->interred_flag) return; |
---|
| 7073 | |
---|
| 7074 | int l,j,compare; |
---|
| 7075 | LObject Lp; |
---|
| 7076 | Lp.i_r = -1; |
---|
| 7077 | |
---|
| 7078 | #ifdef KDEBUG |
---|
| 7079 | Lp.ecart=0; Lp.length=0; |
---|
| 7080 | #endif |
---|
| 7081 | /*- computes the lcm(s[i],p) -*/ |
---|
| 7082 | Lp.lcm = pInit(); |
---|
| 7083 | |
---|
| 7084 | pLcm(p,q, Lp.lcm); // q is what was strat->S[i], so a poly in LM/TR presentation |
---|
| 7085 | pSetm(Lp.lcm); |
---|
| 7086 | |
---|
| 7087 | /* apply the V criterion */ |
---|
| 7088 | if (!isInV(Lp.lcm, lV)) |
---|
| 7089 | { |
---|
| 7090 | #ifdef KDEBUG |
---|
| 7091 | if (TEST_OPT_DEBUG) |
---|
| 7092 | { |
---|
| 7093 | PrintS("V crit applied to q = "); |
---|
| 7094 | wrp(q); // wrp(pHead(q)); |
---|
| 7095 | PrintS(", p = "); |
---|
[9f17c9] | 7096 | wrp(p); //wrp(pHead(p)); |
---|
[f41347f] | 7097 | PrintLn(); |
---|
| 7098 | } |
---|
| 7099 | #endif |
---|
| 7100 | pLmFree(Lp.lcm); |
---|
| 7101 | Lp.lcm=NULL; |
---|
| 7102 | /* + counter for applying the V criterion */ |
---|
| 7103 | strat->cv++; |
---|
| 7104 | return; |
---|
| 7105 | } |
---|
| 7106 | |
---|
[cce4a2f] | 7107 | if (strat->sugarCrit && ALLOW_PROD_CRIT(strat)) |
---|
[f41347f] | 7108 | { |
---|
| 7109 | if((!((ecartq>0)&&(ecart>0))) |
---|
| 7110 | && pHasNotCF(p,q)) |
---|
| 7111 | { |
---|
| 7112 | /* |
---|
| 7113 | *the product criterion has applied for (s,p), |
---|
| 7114 | *i.e. lcm(s,p)=product of the leading terms of s and p. |
---|
| 7115 | *Suppose (s,r) is in L and the leading term |
---|
| 7116 | *of p divides lcm(s,r) |
---|
| 7117 | *(==> the leading term of p divides the leading term of r) |
---|
| 7118 | *but the leading term of s does not divide the leading term of r |
---|
| 7119 | *(notice that this condition is automatically satisfied if r is still |
---|
| 7120 | *in S), then (s,r) can be cancelled. |
---|
| 7121 | *This should be done here because the |
---|
| 7122 | *case lcm(s,r)=lcm(s,p) is not covered by chainCrit. |
---|
| 7123 | * |
---|
| 7124 | *Moreover, skipping (s,r) holds also for the noncommutative case. |
---|
| 7125 | */ |
---|
| 7126 | strat->cp++; |
---|
| 7127 | pLmFree(Lp.lcm); |
---|
| 7128 | Lp.lcm=NULL; |
---|
| 7129 | return; |
---|
| 7130 | } |
---|
| 7131 | else |
---|
| 7132 | Lp.ecart = si_max(ecart,ecartq); |
---|
| 7133 | if (strat->fromT && (ecartq>ecart)) |
---|
| 7134 | { |
---|
| 7135 | pLmFree(Lp.lcm); |
---|
| 7136 | Lp.lcm=NULL; |
---|
| 7137 | return; |
---|
| 7138 | /*the pair is (s[i],t[.]), discard it if the ecart is too big*/ |
---|
| 7139 | } |
---|
| 7140 | /* |
---|
| 7141 | *the set B collects the pairs of type (S[j],p) |
---|
| 7142 | *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p) |
---|
| 7143 | *if the leading term of s devides lcm(r,p) then (r,p) will be canceled |
---|
| 7144 | *if the leading term of r devides lcm(s,p) then (s,p) will not enter B |
---|
| 7145 | */ |
---|
| 7146 | { |
---|
| 7147 | j = strat->Bl; |
---|
| 7148 | loop |
---|
| 7149 | { |
---|
| 7150 | if (j < 0) break; |
---|
| 7151 | compare=pDivComp(strat->B[j].lcm,Lp.lcm); |
---|
| 7152 | if ((compare==1) |
---|
| 7153 | &&(sugarDivisibleBy(strat->B[j].ecart,Lp.ecart))) |
---|
| 7154 | { |
---|
| 7155 | strat->c3++; |
---|
| 7156 | if ((strat->fromQ==NULL) || (isFromQ==0) || (qfromQ==0)) |
---|
| 7157 | { |
---|
| 7158 | pLmFree(Lp.lcm); |
---|
| 7159 | return; |
---|
| 7160 | } |
---|
| 7161 | break; |
---|
| 7162 | } |
---|
| 7163 | else |
---|
| 7164 | if ((compare ==-1) |
---|
| 7165 | && sugarDivisibleBy(Lp.ecart,strat->B[j].ecart)) |
---|
| 7166 | { |
---|
| 7167 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 7168 | strat->c3++; |
---|
| 7169 | } |
---|
| 7170 | j--; |
---|
| 7171 | } |
---|
| 7172 | } |
---|
| 7173 | } |
---|
| 7174 | else /*sugarcrit*/ |
---|
| 7175 | { |
---|
[cce4a2f] | 7176 | if (ALLOW_PROD_CRIT(strat)) |
---|
[f41347f] | 7177 | { |
---|
| 7178 | // if currRing->nc_type!=quasi (or skew) |
---|
| 7179 | // TODO: enable productCrit for super commutative algebras... |
---|
| 7180 | if(/*(strat->ak==0) && productCrit(p,strat->S[i])*/ |
---|
| 7181 | pHasNotCF(p,q)) |
---|
| 7182 | { |
---|
| 7183 | /* |
---|
| 7184 | *the product criterion has applied for (s,p), |
---|
| 7185 | *i.e. lcm(s,p)=product of the leading terms of s and p. |
---|
| 7186 | *Suppose (s,r) is in L and the leading term |
---|
| 7187 | *of p devides lcm(s,r) |
---|
| 7188 | *(==> the leading term of p devides the leading term of r) |
---|
| 7189 | *but the leading term of s does not devide the leading term of r |
---|
| 7190 | *(notice that tis condition is automatically satisfied if r is still |
---|
| 7191 | *in S), then (s,r) can be canceled. |
---|
| 7192 | *This should be done here because the |
---|
| 7193 | *case lcm(s,r)=lcm(s,p) is not covered by chainCrit. |
---|
| 7194 | */ |
---|
| 7195 | strat->cp++; |
---|
| 7196 | pLmFree(Lp.lcm); |
---|
| 7197 | Lp.lcm=NULL; |
---|
| 7198 | return; |
---|
| 7199 | } |
---|
| 7200 | if (strat->fromT && (ecartq>ecart)) |
---|
| 7201 | { |
---|
| 7202 | pLmFree(Lp.lcm); |
---|
| 7203 | Lp.lcm=NULL; |
---|
| 7204 | return; |
---|
| 7205 | /*the pair is (s[i],t[.]), discard it if the ecart is too big*/ |
---|
| 7206 | } |
---|
| 7207 | /* |
---|
| 7208 | *the set B collects the pairs of type (S[j],p) |
---|
| 7209 | *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p) |
---|
| 7210 | *if the leading term of s devides lcm(r,p) then (r,p) will be canceled |
---|
| 7211 | *if the leading term of r devides lcm(s,p) then (s,p) will not enter B |
---|
| 7212 | */ |
---|
| 7213 | for(j = strat->Bl;j>=0;j--) |
---|
| 7214 | { |
---|
| 7215 | compare=pDivComp(strat->B[j].lcm,Lp.lcm); |
---|
| 7216 | if (compare==1) |
---|
| 7217 | { |
---|
| 7218 | strat->c3++; |
---|
| 7219 | if ((strat->fromQ==NULL) || (isFromQ==0) || (qfromQ==0)) |
---|
| 7220 | { |
---|
| 7221 | pLmFree(Lp.lcm); |
---|
| 7222 | return; |
---|
| 7223 | } |
---|
| 7224 | break; |
---|
| 7225 | } |
---|
| 7226 | else |
---|
| 7227 | if (compare ==-1) |
---|
| 7228 | { |
---|
| 7229 | deleteInL(strat->B,&strat->Bl,j,strat); |
---|
| 7230 | strat->c3++; |
---|
| 7231 | } |
---|
| 7232 | } |
---|
| 7233 | } |
---|
| 7234 | } |
---|
| 7235 | /* |
---|
| 7236 | *the pair (S[i],p) enters B if the spoly != 0 |
---|
| 7237 | */ |
---|
| 7238 | /*- compute the short s-polynomial -*/ |
---|
| 7239 | if (strat->fromT && !TEST_OPT_INTSTRATEGY) |
---|
| 7240 | pNorm(p); |
---|
| 7241 | if ((q==NULL) || (p==NULL)) |
---|
| 7242 | return; |
---|
| 7243 | if ((strat->fromQ!=NULL) && (isFromQ!=0) && (qfromQ!=0)) |
---|
| 7244 | Lp.p=NULL; |
---|
| 7245 | else |
---|
| 7246 | { |
---|
[a794e7] | 7247 | // if ( rIsPluralRing(currRing) ) |
---|
[f41347f] | 7248 | // { |
---|
| 7249 | // if(pHasNotCF(p, q)) |
---|
| 7250 | // { |
---|
| 7251 | // if(ncRingType(currRing) == nc_lie) |
---|
| 7252 | // { |
---|
| 7253 | // // generalized prod-crit for lie-type |
---|
| 7254 | // strat->cp++; |
---|
| 7255 | // Lp.p = nc_p_Bracket_qq(pCopy(p),q); |
---|
| 7256 | // } |
---|
| 7257 | // else |
---|
[cce4a2f] | 7258 | // if( ALLOW_PROD_CRIT(strat) ) |
---|
[f41347f] | 7259 | // { |
---|
| 7260 | // // product criterion for homogeneous case in SCA |
---|
| 7261 | // strat->cp++; |
---|
| 7262 | // Lp.p = NULL; |
---|
| 7263 | // } |
---|
| 7264 | // else |
---|
| 7265 | // Lp.p = nc_CreateSpoly(q,p,currRing); // ? |
---|
| 7266 | // } |
---|
| 7267 | // else Lp.p = nc_CreateSpoly(q,p,currRing); |
---|
| 7268 | // } |
---|
| 7269 | // else |
---|
| 7270 | // { |
---|
[9f17c9] | 7271 | |
---|
[f41347f] | 7272 | /* ksCreateShortSpoly needs two Lobject-kind presentations */ |
---|
| 7273 | /* p is already in this form, so convert q */ |
---|
| 7274 | // q = pMove2CurrTail(q, strat); |
---|
| 7275 | Lp.p = ksCreateShortSpoly(q, p, strat->tailRing); |
---|
| 7276 | // } |
---|
| 7277 | } |
---|
| 7278 | if (Lp.p == NULL) |
---|
| 7279 | { |
---|
| 7280 | /*- the case that the s-poly is 0 -*/ |
---|
| 7281 | /* TEMPORARILY DISABLED FOR SHIFTS because there is no i*/ |
---|
| 7282 | // if (strat->pairtest==NULL) initPairtest(strat); |
---|
| 7283 | // strat->pairtest[i] = TRUE;/*- hint for spoly(S^[i],p)=0 -*/ |
---|
| 7284 | // strat->pairtest[strat->sl+1] = TRUE; |
---|
| 7285 | /* END _ TEMPORARILY DISABLED FOR SHIFTS */ |
---|
| 7286 | /*hint for spoly(S[i],p) == 0 for some i,0 <= i <= sl*/ |
---|
| 7287 | /* |
---|
| 7288 | *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is |
---|
| 7289 | *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not |
---|
| 7290 | *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading |
---|
| 7291 | *term of p devides the lcm(s,r) |
---|
| 7292 | *(this canceling should be done here because |
---|
| 7293 | *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit) |
---|
| 7294 | *the first case is handeled in chainCrit |
---|
| 7295 | */ |
---|
| 7296 | if (Lp.lcm!=NULL) pLmFree(Lp.lcm); |
---|
| 7297 | } |
---|
| 7298 | else |
---|
| 7299 | { |
---|
| 7300 | /*- the pair (S[i],p) enters B -*/ |
---|
| 7301 | /* both of them should have their LM in currRing and TAIL in tailring */ |
---|
[9f17c9] | 7302 | Lp.p1 = q; // already in the needed form |
---|
| 7303 | Lp.p2 = p; // already in the needed form |
---|
[f41347f] | 7304 | |
---|
[a794e7] | 7305 | if ( !rIsPluralRing(currRing) ) |
---|
[f41347f] | 7306 | pNext(Lp.p) = strat->tail; |
---|
| 7307 | |
---|
| 7308 | /* TEMPORARILY DISABLED FOR SHIFTS because there's no i*/ |
---|
| 7309 | /* at the beginning we DO NOT set atR = -1 ANYMORE*/ |
---|
| 7310 | if ( (atR >= 0) && (shiftcount==0) && (ifromS >=0) ) |
---|
| 7311 | { |
---|
[9f17c9] | 7312 | Lp.i_r1 = kFindInT(Lp.p1,strat); //strat->S_2_R[ifromS]; |
---|
[f41347f] | 7313 | Lp.i_r2 = atR; |
---|
| 7314 | } |
---|
| 7315 | else |
---|
| 7316 | { |
---|
| 7317 | /* END _ TEMPORARILY DISABLED FOR SHIFTS */ |
---|
| 7318 | Lp.i_r1 = -1; |
---|
| 7319 | Lp.i_r2 = -1; |
---|
| 7320 | } |
---|
| 7321 | strat->initEcartPair(&Lp,q,p,ecartq,ecart); |
---|
| 7322 | |
---|
| 7323 | if (TEST_OPT_INTSTRATEGY) |
---|
| 7324 | { |
---|
[a794e7] | 7325 | if (!rIsPluralRing(currRing)) |
---|
[f41347f] | 7326 | nDelete(&(Lp.p->coef)); |
---|
| 7327 | } |
---|
| 7328 | |
---|
| 7329 | l = strat->posInL(strat->B,strat->Bl,&Lp,strat); |
---|
| 7330 | enterL(&strat->B,&strat->Bl,&strat->Bmax,Lp,l); |
---|
| 7331 | } |
---|
| 7332 | } |
---|
| 7333 | #endif |
---|
| 7334 | |
---|
| 7335 | #ifdef HAVE_SHIFTBBA |
---|
| 7336 | /*2 |
---|
| 7337 | *(s[0],h),...,(s[k],h) will be put to the pairset L(via initenterpairs) |
---|
| 7338 | *superfluous elements in S will be deleted |
---|
| 7339 | */ |
---|
| 7340 | void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV) |
---|
| 7341 | { |
---|
| 7342 | /* h is strat->P.p, that is LObject with LM in currRing and Tail in tailRing */ |
---|
| 7343 | /* Q: what is exactly the strat->fromT ? A: a local case trick; don't need it yet*/ |
---|
| 7344 | int j=pos; |
---|
| 7345 | |
---|
| 7346 | #ifdef HAVE_RINGS |
---|
| 7347 | assume (!rField_is_Ring(currRing)); |
---|
| 7348 | #endif |
---|
| 7349 | initenterpairsShift(h,k,ecart,0,strat, atR,uptodeg,lV); |
---|
| 7350 | if ( (!strat->fromT) |
---|
| 7351 | && ((strat->syzComp==0) |
---|
| 7352 | ||(pGetComp(h)<=strat->syzComp))) |
---|
| 7353 | { |
---|
| 7354 | //Print("start clearS k=%d, pos=%d, sl=%d\n",k,pos,strat->sl); |
---|
| 7355 | unsigned long h_sev = pGetShortExpVector(h); |
---|
| 7356 | loop |
---|
| 7357 | { |
---|
| 7358 | if (j > k) break; |
---|
| 7359 | clearS(h,h_sev, &j,&k,strat); |
---|
| 7360 | j++; |
---|
| 7361 | } |
---|
| 7362 | //Print("end clearS sl=%d\n",strat->sl); |
---|
| 7363 | } |
---|
| 7364 | // PrintS("end enterpairs\n"); |
---|
| 7365 | } |
---|
| 7366 | #endif |
---|
| 7367 | |
---|
| 7368 | #ifdef HAVE_SHIFTBBA |
---|
| 7369 | /*3 |
---|
| 7370 | *(s[0], s \dot h),...,(s[k],s \dot h) will be put to the pairset L |
---|
| 7371 | * also the pairs (h, s\dot s[0]), ..., (h, s\dot s[k]) enter L |
---|
| 7372 | * additionally we put the pairs (h, s \sdot h) for s>=1 to L |
---|
| 7373 | */ |
---|
| 7374 | void initenterpairsShift (poly h,int k,int ecart,int isFromQ, kStrategy strat, int atR, int uptodeg, int lV) |
---|
| 7375 | { |
---|
| 7376 | /* h comes from strat->P.p, that is LObject with LM in currRing and Tail in tailRing */ |
---|
| 7377 | // atR = -1; |
---|
| 7378 | if ((strat->syzComp==0) |
---|
| 7379 | || (pGetComp(h)<=strat->syzComp)) |
---|
| 7380 | { |
---|
| 7381 | int j; |
---|
| 7382 | BOOLEAN new_pair=FALSE; |
---|
| 7383 | |
---|
| 7384 | if (pGetComp(h)==0) |
---|
| 7385 | { |
---|
| 7386 | /* for Q!=NULL: build pairs (f,q),(f1,f2), but not (q1,q2)*/ |
---|
| 7387 | if ((isFromQ)&&(strat->fromQ!=NULL)) |
---|
| 7388 | { |
---|
| 7389 | for (j=0; j<=k; j++) |
---|
| 7390 | { |
---|
| 7391 | if (!strat->fromQ[j]) |
---|
| 7392 | { |
---|
| 7393 | new_pair=TRUE; |
---|
| 7394 | enterOnePairManyShifts(j,h,ecart,isFromQ,strat, atR,uptodeg,lV); |
---|
| 7395 | // other side pairs: |
---|
| 7396 | enterOnePairSelfShifts(h,strat->S[j],ecart,isFromQ,strat, atR,uptodeg,lV); |
---|
| 7397 | //Print("j:%d, Ll:%d\n",j,strat->Ll); |
---|
| 7398 | } |
---|
| 7399 | } |
---|
| 7400 | } |
---|
| 7401 | else |
---|
| 7402 | { |
---|
| 7403 | new_pair=TRUE; |
---|
| 7404 | for (j=0; j<=k; j++) |
---|
| 7405 | { |
---|
| 7406 | enterOnePairManyShifts(j,h,ecart,isFromQ,strat, atR,uptodeg,lV); |
---|
| 7407 | // other side pairs |
---|
| 7408 | enterOnePairSelfShifts(h,strat->S[j],ecart,isFromQ,strat, atR,uptodeg,lV); |
---|
| 7409 | } |
---|
| 7410 | /* HERE we put (h, s*h) pairs */ |
---|
| 7411 | /* enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); */ |
---|
| 7412 | enterOnePairSelfShifts (h, h, ecart, isFromQ, strat, atR, uptodeg, lV); |
---|
| 7413 | } |
---|
| 7414 | } |
---|
| 7415 | else |
---|
| 7416 | { |
---|
| 7417 | for (j=0; j<=k; j++) |
---|
| 7418 | { |
---|
| 7419 | if ((pGetComp(h)==pGetComp(strat->S[j])) |
---|
| 7420 | || (pGetComp(strat->S[j])==0)) |
---|
| 7421 | { |
---|
| 7422 | new_pair=TRUE; |
---|
| 7423 | enterOnePairManyShifts(j,h,ecart,isFromQ,strat, atR, uptodeg, lV); |
---|
| 7424 | // other side pairs |
---|
| 7425 | enterOnePairSelfShifts(h,strat->S[j],ecart,isFromQ,strat, atR,uptodeg,lV); |
---|
| 7426 | //Print("j:%d, Ll:%d\n",j,strat->Ll); |
---|
| 7427 | } |
---|
| 7428 | } |
---|
| 7429 | /* HERE we put (h, s*h) pairs */ |
---|
| 7430 | enterOnePairSelfShifts (h, h, ecart, isFromQ, strat, atR, uptodeg, lV); |
---|
| 7431 | } |
---|
| 7432 | |
---|
| 7433 | if (new_pair) |
---|
| 7434 | { |
---|
[6c55ae] | 7435 | strat->chainCrit(h,ecart,strat); |
---|
[f41347f] | 7436 | } |
---|
| 7437 | |
---|
| 7438 | } |
---|
| 7439 | } |
---|
| 7440 | #endif |
---|
| 7441 | |
---|
| 7442 | #ifdef HAVE_SHIFTBBA |
---|
| 7443 | /*2 |
---|
| 7444 | * puts p to the set T, starting with the at position atT |
---|
| 7445 | * and inserts all admissible shifts of p |
---|
| 7446 | */ |
---|
| 7447 | void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV) |
---|
| 7448 | { |
---|
| 7449 | /* determine how many elements we have to insert */ |
---|
| 7450 | /* x(0)y(1)z(2) : lastVblock-1=2, to add until lastVblock=uptodeg-1 */ |
---|
| 7451 | /* hence, a total number of elt's to add is: */ |
---|
| 7452 | /* int toInsert = 1 + (uptodeg-1) - (pLastVblock(p.p, lV) -1); */ |
---|
| 7453 | |
---|
| 7454 | int toInsert = itoInsert(p.p, uptodeg, lV, strat->tailRing); |
---|
| 7455 | |
---|
| 7456 | #ifdef PDEBUG |
---|
| 7457 | // Print("enterTShift uses toInsert: %d", toInsert); PrintLn(); |
---|
| 7458 | #endif |
---|
| 7459 | int i; |
---|
| 7460 | |
---|
| 7461 | if (atT < 0) |
---|
| 7462 | atT = strat->posInT(strat->T, strat->tl, p); |
---|
[9f17c9] | 7463 | |
---|
[f41347f] | 7464 | /* can call enterT in a sequence, e.g. */ |
---|
| 7465 | |
---|
| 7466 | /* shift0 = it's our model for further shifts */ |
---|
| 7467 | enterT(p,strat,atT); |
---|
| 7468 | LObject qq; |
---|
| 7469 | for (i=1; i<=toInsert; i++) // toIns - 1? |
---|
| 7470 | { |
---|
| 7471 | qq = p; //qq.Copy(); |
---|
[9f17c9] | 7472 | qq.p = NULL; |
---|
[f41347f] | 7473 | qq.max = NULL; |
---|
| 7474 | qq.t_p = p_LPshift(p_Copy(p.t_p,strat->tailRing), i, uptodeg, lV, strat->tailRing); // direct shift |
---|
| 7475 | qq.GetP(); |
---|
| 7476 | // update q.sev |
---|
| 7477 | qq.sev = pGetShortExpVector(qq.p); |
---|
| 7478 | /* enter it into T, first el't is with the shift 0 */ |
---|
| 7479 | // compute the position for qq |
---|
| 7480 | atT = strat->posInT(strat->T, strat->tl, qq); |
---|
| 7481 | enterT(qq,strat,atT); |
---|
| 7482 | } |
---|
| 7483 | /* Q: what to do with this one in the orig enterT ? */ |
---|
| 7484 | /* strat->R[strat->tl] = &(strat->T[atT]); */ |
---|
| 7485 | /* Solution: it is done by enterT each time separately */ |
---|
| 7486 | } |
---|
| 7487 | #endif |
---|
| 7488 | |
---|
| 7489 | #ifdef HAVE_SHIFTBBA |
---|
| 7490 | poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize) |
---|
| 7491 | { |
---|
| 7492 | /* for the shift case need to run it with withT = TRUE */ |
---|
| 7493 | strat->redTailChange=FALSE; |
---|
| 7494 | if (strat->noTailReduction) return L->GetLmCurrRing(); |
---|
| 7495 | poly h, p; |
---|
| 7496 | p = h = L->GetLmTailRing(); |
---|
| 7497 | if ((h==NULL) || (pNext(h)==NULL)) |
---|
| 7498 | return L->GetLmCurrRing(); |
---|
| 7499 | |
---|
| 7500 | TObject* With; |
---|
| 7501 | // placeholder in case strat->tl < 0 |
---|
| 7502 | TObject With_s(strat->tailRing); |
---|
| 7503 | |
---|
| 7504 | LObject Ln(pNext(h), strat->tailRing); |
---|
| 7505 | Ln.pLength = L->GetpLength() - 1; |
---|
| 7506 | |
---|
| 7507 | pNext(h) = NULL; |
---|
| 7508 | if (L->p != NULL) pNext(L->p) = NULL; |
---|
| 7509 | L->pLength = 1; |
---|
| 7510 | |
---|
| 7511 | Ln.PrepareRed(strat->use_buckets); |
---|
| 7512 | |
---|
| 7513 | while(!Ln.IsNull()) |
---|
| 7514 | { |
---|
| 7515 | loop |
---|
| 7516 | { |
---|
| 7517 | Ln.SetShortExpVector(); |
---|
| 7518 | if (withT) |
---|
| 7519 | { |
---|
| 7520 | int j; |
---|
| 7521 | j = kFindDivisibleByInT(strat->T, strat->sevT, strat->tl, &Ln); |
---|
| 7522 | if (j < 0) break; |
---|
| 7523 | With = &(strat->T[j]); |
---|
| 7524 | } |
---|
| 7525 | else |
---|
| 7526 | { |
---|
| 7527 | With = kFindDivisibleByInS(strat, pos, &Ln, &With_s); |
---|
| 7528 | if (With == NULL) break; |
---|
| 7529 | } |
---|
| 7530 | if (normalize && (!TEST_OPT_INTSTRATEGY) && (!nIsOne(pGetCoeff(With->p)))) |
---|
| 7531 | { |
---|
| 7532 | With->pNorm(); |
---|
| 7533 | //if (TEST_OPT_PROT) { PrintS("n"); mflush(); } |
---|
| 7534 | } |
---|
| 7535 | strat->redTailChange=TRUE; |
---|
| 7536 | if (ksReducePolyTail(L, With, &Ln)) |
---|
| 7537 | { |
---|
| 7538 | // reducing the tail would violate the exp bound |
---|
| 7539 | // set a flag and hope for a retry (in bba) |
---|
| 7540 | strat->completeReduce_retry=TRUE; |
---|
[982b30] | 7541 | if ((Ln.p != NULL) && (Ln.t_p != NULL)) Ln.p=NULL; |
---|
[f41347f] | 7542 | do |
---|
| 7543 | { |
---|
| 7544 | pNext(h) = Ln.LmExtractAndIter(); |
---|
| 7545 | pIter(h); |
---|
| 7546 | L->pLength++; |
---|
| 7547 | } while (!Ln.IsNull()); |
---|
| 7548 | goto all_done; |
---|
| 7549 | } |
---|
| 7550 | if (Ln.IsNull()) goto all_done; |
---|
| 7551 | if (! withT) With_s.Init(currRing); |
---|
| 7552 | } |
---|
| 7553 | pNext(h) = Ln.LmExtractAndIter(); |
---|
| 7554 | pIter(h); |
---|
| 7555 | L->pLength++; |
---|
| 7556 | } |
---|
| 7557 | |
---|
| 7558 | all_done: |
---|
| 7559 | Ln.Delete(); |
---|
| 7560 | if (L->p != NULL) pNext(L->p) = pNext(p); |
---|
| 7561 | |
---|
| 7562 | if (strat->redTailChange) |
---|
| 7563 | { |
---|
| 7564 | L->last = NULL; |
---|
| 7565 | L->length = 0; |
---|
| 7566 | } |
---|
| 7567 | L->Normalize(); // HANNES: should have a test |
---|
| 7568 | kTest_L(L); |
---|
| 7569 | return L->GetLmCurrRing(); |
---|
| 7570 | } |
---|
| 7571 | #endif |
---|