- Timestamp:
- Feb 20, 2013, 3:48:32 PM (11 years ago)
- Branches:
- (u'spielwiese', '5b153614cbc72bfa198d75b1e9e33dab2645d9fe')
- Children:
- 2e4ec146a83f4d025c2cb4229c4b171a375173c1
- Parents:
- 367df95c40f03bb94a871481eb198951b3a42c85
- git-author:
- Yue Ren <ren@mathematik.uni-kl.de>2013-02-20 15:48:32+01:00
- git-committer:
- Yue Ren <ren@mathematik.uni-kl.de>2013-02-21 20:00:58+01:00
- Location:
- kernel
- Files:
-
- 12 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/fast_maps.cc
r367df9 r6909cfb 354 354 { 355 355 ring src_r, dest_r; 356 ideal dest_id , res_id;356 ideal dest_id/*, res_id*/; 357 357 int length = 0; 358 358 BOOLEAN no_sort; -
kernel/fglmgauss.cc
r367df9 r6909cfb 73 73 gaussReducer::~gaussReducer() 74 74 { 75 int k;76 77 75 #ifndef HAVE_EXPLICIT_CONSTR 78 76 delete [] elems; 79 77 #else 78 int k; 80 79 for ( k= size; k > 0; k-- ) 81 80 elems[k].~gaussElem(); … … 159 158 { 160 159 // fglmASSERT( size < max ); 161 number fac;160 // number fac; 162 161 // find the pivot-element in v: 163 162 -
kernel/gr_kstd2.cc
r367df9 r6909cfb 972 972 assume(rIsPluralRing(currRing)); 973 973 974 int i;974 // int i; 975 975 // idhdl h; 976 976 /* setting global variables ------------------- */ … … 1070 1070 assume(currRing->OrdSgn != -1); // no mora!!! it terminates only for global ordering!!! (?) 1071 1071 1072 intvec *w=NULL;1073 intvec *hilb=NULL;1072 // intvec *w=NULL; 1073 // intvec *hilb=NULL; 1074 1074 int olddeg,reduc; 1075 1075 int red_result=1; 1076 int hilbeledeg=1,hilbcount=0,minimcnt=0;1076 int /*hilbeledeg=1,*/hilbcount=0/*,minimcnt=0*/; 1077 1077 1078 1078 initBuchMoraCrit(strat); /*set Gebauer, honey, sugarCrit*/ -
kernel/ideals.cc
r367df9 r6909cfb 939 939 BOOLEAN isSB, BOOLEAN divide, matrix *unit) 940 940 { 941 int lsmod =id_RankFreeModule(submod,currRing), i,j, k;941 int lsmod =id_RankFreeModule(submod,currRing), j, k; 942 942 int comps_to_add=0; 943 943 poly p; -
kernel/kspoly.cc
r367df9 r6909cfb 394 394 poly a1 = pNext(p1), a2 = pNext(p2); 395 395 number lc1 = pGetCoeff(p1), lc2 = pGetCoeff(p2); 396 int co=0, ct = ksCheckCoeff(&lc1, &lc2, currRing->cf); // gcd and zero divisors 396 int co=0/*, ct = ksCheckCoeff(&lc1, &lc2, currRing->cf)*/; // gcd and zero divisors 397 (void) ksCheckCoeff(&lc1, &lc2, currRing->cf); 397 398 398 399 int l1=0, l2=0; -
kernel/kstd2.cc
r367df9 r6909cfb 197 197 int a_ind2 = ind2(a); 198 198 199 NATNUMBER k = 1;199 // NATNUMBER k = 1; 200 200 // of interest is only k_ind2, special routine for improvement ... TODO OLIVER 201 201 for (int i = 1; i <= leadRing->N; i++) … … 303 303 if (strat->tl<0) return 1; 304 304 305 int at ,i;305 int at/*,i*/; 306 306 long d; 307 307 int j = 0; 308 308 int pass = 0; 309 poly zeroPoly = NULL;309 // poly zeroPoly = NULL; 310 310 311 311 // TODO warum SetpFDeg notwendig? -
kernel/kstdfac.cc
r367df9 r6909cfb 161 161 kStrategy kStratCopy(kStrategy o) 162 162 { 163 int i;163 // int i; 164 164 assume(kTest_TS(o)); 165 165 kStrategy s=new skStrategy; -
kernel/kutil.cc
r367df9 r6909cfb 846 846 { 847 847 int i, j; 848 BOOLEAN ret = TRUE;848 // BOOLEAN ret = TRUE; 849 849 kFalseReturn(kTest(strat)); 850 850 … … 1740 1740 // the corresponding signatures for criteria checks 1741 1741 LObject Lp; 1742 poly last;1742 // poly last; 1743 1743 poly pSigMult = p_Copy(pSig,currRing); 1744 1744 poly sSigMult = p_Copy(strat->sig[i],currRing); … … 8828 8828 int j; 8829 8829 8830 poly q , s;8830 poly q/*, s*/; 8831 8831 8832 8832 // for the 0th shift: insert the orig. pair -
kernel/preimage.cc
r367df9 r6909cfb 78 78 79 79 int i,j; 80 poly p, pp,q;80 poly p,/*pp,*/q; 81 81 ideal temp1; 82 82 ideal temp2; -
kernel/syz.cc
r367df9 r6909cfb 222 222 void syGaussForOne(ideal syz, int elnum, int ModComp,int from,int till) 223 223 { 224 int k,j,i,lu;224 int /*k,j,i,*/lu; 225 225 poly unit1,unit2; 226 226 poly actWith=syz->m[elnum]; … … 249 249 static void syDeleteAbove1(ideal up, int k) 250 250 { 251 poly p ,pp;251 poly p/*,pp*/; 252 252 if (up!=NULL) 253 253 { -
kernel/syz0.cc
r367df9 r6909cfb 173 173 if (Fl==0) return result; 174 174 175 int i,j,l,k,totalToRed,ecartToRed,kk ,kkk;175 int i,j,l,k,totalToRed,ecartToRed,kk; 176 176 int bestEcart,totalmax,rkF,Sl=0,smax,tmax,tl; 177 177 int *ecartS, *ecartT, *totalS, 178 178 *totalT=NULL, *temp=NULL; 179 polyset pairs,S,T,ST ,oldF;179 polyset pairs,S,T,ST/*,oldF*/; 180 180 poly p,q,toRed; 181 181 BOOLEAN notFound = FALSE; … … 342 342 #else 343 343 l = (**modcomp)[pGetComp(toRed)]; 344 kkk = (**modcomp)[pGetComp(toRed)+1];344 int kkk = (**modcomp)[pGetComp(toRed)+1]; 345 345 while ((l<kkk) && (notFound)) 346 346 #endif … … 510 510 ideal result=idInit(16,Fl); 511 511 int i,j,l,k,kkk,rkF,Sl=0,syComponentOrder=currRing->ComponentOrder; 512 int fstart,wend,lini,ltR,gencQ=0;512 int /*fstart,*/wend,lini,ltR,gencQ=0; 513 513 intvec *newmodcomp; 514 514 int *Flength; 515 515 polyset pairs,F=arg->m,*Shdl=&(result->m); 516 poly p,q,toRed,syz,lastmonom,multWith;516 poly /*p,*/q,toRed,syz,lastmonom,multWith; 517 517 BOOLEAN isNotReduced=TRUE; 518 518 … … 577 577 { 578 578 number an=nCopy(pGetCoeff(F[k])),bn=nCopy(pGetCoeff(F[j])); 579 int ct =ksCheckCoeff(&an, &bn, currRing->cf);579 /*int ct =*/ (void) ksCheckCoeff(&an, &bn, currRing->cf); 580 580 syz = pCopy(pairs[k]); 581 581 //syz->coef = nCopy(F[k]->coef); … … 867 867 int i,syzIndex = 0,j=0; 868 868 intvec * modcomp=NULL,*w=NULL; 869 int ** wv=NULL;869 // int ** wv=NULL; 870 870 tHomog hom=(tHomog)idHomModule(arg,NULL,&w); 871 871 ring origR = currRing; … … 1017 1017 if (fr==NULL) return NULL; 1018 1018 1019 int typ0;1019 // int typ0; 1020 1020 syStrategy result=(syStrategy)omAlloc0(sizeof(ssyStrategy)); 1021 1021 result->length=rl; -
kernel/syz3.cc
r367df9 r6909cfb 112 112 ideal old_repr,int old_tl, poly next_generator,resolvente totake) 113 113 { 114 int index=syzstr->length-1,i,j,start,start_ttk ,new_tl;114 int index=syzstr->length-1,i,j,start,start_ttk/*,new_tl*/; 115 115 poly gen=pCopy(next_generator),p; 116 116 poly neg_gen=pCopy(next_generator); … … 656 656 int toReplace=0; 657 657 int i,j,syz_l; 658 number coefgcd,n;658 number /*coefgcd,*/n; 659 659 polyset ogm=old_generators->m; 660 660 poly p; … … 941 941 int * ogm_l=(int*)omAlloc0(IDELEMS(syzstr->res[index])*sizeof(int)); 942 942 int * orp_l=(int*)omAlloc0(IDELEMS(syzstr->orderedRes[index])*sizeof(int)); 943 int t1=IDELEMS(syzstr->res[index]),t2=IDELEMS(syzstr->orderedRes[index]);943 // int t1=IDELEMS(syzstr->res[index]),t2=IDELEMS(syzstr->orderedRes[index]); 944 944 945 945 for (j=IDELEMS(syzstr->res[index])-1;j>=0;j--) … … 1753 1753 syStrategy syKosz(ideal arg,int * length) 1754 1754 { 1755 int i,j,jj,k=0,index=0,rk_arg ,next_syz=0;1755 int i,j,jj,k=0,index=0,rk_arg/*,next_syz=0*/; 1756 1756 int crit_comp,t_comp,next_deg,old_tl; 1757 1757 ideal temp=NULL,old_ideal,old_repr;
Note: See TracChangeset
for help on using the changeset viewer.