Changeset ab9b40 in git
- Timestamp:
- Jul 17, 2001, 11:42:26 AM (22 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- 0b5f43b241273a85beeb00e27706018ee704a303
- Parents:
- 6a81f86c715f2c701a838ba9632de78d778e28c6
- Location:
- Singular
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/kutil.cc
r6a81f8 rab9b40 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kutil.cc,v 1.10 0 2001-04-05 15:41:07Singular Exp $ */4 /* $Id: kutil.cc,v 1.101 2001-07-17 09:42:25 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: kernel: utils for kStd … … 292 292 293 293 strat->kHEdgeFound=FALSE; 294 if (pLexOrder )294 if (pLexOrder || currRing->MixedOrder) 295 295 { 296 296 return; … … 1477 1477 *superfluous elements in S will be deleted 1478 1478 */ 1479 void enterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1)1479 void enterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR) 1480 1480 { 1481 1481 int j=pos; 1482 1482 1483 1483 initenterpairs(h,k,ecart,0,strat, atR); 1484 if ( (!strat->fromT)1484 if ( (!strat->fromT) 1485 1485 && ((strat->syzComp==0) 1486 1486 ||(pGetComp(h)<=strat->syzComp))) … … 3675 3675 * puts p to the set T at position atT 3676 3676 */ 3677 void enterT(LObject p, kStrategy strat, int atT = -1)3677 void enterT(LObject p, kStrategy strat, int atT) 3678 3678 { 3679 3679 int i; -
Singular/ring.cc
r6a81f8 rab9b40 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ring.cc,v 1.16 5 2001-05-22 14:23:31Singular Exp $ */4 /* $Id: ring.cc,v 1.166 2001-07-17 09:42:26 Singular Exp $ */ 5 5 6 6 /* … … 356 356 case ringorder_a: 357 357 R->block0[n] = last+1; 358 R->block1[n] = last + iv->length() - 2;358 R->block1[n] = min(last+iv->length()-2 , R->N); 359 359 R->wvhdl[n] = (int*)omAlloc((iv->length()-1)*sizeof(int)); 360 360 for (i=2; i<iv->length(); i++) … … 2714 2714 * sets pMixedOrder and pComponentOrder for orderings with more than one block 2715 2715 * block of variables (ip is the block number, o_r the number of the ordering) 2716 * o is the position of the orderingering in r 2716 2717 */ 2717 static void rHighSet(ring r, int o_r )2718 static void rHighSet(ring r, int o_r, int o) 2718 2719 { 2719 2720 switch(o_r) … … 2732 2733 case ringorder_ds: 2733 2734 case ringorder_Ds: 2735 case ringorder_s: 2736 break; 2734 2737 case ringorder_ws: 2735 2738 case ringorder_Ws: 2736 case ringorder_s: 2739 { 2740 int i; 2741 for(i=r->block1[o]-r->block0[o];i>=0;i--) 2742 if (r->wvhdl[o][i]<0) { r->MixedOrder=TRUE; break; } 2743 } 2737 2744 break; 2738 2745 case ringorder_c: … … 2759 2766 r->firstBlockEnds=block1[i]; 2760 2767 r->firstwv = wvhdl[i]; 2768 if ((order[i]== ringorder_ws) || (order[i]==ringorder_Ws)) 2769 { 2770 int j; 2771 for(j=block1[i]-r->block0[i];j>=0;j--) 2772 if (r->firstwv[j]<0) { r->MixedOrder=TRUE; break; } 2773 } 2761 2774 } 2762 2775 … … 2871 2884 { 2872 2885 i--; 2873 rHighSet(r, order[i] );2886 rHighSet(r, order[i],i); 2874 2887 } 2875 2888 while (i != 0);
Note: See TracChangeset
for help on using the changeset viewer.