Changeset 241f58 in git
- Timestamp:
- Mar 14, 2001, 4:51:53 PM (22 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 4e18c51925ab32021341e7172545db0b399b0eab
- Parents:
- 7bd107102e136678c7798894c6d866b2b4d30d3f
- Location:
- Singular
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/hilb.cc
r7bd1071 r241f58 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: hilb.cc,v 1.1 8 2000-12-14 16:38:48 obachmanExp $ */4 /* $Id: hilb.cc,v 1.19 2001-03-14 15:51:53 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - Hilbert series … … 264 264 for (i = hNvar; i; i--) 265 265 hvar[i] = i; 266 if (notstc)266 //if (notstc) // TODO: no mon divedes another 267 267 hStaircase(hstc, &hNstc, hvar, hNvar); 268 268 hSupp(hstc, hNstc, hvar, &hNvar); -
Singular/hutil.cc
r7bd1071 r241f58 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: hutil.cc,v 1.1 8 2000-11-08 15:34:55 obachmanExp $ */4 /* $Id: hutil.cc,v 1.19 2001-03-14 15:51:52 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: Utilities for staircase operations … … 289 289 static void hShrink(scfmon co, int a, int Nco) 290 290 { 291 int i = a, j = a; 292 for (; j < Nco; j++) 293 { 294 if (co[j]) 291 while ((co[a]!=NULL) && (a<Nco)) a++; 292 int i = a; 293 int j; 294 for (j = a; j < Nco; j++) 295 { 296 if (co[j]!=NULL) 295 297 { 296 298 co[i] = co[j]; … … 303 305 void hStaircase(scfmon stc, int *Nstc, varset var, int Nvar) 304 306 { 305 int nc = *Nstc, z = 0, i, j, k, k1; 306 scmon n, o; 307 int nc = *Nstc; 307 308 if (nc < 2) 308 309 return; 309 i = 0; 310 j = 1; 311 n = stc[j]; 312 o = *stc; 313 k = Nvar; 310 int z = 0; 311 int i = 0; 312 int j = 1; 313 scmon n = stc[1 /*j*/]; 314 scmon o = stc[0]; 315 int k = Nvar; 314 316 loop 315 317 { 316 k1 = var[k];318 int k1 = var[k]; 317 319 if (o[k1] > n[k1]) 318 320 { … … 320 322 { 321 323 k--; 322 if ( !k)324 if (k==0) 323 325 { 324 326 stc[i] = NULL; … … 340 342 { 341 343 k--; 342 if ( !k)344 if (k==0) 343 345 { 344 346 stc[j] = NULL; … … 358 360 { 359 361 k--; 360 if ( !k)362 if (k==0) 361 363 { 362 364 stc[j] = NULL; … … 367 369 if (k == Nvar) 368 370 { 369 if ( !stc[j])371 if (stc[j]==NULL) 370 372 i = j - 1; 371 373 loop … … 380 382 else 381 383 { 382 if (z )384 if (z!=0) 383 385 { 384 386 *Nstc -= z; … … 388 390 } 389 391 } 390 else if (stc[i] )392 else if (stc[i]!=NULL) 391 393 { 392 394 o = stc[i]; … … 545 547 } 546 548 else 549 { 547 550 k--; 551 } 548 552 } 549 553 } -
Singular/kutil.cc
r7bd1071 r241f58 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kutil.cc,v 1.9 8 2001-03-08 13:05:13 Singular Exp $ */4 /* $Id: kutil.cc,v 1.99 2001-03-14 15:51:53 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: kernel: utils for kStd … … 1682 1682 if (pLmCmp(set[an],p) == -cmp_int) return en; 1683 1683 if ((cmp_int!=1) 1684 && ((strat->ecartS[an]) <ecart_p))1684 && ((strat->ecartS[an])>ecart_p)) 1685 1685 return an; 1686 1686 return en;
Note: See TracChangeset
for help on using the changeset viewer.