Changeset 1c7953 in git
 Timestamp:
 Sep 13, 2007, 4:17:08 PM (16 years ago)
 Branches:
 (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
 Children:
 01a57be60f163f44715ff7f3812b07c7ae891a78
 Parents:
 65bed3e3b194419dbe07eddc61d688cab60323cd
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

kernel/ffields.cc
r65bed3 r1c7953 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ffields.cc,v 1. 6 20070731 15:32:32Singular Exp $ */4 /* $Id: ffields.cc,v 1.7 20070913 14:17:08 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: finite fields with a noneprime number of elements (via tables) … … 146 146 #endif 147 147 if (((long)a == (long)nfCharQ)  ((long)b == (long)nfCharQ)) 148 return (number) nfCharQ;148 return (number)(long)nfCharQ; 149 149 /*else*/ 150 150 int i=(int)((long)a+(long)b); 151 151 if (i>=nfCharQ1) i=nfCharQ1; 152 152 #ifdef LDEBUG 153 nfTest((number) i);154 #endif 155 return (number) i;153 nfTest((number)(long)i); 154 #endif 155 return (number)(long)i; 156 156 } 157 157 … … 163 163 // Hmm .. this is just to prevent initialization 164 164 // from nfInitChar to go into an infinite loop 165 if (i==0) return (number) nfCharQ;165 if (i==0) return (number)(long)nfCharQ; 166 166 while (i < 0) i += nfCharP; 167 167 while (i >= nfCharP) i = nfCharP; 168 if (i==0) return (number) nfCharQ;168 if (i==0) return (number)(long)nfCharQ; 169 169 CARDINAL c=0; 170 170 while (i>1) … … 174 174 } 175 175 #ifdef LDEBUG 176 nfTest((number) c);177 #endif 178 return (number) c;176 nfTest((number)(long)c); 177 #endif 178 return (number)(long)c; 179 179 } 180 180
Note: See TracChangeset
for help on using the changeset viewer.