Changeset 6909cfb in git
- Timestamp:
- Feb 20, 2013, 3:48:32 PM (11 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- 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
- Files:
-
- 36 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/MinorInterface.cc
r367df9 r6909cfb 100 100 /* containers for all upcoming results: */ 101 101 IntMinorValue theMinor; 102 int value = 0;102 // int value = 0; 103 103 int collectedMinors = 0; 104 104 int characteristic = 0; if (currRing != 0) characteristic = rChar(currRing); … … 323 323 /* containers for all upcoming results: */ 324 324 IntMinorValue theMinor; 325 int value = 0;325 // int value = 0; 326 326 int collectedMinors = 0; 327 327 int characteristic = 0; if (currRing != 0) characteristic = rChar(currRing); -
Singular/emacs.cc
r367df9 r6909cfb 107 107 char* singular = NULL; 108 108 char* emacs = NULL; 109 #ifndef TSINGULAR 109 110 char* emacs_dir = NULL; 110 111 char* emacs_load = NULL; 112 char cwd[MAXPATHLEN]; 113 #endif 111 114 int no_emacs_call = 0; 112 char cwd[MAXPATHLEN];113 115 114 116 // parse-cmdline options -
Singular/fehelp.cc
r367df9 r6909cfb 980 980 { 981 981 char sys[MAX_SYSCMD_LEN]; 982 char url[MAXPATHLEN];982 // char url[MAXPATHLEN]; 983 983 const char *p=heHelpBrowsers[br].action; 984 984 if (p==NULL) {PrintS("no action ?\n"); return;} … … 1063 1063 } 1064 1064 Print("running `%s`\n",sys); 1065 int dummy=system(sys);1065 /*int dummy=*/ (void) system(sys); 1066 1066 } 1067 1067 … … 1219 1219 while(!feof(index)) 1220 1220 { 1221 char* dummy=fgets(buffer, BUF_LEN, index); /* */1221 // char* dummy=fgets(buffer, BUF_LEN, index); /* */ 1222 1222 (void)sscanf(buffer, "Node:%[^\177]\177%ld\n", Index, &offset); 1223 1223 for(p=Index; *p; p++) *p = tolow(*p);/* */ -
Singular/fevoices.cc
r367df9 r6909cfb 40 40 // this is an upper limit for the size of monomials/numbers read via the interpreter 41 41 #define MAX_FILE_BUFFER 4*4096 42 static long feBufferLength=INITIAL_PRINT_BUFFER;42 // static long feBufferLength=INITIAL_PRINT_BUFFER; 43 43 static char * feBuffer=(char *)omAlloc(INITIAL_PRINT_BUFFER); 44 44 -
Singular/fglm.cc
r367df9 r6909cfb 288 288 289 289 idhdl destRingHdl = currRingHdl; 290 ring destRing = currRing;290 // ring destRing = currRing; 291 291 ideal destIdeal = NULL; 292 292 idhdl sourceRingHdl = (idhdl)first->data; 293 293 rSetHdl( sourceRingHdl ); 294 ring sourceRing = currRing;294 // ring sourceRing = currRing; 295 295 296 296 int * vperm = (int *)omAlloc0( (currRing->N+1)*sizeof( int ) ); -
Singular/ipid.cc
r367df9 r6909cfb 243 243 idhdl h; 244 244 s=omStrDup(s); 245 idhdl *save_root=root;245 // idhdl *save_root=root; 246 246 if (t==PACKAGE_CMD) 247 247 { -
Singular/iplib.cc
r367df9 r6909cfb 279 279 // load example 280 280 fseek(fp, pi->data.s.example_start, SEEK_SET); 281 char *dummy=fgets(buf, sizeof(buf), fp); // skip line with "example"281 /*char *dummy=*/ (void) fgets(buf, sizeof(buf), fp); // skip line with "example" 282 282 procbuflen = pi->data.s.proc_end - pi->data.s.example_start - strlen(buf); 283 283 //Print("Example=%ld-%ld=%d\n", pi->data.s.proc_end, … … 755 755 const char *suffix[] = { "", ".lib", ".so", ".sl", NULL }; 756 756 int i = 0; 757 FILE *fp;758 package pack;759 idhdl packhdl;757 // FILE *fp; 758 // package pack; 759 // idhdl packhdl; 760 760 lib_types LT; 761 761 for(i=0; suffix[i] != NULL; i++) … … 828 828 { 829 829 char libnamebuf[128]; 830 procinfov pi;831 idhdl h;830 // procinfov pi; 831 // idhdl h; 832 832 idhdl pl; 833 idhdl hl;834 long pos = 0L;833 // idhdl hl; 834 // long pos = 0L; 835 835 char *plib = iiConvName(newlib); 836 836 FILE * fp = feFopen( newlib, "r", libnamebuf, tellerror ); 837 int lines = 1;837 // int lines = 1; 838 838 BOOLEAN LoadResult = TRUE; 839 839 … … 906 906 int save=yylineno; 907 907 myynest++; 908 procinfo *pi=(procinfo*)IDDATA(h);908 // procinfo *pi=(procinfo*)IDDATA(h); 909 909 //PrintS("mod_init found\n"); 910 910 iiMake_proc(h,p,NULL); … … 1178 1178 BOOLEAN pstatic, 1179 1179 BOOLEAN(*func)(leftv res, leftv v))); 1180 SModulFunc_t fktn;1180 // SModulFunc_t fktn; 1181 1181 idhdl pl; 1182 1182 char *plib = iiConvName(newlib); 1183 BOOLEAN RET=TRUE;1184 int token;1183 // BOOLEAN RET=TRUE; 1184 // int token; 1185 1185 1186 1186 pl = IDROOT->get(plib,0); -
Singular/ipprint.cc
r367df9 r6909cfb 303 303 if (print) 304 304 { 305 BOOLEAN r=FALSE;305 // BOOLEAN r=FALSE; 306 306 leftv h=u; 307 307 leftv hh; -
Singular/janet.cc
r367df9 r6909cfb 33 33 34 34 //------GLOBALS------- 35 static int m_s,v_s,vectorized,VarN1,offset;35 static int /*m_s,v_s,vectorized,VarN1,*/offset; 36 36 static jList *T,*Q; 37 37 static TreeM *G; 38 static Poly *phD;38 // static Poly *phD; 39 39 static NodeM *FreeNodes; 40 40 static int degree_compatible; … … 193 193 { 194 194 Poly *f; 195 int g1,f1,gg;195 // int g1,f1,gg; 196 196 197 197 if ((f=is_div_(F,p->lead))==NULL) return; … … 246 246 247 247 //if (TEST_OPT_PROT) { PrintS("R"); mflush(); } 248 int old_size,count;248 int /*old_size, */count; 249 249 count=0; 250 250 while(f && p->root) … … 303 303 int ValidatePoly(Poly *x, TreeM *F) 304 304 { 305 Poly *f,*g;306 int g1,f1;305 Poly /*f,*/*g; 306 // int g1,f1; 307 307 308 308 if (x->root) return 1; … … 971 971 } 972 972 973 static Poly *h ,*f;973 static Poly *h/*,*f*/; 974 974 975 975 void insert_in_G(Poly *x) … … 998 998 int ComputeBasis(jList *_lT,jList *_lQ) 999 999 { 1000 int gb_l,i,ret_value=1;1000 // int gb_l,i,ret_value=1; 1001 1001 1002 1002 T=_lT; Q=_lQ; -
Singular/links/ndbm.cc
r367df9 r6909cfb 150 150 { 151 151 register int i; 152 datum item;152 // datum item; 153 153 154 154 if (dbm_error(db)) -
Singular/links/pipeLink.cc
r367df9 r6909cfb 166 166 else 167 167 { 168 fd_set mask , fdmask;168 fd_set mask/*, fdmask*/; 169 169 struct timeval wt; 170 170 /* Don't block. Return socket status immediately. */ -
Singular/links/ssiLink.cc
r367df9 r6909cfb 289 289 fprintf(d->f_write,"%d ",pLength(p));//number of terms 290 290 SSI_UNBLOCK_CHLD; 291 int i;291 int j; 292 292 293 293 while(p!=NULL) … … 298 298 fprintf(d->f_write,"%ld ",p_GetComp(p,d->r));//component 299 299 300 for( intj=1;j<=rVar(d->r);j++)300 for(j=1;j<=rVar(d->r);j++) 301 301 { 302 302 fprintf(d->f_write,"%ld ",p_GetExp(p,j,d->r ));//x^j … … 416 416 l=s_readint(d->f_read); 417 417 buf=(char*)omAlloc0(l+1); 418 int c =s_getc(d->f_read); /* skip ' '*/419 int ll=s_readbytes(buf,l,d->f_read);418 /*int c =*/ (void) s_getc(d->f_read); /* skip ' '*/ 419 /*int ll=*/ (void) s_readbytes(buf,l,d->f_read); 420 420 //if (ll!=l) printf("want %d, got %d bytes\n",l,ll); 421 421 buf[l]='\0'; … … 528 528 { 529 529 /* syntax is <ch> <N> <l1> <v1> ...<lN> <vN> <number of orderings> <ord1> <block0_1> <block1_1> .... */ 530 int ch, N,i ,l;530 int ch, N,i/*,l*/; 531 531 char **names; 532 532 ch=s_readint(d->f_read); … … 748 748 { 749 749 ssiInfo *d=(ssiInfo*)l->data; 750 int throwaway=s_readint(d->f_read);750 /*int throwaway=*/ (void) s_readint(d->f_read); 751 751 char *name=ssiReadString(d); 752 752 int tok; … … 891 891 int sockfd, newsockfd, portno, clilen; 892 892 struct sockaddr_in serv_addr, cli_addr; 893 int n;893 // int n; 894 894 sockfd = socket(AF_INET, SOCK_STREAM, 0); 895 895 if(sockfd < 0) … … 952 952 int sockfd, newsockfd, portno, clilen; 953 953 struct sockaddr_in serv_addr, cli_addr; 954 int n;954 // int n; 955 955 sockfd = socket(AF_INET, SOCK_STREAM, 0); 956 956 if(sockfd < 0) … … 1034 1034 { 1035 1035 char* host = (char*)omAlloc(256); 1036 int sockfd, portno , n;1036 int sockfd, portno/*, n*/; 1037 1037 struct sockaddr_in serv_addr; 1038 1038 struct hostent *server; … … 1485 1485 && (strcmp(request, "read") == 0)) 1486 1486 { 1487 fd_set mask , fdmask;1487 fd_set mask/*, fdmask*/; 1488 1488 struct timeval wt; 1489 1489 if (s_isready(d->f_read)) return "ready"; … … 1810 1810 } 1811 1811 int portno; 1812 int n;1812 // int n; 1813 1813 ssiReserved_sockfd = socket(AF_INET, SOCK_STREAM, 0); 1814 1814 if(ssiReserved_sockfd < 0) -
Singular/utils.cc
r367df9 r6909cfb 158 158 void printpi(procinfov pi) 159 159 { 160 char *buf, name[256];161 int len1, len2;160 // char *buf, name[256]; 161 // int len1, len2; 162 162 /* pi->libname is badly broken -- use file, instead */ 163 163 FILE *fp = fopen( lib_file, "rb"); -
dyn_modules/bigintm/bigintm.cc
r367df9 r6909cfb 46 46 assume( l->Typ() == bigintm_type_id ); 47 47 48 blackbox *ll=getBlackboxStuff(l->Typ());48 // blackbox *ll=getBlackboxStuff(l->Typ()); 49 49 50 50 if (r->Typ()>MAX_TOK) … … 52 52 if (bigintm_type_id == r->Typ()) 53 53 { 54 blackbox *rr=getBlackboxStuff(r->Typ());54 // blackbox *rr=getBlackboxStuff(r->Typ()); 55 55 56 56 if (l->Data()!=NULL) { number n1=(number)l->Data(); n_Delete(&n1,coeffs_BIGINT); } … … 126 126 assume( a1->Typ() == bigintm_type_id ); 127 127 128 blackbox *a=getBlackboxStuff(a1->Typ());128 // blackbox *a=getBlackboxStuff(a1->Typ()); 129 129 number n1=(number)a1->Data(); 130 130 switch(op) -
dyn_modules/syzextra/mod_main.cc
r367df9 r6909cfb 819 819 static BOOLEAN reduce_syz(leftv res, leftv h) 820 820 { 821 const ring r = currRing;821 // const ring r = currRing; 822 822 823 823 if ( !( (h!=NULL) && (h->Typ()==VECTOR_CMD || h->Typ()==POLY_CMD) ) ) -
dyn_modules/syzextra/myNF.cc
r367df9 r6909cfb 218 218 // only global: avoid normalization, return a multiply of NF 219 219 poly p; 220 int i;220 // int i; 221 221 222 222 //if ((idIs0(F))&&(Q==NULL)) -
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; -
libpolys/polys/ext_fields/algext.cc
r367df9 r6909cfb 972 972 { 973 973 if (n_IsZero(a, src)) return NULL; 974 int p = rChar(dst->extRing);974 // int p = rChar(dst->extRing); 975 975 976 976 number q = nlModP(a, src, dst->extRing->cf); -
libpolys/polys/ext_fields/transext.cc
r367df9 r6909cfb 1539 1539 assume( n_Test(a, src) ); 1540 1540 if (n_IsZero(a, src)) return NULL; 1541 int p = rChar(dst->extRing);1541 // int p = rChar(dst->extRing); 1542 1542 number q = nlModP(a, src, dst->extRing->cf); 1543 1543 -
libpolys/polys/monomials/ring.cc
r367df9 r6909cfb 1683 1683 return FALSE; 1684 1684 1685 int i , j;1685 int i/*, j*/; 1686 1686 1687 1687 if (r1 == r2) return TRUE; -
libpolys/polys/nc/ncSACache.cc
r367df9 r6909cfb 27 27 #endif 28 28 29 #if OUTPUT 29 30 namespace 30 31 { 31 32 static const char* m_Typenames[2] = {"lookup", "store"}; 32 33 } 34 #endif 33 35 34 36 #include <coeffs/numbers.h> -
libpolys/polys/templates/p_Procs_Set.h
r367df9 r6909cfb 198 198 void p_Debug_GetSpecNames(const ring r, const char* &field, const char* &length, const char* &ord) 199 199 { 200 p_Field e_field =p_FieldIs(r);201 p_Length e_length =p_LengthIs(r);202 p_Ord e_ord =p_OrdIs(r);200 /*p_Field e_field =*/ (void) p_FieldIs(r); 201 /*p_Length e_length =*/ (void) p_LengthIs(r); 202 /*p_Ord e_ord =*/ (void) p_OrdIs(r); 203 203 204 204 field = p_FieldEnum_2_String(p_FieldIs(r)); -
libpolys/reporter/dError.cc
r367df9 r6909cfb 50 50 #ifdef HAVE_EXECINFO_H 51 51 #define SIZE 50 52 void *buffer[SIZE+1]; int i, j, k, ret, status; char **ptr; char *demangledName; char *s; char *ss;52 void *buffer[SIZE+1]; int ret; 53 53 #endif 54 54 … … 73 73 backtrace_symbols_fd(buffer, ret, STDERR_FILENO); // execinfo.h 74 74 #else 75 ptr = backtrace_symbols( buffer, ret ); // execinfo.h75 char **ptr = backtrace_symbols( buffer, ret ); // execinfo.h 76 76 77 for (i = 0; i < ret; i++) 77 int status; 78 char *demangledName; 79 char *s; 80 char *ss; 81 for (int i = 0; i < ret; i++) 78 82 { 79 83 status = -1; -
numeric/mpr_base.cc
r367df9 r6909cfb 1739 1739 ideal resMatrixSparse::getMatrix() 1740 1740 { 1741 int i, j,cp;1741 int i,/*j,*/cp; 1742 1742 poly pp,phelp,piter,pgls; 1743 1743 -
numeric/mpr_inout.cc
r367df9 r6909cfb 110 110 { 111 111 mprState state = mprOk; 112 int power;112 // int power; 113 113 int k; 114 114
Note: See TracChangeset
for help on using the changeset viewer.