Changeset 0bf7dff in git
- Timestamp:
- Sep 19, 2000, 5:22:25 PM (24 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 9c8b81ebdf5b81ba6d682234d624c628c8c2f128
- Parents:
- 82063a79ea38ca00e3f4367decdd79d1b0fcdfb7
- Location:
- Singular
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/ring.cc
r82063a r0bf7dff 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ring.cc,v 1.11 7 2000-09-18 09:19:31 obachmanExp $ */4 /* $Id: ring.cc,v 1.118 2000-09-19 15:22:23 Singular Exp $ */ 5 5 6 6 /* … … 2293 2293 2294 2294 /*2 2295 * optimize rGetExpSize for a block of N variables, exp <=bitmask 2296 */ 2297 unsigned long rGetExpSize(unsigned long bitmask, int & bits, int N) 2298 { 2299 #if SIZEOF_LONG == 8 2300 #define BITS_FOR_EXPS 64 2301 #else 2302 // SIZEOF_LONG ==4, 32 bits 2303 #define BITS_FOR_EXPS 32 2304 #endif 2305 bitmask =rGetExpSize(bitmask, &bits); 2306 int vars_per_long=BITS_FOR_EXPS/bits; 2307 int bits1; 2308 loop 2309 { 2310 unsigned long bitmask1 =rGetExpSize(bitmask+1, &bits1); 2311 int vars_per_long1=BITS_FOR_EXPS/bits1; 2312 if (((N+vars_per_long-1)/vars_per_long) 2313 == ((N+vars_per_long1-1)/vars_per_long1)) 2314 { 2315 vars_per_long=vars_per_long1; 2316 bits=bits1; 2317 bitmask=bitmask1; 2318 } 2319 else 2320 { 2321 return bitmask; /* and bits */ 2322 } 2323 } 2324 } 2325 2326 /*2 2295 2327 * create a copy of the ring r, which must be equivalent to currRing 2296 2328 * used for std computations -
Singular/ring.h
r82063a r0bf7dff 7 7 * ABSTRACT - the interpreter related ring operations 8 8 */ 9 /* $Id: ring.h,v 1.5 0 2000-09-07 16:22:02Singular Exp $ */9 /* $Id: ring.h,v 1.51 2000-09-19 15:22:25 Singular Exp $ */ 10 10 11 11 /* includes */ … … 166 166 ringorder_ws, 167 167 ringorder_Ws, 168 #ifdef HAVE_SHIFTED_EXPONENTS169 168 ringorder_L, 170 #endif171 169 ringorder_unspec 172 170 } rRingOrder_t; … … 224 222 #endif 225 223 226 #ifdef HAVE_SHIFTED_EXPONENTS227 224 unsigned long rGetExpSize(unsigned long bitmask, int & bits); 225 unsigned long rGetExpSize(unsigned long bitmask, int & bits, int N); 228 226 ring rModifyRing(ring r, BOOLEAN omit_degree, 229 227 BOOLEAN omit_comp, 230 228 unsigned long exp_limit); 231 229 void rKillModifiedRing(ring r); 232 #endif233 230 234 231 void rDebugPrint(ring r); 235 232 void pDebugPrint(poly p); 236 237 #endif 238 233 #endif -
Singular/structs.h
r82063a r0bf7dff 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: structs.h,v 1.3 6 2000-09-12 16:01:17 obachmanExp $ */6 /* $Id: structs.h,v 1.37 2000-09-19 15:22:25 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT … … 114 114 typedef struct p_Procs_s p_Procs_s; 115 115 116 // for hdegree.cc 116 // for hdegree.cc 117 117 typedef struct sindlist indlist; 118 118 typedef indlist * indset; … … 132 132 133 133 134 // for sparsemat.cc 134 // for sparsemat.cc 135 135 typedef struct smprec sm_prec; 136 136 typedef sm_prec * smpoly; … … 256 256 int *VarOffset; 257 257 /* mapping exp. of var(i) -> p->exp */ 258 #ifdef HAVE_SHIFTED_EXPONENTS259 258 /* mapping exp. of var(i) -> 260 259 p->exp[(VarOffset[i] & 0xffffff)] >> (VarOffset[i] >> 24) & bitmask */ 261 #else262 /* mapping exp. of var(i) -> p->exp.e[VarOffset[i]] */263 #endif264 260 265 261 struct omBin_s* PolyBin; /* Bin from where monoms are allocated */ -
Singular/subexpr.cc
r82063a r0bf7dff 5 5 * ABSTRACT: handling of leftv 6 6 */ 7 /* $Id: subexpr.cc,v 1.6 8 2000-09-19 12:43:32Singular Exp $ */7 /* $Id: subexpr.cc,v 1.69 2000-09-19 15:22:25 Singular Exp $ */ 8 8 9 9 #include <stdlib.h> … … 1109 1109 } 1110 1110 tmp.data=r; 1111 if ( rtyp==IDHDL)1111 if ((rtyp==IDHDL)||(rtyp==STRING_CMD)) 1112 1112 { 1113 1113 tmp.next=next; next=NULL;
Note: See TracChangeset
for help on using the changeset viewer.