Changeset 4ecc6fa in git for kernel/GBEngine/kutil.h
- Timestamp:
- Apr 7, 2021, 6:09:07 PM (3 years ago)
- Branches:
- (u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')
- Children:
- e596bb3ff97e8946fdc0b593d1972a8e219125ca
- Parents:
- 0941e691a2fa61260a13f8455d1e5ae84290b65e
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2021-04-07 18:09:07+02:00
- git-committer:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2021-04-07 21:21:06+02:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/GBEngine/kutil.h
r0941e6 r4ecc6fa 74 74 int ecart, 75 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 76 pLength; // either == 0, or == pLength(p) 78 77 79 78 #ifdef HAVE_SHIFTBBA … … 187 186 poly lcm; /*- the lcm of p1,p2 -*/ 188 187 kBucket_pt bucket; 189 int i_r1, i_r2;190 188 unsigned checked; // this is the index of S up to which 191 189 // the corresponding LObject was already checked in … … 281 279 int (*posInL)(const LSet set, const int length, 282 280 LObject* L,const kStrategy strat); 283 void (*enterS)(LObject &h, int pos,kStrategy strat , int atR/* =-1*/);281 void (*enterS)(LObject &h, int pos,kStrategy strat); 284 282 void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG); 285 283 int (*posInLOld)(const LSet Ls,const int Ll, 286 284 LObject* Lo,const kStrategy strat); 287 void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat , int atR /*= -1*/);285 void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat); 288 286 void (*chainCrit) (poly p,int ecart,kStrategy strat); 289 287 BOOLEAN (*syzCrit) (poly sig, unsigned long not_sevSig, kStrategy strat); … … 336 334 // procedure for ShalloCopy from tailRing to currRing 337 335 pShallowCopyDeleteProc p_shallow_copy_delete; 338 // pointers to Tobjects R[i] is ith Tobject which is generated339 TObject** R;340 // S_2_R[i] yields Tobject which corresponds to S[i]341 int* S_2_R;342 336 ring tailRing; 343 337 omBin lmBin; … … 423 417 void deleteInL(LSet set, int *length, int j,kStrategy strat); 424 418 void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at); 425 void enterSBba (LObject &p,int atS,kStrategy strat , int atR = -1);426 void enterSBbaShift (LObject &p,int atS,kStrategy strat , int atR = -1);427 void enterSSba (LObject &p,int atS,kStrategy strat , int atR = -1);419 void enterSBba (LObject &p,int atS,kStrategy strat); 420 void enterSBbaShift (LObject &p,int atS,kStrategy strat); 421 void enterSSba (LObject &p,int atS,kStrategy strat); 428 422 void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG); 429 423 void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG); … … 515 509 void enterExtendedSpoly(poly h,kStrategy strat); 516 510 void enterExtendedSpolySig(poly h,poly hSig,kStrategy strat); 517 void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat , int atR = -1);518 void superenterpairsSig (poly h,poly hSig,int hFrom,int k,int ecart,int pos,kStrategy strat , int atR = -1);511 void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat); 512 void superenterpairsSig (poly h,poly hSig,int hFrom,int k,int ecart,int pos,kStrategy strat); 519 513 poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing); 520 514 long ind2(long arg); … … 529 523 int redSigRing (LObject* h,kStrategy strat); 530 524 //adds hSig to be able to check with F5's criteria when entering pairs! 531 void enterpairsSig (poly h, poly hSig, int from, int k, int ec, int pos,kStrategy strat , int atR = -1);532 void enterpairs (poly h, int k, int ec, int pos,kStrategy strat , int atR = -1);525 void enterpairsSig (poly h, poly hSig, int from, int k, int ec, int pos,kStrategy strat); 526 void enterpairs (poly h, int k, int ec, int pos,kStrategy strat); 533 527 void entersets (LObject h); 534 528 void pairs (); … … 580 574 void completeReduce (kStrategy strat, BOOLEAN withT=FALSE); 581 575 void kFreeStrat(kStrategy strat); 582 void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat , int atR);576 void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat); 583 577 void chainCritNormal (poly p,int ecart,kStrategy strat); 584 578 void chainCritOpt_1 (poly,int,kStrategy strat); … … 785 779 void ksCreateSpoly(LObject* Pair, poly spNoether = NULL, 786 780 int use_buckets=0, ring tailRing=currRing, 787 poly m1 = NULL, poly m2 = NULL , TObject** R = NULL);781 poly m1 = NULL, poly m2 = NULL); 788 782 789 783 /*2 … … 814 808 BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2); 815 809 #ifdef HAVE_RINGS 816 // return TRUE if gcdpoly creation of R[atR] and S[atS] does not violate817 // exponent bound of strat->tailRing818 // FALSE, otherwise819 BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat);820 810 poly preIntegerCheck(ideal F, ideal Q); 821 811 void postReduceByMon(LObject* h, kStrategy strat); … … 858 848 void enterTShift(LObject p, kStrategy strat, int atT = -1); 859 849 860 void enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, intecartq, int qisFromQ, int shiftcount, int ifromS);861 862 void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat , int atR);863 864 void superenterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat , int atR);850 void enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int ecartq, int qisFromQ, int shiftcount, int ifromS); 851 852 void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat); 853 854 void superenterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat); 865 855 866 856 poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize); … … 888 878 } 889 879 890 void initenterpairs (poly h,int k,int ecart,int isFromQ,kStrategy strat , int atR = -1);891 #endif 880 void initenterpairs (poly h,int k,int ecart,int isFromQ,kStrategy strat); 881 #endif
Note: See TracChangeset
for help on using the changeset viewer.