| 1 | #ifndef KUTIL_H |
|---|
| 2 | #define KUTIL_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id: kutil.h,v 1.8 2005-12-19 13:56:05 bricken Exp $ */ |
|---|
| 7 | /* |
|---|
| 8 | * ABSTRACT: kernel: utils for kStd |
|---|
| 9 | */ |
|---|
| 10 | |
|---|
| 11 | |
|---|
| 12 | #include <string.h> |
|---|
| 13 | #include <mylimits.h> |
|---|
| 14 | |
|---|
| 15 | #include "structs.h" |
|---|
| 16 | #include "omalloc.h" |
|---|
| 17 | #include "ring.h" |
|---|
| 18 | #include "structs.h" |
|---|
| 19 | #include "pShallowCopyDelete.h" |
|---|
| 20 | |
|---|
| 21 | #if 1 |
|---|
| 22 | #define setmax 16 |
|---|
| 23 | #define setmaxL 56 |
|---|
| 24 | #define setmaxLinc 32 |
|---|
| 25 | #define setmaxT 64 |
|---|
| 26 | #define setmaxTinc 32 |
|---|
| 27 | #else |
|---|
| 28 | #define setmax 16 |
|---|
| 29 | #define setmaxL 16 |
|---|
| 30 | #define setmaxLinc 16 |
|---|
| 31 | #define setmaxT 16 |
|---|
| 32 | #define setmaxTinc 16 |
|---|
| 33 | #endif |
|---|
| 34 | |
|---|
| 35 | // define if you want std computations as in Singular version < 2 |
|---|
| 36 | // This disbales RedThrough, tailReductions against T (bba), |
|---|
| 37 | // sets posInT = posInT15 (bba, strat->honey), and enables redFirst with LDeg |
|---|
| 38 | // NOTE: the same effect can be achieved with option(oldStd) |
|---|
| 39 | // #define HAVE_OLD_STD |
|---|
| 40 | |
|---|
| 41 | #ifdef HAVE_OLD_STD |
|---|
| 42 | #define K_TEST_OPT_REDTHROUGH 0 |
|---|
| 43 | #define K_TEST_OPT_OLDSTD 1 |
|---|
| 44 | #else |
|---|
| 45 | #define K_TEST_OPT_REDTHROUGH TEST_OPT_REDTHROUGH |
|---|
| 46 | #define K_TEST_OPT_OLDSTD TEST_OPT_OLDSTD |
|---|
| 47 | #endif |
|---|
| 48 | |
|---|
| 49 | #undef NO_KINLINE |
|---|
| 50 | #if !defined(KDEBUG) && !defined(NO_INLINE) |
|---|
| 51 | #define KINLINE inline |
|---|
| 52 | #else |
|---|
| 53 | #define KINLINE |
|---|
| 54 | #define NO_KINLINE 1 |
|---|
| 55 | #endif |
|---|
| 56 | |
|---|
| 57 | typedef int* intset; |
|---|
| 58 | typedef int64 wlen_type; |
|---|
| 59 | typedef wlen_type* wlen_set; |
|---|
| 60 | |
|---|
| 61 | typedef class sTObject TObject; |
|---|
| 62 | typedef class sLObject LObject; |
|---|
| 63 | typedef TObject * TSet; |
|---|
| 64 | typedef LObject * LSet; |
|---|
| 65 | |
|---|
| 66 | class sTObject |
|---|
| 67 | { |
|---|
| 68 | public: |
|---|
| 69 | poly p; // Lm(p) \in currRing Tail(p) \in tailRing |
|---|
| 70 | poly t_p; // t_p \in tailRing: as monomials Lm(t_p) == Lm(p) |
|---|
| 71 | ring tailRing; |
|---|
| 72 | poly max; // p_GetMaxExpP(pNext(p)) |
|---|
| 73 | long FDeg; // pFDeg(p) |
|---|
| 74 | int ecart, |
|---|
| 75 | length, // as of pLDeg |
|---|
| 76 | pLength, // either == 0, or == pLength(p) |
|---|
| 77 | i_r; // index of TObject in R set, or -1 if not in T |
|---|
| 78 | BOOLEAN is_normalized; // true, if pNorm was called on p, false otherwise |
|---|
| 79 | |
|---|
| 80 | // initialization |
|---|
| 81 | KINLINE void Init(ring r = currRing); |
|---|
| 82 | KINLINE sTObject(ring tailRing = currRing); |
|---|
| 83 | KINLINE sTObject(poly p, ring tailRing = currRing); |
|---|
| 84 | KINLINE sTObject(poly p, ring c_r, ring tailRing); |
|---|
| 85 | KINLINE sTObject(sTObject* T, int copy); |
|---|
| 86 | |
|---|
| 87 | KINLINE void Set(ring r=currRing); |
|---|
| 88 | KINLINE void Set(poly p_in, ring r=currRing); |
|---|
| 89 | KINLINE void Set(poly p_in, ring c_r, ring t_r); |
|---|
| 90 | |
|---|
| 91 | // Frees the polys of T |
|---|
| 92 | KINLINE void Delete(); |
|---|
| 93 | // Sets polys to NULL |
|---|
| 94 | KINLINE void Clear(); |
|---|
| 95 | // makes a copy of the poly of T |
|---|
| 96 | KINLINE void Copy(); |
|---|
| 97 | |
|---|
| 98 | // ring-dependent Lm access: these might result in allocation of monomials |
|---|
| 99 | KINLINE poly GetLmCurrRing(); |
|---|
| 100 | KINLINE poly GetLmTailRing(); |
|---|
| 101 | KINLINE poly GetLm(ring r); |
|---|
| 102 | // this returns Lm and ring r (preferably from tailRing), but does not |
|---|
| 103 | // allocate a new poly |
|---|
| 104 | KINLINE void GetLm(poly &p, ring &r) const; |
|---|
| 105 | |
|---|
| 106 | #ifdef OLIVER_PRIVAT_LT |
|---|
| 107 | // routines for calc. with rings |
|---|
| 108 | KINLINE poly GetLtCurrRing(); |
|---|
| 109 | KINLINE poly GetLtTailRing(); |
|---|
| 110 | KINLINE poly GetLt(ring r); |
|---|
| 111 | KINLINE void GetLt(poly &p, ring &r) const; |
|---|
| 112 | #endif |
|---|
| 113 | |
|---|
| 114 | KINLINE BOOLEAN IsNull() const; |
|---|
| 115 | |
|---|
| 116 | KINLINE int GetpLength(); |
|---|
| 117 | |
|---|
| 118 | // makes sure that T.p exists |
|---|
| 119 | KINLINE void SetLmCurrRing(); |
|---|
| 120 | |
|---|
| 121 | // Iterations |
|---|
| 122 | // simply get the next monomial |
|---|
| 123 | KINLINE poly Next(); |
|---|
| 124 | KINLINE void LmDeleteAndIter(); |
|---|
| 125 | |
|---|
| 126 | // deg stuff |
|---|
| 127 | // computes pFDeg |
|---|
| 128 | KINLINE long pFDeg() const; |
|---|
| 129 | // computes and sets FDeg |
|---|
| 130 | KINLINE long SetpFDeg(); |
|---|
| 131 | // gets stored FDeg |
|---|
| 132 | KINLINE long GetpFDeg() const; |
|---|
| 133 | |
|---|
| 134 | // computes pLDeg |
|---|
| 135 | KINLINE long pLDeg(); |
|---|
| 136 | // sets length, FDeg, returns LDeg |
|---|
| 137 | KINLINE long SetDegStuffReturnLDeg(); |
|---|
| 138 | |
|---|
| 139 | // arithmetic |
|---|
| 140 | KINLINE void Mult_nn(number n); |
|---|
| 141 | KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin, |
|---|
| 142 | pShallowCopyDeleteProc p_shallow_copy_delete, |
|---|
| 143 | BOOLEAN set_max = TRUE); |
|---|
| 144 | // manipulations |
|---|
| 145 | KINLINE void pNorm(); |
|---|
| 146 | KINLINE void pCleardenom(); |
|---|
| 147 | |
|---|
| 148 | #ifdef KDEBUG |
|---|
| 149 | void wrp(); |
|---|
| 150 | #endif |
|---|
| 151 | }; |
|---|
| 152 | |
|---|
| 153 | #ifndef NDEBUG |
|---|
| 154 | extern int strat_nr; |
|---|
| 155 | extern int strat_fac_debug; |
|---|
| 156 | #endif |
|---|
| 157 | |
|---|
| 158 | class sLObject : public sTObject |
|---|
| 159 | { |
|---|
| 160 | |
|---|
| 161 | public: |
|---|
| 162 | unsigned long sev; |
|---|
| 163 | poly p1,p2; /*- the pair p comes from -*/ |
|---|
| 164 | |
|---|
| 165 | poly lcm; /*- the lcm of p1,p2 -*/ |
|---|
| 166 | poly last; // pLast(p) during reductions |
|---|
| 167 | kBucket_pt bucket; |
|---|
| 168 | int i_r1, i_r2; |
|---|
| 169 | |
|---|
| 170 | // initialization |
|---|
| 171 | KINLINE void Init(ring tailRing = currRing); |
|---|
| 172 | KINLINE sLObject(ring tailRing = currRing); |
|---|
| 173 | KINLINE sLObject(poly p, ring tailRing = currRing); |
|---|
| 174 | KINLINE sLObject(poly p, ring c_r, ring tailRing); |
|---|
| 175 | |
|---|
| 176 | // Frees the polys of L |
|---|
| 177 | KINLINE void Delete(); |
|---|
| 178 | KINLINE void Clear(); |
|---|
| 179 | |
|---|
| 180 | // Iterations |
|---|
| 181 | KINLINE void LmDeleteAndIter(); |
|---|
| 182 | KINLINE poly LmExtractAndIter(); |
|---|
| 183 | |
|---|
| 184 | // spoly related things |
|---|
| 185 | // preparation for reduction if not spoly |
|---|
| 186 | KINLINE void PrepareRed(BOOLEAN use_bucket); |
|---|
| 187 | KINLINE void SetLmTail(poly lm, poly new_p, int length, |
|---|
| 188 | int use_bucket, ring r, poly last); |
|---|
| 189 | KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether); |
|---|
| 190 | KINLINE void Tail_Mult_nn(number n); |
|---|
| 191 | // deletes bucket, makes sure that p and t_p exists |
|---|
| 192 | KINLINE poly GetP(omBin lmBin = NULL); |
|---|
| 193 | // similar, except that only t_p exists |
|---|
| 194 | KINLINE poly GetTP(); |
|---|
| 195 | |
|---|
| 196 | // does not delete bucket, just canonicalizes it |
|---|
| 197 | // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing |
|---|
| 198 | KINLINE poly CanonicalizeP(); |
|---|
| 199 | |
|---|
| 200 | // makes a copy of the poly of L |
|---|
| 201 | KINLINE void Copy(); |
|---|
| 202 | // gets the poly and makes a copy of it |
|---|
| 203 | KINLINE poly CopyGetP(); |
|---|
| 204 | |
|---|
| 205 | KINLINE int GetpLength(); |
|---|
| 206 | KINLINE long pLDeg(BOOLEAN use_last); |
|---|
| 207 | KINLINE long pLDeg(); |
|---|
| 208 | KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE); |
|---|
| 209 | KINLINE long SetDegStuffReturnLDeg(); |
|---|
| 210 | KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last); |
|---|
| 211 | |
|---|
| 212 | // returns minimal component of p |
|---|
| 213 | KINLINE long MinComp(); |
|---|
| 214 | // returns component of p |
|---|
| 215 | KINLINE long Comp(); |
|---|
| 216 | |
|---|
| 217 | KINLINE void ShallowCopyDelete(ring new_tailRing, |
|---|
| 218 | pShallowCopyDeleteProc p_shallow_copy_delete); |
|---|
| 219 | |
|---|
| 220 | // sets sev |
|---|
| 221 | KINLINE void SetShortExpVector(); |
|---|
| 222 | |
|---|
| 223 | // enable assignment from TObject |
|---|
| 224 | KINLINE sLObject& operator=(const sTObject&); |
|---|
| 225 | |
|---|
| 226 | // get T's corresponding to p1, p2: they might return NULL |
|---|
| 227 | KINLINE TObject* T_1(const skStrategy* strat); |
|---|
| 228 | KINLINE TObject* T_2(const skStrategy* strat); |
|---|
| 229 | KINLINE void T_1_2(const skStrategy* strat, |
|---|
| 230 | TObject* &T_1, TObject* &T_2); |
|---|
| 231 | |
|---|
| 232 | // simplify coefficients |
|---|
| 233 | KINLINE void Normalize(); |
|---|
| 234 | KINLINE void HeadNormalize(); |
|---|
| 235 | }; |
|---|
| 236 | |
|---|
| 237 | |
|---|
| 238 | extern int HCord; |
|---|
| 239 | |
|---|
| 240 | class skStrategy; |
|---|
| 241 | typedef skStrategy * kStrategy; |
|---|
| 242 | class skStrategy |
|---|
| 243 | { |
|---|
| 244 | public: |
|---|
| 245 | kStrategy next; |
|---|
| 246 | int (*red)(LObject * L,kStrategy strat); |
|---|
| 247 | void (*initEcart)(LObject * L); |
|---|
| 248 | int (*posInT)(const TSet T,const int tl,LObject &h); |
|---|
| 249 | int (*posInL)(const LSet set, const int length, |
|---|
| 250 | LObject* L,const kStrategy strat); |
|---|
| 251 | void (*enterS)(LObject h, int pos,kStrategy strat, int atR/* =-1*/ ); |
|---|
| 252 | void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG); |
|---|
| 253 | int (*posInLOld)(const LSet Ls,const int Ll, |
|---|
| 254 | LObject* Lo,const kStrategy strat); |
|---|
| 255 | pFDegProc pOrigFDeg; |
|---|
| 256 | pLDegProc pOrigLDeg; |
|---|
| 257 | pFDegProc pOrigFDeg_TailRing; |
|---|
| 258 | pLDegProc pOrigLDeg_TailRing; |
|---|
| 259 | |
|---|
| 260 | LObject P; |
|---|
| 261 | ideal Shdl; |
|---|
| 262 | ideal D; /*V(S) is in D(D)*/ |
|---|
| 263 | ideal M; /*set of minimal generators*/ |
|---|
| 264 | polyset S; |
|---|
| 265 | intset ecartS; |
|---|
| 266 | intset lenS; |
|---|
| 267 | wlen_set lenSw; /* for tgb.ccc */ |
|---|
| 268 | intset fromQ; |
|---|
| 269 | unsigned long* sevS; |
|---|
| 270 | unsigned long* sevT; |
|---|
| 271 | TSet T; |
|---|
| 272 | LSet L; |
|---|
| 273 | LSet B; |
|---|
| 274 | poly kHEdge; |
|---|
| 275 | poly kNoether; |
|---|
| 276 | poly t_kHEdge; // same polys in tailring |
|---|
| 277 | KINLINE poly kNoetherTail(); |
|---|
| 278 | poly t_kNoether; |
|---|
| 279 | BOOLEAN * NotUsedAxis; |
|---|
| 280 | poly tail; |
|---|
| 281 | leftv kIdeal; |
|---|
| 282 | intvec * kModW; |
|---|
| 283 | intvec * kHomW; |
|---|
| 284 | // procedure for ShalloCopy from tailRing to currRing |
|---|
| 285 | pShallowCopyDeleteProc p_shallow_copy_delete; |
|---|
| 286 | // pointers to Tobjects R[i] is ith Tobject which is generated |
|---|
| 287 | TObject** R; |
|---|
| 288 | // S_2_R[i] yields Tobject which corresponds to S[i] |
|---|
| 289 | int* S_2_R; |
|---|
| 290 | ring tailRing; |
|---|
| 291 | omBin lmBin; |
|---|
| 292 | omBin tailBin; |
|---|
| 293 | #ifndef NDEBUG |
|---|
| 294 | int nr; |
|---|
| 295 | #endif |
|---|
| 296 | int cp,c3; |
|---|
| 297 | int sl,mu; |
|---|
| 298 | int tl,tmax; |
|---|
| 299 | int Ll,Lmax; |
|---|
| 300 | int Bl,Bmax; |
|---|
| 301 | int ak,LazyDegree,LazyPass; |
|---|
| 302 | int syzComp; |
|---|
| 303 | int HCord; |
|---|
| 304 | int lastAxis; |
|---|
| 305 | int newIdeal; |
|---|
| 306 | int minim; |
|---|
| 307 | BOOLEAN interpt; |
|---|
| 308 | BOOLEAN homog; |
|---|
| 309 | BOOLEAN kHEdgeFound; |
|---|
| 310 | BOOLEAN honey,sugarCrit; |
|---|
| 311 | BOOLEAN Gebauer,noTailReduction; |
|---|
| 312 | BOOLEAN fromT; |
|---|
| 313 | BOOLEAN noetherSet; |
|---|
| 314 | BOOLEAN update; |
|---|
| 315 | BOOLEAN posInLOldFlag; |
|---|
| 316 | BOOLEAN use_buckets; |
|---|
| 317 | BOOLEAN interred_flag; |
|---|
| 318 | BOOLEAN *pairtest;/*used for enterOnePair*/ |
|---|
| 319 | // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength) |
|---|
| 320 | BOOLEAN LDegLast; |
|---|
| 321 | // if set, then L.length == L.pLength |
|---|
| 322 | BOOLEAN length_pLength; |
|---|
| 323 | // if set, then posInL does not depend on L.length |
|---|
| 324 | BOOLEAN posInLDependsOnLength; |
|---|
| 325 | /*FALSE, if posInL == posInL10*/ |
|---|
| 326 | char redTailChange; |
|---|
| 327 | char news; |
|---|
| 328 | char newt;/*used for messageSets*/ |
|---|
| 329 | |
|---|
| 330 | skStrategy(); |
|---|
| 331 | ~skStrategy(); |
|---|
| 332 | |
|---|
| 333 | // return TObject corresponding to S[i]: assume that it exists |
|---|
| 334 | // i.e. no error checking is done |
|---|
| 335 | KINLINE TObject* S_2_T(int i); |
|---|
| 336 | // like S_2_T, except that NULL is returned if it can not be found |
|---|
| 337 | KINLINE TObject* s_2_t(int i); |
|---|
| 338 | }; |
|---|
| 339 | |
|---|
| 340 | void deleteHC(poly *p, int *e, int *l, kStrategy strat); |
|---|
| 341 | void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE); |
|---|
| 342 | void deleteInS (int i,kStrategy strat); |
|---|
| 343 | void cleanT (kStrategy strat); |
|---|
| 344 | LSet initL (); |
|---|
| 345 | void deleteInL(LSet set, int *length, int j,kStrategy strat); |
|---|
| 346 | void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at); |
|---|
| 347 | void enterSBba (LObject p,int atS,kStrategy strat, int atR = -1); |
|---|
| 348 | void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG); |
|---|
| 349 | void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG); |
|---|
| 350 | int posInS (kStrategy strat,int length,poly p, int ecart_p); |
|---|
| 351 | int posInT0 (const TSet set,const int length,LObject &p); |
|---|
| 352 | int posInT1 (const TSet set,const int length,LObject &p); |
|---|
| 353 | int posInT2 (const TSet set,const int length,LObject &p); |
|---|
| 354 | int posInT11 (const TSet set,const int length,LObject &p); |
|---|
| 355 | int posInT110 (const TSet set,const int length,LObject &p); |
|---|
| 356 | int posInT13 (const TSet set,const int length,LObject &p); |
|---|
| 357 | int posInT15 (const TSet set,const int length,LObject &p); |
|---|
| 358 | int posInT17 (const TSet set,const int length,LObject &p); |
|---|
| 359 | int posInT19 (const TSet set,const int length,LObject &p); |
|---|
| 360 | int posInT_EcartpLength(const TSet set,const int length,LObject &p); |
|---|
| 361 | |
|---|
| 362 | #ifdef HAVE_MORE_POS_IN_T |
|---|
| 363 | int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p); |
|---|
| 364 | int posInT_FDegpLength(const TSet set,const int length,LObject &p); |
|---|
| 365 | int posInT_pLength(const TSet set,const int length,LObject &p); |
|---|
| 366 | #endif |
|---|
| 367 | |
|---|
| 368 | |
|---|
| 369 | void reorderS (int* suc,kStrategy strat); |
|---|
| 370 | int posInL0 (const LSet set, const int length, |
|---|
| 371 | LObject* L,const kStrategy strat); |
|---|
| 372 | int posInL11 (const LSet set, const int length, |
|---|
| 373 | LObject* L,const kStrategy strat); |
|---|
| 374 | int posInL13 (const LSet set, const int length, |
|---|
| 375 | LObject* L,const kStrategy strat); |
|---|
| 376 | int posInL15 (const LSet set, const int length, |
|---|
| 377 | LObject* L,const kStrategy strat); |
|---|
| 378 | int posInL17 (const LSet set, const int length, |
|---|
| 379 | LObject* L,const kStrategy strat); |
|---|
| 380 | int posInL10 (const LSet set, const int length, |
|---|
| 381 | LObject* L,const kStrategy strat); |
|---|
| 382 | KINLINE poly redtailBba (poly p,int pos,kStrategy strat); |
|---|
| 383 | poly redtailBba (LObject *L, int pos,kStrategy strat, BOOLEAN withT = FALSE); |
|---|
| 384 | poly redtailBba (TObject *T, int pos,kStrategy strat, BOOLEAN withT = FALSE); |
|---|
| 385 | poly redtail (poly p,int pos,kStrategy strat); |
|---|
| 386 | poly redtail (LObject *L,int pos,kStrategy strat); |
|---|
| 387 | poly redNF (poly h,kStrategy strat); |
|---|
| 388 | int redNF0 (LObject *P,kStrategy strat); |
|---|
| 389 | poly redNFTail (poly h,const int sl,kStrategy strat); |
|---|
| 390 | int redHoney (LObject* h, kStrategy strat); |
|---|
| 391 | #ifdef HAVE_RING2TOM |
|---|
| 392 | int redRing2toM (LObject* h,kStrategy strat); |
|---|
| 393 | #endif |
|---|
| 394 | int redLazy (LObject* h,kStrategy strat); |
|---|
| 395 | int redHomog (LObject* h,kStrategy strat); |
|---|
| 396 | void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1); |
|---|
| 397 | void entersets (LObject h); |
|---|
| 398 | void pairs (); |
|---|
| 399 | void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result); |
|---|
| 400 | void messageStat (int srmax,int lrmax,int hilbcount,kStrategy strat); |
|---|
| 401 | #ifdef KDEBUG |
|---|
| 402 | void messageSets (kStrategy strat); |
|---|
| 403 | #else |
|---|
| 404 | #define messageSets(s) ((void) 0) |
|---|
| 405 | #endif |
|---|
| 406 | |
|---|
| 407 | void initEcartNormal (LObject* h); |
|---|
| 408 | void initEcartBBA (LObject* h); |
|---|
| 409 | void initS (ideal F, ideal Q,kStrategy strat); |
|---|
| 410 | void initSL (ideal F, ideal Q,kStrategy strat); |
|---|
| 411 | void updateS(BOOLEAN toT,kStrategy strat); |
|---|
| 412 | void enterT (LObject p,kStrategy strat, int atT = -1); |
|---|
| 413 | void cancelunit (LObject* p); |
|---|
| 414 | void HEckeTest (poly pp,kStrategy strat); |
|---|
| 415 | void initBuchMoraCrit(kStrategy strat); |
|---|
| 416 | void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat); |
|---|
| 417 | void initBuchMoraPos(kStrategy strat); |
|---|
| 418 | void initBuchMora (ideal F, ideal Q,kStrategy strat); |
|---|
| 419 | void exitBuchMora (kStrategy strat); |
|---|
| 420 | void updateResult(ideal r,ideal Q,kStrategy strat); |
|---|
| 421 | void completeReduce (kStrategy strat); |
|---|
| 422 | void kFreeStrat(kStrategy strat); |
|---|
| 423 | BOOLEAN homogTest(polyset F, int Fmax); |
|---|
| 424 | BOOLEAN newHEdge(polyset S, kStrategy strat); |
|---|
| 425 | // returns index of p in TSet, or -1 if not found |
|---|
| 426 | int kFindInT(poly p, TSet T, int tlength); |
|---|
| 427 | |
|---|
| 428 | // return -1 if no divisor is found |
|---|
| 429 | // number of first divisor, otherwise |
|---|
| 430 | int kFindDivisibleByInT(const TSet &T, const unsigned long* sevT, |
|---|
| 431 | const int tl, const LObject* L, const int start=0); |
|---|
| 432 | // same with S |
|---|
| 433 | int kFindDivisibleByInS(const polyset &S, const unsigned long* sev, |
|---|
| 434 | const int sl, LObject* L); |
|---|
| 435 | |
|---|
| 436 | TObject* |
|---|
| 437 | kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T, |
|---|
| 438 | long ecart = LONG_MAX); |
|---|
| 439 | |
|---|
| 440 | #ifdef HAVE_RING2TOM |
|---|
| 441 | // same for rings |
|---|
| 442 | int kRingFindDivisibleByInT(const TSet &T, const unsigned long* sevT, |
|---|
| 443 | const int tl, const LObject* L, const int start=0); |
|---|
| 444 | int kRingFindDivisibleByInS(const polyset &S, const unsigned long* sev, |
|---|
| 445 | const int sl, LObject* L); |
|---|
| 446 | |
|---|
| 447 | |
|---|
| 448 | TObject* |
|---|
| 449 | kRingFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T, |
|---|
| 450 | long ecart = LONG_MAX); |
|---|
| 451 | #endif |
|---|
| 452 | |
|---|
| 453 | /*************************************************************** |
|---|
| 454 | * |
|---|
| 455 | * stuff to be inlined |
|---|
| 456 | * |
|---|
| 457 | ***************************************************************/ |
|---|
| 458 | |
|---|
| 459 | KINLINE TSet initT (); |
|---|
| 460 | KINLINE TObject** initR(); |
|---|
| 461 | KINLINE unsigned long* initsevT(); |
|---|
| 462 | KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin); |
|---|
| 463 | KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin); |
|---|
| 464 | KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin); |
|---|
| 465 | KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing, omBin bin); |
|---|
| 466 | |
|---|
| 467 | KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing); |
|---|
| 468 | KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing); |
|---|
| 469 | KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing); |
|---|
| 470 | KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing); |
|---|
| 471 | |
|---|
| 472 | // if exp bound is not violated, return TRUE and |
|---|
| 473 | // get m1 = LCM(LM(p1), LM(p2))/LM(p1) |
|---|
| 474 | // m2 = LCM(LM(p1), LM(p2))/LM(p2) |
|---|
| 475 | // return FALSE and m1 == NULL, m2 == NULL , otherwise |
|---|
| 476 | KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r, |
|---|
| 477 | poly &m1, poly &m2, const ring m_r); |
|---|
| 478 | #ifdef KDEBUG |
|---|
| 479 | // test strat |
|---|
| 480 | BOOLEAN kTest(kStrategy strat); |
|---|
| 481 | // test strat, and test that S is contained in T |
|---|
| 482 | BOOLEAN kTest_TS(kStrategy strat); |
|---|
| 483 | // test LObject |
|---|
| 484 | BOOLEAN kTest_L(LObject* L, ring tailRing = NULL, |
|---|
| 485 | BOOLEAN testp = FALSE, int lpos = -1, |
|---|
| 486 | TSet T = NULL, int tlength = -1); |
|---|
| 487 | // test TObject |
|---|
| 488 | BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?'); |
|---|
| 489 | // test set strat->SevS |
|---|
| 490 | BOOLEAN kTest_S(kStrategy strat); |
|---|
| 491 | #else |
|---|
| 492 | #define kTest(A) ((void)0) |
|---|
| 493 | #define kTest_TS(A) ((void)0) |
|---|
| 494 | #define kTest_T(T) ((void)0) |
|---|
| 495 | #define kTest_S(T) ((void)0) |
|---|
| 496 | #define kTest_L(T) ((void)0) |
|---|
| 497 | #endif |
|---|
| 498 | |
|---|
| 499 | |
|---|
| 500 | /*************************************************************** |
|---|
| 501 | * |
|---|
| 502 | * From kstd2.cc |
|---|
| 503 | * |
|---|
| 504 | ***************************************************************/ |
|---|
| 505 | ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat); |
|---|
| 506 | poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce); |
|---|
| 507 | ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce); |
|---|
| 508 | void initBba(ideal F,kStrategy strat); |
|---|
| 509 | |
|---|
| 510 | /*************************************************************** |
|---|
| 511 | * |
|---|
| 512 | * From kSpolys.cc |
|---|
| 513 | * |
|---|
| 514 | ***************************************************************/ |
|---|
| 515 | // Reduces PR with PW |
|---|
| 516 | // Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR) |
|---|
| 517 | // Changes: PR |
|---|
| 518 | // Const: PW |
|---|
| 519 | // If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW) |
|---|
| 520 | // If strat != NULL, tailRing is changed if reduction would violate exp bound |
|---|
| 521 | // of tailRing |
|---|
| 522 | // Returns: 0 everything ok, no tailRing change |
|---|
| 523 | // 1 tailRing has successfully changed (strat != NULL) |
|---|
| 524 | // 2 no reduction performed, tailRing needs to be changed first |
|---|
| 525 | // (strat == NULL) |
|---|
| 526 | // -1 tailRing change could not be performed due to exceeding exp |
|---|
| 527 | // bound of currRing |
|---|
| 528 | int ksReducePoly(LObject* PR, |
|---|
| 529 | TObject* PW, |
|---|
| 530 | poly spNoether = NULL, |
|---|
| 531 | number *coef = NULL, |
|---|
| 532 | kStrategy strat = NULL); |
|---|
| 533 | |
|---|
| 534 | #ifdef HAVE_RING2TOM |
|---|
| 535 | // same for rings |
|---|
| 536 | int ksRingReducePoly(LObject* PR, |
|---|
| 537 | TObject* PW, |
|---|
| 538 | poly spNoether = NULL, |
|---|
| 539 | number *coef = NULL, |
|---|
| 540 | kStrategy strat = NULL); |
|---|
| 541 | #endif |
|---|
| 542 | |
|---|
| 543 | // Reduces PR at Current->next with PW |
|---|
| 544 | // Assumes PR != NULL, Current contained in PR |
|---|
| 545 | // Current->next != NULL, LM(PW) devides LM(Current->next) |
|---|
| 546 | // Changes: PR |
|---|
| 547 | // Const: PW |
|---|
| 548 | // Return: see ksReducePoly |
|---|
| 549 | int ksReducePolyTail(LObject* PR, |
|---|
| 550 | TObject* PW, |
|---|
| 551 | poly Current, |
|---|
| 552 | poly spNoether = NULL); |
|---|
| 553 | |
|---|
| 554 | KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red); |
|---|
| 555 | |
|---|
| 556 | // Creates S-Poly of Pair |
|---|
| 557 | // Const: Pair->p1, Pair->p2 |
|---|
| 558 | // Changes: Pair->p == S-Poly of p1, p2 |
|---|
| 559 | // Assume: Pair->p1 != NULL && Pair->p2 |
|---|
| 560 | void ksCreateSpoly(LObject* Pair, poly spNoether = NULL, |
|---|
| 561 | int use_buckets=0, ring tailRing=currRing, |
|---|
| 562 | poly m1 = NULL, poly m2 = NULL, TObject** R = NULL); |
|---|
| 563 | |
|---|
| 564 | /*2 |
|---|
| 565 | * creates the leading term of the S-polynomial of p1 and p2 |
|---|
| 566 | * do not destroy p1 and p2 |
|---|
| 567 | * remarks: |
|---|
| 568 | * 1. the coefficient is 0 (nNew) |
|---|
| 569 | * 2. pNext is undefined |
|---|
| 570 | */ |
|---|
| 571 | poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing); |
|---|
| 572 | |
|---|
| 573 | |
|---|
| 574 | /* |
|---|
| 575 | * input - output: a, b |
|---|
| 576 | * returns: |
|---|
| 577 | * a := a/gcd(a,b), b := b/gcd(a,b) |
|---|
| 578 | * and return value |
|---|
| 579 | * 0 -> a != 1, b != 1 |
|---|
| 580 | * 1 -> a == 1, b != 1 |
|---|
| 581 | * 2 -> a != 1, b == 1 |
|---|
| 582 | * 3 -> a == 1, b == 1 |
|---|
| 583 | * this value is used to control the spolys |
|---|
| 584 | */ |
|---|
| 585 | int ksCheckCoeff(number *a, number *b); |
|---|
| 586 | |
|---|
| 587 | // old stuff |
|---|
| 588 | KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL); |
|---|
| 589 | KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL); |
|---|
| 590 | KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing); |
|---|
| 591 | KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing); |
|---|
| 592 | |
|---|
| 593 | /*************************************************************** |
|---|
| 594 | * |
|---|
| 595 | * Routines related for ring changes during std computations |
|---|
| 596 | * |
|---|
| 597 | ***************************************************************/ |
|---|
| 598 | // return TRUE and set m1, m2 to k_GetLcmTerms, |
|---|
| 599 | // if spoly creation of strat->P does not violate |
|---|
| 600 | // exponent bound of strat->tailRing |
|---|
| 601 | // FALSE, otherwise |
|---|
| 602 | BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2); |
|---|
| 603 | // change strat->tailRing and adjust all data in strat, L, and T: |
|---|
| 604 | // new tailRing has larger exponent bound |
|---|
| 605 | // do nothing and return FALSE if exponent bound increase would result in |
|---|
| 606 | // larger exponent bound that that of currRing |
|---|
| 607 | BOOLEAN kStratChangeTailRing(kStrategy strat, |
|---|
| 608 | LObject* L = NULL, TObject* T = NULL, |
|---|
| 609 | // take this as new_expbound: if 0 |
|---|
| 610 | // new expbound is 2*expbound of tailRing |
|---|
| 611 | unsigned long new_expbound = 0); |
|---|
| 612 | // initiate a change of the tailRing of strat -- should be called |
|---|
| 613 | // right before main loop in bba |
|---|
| 614 | void kStratInitChangeTailRing(kStrategy strat); |
|---|
| 615 | |
|---|
| 616 | #include "kInline.cc" |
|---|
| 617 | |
|---|
| 618 | |
|---|
| 619 | #endif |
|---|
