Changeset efb860 in git
- Timestamp:
- Oct 5, 2006, 8:26:10 PM (18 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- f5bfe4a0668705d924990d960a15282b2a2a3ac1
- Parents:
- ded4ee6c4c561eaf2513cbc7df1f8b1d60dd0ed1
- Location:
- kernel
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/kstd1.cc
rded4ee refb860 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kstd1.cc,v 1.1 1 2006-05-19 13:33:25Singular Exp $ */4 /* $Id: kstd1.cc,v 1.12 2006-10-05 18:26:09 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: … … 295 295 if (at <= strat->Ll) 296 296 { 297 if (kFindDivisibleByInS(strat ->S, strat->sevS, strat->sl, h) < 0)297 if (kFindDivisibleByInS(strat, h) < 0) 298 298 { 299 299 if (strat->honey && !strat->posInLDependsOnLength) … … 416 416 if (at <= strat->Ll) 417 417 { 418 if (kFindDivisibleByInS(strat ->S, strat->sevS, strat->sl, h) < 0)418 if (kFindDivisibleByInS(strat, h) < 0) 419 419 return 1; 420 420 enterL(&strat->L,&strat->Ll,&strat->Lmax,*h,at); -
kernel/kstd2.cc
rded4ee refb860 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kstd2.cc,v 1.2 0 2006-10-05 10:28:47Singular Exp $ */4 /* $Id: kstd2.cc,v 1.21 2006-10-05 18:26:10 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - Kernel: alg. of Buchberger … … 81 81 82 82 // same as above, only with set S 83 int kFindDivisibleByInS(const polyset &S, const unsigned long* sev, const int sl, LObject* L)83 int kFindDivisibleByInS(const kStrategy strat, LObject* L) 84 84 { 85 85 unsigned long not_sev = ~L->sev; … … 88 88 89 89 pAssume(~not_sev == p_GetShortExpVector(p, currRing)); 90 int ende=posInS(strat,strat->sl,p,0)+1; 91 if (ende>strat->sl) ende=strat->sl; 90 92 loop 91 93 { 92 if (j > sl) return -1;94 if (j > ende) return -1; 93 95 #if defined(PDEBUG) || defined(PDIV_DEBUG) 94 if (p_LmShortDivisibleBy( S[j], sev[j],96 if (p_LmShortDivisibleBy(strat->S[j], strat->sevS[j], 95 97 p, not_sev, currRing)) 96 98 return j; 97 99 #else 98 if ( !(s ev[j] & not_sev) &&99 p_LmDivisibleBy( S[j], p, currRing))100 if ( !(strat->sevS[j] & not_sev) && 101 p_LmDivisibleBy(strat->S[j], p, currRing)) 100 102 return j; 101 103 #endif … … 555 557 { 556 558 #if 0 557 if (kFindDivisibleByInS(strat ->S, strat->sevS, strat->sl, h) < 0)559 if (kFindDivisibleByInS(strat, h) < 0) 558 560 return 1; 559 561 #endif … … 706 708 if (at <= strat->Ll) 707 709 { 708 if (kFindDivisibleByInS(strat ->S, strat->sevS, strat->sl, h) < 0)710 if (kFindDivisibleByInS(strat, h) < 0) 709 711 return 1; 710 712 enterL(&strat->L,&strat->Ll,&strat->Lmax,*h,at); … … 753 755 #endif 754 756 */ 755 j=kFindDivisibleByInS(strat ->S,strat->sevS,strat->sl,&P);757 j=kFindDivisibleByInS(strat,&P); 756 758 if (j>=0) 757 759 { -
kernel/kutil.h
rded4ee refb860 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: kutil.h,v 1.1 8 2006-08-14 17:08:37 wienandExp $ */6 /* $Id: kutil.h,v 1.19 2006-10-05 18:26:10 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT: kernel: utils for kStd … … 444 444 const int tl, const LObject* L, const int start=0); 445 445 // same with S 446 int kFindDivisibleByInS(const polyset &S, const unsigned long* sev, 447 const int sl, LObject* L); 446 int kFindDivisibleByInS(const kStrategy strat, LObject* L); 448 447 449 448 TObject* -
kernel/tgb.cc
rded4ee refb860 5 5 * Computer Algebra System SINGULAR * 6 6 ****************************************/ 7 /* $Id: tgb.cc,v 1.10 0 2006-07-06 07:00:15 brickenExp $ */7 /* $Id: tgb.cc,v 1.101 2006-10-05 18:26:10 Singular Exp $ */ 8 8 /* 9 9 * ABSTRACT: slimgb and F4 implementation … … 770 770 P.p=strat->S[i]; 771 771 P.sev=strat->sevS[i]; 772 if(kFindDivisibleByInS(strat ->S,strat->sevS,strat->sl,&P)!=i)772 if(kFindDivisibleByInS(strat,&P)!=i) 773 773 { 774 774 deleteInS(i,strat); … … 1547 1547 loop 1548 1548 { 1549 1550 j=kFindDivisibleByInS(strat->S,strat->sevS,strat->sl,&P); 1549 j=kFindDivisibleByInS(strat,&P); 1551 1550 if ((j>=0) && ((!n)|| 1552 1551 ((strat->lenS[j]<=n) && … … 1554 1553 (strat->lenSw[j]<=n))))) 1555 1554 { 1556 1557 1558 1555 nNormalize(pGetCoeff(P.p)); 1559 1556 #ifdef KDEBUG … … 2029 2026 loop 2030 2027 { 2031 j=kFindDivisibleByInS(strat ->S,strat->sevS,sl,&P);2028 j=kFindDivisibleByInS(strat,&P); 2032 2029 if (j>=0) 2033 2030 {
Note: See TracChangeset
for help on using the changeset viewer.