Changeset 1a2ca6 in git
- Timestamp:
- Jan 31, 2000, 3:57:34 PM (24 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 94f5652c6b8f440140551e85e69410fcb24baf1a
- Parents:
- f7227808a681b6a4913de0a93ee1d12ed8cd33ef
- Location:
- Singular
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/polys.cc
rf722780 r1a2ca6 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: polys.cc,v 1.5 2 1999-11-15 17:20:40 obachmanExp $ */4 /* $Id: polys.cc,v 1.53 2000-01-31 14:57:32 Singular Exp $ */ 5 5 6 6 /* … … 31 31 /* the monomial ordering of the head monomials a and b */ 32 32 /* returns -1 if a comes before b, 0 if a=b, 1 otherwise */ 33 pCompProc pComp0;34 33 35 34 int pVariables; // number of variables … … 61 60 /* -------------- static variables --------------------------------------- */ 62 61 /*is the basic comparing procedure during a computation of syzygies*/ 63 static pCompProc pCompOld;62 //static pCompProc pCompOld; 64 63 65 64 /*contains the headterms for the Schreyer orderings*/ … … 285 284 cP1=SchreyerOrd[CompP1-1],cP2=SchreyerOrd[CompP2-1]; 286 285 287 if (CompP1==CompP2) return pCompOld(p1,p2); 286 //if (CompP1==CompP2) return pCompOld(p1,p2); 287 if (CompP1==CompP2) return pComp0(p1,p2); 288 288 pSetComp(p1,cP1); 289 289 pSetComp(p2,cP2); 290 result = pCompOld(p1,p2); 290 //result = pCompOld(p1,p2); 291 result = pComp0(p1,p2); 291 292 pSetComp(p1,CompP1); 292 293 pSetComp(p2,CompP2); … … 373 374 for (i=indexShift;i<maxSchreyer;i++) 374 375 SchreyerOrd[i] = pGetComp(nextOrder[i-indexShift]); 375 pCompOld = pComp0;376 pComp0 = mcompSchrM;376 //pCompOld = pComp0; 377 //pComp0 = mcompSchrM; 377 378 pLDegOld = pLDeg; 378 379 pLDeg = ldegSchrM; … … 386 387 maxSchreyer = 0; 387 388 indexShift = 0; 388 pComp0 = pCompOld;389 //pComp0 = pCompOld; 389 390 pLDeg = pLDegOld; 390 391 } … … 793 794 } 794 795 pSetm=rSetm; 795 pComp0=rComp0;796 796 } 797 797 if (pFDeg!=pWTotaldegree) pFDeg=pTotaldegree; -
Singular/polys.h
rf722780 r1a2ca6 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: polys.h,v 1.2 7 1999-11-15 17:20:41 obachmanExp $ */6 /* $Id: polys.h,v 1.28 2000-01-31 14:57:33 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT - all basic methods to manipulate polynomials 9 9 */ 10 #include "polys-comp.h" 10 11 #include "polys-impl.h" 11 12 #define pFetchCopy(r,p) _pFetchCopy(r,p) … … 96 97 /*-----------the ordering of monomials:-------------*/ 97 98 extern pSetmProc pSetm; 98 extern pCompProc pComp0; 99 #define pComp0 rComp0 99 100 #define pSetmComp pSetm 100 // this is needed here as long as monomials with negative exponents might be101 // compared (see in spolys.cc)102 extern pCompProc t_pComp0;103 101 int pComp(poly p1,poly p2); 104 102 extern pLDegProc pLDeg; -
Singular/syz.h
rf722780 r1a2ca6 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: syz.h,v 1.2 2 1999-11-15 17:20:53 obachmanExp $ */6 /* $Id: syz.h,v 1.23 2000-01-31 14:57:34 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT: Resolutions … … 111 111 syStrategy syMinimize(syStrategy syzstr); 112 112 void syKillEmptyEntres(resolvente res,int length); 113 #ifdef PDEBUG114 int syzcomp2dpc(poly p1, poly p2);115 #else116 #define syzcomp2dpc rComp0117 #endif118 113 119 114 extern int * currcomponents; -
Singular/syz1.cc
rf722780 r1a2ca6 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz1.cc,v 1.5 2 2000-01-28 12:37:56 siebertExp $ */4 /* $Id: syz1.cc,v 1.53 2000-01-31 14:57:34 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 279 279 if (currcomponents[o1]>currcomponents[o2]) return 1; 280 280 return -1; 281 }282 int syzcomp2dpc(poly p1, poly p2)283 {284 int test = syzcomp2dpc_test(p1, p2);285 int rc = rComp0(p1, p2);286 if (test != rc)287 {288 assume(0);289 syzcomp2dpc_test(p1, p2);290 rComp0(p1, p2);291 }292 return test;293 281 } 294 282 #endif // PDEBUG
Note: See TracChangeset
for help on using the changeset viewer.