Changeset 83552f in git
- Timestamp:
- Jan 28, 2000, 1:41:52 PM (24 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 526f34914e53401cb13d2d75c1f4cf26cbb4b7e8
- Parents:
- 8786895d3dba9270ac0695c8bc822a76d248d43c
- Location:
- Singular
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/ideals.cc
r878689 r83552f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ideals.cc,v 1.8 6 2000-01-28 09:45:56 SingularExp $ */4 /* $Id: ideals.cc,v 1.87 2000-01-28 12:37:28 siebert Exp $ */ 5 5 /* 6 6 * ABSTRACT - all basic methods to manipulate ideals … … 386 386 * for idSort: compare a and b revlex inclusive module comp. 387 387 */ 388 static int pComp_RevLex(poly a, poly b) 389 { 388 static int pComp_RevLex(poly a, poly b,BOOLEAN nolex) 389 { 390 if (nolex) return pComp0(a,b); 390 391 int l=pVariables; 391 392 while ((l>0) && (pGetExp(a,l)==pGetExp(b,l))) l--; … … 412 413 BOOLEAN notFound; 413 414 414 pCompProc oldComp=pComp0;415 416 if (!nolex) pComp0=pComp_RevLex;417 418 415 for (i=0;i<IDELEMS(id);i++) 419 416 { … … 439 436 while ((newpos>=0) && (newpos<actpos) && (notFound)) 440 437 { 441 newcomp = pComp 0(id->m[i],id->m[(*result)[newpos]]);438 newcomp = pComp_RevLex(id->m[i],id->m[(*result)[newpos]],nolex); 442 439 olddiff = diff; 443 440 if (diff>1) … … 486 483 if (newpos<0) newpos = 0; 487 484 if (newpos>actpos) newpos = actpos; 488 while ((newpos<actpos) && (pComp 0(id->m[i],id->m[(*result)[newpos]])==0))485 while ((newpos<actpos) && (pComp_RevLex(id->m[i],id->m[(*result)[newpos]],nolex)==0)) 489 486 newpos++; 490 487 for (j=actpos;j>newpos;j--) … … 497 494 } 498 495 for (j=0;j<actpos;j++) (*result)[j]++; 499 pComp0=oldComp;500 496 return result; 501 497 } -
Singular/syz1.cc
r878689 r83552f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz1.cc,v 1.5 1 1999-11-25 13:12:27siebert Exp $ */4 /* $Id: syz1.cc,v 1.52 2000-01-28 12:37:56 siebert Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 2540 2540 SSet sPairs; 2541 2541 int * ord,*b0,*b1; 2542 pSetmProc oldSetm=pSetm;2543 pCompProc oldComp0=pComp0;2544 2542 2545 2543 assume(syzstr->syRing != NULL); 2546 2544 rChangeCurrRing(syzstr->syRing, TRUE); 2547 2545 //Print("laeufts "); 2548 pComp0 = syzcomp2dpc;2549 2546 syzstr->bucket = kBucketCreate(); 2550 2547 for (index=syzstr->length-1;index>0;index--) … … 2598 2595 // maybe incoporate it into syReorder ?? 2599 2596 } 2600 else2601 {2602 pSetm=oldSetm;2603 pComp0=oldComp0;2604 }2605 2597 tres = syReorder(tres,syzstr->length,syzstr,FALSE,syzstr->res); 2606 2598 syKillEmptyEntres(tres,syzstr->length); … … 2662 2654 return syzstr; 2663 2655 } 2664 pSetmProc oldSetm=pSetm;2665 pCompProc oldComp0=pComp0;2666 2656 2667 2657 //crit = 0; … … 2683 2673 } 2684 2674 rChangeSComps(currcomponents, currShiftedComponents, arg->rank); 2685 pComp0 = syzcomp2dpc;2686 2675 /*--- initializes the data structures---------------*/ 2687 2676 syzstr->Tl = NewIntvec1(*length); -
Singular/syz2.cc
r878689 r83552f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz2.cc,v 1.1 1 1999-11-20 10:17:24siebert Exp $ */4 /* $Id: syz2.cc,v 1.12 2000-01-28 12:41:52 siebert Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 940 940 SSet nextPairs; 941 941 ring origR = currRing; 942 pSetmProc oldSetm=pSetm;943 pCompProc oldComp0=pComp0;944 942 syStrategy syzstr=(syStrategy)Alloc0SizeOf(ssyStrategy); 945 943
Note: See TracChangeset
for help on using the changeset viewer.