[35aab3] | 1 | #ifndef KUTIL_H |
---|
| 2 | #define KUTIL_H |
---|
| 3 | /**************************************** |
---|
| 4 | * Computer Algebra System SINGULAR * |
---|
| 5 | ****************************************/ |
---|
| 6 | /* |
---|
| 7 | * ABSTRACT: kernel: utils for kStd |
---|
| 8 | */ |
---|
| 9 | |
---|
| 10 | |
---|
| 11 | #include <string.h> |
---|
| 12 | |
---|
[b1dfaf] | 13 | #include <omalloc/omalloc.h> |
---|
[c6e80e] | 14 | #include <misc/mylimits.h> |
---|
| 15 | |
---|
| 16 | |
---|
[737a68] | 17 | #include <kernel/polys.h> |
---|
[210e07] | 18 | #include <polys/operations/pShallowCopyDelete.h> |
---|
[35aab3] | 19 | |
---|
[c6e80e] | 20 | #include <kernel/structs.h> |
---|
| 21 | |
---|
[35aab3] | 22 | #if 1 |
---|
| 23 | #define setmax 16 |
---|
[425d94c] | 24 | #define setmaxL ((4096-12)/sizeof(LObject)) |
---|
| 25 | #define setmaxLinc ((4096)/sizeof(LObject)) |
---|
[939847] | 26 | |
---|
| 27 | #define setmaxT 64 |
---|
| 28 | #define setmaxTinc 32 |
---|
[35aab3] | 29 | #else |
---|
| 30 | #define setmax 16 |
---|
| 31 | #define setmaxL 16 |
---|
| 32 | #define setmaxLinc 16 |
---|
| 33 | #define setmaxT 16 |
---|
| 34 | #define setmaxTinc 16 |
---|
| 35 | #endif |
---|
| 36 | |
---|
[228b631] | 37 | // if you want std computations as in Singular version < 2: |
---|
| 38 | // This disables RedThrough, tailReductions against T (bba), |
---|
[35aab3] | 39 | // sets posInT = posInT15 (bba, strat->honey), and enables redFirst with LDeg |
---|
[228b631] | 40 | // NOTE: can be achieved with option(oldStd) |
---|
[35aab3] | 41 | |
---|
| 42 | #undef NO_KINLINE |
---|
| 43 | #if !defined(KDEBUG) && !defined(NO_INLINE) |
---|
| 44 | #define KINLINE inline |
---|
| 45 | #else |
---|
| 46 | #define KINLINE |
---|
| 47 | #define NO_KINLINE 1 |
---|
| 48 | #endif |
---|
| 49 | |
---|
| 50 | typedef int* intset; |
---|
[58ebad] | 51 | typedef int64 wlen_type; |
---|
[fe5ad5] | 52 | typedef wlen_type* wlen_set; |
---|
| 53 | |
---|
[35aab3] | 54 | typedef class sTObject TObject; |
---|
| 55 | typedef class sLObject LObject; |
---|
| 56 | typedef TObject * TSet; |
---|
| 57 | typedef LObject * LSet; |
---|
| 58 | |
---|
[526e40d] | 59 | typedef struct denominator_list_s denominator_list_s; |
---|
| 60 | typedef denominator_list_s *denominator_list; |
---|
| 61 | |
---|
| 62 | struct denominator_list_s{number n; denominator_list next;}; |
---|
| 63 | extern denominator_list DENOMINATOR_LIST; |
---|
| 64 | |
---|
[35aab3] | 65 | class sTObject |
---|
| 66 | { |
---|
| 67 | public: |
---|
[83be980] | 68 | unsigned long sevSig; |
---|
| 69 | poly sig; // the signature of the element |
---|
[35aab3] | 70 | poly p; // Lm(p) \in currRing Tail(p) \in tailRing |
---|
| 71 | poly t_p; // t_p \in tailRing: as monomials Lm(t_p) == Lm(p) |
---|
| 72 | poly max; // p_GetMaxExpP(pNext(p)) |
---|
[ad07b8] | 73 | ring tailRing; |
---|
[35aab3] | 74 | long FDeg; // pFDeg(p) |
---|
| 75 | int ecart, |
---|
| 76 | length, // as of pLDeg |
---|
| 77 | pLength, // either == 0, or == pLength(p) |
---|
| 78 | i_r; // index of TObject in R set, or -1 if not in T |
---|
| 79 | BOOLEAN is_normalized; // true, if pNorm was called on p, false otherwise |
---|
[83be980] | 80 | // used in incremental sba() with F5C: |
---|
[a9c298] | 81 | // we know some of the redundant elements in |
---|
[83be980] | 82 | // strat->T beforehand, so we can just discard |
---|
| 83 | // them and do not need to consider them in the |
---|
| 84 | // interreduction process |
---|
| 85 | BOOLEAN is_redundant; |
---|
| 86 | // used in sba's sig-safe reduction: |
---|
| 87 | // sometimes we already know that a reducer |
---|
| 88 | // is sig-safe, so no need for a real |
---|
| 89 | // sig-safeness check |
---|
| 90 | BOOLEAN is_sigsafe; |
---|
| 91 | |
---|
[35aab3] | 92 | |
---|
[a9c298] | 93 | #ifdef HAVE_PLURAL |
---|
[c656700] | 94 | BOOLEAN is_special; // true, it is a new special S-poly (e.g. for SCA) |
---|
| 95 | #endif |
---|
[a9c298] | 96 | |
---|
[35aab3] | 97 | // initialization |
---|
| 98 | KINLINE void Init(ring r = currRing); |
---|
| 99 | KINLINE sTObject(ring tailRing = currRing); |
---|
| 100 | KINLINE sTObject(poly p, ring tailRing = currRing); |
---|
| 101 | KINLINE sTObject(poly p, ring c_r, ring tailRing); |
---|
| 102 | KINLINE sTObject(sTObject* T, int copy); |
---|
| 103 | |
---|
| 104 | KINLINE void Set(ring r=currRing); |
---|
| 105 | KINLINE void Set(poly p_in, ring r=currRing); |
---|
| 106 | KINLINE void Set(poly p_in, ring c_r, ring t_r); |
---|
| 107 | |
---|
| 108 | // Frees the polys of T |
---|
| 109 | KINLINE void Delete(); |
---|
| 110 | // Sets polys to NULL |
---|
| 111 | KINLINE void Clear(); |
---|
| 112 | // makes a copy of the poly of T |
---|
| 113 | KINLINE void Copy(); |
---|
| 114 | |
---|
| 115 | // ring-dependent Lm access: these might result in allocation of monomials |
---|
| 116 | KINLINE poly GetLmCurrRing(); |
---|
| 117 | KINLINE poly GetLmTailRing(); |
---|
| 118 | KINLINE poly GetLm(ring r); |
---|
| 119 | // this returns Lm and ring r (preferably from tailRing), but does not |
---|
| 120 | // allocate a new poly |
---|
| 121 | KINLINE void GetLm(poly &p, ring &r) const; |
---|
[585bbcb] | 122 | |
---|
| 123 | #ifdef OLIVER_PRIVAT_LT |
---|
| 124 | // routines for calc. with rings |
---|
| 125 | KINLINE poly GetLtCurrRing(); |
---|
| 126 | KINLINE poly GetLtTailRing(); |
---|
| 127 | KINLINE poly GetLt(ring r); |
---|
| 128 | KINLINE void GetLt(poly &p, ring &r) const; |
---|
| 129 | #endif |
---|
| 130 | |
---|
[35aab3] | 131 | KINLINE BOOLEAN IsNull() const; |
---|
| 132 | |
---|
| 133 | KINLINE int GetpLength(); |
---|
| 134 | |
---|
| 135 | // makes sure that T.p exists |
---|
| 136 | KINLINE void SetLmCurrRing(); |
---|
| 137 | |
---|
| 138 | // Iterations |
---|
| 139 | // simply get the next monomial |
---|
| 140 | KINLINE poly Next(); |
---|
| 141 | KINLINE void LmDeleteAndIter(); |
---|
| 142 | |
---|
| 143 | // deg stuff |
---|
[d5564f8] | 144 | // compute pTotalDegree |
---|
| 145 | KINLINE long pTotalDeg() const; |
---|
[35aab3] | 146 | // computes pFDeg |
---|
| 147 | KINLINE long pFDeg() const; |
---|
| 148 | // computes and sets FDeg |
---|
| 149 | KINLINE long SetpFDeg(); |
---|
| 150 | // gets stored FDeg |
---|
| 151 | KINLINE long GetpFDeg() const; |
---|
| 152 | |
---|
| 153 | // computes pLDeg |
---|
| 154 | KINLINE long pLDeg(); |
---|
| 155 | // sets length, FDeg, returns LDeg |
---|
| 156 | KINLINE long SetDegStuffReturnLDeg(); |
---|
| 157 | |
---|
| 158 | // arithmetic |
---|
| 159 | KINLINE void Mult_nn(number n); |
---|
| 160 | KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin, |
---|
| 161 | pShallowCopyDeleteProc p_shallow_copy_delete, |
---|
| 162 | BOOLEAN set_max = TRUE); |
---|
| 163 | // manipulations |
---|
| 164 | KINLINE void pNorm(); |
---|
| 165 | KINLINE void pCleardenom(); |
---|
| 166 | |
---|
| 167 | #ifdef KDEBUG |
---|
| 168 | void wrp(); |
---|
| 169 | #endif |
---|
| 170 | }; |
---|
| 171 | |
---|
[2d9e1e] | 172 | #ifndef NDEBUG |
---|
| 173 | extern int strat_nr; |
---|
| 174 | extern int strat_fac_debug; |
---|
| 175 | #endif |
---|
| 176 | |
---|
[35aab3] | 177 | class sLObject : public sTObject |
---|
| 178 | { |
---|
| 179 | |
---|
| 180 | public: |
---|
| 181 | unsigned long sev; |
---|
[83be980] | 182 | unsigned long from; // from which polynomial it comes from |
---|
| 183 | // this is important for signature-based |
---|
| 184 | // algorithms |
---|
| 185 | unsigned long checked; // this is the index of S up to which |
---|
| 186 | // the corresponding LObject was already checked in |
---|
| 187 | // critical pair creation => when entering the |
---|
| 188 | // reduction process it is enough to start a second |
---|
| 189 | // rewritten criterion check from checked+1 onwards |
---|
[5313c0] | 190 | // NOTE: If checked = 3 then the corresponding pair is |
---|
| 191 | // detected by Buchberger's Product Criterion and can be |
---|
| 192 | // deleted |
---|
[63e7d6c] | 193 | poly p1,p2; /*- the pair p comes from, |
---|
| 194 | lm(pi) in currRing, tail(pi) in tailring -*/ |
---|
[35aab3] | 195 | |
---|
| 196 | poly lcm; /*- the lcm of p1,p2 -*/ |
---|
| 197 | kBucket_pt bucket; |
---|
| 198 | int i_r1, i_r2; |
---|
| 199 | |
---|
| 200 | // initialization |
---|
| 201 | KINLINE void Init(ring tailRing = currRing); |
---|
| 202 | KINLINE sLObject(ring tailRing = currRing); |
---|
| 203 | KINLINE sLObject(poly p, ring tailRing = currRing); |
---|
| 204 | KINLINE sLObject(poly p, ring c_r, ring tailRing); |
---|
| 205 | |
---|
| 206 | // Frees the polys of L |
---|
| 207 | KINLINE void Delete(); |
---|
| 208 | KINLINE void Clear(); |
---|
| 209 | |
---|
| 210 | // Iterations |
---|
| 211 | KINLINE void LmDeleteAndIter(); |
---|
| 212 | KINLINE poly LmExtractAndIter(); |
---|
| 213 | |
---|
| 214 | // spoly related things |
---|
| 215 | // preparation for reduction if not spoly |
---|
| 216 | KINLINE void PrepareRed(BOOLEAN use_bucket); |
---|
| 217 | KINLINE void SetLmTail(poly lm, poly new_p, int length, |
---|
[f224d85] | 218 | int use_bucket, ring r); |
---|
[35aab3] | 219 | KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether); |
---|
| 220 | KINLINE void Tail_Mult_nn(number n); |
---|
| 221 | // deletes bucket, makes sure that p and t_p exists |
---|
| 222 | KINLINE poly GetP(omBin lmBin = NULL); |
---|
| 223 | // similar, except that only t_p exists |
---|
| 224 | KINLINE poly GetTP(); |
---|
| 225 | |
---|
| 226 | // does not delete bucket, just canonicalizes it |
---|
| 227 | // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing |
---|
| 228 | KINLINE poly CanonicalizeP(); |
---|
| 229 | |
---|
| 230 | // makes a copy of the poly of L |
---|
| 231 | KINLINE void Copy(); |
---|
| 232 | // gets the poly and makes a copy of it |
---|
| 233 | KINLINE poly CopyGetP(); |
---|
| 234 | |
---|
| 235 | KINLINE int GetpLength(); |
---|
| 236 | KINLINE long pLDeg(BOOLEAN use_last); |
---|
| 237 | KINLINE long pLDeg(); |
---|
| 238 | KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE); |
---|
| 239 | KINLINE long SetDegStuffReturnLDeg(); |
---|
| 240 | KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last); |
---|
| 241 | |
---|
| 242 | // returns minimal component of p |
---|
| 243 | KINLINE long MinComp(); |
---|
| 244 | // returns component of p |
---|
| 245 | KINLINE long Comp(); |
---|
| 246 | |
---|
| 247 | KINLINE void ShallowCopyDelete(ring new_tailRing, |
---|
| 248 | pShallowCopyDeleteProc p_shallow_copy_delete); |
---|
| 249 | |
---|
| 250 | // sets sev |
---|
| 251 | KINLINE void SetShortExpVector(); |
---|
| 252 | |
---|
| 253 | // enable assignment from TObject |
---|
| 254 | KINLINE sLObject& operator=(const sTObject&); |
---|
| 255 | |
---|
| 256 | // get T's corresponding to p1, p2: they might return NULL |
---|
| 257 | KINLINE TObject* T_1(const skStrategy* strat); |
---|
| 258 | KINLINE TObject* T_2(const skStrategy* strat); |
---|
| 259 | KINLINE void T_1_2(const skStrategy* strat, |
---|
| 260 | TObject* &T_1, TObject* &T_2); |
---|
[88f583] | 261 | |
---|
| 262 | // simplify coefficients |
---|
| 263 | KINLINE void Normalize(); |
---|
| 264 | KINLINE void HeadNormalize(); |
---|
[35aab3] | 265 | }; |
---|
| 266 | |
---|
| 267 | |
---|
| 268 | extern int HCord; |
---|
| 269 | |
---|
| 270 | class skStrategy; |
---|
| 271 | typedef skStrategy * kStrategy; |
---|
| 272 | class skStrategy |
---|
| 273 | { |
---|
| 274 | public: |
---|
| 275 | kStrategy next; |
---|
| 276 | int (*red)(LObject * L,kStrategy strat); |
---|
[83be980] | 277 | int (*red2)(LObject * L,kStrategy strat); |
---|
[35aab3] | 278 | void (*initEcart)(LObject * L); |
---|
| 279 | int (*posInT)(const TSet T,const int tl,LObject &h); |
---|
[83be980] | 280 | int (*posInLSba)(const LSet set, const int length, |
---|
| 281 | LObject* L,const kStrategy strat); |
---|
[35aab3] | 282 | int (*posInL)(const LSet set, const int length, |
---|
| 283 | LObject* L,const kStrategy strat); |
---|
[b130fb] | 284 | void (*enterS)(LObject h, int pos,kStrategy strat, int atR/* =-1*/ ); |
---|
[35aab3] | 285 | void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG); |
---|
| 286 | int (*posInLOld)(const LSet Ls,const int Ll, |
---|
| 287 | LObject* Lo,const kStrategy strat); |
---|
[6c55ae] | 288 | void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR /*= -1*/); |
---|
| 289 | void (*chainCrit) (poly p,int ecart,kStrategy strat); |
---|
[83be980] | 290 | BOOLEAN (*syzCrit) (poly sig, unsigned long not_sevSig, kStrategy strat); |
---|
| 291 | BOOLEAN (*rewCrit1) (poly sig, unsigned long not_sevSig, kStrategy strat, int start /*= 0*/); |
---|
| 292 | BOOLEAN (*rewCrit2) (poly sig, unsigned long not_sevSig, kStrategy strat, int start /*= 0*/); |
---|
[35aab3] | 293 | pFDegProc pOrigFDeg; |
---|
| 294 | pLDegProc pOrigLDeg; |
---|
| 295 | pFDegProc pOrigFDeg_TailRing; |
---|
| 296 | pLDegProc pOrigLDeg_TailRing; |
---|
| 297 | |
---|
| 298 | LObject P; |
---|
| 299 | ideal Shdl; |
---|
| 300 | ideal D; /*V(S) is in D(D)*/ |
---|
| 301 | ideal M; /*set of minimal generators*/ |
---|
| 302 | polyset S; |
---|
[83be980] | 303 | polyset syz; |
---|
| 304 | polyset sig; |
---|
[35aab3] | 305 | intset ecartS; |
---|
[83be980] | 306 | intset fromS; // from which S[i] S[j] comes from |
---|
| 307 | // this is important for signature-based |
---|
| 308 | // algorithms |
---|
| 309 | intset syzIdx;// index in the syz array at which the first |
---|
| 310 | // syzygy of component i comes up |
---|
| 311 | // important for signature-based algorithms |
---|
| 312 | BOOLEAN incremental; |
---|
| 313 | unsigned long currIdx; |
---|
| 314 | int max_lower_index; |
---|
[35aab3] | 315 | intset lenS; |
---|
[fe5ad5] | 316 | wlen_set lenSw; /* for tgb.ccc */ |
---|
[35aab3] | 317 | intset fromQ; |
---|
| 318 | unsigned long* sevS; |
---|
[83be980] | 319 | unsigned long* sevSyz; |
---|
| 320 | unsigned long* sevSig; |
---|
[35aab3] | 321 | unsigned long* sevT; |
---|
| 322 | TSet T; |
---|
| 323 | LSet L; |
---|
| 324 | LSet B; |
---|
| 325 | poly kHEdge; |
---|
| 326 | poly kNoether; |
---|
| 327 | poly t_kHEdge; // same polys in tailring |
---|
| 328 | KINLINE poly kNoetherTail(); |
---|
| 329 | poly t_kNoether; |
---|
| 330 | BOOLEAN * NotUsedAxis; |
---|
[660ed3] | 331 | BOOLEAN * pairtest;/*used for enterOnePair*/ |
---|
[35aab3] | 332 | poly tail; |
---|
| 333 | intvec * kModW; |
---|
| 334 | intvec * kHomW; |
---|
| 335 | // procedure for ShalloCopy from tailRing to currRing |
---|
| 336 | pShallowCopyDeleteProc p_shallow_copy_delete; |
---|
| 337 | // pointers to Tobjects R[i] is ith Tobject which is generated |
---|
| 338 | TObject** R; |
---|
| 339 | // S_2_R[i] yields Tobject which corresponds to S[i] |
---|
| 340 | int* S_2_R; |
---|
| 341 | ring tailRing; |
---|
| 342 | omBin lmBin; |
---|
| 343 | omBin tailBin; |
---|
[2d9e1e] | 344 | #ifndef NDEBUG |
---|
| 345 | int nr; |
---|
| 346 | #endif |
---|
[35aab3] | 347 | int cp,c3; |
---|
[1c473f] | 348 | int cv; // in shift bases: counting V criterion |
---|
[35aab3] | 349 | int sl,mu; |
---|
[83be980] | 350 | int syzl,syzmax,syzidxmax; |
---|
[35aab3] | 351 | int tl,tmax; |
---|
| 352 | int Ll,Lmax; |
---|
| 353 | int Bl,Bmax; |
---|
| 354 | int ak,LazyDegree,LazyPass; |
---|
| 355 | int syzComp; |
---|
| 356 | int HCord; |
---|
| 357 | int lastAxis; |
---|
| 358 | int newIdeal; |
---|
| 359 | int minim; |
---|
[63b728c] | 360 | #ifdef HAVE_SHIFTBBA |
---|
| 361 | int lV; |
---|
| 362 | #endif |
---|
[35aab3] | 363 | BOOLEAN interpt; |
---|
| 364 | BOOLEAN homog; |
---|
[aef1b86] | 365 | #ifdef HAVE_PLURAL |
---|
| 366 | BOOLEAN z2homog; // Z_2 - homogeneous input allows product criterion in commutative and SCA cases! |
---|
| 367 | #endif |
---|
[35aab3] | 368 | BOOLEAN kHEdgeFound; |
---|
| 369 | BOOLEAN honey,sugarCrit; |
---|
| 370 | BOOLEAN Gebauer,noTailReduction; |
---|
| 371 | BOOLEAN fromT; |
---|
| 372 | BOOLEAN noetherSet; |
---|
| 373 | BOOLEAN update; |
---|
| 374 | BOOLEAN posInLOldFlag; |
---|
| 375 | BOOLEAN use_buckets; |
---|
| 376 | BOOLEAN interred_flag; |
---|
| 377 | // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength) |
---|
| 378 | BOOLEAN LDegLast; |
---|
| 379 | // if set, then L.length == L.pLength |
---|
| 380 | BOOLEAN length_pLength; |
---|
| 381 | // if set, then posInL does not depend on L.length |
---|
| 382 | BOOLEAN posInLDependsOnLength; |
---|
| 383 | /*FALSE, if posInL == posInL10*/ |
---|
[a794e7] | 384 | #ifdef HAVE_PLURAL |
---|
[cce4a2f] | 385 | // set this flag to 1 to stop the product criteria |
---|
| 386 | // use ALLOW_PROD_CRIT(strat) to test |
---|
[a794e7] | 387 | BOOLEAN no_prod_crit; |
---|
[cce4a2f] | 388 | #define ALLOW_PROD_CRIT(A) (!(A)->no_prod_crit) |
---|
[a794e7] | 389 | #else |
---|
[cce4a2f] | 390 | #define ALLOW_PROD_CRIT(A) (1) |
---|
[a794e7] | 391 | #endif |
---|
[35aab3] | 392 | char redTailChange; |
---|
| 393 | char news; |
---|
| 394 | char newt;/*used for messageSets*/ |
---|
[660ed3] | 395 | char noClearS; |
---|
[b57694] | 396 | char completeReduce_retry; |
---|
[d5564f8] | 397 | char overflow; |
---|
[35aab3] | 398 | |
---|
| 399 | skStrategy(); |
---|
| 400 | ~skStrategy(); |
---|
| 401 | |
---|
| 402 | // return TObject corresponding to S[i]: assume that it exists |
---|
| 403 | // i.e. no error checking is done |
---|
| 404 | KINLINE TObject* S_2_T(int i); |
---|
| 405 | // like S_2_T, except that NULL is returned if it can not be found |
---|
| 406 | KINLINE TObject* s_2_t(int i); |
---|
| 407 | }; |
---|
| 408 | |
---|
| 409 | void deleteHC(poly *p, int *e, int *l, kStrategy strat); |
---|
| 410 | void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE); |
---|
| 411 | void deleteInS (int i,kStrategy strat); |
---|
[83be980] | 412 | void deleteInSSba (int i,kStrategy strat); |
---|
[35aab3] | 413 | void cleanT (kStrategy strat); |
---|
[e259fe] | 414 | static inline LSet initL (int nr=setmaxL) |
---|
[27fc50] | 415 | { return (LSet)omAlloc(nr*sizeof(LObject)); } |
---|
[35aab3] | 416 | void deleteInL(LSet set, int *length, int j,kStrategy strat); |
---|
| 417 | void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at); |
---|
| 418 | void enterSBba (LObject p,int atS,kStrategy strat, int atR = -1); |
---|
[83be980] | 419 | void enterSSba (LObject p,int atS,kStrategy strat, int atR = -1); |
---|
[35aab3] | 420 | void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG); |
---|
| 421 | void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG); |
---|
[a9c298] | 422 | int posInS (const kStrategy strat, const int length, const poly p, |
---|
[391323] | 423 | const int ecart_p); |
---|
[35aab3] | 424 | int posInT0 (const TSet set,const int length,LObject &p); |
---|
| 425 | int posInT1 (const TSet set,const int length,LObject &p); |
---|
| 426 | int posInT2 (const TSet set,const int length,LObject &p); |
---|
| 427 | int posInT11 (const TSet set,const int length,LObject &p); |
---|
[83be980] | 428 | int posInTSig (const TSet set,const int length,LObject &p); |
---|
[35aab3] | 429 | int posInT110 (const TSet set,const int length,LObject &p); |
---|
| 430 | int posInT13 (const TSet set,const int length,LObject &p); |
---|
| 431 | int posInT15 (const TSet set,const int length,LObject &p); |
---|
| 432 | int posInT17 (const TSet set,const int length,LObject &p); |
---|
| 433 | int posInT19 (const TSet set,const int length,LObject &p); |
---|
| 434 | int posInT_EcartpLength(const TSet set,const int length,LObject &p); |
---|
| 435 | |
---|
| 436 | #ifdef HAVE_MORE_POS_IN_T |
---|
| 437 | int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p); |
---|
| 438 | int posInT_FDegpLength(const TSet set,const int length,LObject &p); |
---|
| 439 | int posInT_pLength(const TSet set,const int length,LObject &p); |
---|
| 440 | #endif |
---|
| 441 | |
---|
| 442 | |
---|
| 443 | void reorderS (int* suc,kStrategy strat); |
---|
[83be980] | 444 | int posInLF5C (const LSet set, const int length, |
---|
| 445 | LObject* L,const kStrategy strat); |
---|
| 446 | int posInLSig (const LSet set, const int length, |
---|
| 447 | LObject* L,const kStrategy strat); |
---|
[35aab3] | 448 | int posInL0 (const LSet set, const int length, |
---|
| 449 | LObject* L,const kStrategy strat); |
---|
| 450 | int posInL11 (const LSet set, const int length, |
---|
| 451 | LObject* L,const kStrategy strat); |
---|
| 452 | int posInL13 (const LSet set, const int length, |
---|
| 453 | LObject* L,const kStrategy strat); |
---|
| 454 | int posInL15 (const LSet set, const int length, |
---|
| 455 | LObject* L,const kStrategy strat); |
---|
| 456 | int posInL17 (const LSet set, const int length, |
---|
| 457 | LObject* L,const kStrategy strat); |
---|
| 458 | int posInL10 (const LSet set, const int length, |
---|
| 459 | LObject* L,const kStrategy strat); |
---|
[830ef8] | 460 | int posInL110 (const LSet set, const int length, |
---|
| 461 | LObject* L,const kStrategy strat); |
---|
[015bba] | 462 | KINLINE poly redtailBba (poly p,int pos,kStrategy strat,BOOLEAN normalize=FALSE); |
---|
[5eb865] | 463 | #ifdef HAVE_RINGS |
---|
| 464 | KINLINE poly redtailBba_Z (poly p,int pos,kStrategy strat); |
---|
| 465 | poly redtailBba_Z (LObject* L, int pos, kStrategy strat ); |
---|
| 466 | #endif |
---|
[015bba] | 467 | poly redtailBba (LObject *L, int pos,kStrategy strat, |
---|
| 468 | BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE); |
---|
[b085fba] | 469 | poly redtailSba (LObject *L, int pos,kStrategy strat, |
---|
| 470 | BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE); |
---|
[015bba] | 471 | poly redtailBba (TObject *T, int pos,kStrategy strat); |
---|
[35aab3] | 472 | poly redtail (poly p,int pos,kStrategy strat); |
---|
| 473 | poly redtail (LObject *L,int pos,kStrategy strat); |
---|
[ab1c36] | 474 | poly redNF (poly h,int & max_ind,int nonorm,kStrategy strat); |
---|
[35aab3] | 475 | int redNF0 (LObject *P,kStrategy strat); |
---|
| 476 | poly redNFTail (poly h,const int sl,kStrategy strat); |
---|
| 477 | int redHoney (LObject* h, kStrategy strat); |
---|
[206e158] | 478 | #ifdef HAVE_RINGS |
---|
[093f30e] | 479 | int redRing (LObject* h,kStrategy strat); |
---|
[c25b56c] | 480 | int redRiloc (LObject* h,kStrategy strat); |
---|
[f92547] | 481 | void enterExtendedSpoly(poly h,kStrategy strat); |
---|
| 482 | void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1); |
---|
[6d09f28] | 483 | poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing); |
---|
[206e158] | 484 | long ind2(long arg); |
---|
[c90b43] | 485 | |
---|
[206e158] | 486 | long ind_fact_2(long arg); |
---|
| 487 | long twoPow(long arg); |
---|
[6d09f28] | 488 | ideal createG0(); |
---|
[585bbcb] | 489 | #endif |
---|
[35aab3] | 490 | int redLazy (LObject* h,kStrategy strat); |
---|
| 491 | int redHomog (LObject* h,kStrategy strat); |
---|
[83be980] | 492 | int redSig (LObject* h,kStrategy strat); |
---|
| 493 | //adds hSig to be able to check with F5's criteria when entering pairs! |
---|
| 494 | void enterpairsSig (poly h, poly hSig, int from, int k, int ec, int pos,kStrategy strat, int atR = -1); |
---|
[35aab3] | 495 | void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1); |
---|
| 496 | void entersets (LObject h); |
---|
| 497 | void pairs (); |
---|
| 498 | void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result); |
---|
[930ea8] | 499 | void messageStat (int hilbcount,kStrategy strat); |
---|
[35aab3] | 500 | #ifdef KDEBUG |
---|
| 501 | void messageSets (kStrategy strat); |
---|
| 502 | #else |
---|
[d101b1] | 503 | #define messageSets(s) do {} while (0) |
---|
[35aab3] | 504 | #endif |
---|
| 505 | |
---|
| 506 | void initEcartNormal (LObject* h); |
---|
| 507 | void initEcartBBA (LObject* h); |
---|
| 508 | void initS (ideal F, ideal Q,kStrategy strat); |
---|
| 509 | void initSL (ideal F, ideal Q,kStrategy strat); |
---|
[83be980] | 510 | void initSLSba (ideal F, ideal Q,kStrategy strat); |
---|
| 511 | /************************************************* |
---|
[a9c298] | 512 | * when initializing a new bunch of principal |
---|
[83be980] | 513 | * syzygies at the beginning of a new iteration |
---|
[a9c298] | 514 | * step in a signature-based algorithm we |
---|
[83be980] | 515 | * compute ONLY the leading elements of those |
---|
| 516 | * syzygies, NOT the whole syzygy |
---|
| 517 | * NOTE: this needs to be adjusted for a more |
---|
| 518 | * general approach on signature-based algorithms |
---|
| 519 | ***********************************************/ |
---|
| 520 | void initSyzRules (kStrategy strat); |
---|
[35aab3] | 521 | void updateS(BOOLEAN toT,kStrategy strat); |
---|
[83be980] | 522 | void enterSyz (LObject p,kStrategy strat); |
---|
[35aab3] | 523 | void enterT (LObject p,kStrategy strat, int atT = -1); |
---|
[5572c1] | 524 | void cancelunit (LObject* p,BOOLEAN inNF=FALSE); |
---|
[35aab3] | 525 | void HEckeTest (poly pp,kStrategy strat); |
---|
| 526 | void initBuchMoraCrit(kStrategy strat); |
---|
[83be980] | 527 | void initSbaCrit(kStrategy strat); |
---|
[35aab3] | 528 | void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat); |
---|
| 529 | void initBuchMoraPos(kStrategy strat); |
---|
[83be980] | 530 | void initSbaPos(kStrategy strat); |
---|
[35aab3] | 531 | void initBuchMora (ideal F, ideal Q,kStrategy strat); |
---|
[83be980] | 532 | void initSbaBuchMora (ideal F, ideal Q,kStrategy strat); |
---|
[35aab3] | 533 | void exitBuchMora (kStrategy strat); |
---|
[83be980] | 534 | void exitSba (kStrategy strat); |
---|
[35aab3] | 535 | void updateResult(ideal r,ideal Q,kStrategy strat); |
---|
[4d43ff] | 536 | void completeReduce (kStrategy strat, BOOLEAN withT=FALSE); |
---|
[35aab3] | 537 | void kFreeStrat(kStrategy strat); |
---|
[6c55ae] | 538 | void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR); |
---|
[83be980] | 539 | void enterOnePairSig (int i,poly p,poly pSig,int ecart, int isFromQ,kStrategy strat, int atR); |
---|
[6c55ae] | 540 | void chainCritNormal (poly p,int ecart,kStrategy strat); |
---|
[83be980] | 541 | void chainCritSig (poly p,int ecart,kStrategy strat); |
---|
[35aab3] | 542 | BOOLEAN homogTest(polyset F, int Fmax); |
---|
[930ea8] | 543 | BOOLEAN newHEdge(kStrategy strat); |
---|
[83be980] | 544 | BOOLEAN syzCriterion(poly sig, unsigned long not_sevSig, kStrategy strat); |
---|
| 545 | BOOLEAN syzCriterionInc(poly sig, unsigned long not_sevSig, kStrategy strat); |
---|
| 546 | KINLINE BOOLEAN arriRewDummy(poly sig, unsigned long not_sevSig, kStrategy strat, int start); |
---|
| 547 | BOOLEAN arriRewCriterion(poly sig, unsigned long not_sevSig, kStrategy strat, int start); |
---|
| 548 | BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, kStrategy strat, int start); |
---|
| 549 | BOOLEAN findMinLMPair(poly sig, unsigned long not_sevSig, kStrategy strat, int start); |
---|
[35aab3] | 550 | // returns index of p in TSet, or -1 if not found |
---|
| 551 | int kFindInT(poly p, TSet T, int tlength); |
---|
| 552 | |
---|
| 553 | // return -1 if no divisor is found |
---|
| 554 | // number of first divisor, otherwise |
---|
| 555 | int kFindDivisibleByInT(const TSet &T, const unsigned long* sevT, |
---|
| 556 | const int tl, const LObject* L, const int start=0); |
---|
| 557 | // same with S |
---|
[391323] | 558 | int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject* L); |
---|
[35aab3] | 559 | |
---|
[7ba059] | 560 | int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L); |
---|
[35aab3] | 561 | TObject* |
---|
| 562 | kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T, |
---|
| 563 | long ecart = LONG_MAX); |
---|
| 564 | |
---|
| 565 | /*************************************************************** |
---|
| 566 | * |
---|
| 567 | * stuff to be inlined |
---|
| 568 | * |
---|
| 569 | ***************************************************************/ |
---|
| 570 | |
---|
| 571 | KINLINE TSet initT (); |
---|
| 572 | KINLINE TObject** initR(); |
---|
| 573 | KINLINE unsigned long* initsevT(); |
---|
| 574 | KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin); |
---|
| 575 | KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin); |
---|
| 576 | KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin); |
---|
| 577 | KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing, omBin bin); |
---|
| 578 | |
---|
| 579 | KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing); |
---|
| 580 | KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing); |
---|
| 581 | KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing); |
---|
| 582 | KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing); |
---|
| 583 | |
---|
| 584 | // if exp bound is not violated, return TRUE and |
---|
| 585 | // get m1 = LCM(LM(p1), LM(p2))/LM(p1) |
---|
| 586 | // m2 = LCM(LM(p1), LM(p2))/LM(p2) |
---|
| 587 | // return FALSE and m1 == NULL, m2 == NULL , otherwise |
---|
| 588 | KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r, |
---|
| 589 | poly &m1, poly &m2, const ring m_r); |
---|
[d681e8] | 590 | #ifdef HAVE_RINGS |
---|
[ca371d] | 591 | KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing, |
---|
[d681e8] | 592 | poly &m1, poly &m2, poly &lcm, const ring taiRing); |
---|
| 593 | #endif |
---|
[35aab3] | 594 | #ifdef KDEBUG |
---|
| 595 | // test strat |
---|
| 596 | BOOLEAN kTest(kStrategy strat); |
---|
| 597 | // test strat, and test that S is contained in T |
---|
| 598 | BOOLEAN kTest_TS(kStrategy strat); |
---|
| 599 | // test LObject |
---|
| 600 | BOOLEAN kTest_L(LObject* L, ring tailRing = NULL, |
---|
| 601 | BOOLEAN testp = FALSE, int lpos = -1, |
---|
| 602 | TSet T = NULL, int tlength = -1); |
---|
| 603 | // test TObject |
---|
| 604 | BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?'); |
---|
| 605 | // test set strat->SevS |
---|
| 606 | BOOLEAN kTest_S(kStrategy strat); |
---|
| 607 | #else |
---|
[d101b1] | 608 | #define kTest(A) (TRUE) |
---|
| 609 | #define kTest_TS(A) (TRUE) |
---|
| 610 | #define kTest_T(T) (TRUE) |
---|
| 611 | #define kTest_S(T) (TRUE) |
---|
| 612 | #define kTest_L(T) (TRUE) |
---|
[35aab3] | 613 | #endif |
---|
| 614 | |
---|
| 615 | |
---|
| 616 | /*************************************************************** |
---|
| 617 | * |
---|
| 618 | * From kstd2.cc |
---|
| 619 | * |
---|
| 620 | ***************************************************************/ |
---|
[a6889e] | 621 | poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing); |
---|
[35aab3] | 622 | ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat); |
---|
[83be980] | 623 | ideal sba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat); |
---|
[35aab3] | 624 | poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce); |
---|
| 625 | ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce); |
---|
| 626 | void initBba(ideal F,kStrategy strat); |
---|
[83be980] | 627 | void initSba(ideal F,kStrategy strat); |
---|
[a9c298] | 628 | void f5c (kStrategy strat, int& olddeg, int& minimcnt, int& hilbeledeg, |
---|
[83be980] | 629 | int& hilbcount, int& srmax, int& lrmax, int& reduc, ideal Q, |
---|
| 630 | intvec *w,intvec *hilb ); |
---|
[35aab3] | 631 | |
---|
| 632 | /*************************************************************** |
---|
| 633 | * |
---|
[c25b56c] | 634 | * From kspoly.cc |
---|
[35aab3] | 635 | * |
---|
| 636 | ***************************************************************/ |
---|
| 637 | // Reduces PR with PW |
---|
| 638 | // Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR) |
---|
| 639 | // Changes: PR |
---|
| 640 | // Const: PW |
---|
| 641 | // If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW) |
---|
| 642 | // If strat != NULL, tailRing is changed if reduction would violate exp bound |
---|
| 643 | // of tailRing |
---|
| 644 | // Returns: 0 everything ok, no tailRing change |
---|
| 645 | // 1 tailRing has successfully changed (strat != NULL) |
---|
| 646 | // 2 no reduction performed, tailRing needs to be changed first |
---|
| 647 | // (strat == NULL) |
---|
| 648 | // -1 tailRing change could not be performed due to exceeding exp |
---|
| 649 | // bound of currRing |
---|
| 650 | int ksReducePoly(LObject* PR, |
---|
| 651 | TObject* PW, |
---|
| 652 | poly spNoether = NULL, |
---|
| 653 | number *coef = NULL, |
---|
| 654 | kStrategy strat = NULL); |
---|
| 655 | |
---|
[83be980] | 656 | // Reduces PR with PW |
---|
| 657 | // Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR) |
---|
| 658 | // Changes: PR |
---|
| 659 | // Const: PW |
---|
| 660 | // If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW) |
---|
| 661 | // If strat != NULL, tailRing is changed if reduction would violate exp bound |
---|
| 662 | // of tailRing |
---|
| 663 | // Returns: 0 everything ok, no tailRing change |
---|
| 664 | // 1 tailRing has successfully changed (strat != NULL) |
---|
| 665 | // 2 no reduction performed, tailRing needs to be changed first |
---|
| 666 | // (strat == NULL) |
---|
| 667 | // 3 no reduction performed, not sig-safe!!! |
---|
| 668 | // -1 tailRing change could not be performed due to exceeding exp |
---|
| 669 | // bound of currRing |
---|
| 670 | int ksReducePolySig(LObject* PR, |
---|
| 671 | TObject* PW, |
---|
| 672 | long idx, |
---|
| 673 | poly spNoether = NULL, |
---|
| 674 | number *coef = NULL, |
---|
| 675 | kStrategy strat = NULL); |
---|
| 676 | |
---|
[35aab3] | 677 | // Reduces PR at Current->next with PW |
---|
| 678 | // Assumes PR != NULL, Current contained in PR |
---|
| 679 | // Current->next != NULL, LM(PW) devides LM(Current->next) |
---|
| 680 | // Changes: PR |
---|
| 681 | // Const: PW |
---|
| 682 | // Return: see ksReducePoly |
---|
| 683 | int ksReducePolyTail(LObject* PR, |
---|
| 684 | TObject* PW, |
---|
| 685 | poly Current, |
---|
| 686 | poly spNoether = NULL); |
---|
| 687 | |
---|
| 688 | KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red); |
---|
| 689 | |
---|
| 690 | // Creates S-Poly of Pair |
---|
| 691 | // Const: Pair->p1, Pair->p2 |
---|
| 692 | // Changes: Pair->p == S-Poly of p1, p2 |
---|
| 693 | // Assume: Pair->p1 != NULL && Pair->p2 |
---|
| 694 | void ksCreateSpoly(LObject* Pair, poly spNoether = NULL, |
---|
| 695 | int use_buckets=0, ring tailRing=currRing, |
---|
| 696 | poly m1 = NULL, poly m2 = NULL, TObject** R = NULL); |
---|
| 697 | |
---|
| 698 | /*2 |
---|
| 699 | * creates the leading term of the S-polynomial of p1 and p2 |
---|
| 700 | * do not destroy p1 and p2 |
---|
| 701 | * remarks: |
---|
| 702 | * 1. the coefficient is 0 (nNew) |
---|
| 703 | * 2. pNext is undefined |
---|
| 704 | */ |
---|
| 705 | poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing); |
---|
| 706 | |
---|
| 707 | |
---|
| 708 | // old stuff |
---|
| 709 | KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL); |
---|
| 710 | KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL); |
---|
| 711 | KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing); |
---|
| 712 | KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing); |
---|
| 713 | |
---|
| 714 | /*************************************************************** |
---|
| 715 | * |
---|
| 716 | * Routines related for ring changes during std computations |
---|
| 717 | * |
---|
| 718 | ***************************************************************/ |
---|
| 719 | // return TRUE and set m1, m2 to k_GetLcmTerms, |
---|
| 720 | // if spoly creation of strat->P does not violate |
---|
| 721 | // exponent bound of strat->tailRing |
---|
| 722 | // FALSE, otherwise |
---|
| 723 | BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2); |
---|
[7245240] | 724 | #ifdef HAVE_RINGS |
---|
| 725 | // return TRUE if gcdpoly creation of R[atR] and S[atS] does not violate |
---|
| 726 | // exponent bound of strat->tailRing |
---|
| 727 | // FALSE, otherwise |
---|
| 728 | BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat); |
---|
| 729 | #endif |
---|
[35aab3] | 730 | // change strat->tailRing and adjust all data in strat, L, and T: |
---|
| 731 | // new tailRing has larger exponent bound |
---|
| 732 | // do nothing and return FALSE if exponent bound increase would result in |
---|
| 733 | // larger exponent bound that that of currRing |
---|
| 734 | BOOLEAN kStratChangeTailRing(kStrategy strat, |
---|
| 735 | LObject* L = NULL, TObject* T = NULL, |
---|
| 736 | // take this as new_expbound: if 0 |
---|
| 737 | // new expbound is 2*expbound of tailRing |
---|
| 738 | unsigned long new_expbound = 0); |
---|
| 739 | // initiate a change of the tailRing of strat -- should be called |
---|
| 740 | // right before main loop in bba |
---|
| 741 | void kStratInitChangeTailRing(kStrategy strat); |
---|
| 742 | |
---|
[4f7d76] | 743 | /// Output some debug info about a given strategy |
---|
| 744 | void kDebugPrint(kStrategy strat); |
---|
| 745 | |
---|
[83be980] | 746 | // getting sb order for sba computations |
---|
| 747 | ring sbaRing(kStrategy strat, const ring r=currRing, BOOLEAN complete=TRUE, int sgn=1); |
---|
[4f7d76] | 748 | |
---|
[ec69aa] | 749 | KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k, |
---|
| 750 | kStrategy strat); |
---|
[1f637e] | 751 | |
---|
[c6e80e] | 752 | #include <kernel/kInline.h> |
---|
[35aab3] | 753 | |
---|
[cb0fbe] | 754 | /* shiftgb stuff */ |
---|
[599326] | 755 | #include <kernel/shiftgb.h> |
---|
[35aab3] | 756 | |
---|
[4d2ab5c] | 757 | poly pMove2CurrTail(poly p, kStrategy strat); |
---|
| 758 | |
---|
| 759 | poly pMoveCurrTail2poly(poly p, kStrategy strat); |
---|
| 760 | |
---|
| 761 | poly pCopyL2p(LObject h, kStrategy strat); |
---|
| 762 | |
---|
[37a4c3] | 763 | void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV); |
---|
[cb0fbe] | 764 | |
---|
[37a4c3] | 765 | void initBuchMoraShift (ideal F,ideal Q,kStrategy strat); |
---|
| 766 | |
---|
| 767 | void enterOnePairManyShifts (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); // ok |
---|
| 768 | |
---|
| 769 | void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); |
---|
| 770 | |
---|
[4d2ab5c] | 771 | 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); // ok |
---|
[37a4c3] | 772 | |
---|
| 773 | void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV); |
---|
| 774 | |
---|
[a9c298] | 775 | void initenterpairsShift (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR,int uptodeg, int lV); |
---|
[37a4c3] | 776 | |
---|
| 777 | void updateSShift(kStrategy strat,int uptodeg,int lV); |
---|
[cb0fbe] | 778 | |
---|
| 779 | void initBbaShift(ideal F,kStrategy strat); |
---|
| 780 | |
---|
[37a4c3] | 781 | poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize); |
---|
| 782 | |
---|
| 783 | int redFirstShift (LObject* h,kStrategy strat); // ok |
---|
[cb0fbe] | 784 | |
---|
| 785 | ideal freegb(ideal I, int uptodeg, int lVblock); |
---|
[1c473f] | 786 | |
---|
| 787 | ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat, int uptodeg, int lV); |
---|
[57fad3a] | 788 | // test syz strategy: // will be removed soon |
---|
| 789 | extern int (*test_PosInT)(const TSet T,const int tl,LObject &h); |
---|
| 790 | extern int (*test_PosInL)(const LSet set, const int length, |
---|
| 791 | LObject* L,const kStrategy strat); |
---|
[35aab3] | 792 | #endif |
---|