Changeset a4c74f in git
- Timestamp:
- Jul 16, 1999, 6:07:22 PM (24 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 86050ee275fe1a82d0ab4c97fb6fa4560231a142
- Parents:
- cedc3f5ddbba05d8f7f30511c0afe931d1b91fd5
- Location:
- Singular
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/febase.cc
rcedc3f ra4c74f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: febase.cc,v 1.7 4 1999-07-06 15:32:43Singular Exp $ */4 /* $Id: febase.cc,v 1.75 1999-07-16 16:07:17 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: i/o system … … 1194 1194 *i += *s++ - '0'; 1195 1195 l++; 1196 if ((l> MAX_INT_LEN)||((*i) <0))1196 if ((l>=MAX_INT_LEN)||((*i) <0)) 1197 1197 { 1198 1198 s-=l; 1199 1199 Werror("`%s` greater than %d(max. integer representation)", 1200 s, INT_MAX);1200 s,MAX_INT_VAL); 1201 1201 return s; 1202 1202 } -
Singular/ffields.cc
rcedc3f ra4c74f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ffields.cc,v 1. 19 1999-05-10 15:10:48 Singular Exp $ */4 /* $Id: ffields.cc,v 1.20 1999-07-16 16:07:18 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: finite fields with a none-prime number of elements (via tables) … … 487 487 *i *= 10; 488 488 *i += *s++ - '0'; 489 if (*i > ( INT_MAX/ 10)) *i = *i % nfCharP;489 if (*i > (MAX_INT_VAL / 10)) *i = *i % nfCharP; 490 490 } 491 491 while (*s >= '0' && *s <= '9'); -
Singular/grammar.y
rcedc3f ra4c74f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: grammar.y,v 1.6 3 1999-07-14 13:16:00Singular Exp $ */4 /* $Id: grammar.y,v 1.64 1999-07-16 16:07:19 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: SINGULAR shell grammatik … … 506 506 if (l >= MAX_INT_LEN) 507 507 { 508 char tmp[ 100];508 char tmp[MAX_INT_LEN+5]; 509 509 sprintf(tmp,"%d",i); 510 510 if (strcmp(tmp,$1)!=0) … … 513 513 { 514 514 Werror("`%s` greater than %d(max. integer representation)" 515 ,$1, INT_MAX);515 ,$1,MAX_INT_VAL); 516 516 YYERROR; 517 517 } -
Singular/modulop.cc
rcedc3f ra4c74f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: modulop.cc,v 1.1 0 1999-05-10 15:10:50 Singular Exp $ */4 /* $Id: modulop.cc,v 1.11 1999-07-16 16:07:20 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: numbers modulo p (<=32003) … … 175 175 (*i) *= 10; 176 176 (*i) += *s++ - '0'; 177 if ((*i) >= ( INT_MAX/ 10)) (*i) = (*i) % npPrimeM;177 if ((*i) >= (MAX_INT_VAL / 10)) (*i) = (*i) % npPrimeM; 178 178 } 179 179 while (((*s) >= '0') && ((*s) <= '9')); -
Singular/scanner.l
rcedc3f ra4c74f 3 3 * Computer Algebra System SINGULAR * 4 4 ****************************************/ 5 /* $Id: scanner.l,v 1.1 8 1999-07-09 14:58:29Singular Exp $ */5 /* $Id: scanner.l,v 1.19 1999-07-16 16:07:21 Singular Exp $ */ 6 6 #include <stdio.h> 7 7 #include <string.h> … … 257 257 {integer} { 258 258 lvalp->name = (char *)yytext; 259 if ((currRing!=NULL) 260 && (strlen(lvalp->name)>MAX_INT_LEN)) 261 { 262 lvalp->name = mstrdup((char *)yytext); 263 return RINGVAR; 264 } 265 else 266 return INT_CONST; 259 return INT_CONST; 267 260 } 268 261 {integer}\/{integer} { -
Singular/shortfl.cc
rcedc3f ra4c74f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: shortfl.cc,v 1. 9 1999-06-28 16:06:31 Singular Exp $ */4 /* $Id: shortfl.cc,v 1.10 1999-07-16 16:07:21 Singular Exp $ */ 5 5 6 6 /* … … 55 55 int i; 56 56 float r = nf(n).F(); 57 if (((float)INT_MIN <= r) || ((float) INT_MAX>= r))57 if (((float)INT_MIN <= r) || ((float)MAX_INT_VAL >= r)) 58 58 i = (int)r; 59 59 else -
Singular/syz1.cc
rcedc3f ra4c74f 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz1.cc,v 1.3 7 1999-06-07 15:46:02 obachmanExp $ */4 /* $Id: syz1.cc,v 1.38 1999-07-16 16:07:22 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 303 303 { 304 304 i=1; 305 j = - INT_MAX;305 j = -MAX_INT_VAL; 306 306 int *ip=binomials+pGetExp(p,1); 307 307 loop … … 607 607 #endif 608 608 { 609 int i2=- INT_MAX;609 int i2=-MAX_INT_VAL; 610 610 int i1; 611 611 int j; … … 659 659 pAddExp(tm2,1, pGetExp(m,1)); 660 660 int *ip=binomials+pGetExp(tm2,1); 661 i2=- INT_MAX;661 i2=-MAX_INT_VAL; 662 662 loop 663 663 { … … 737 737 pAddExp(tm2,1, pGetExp(m,1)); 738 738 int *ip=binomials+pGetExp(tm2,1); 739 i2=- INT_MAX;739 i2=-MAX_INT_VAL; 740 740 loop 741 741 { … … 2781 2781 { 2782 2782 #ifdef __MWERKS__ 2783 const double m=(double) INT_MAX;2783 const double m=(double)MAX_INT_VAL; 2784 2784 double t=1.0; 2785 2785 unsigned int h_d=1; … … 2798 2798 long long t=1, h_d=1; 2799 2799 long long h_n=1+pVariables; 2800 while ((t=((t*h_n)/h_d))< INT_MAX)2800 while ((t=((t*h_n)/h_d))<MAX_INT_VAL) 2801 2801 { 2802 2802 h_d++;
Note: See TracChangeset
for help on using the changeset viewer.