Changeset 8c8bea in git
- Timestamp:
- May 26, 1999, 6:24:02 PM (24 years ago)
- Branches:
- (u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
- Children:
- 02be757a4cd1350a160ea7b013174d89e358e456
- Parents:
- 6ffb6fd0051336687cab0ad88f2e4354233e4769
- Location:
- Singular
- Files:
-
- 11 edited
-
Makefile.in (modified) (6 diffs)
-
ipprint.cc (modified) (6 diffs)
-
kutil.h (modified) (2 diffs)
-
modulop.h (modified) (2 diffs)
-
polys-comp.h (modified) (5 diffs)
-
polys.cc (modified) (2 diffs)
-
polys.h (modified) (2 diffs)
-
ring.h (modified) (2 diffs)
-
spolys0.cc (modified) (2 diffs)
-
structs.h (modified) (3 diffs)
-
syz.h (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
Singular/Makefile.in
r6ffb6f r8c8bea 82 82 mpsr_Put.cc mpsr_PutPoly.cc mpsr_Tok.cc mpsr_GetPoly.cc \ 83 83 mpsr_Get.cc mpsr_GetMisc.cc mpsr_Error.cc \ 84 ndbm.cc spSpolyLoop.cc libparse.cc mod_raw.cc \85 pcv.cc84 ndbm.cc spSpolyLoop.cc libparse.cc mod_raw.cc \ 85 pcv.cc kbuckets.cc kbPolyProcs.cc 86 86 87 87 CSOURCES=gmalloc.c mmalloc.c mmheap.c mmpage.c mmcheck.c mmisc.c mmtables.c \ 88 88 mmbt.c weight0.c find_exec.c getopt.c fereadl.c page.c 89 89 90 SOURCES=${CSOURCES} ${CXXSOURCES} grammar.y scanner.l libparse.l spSpolyLoop.pl 90 SOURCES=${CSOURCES} ${CXXSOURCES} grammar.y scanner.l libparse.l spSpolyLoop.pl generate.pl 91 91 92 92 HEADERS=algmap.h hutil.h lists.h stairc.h attrib.h ideals.h \ … … 103 103 kutil.h mpsr_Put.h spolys0.h sing_dld.h\ 104 104 ndbm.h spSpolyLoop.h polys-impl.h polys-comp.h getopt.h libparse.h \ 105 pcv.h mod_raw.h 105 pcv.h mod_raw.h kbuckets.h kbPolyProcs.h 106 106 107 107 INCS=febase.inc polys.inc iparith.inc mpsr_Tok.inc spSpolyLoop.inc … … 131 131 mpsr_Get.o mpsr_GetMisc.o ndbm.o spSpolyLoop.o libparse.o \ 132 132 find_exec.o getopt.o fereadl.o mod_raw.o sdb.o \ 133 pcv.o133 pcv.o kbuckets.o kbPolyProcs.o 134 134 135 135 ## … … 195 195 configure.in 196 196 echo "#define SINGULAR_VERSION_ID " `date '+%y%m%d%H'` >version.h 197 198 kbPolyProcs.cc kbPolyProcs.dd : kbPolyProcs.pin 199 200 kbPolyProcs.pin : generate.pl 201 @if test "x${PERL5}" = x; then \ 202 echo Error: no perl5 given. Can not rebuild $@;\ 203 exit 1;\ 204 fi 205 ${PERL5} generate.pl kb_n_Mult_p kb_p_Mult_m kb_p_Add_q kb_p_Minus_m_Mult_q > $@ 197 206 198 207 spSpolyLoop.cc spSpolyLoop.dd : spSpolyLoop.inc … … 347 356 mpsr_Get.og mpsr_GetMisc.og \ 348 357 ndbm.og spSpolyLoop.og libparse.og mod_raw.og \ 349 pcv.og358 pcv.og kbuckets.og kbPolyProcs.og 350 359 351 360 OBJG2= mmalloc.og mmheap.og mmpage.og mmcheck.og mmbt.og page.og \ … … 423 432 mpsr_Get.op mpsr_GetMisc.op \ 424 433 ndbm.op spSpolyLoop.op libparse.op mod_raw.op \ 425 pcv.op434 pcv.op kbuckets.op kbPolyProcs.op 426 435 427 436 OBJP2= mmalloc.op mmheap.op mmpage.op mmcheck.op mmbt.op page.op \ -
Singular/ipprint.cc
r6ffb6f r8c8bea 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipprint.cc,v 1.1 2 1999-04-20 11:25:50 SingularExp $ */4 /* $Id: ipprint.cc,v 1.13 1999-05-26 16:23:55 obachman Exp $ */ 5 5 /* 6 6 * ABSTRACT: interpreter: printing … … 345 345 { 346 346 res->data = (char*) u->String(NULL, TRUE, dim); 347 if (dim == 2) 348 { 349 char* ns = (char*) AllocL(strlen((char*) res->data) + 2); 350 strcpy(ns, (char*) res->data); 351 FreeL(res->data); 352 strcat(ns, "\n"); 353 res->data = ns; 354 } 347 355 } 348 356 else if (strcmp(ns,"%t") == 0) 349 357 { 350 358 SPrintStart(); 351 if (u->rtyp==IDHDL) type_cmd((idhdl) (u->data)); 352 else type_cmd((idhdl) u); 359 if (u->rtyp==IDHDL) 360 type_cmd((idhdl) (u->data)); 361 else 362 type_cmd((idhdl) u); 353 363 res->data = SPrintEnd(); 364 if (dim != 2) 365 ((char*)res->data)[strlen((char*)res->data) -1] = '\0'; 354 366 } 355 367 else if (strcmp(ns,"%;") == 0) … … 357 369 SPrintStart(); 358 370 u->Print(); 371 if (dim == 2) PrintLn(); 359 372 res->data = SPrintEnd(); 360 373 } … … 363 376 SPrintStart(); 364 377 iiExprArith1(res, u, PRINT_CMD); 378 if (dim == 2) PrintLn(); 365 379 res->data = SPrintEnd(); 366 380 } … … 369 383 SPrintStart(); 370 384 ipPrintBetti(u); 385 if (dim == 2) PrintLn(); 371 386 res->data = SPrintEnd(); 372 387 } … … 374 389 { 375 390 res->data = u->String(NULL, FALSE, dim); 391 if (dim == 2) 392 { 393 char* ns = (char*) AllocL(strlen((char*) res->data) + 2); 394 strcpy(ns, (char*) res->data); 395 FreeL(res->data); 396 strcat(ns, "\n"); 397 res->data = ns; 398 } 376 399 } 377 400 -
Singular/kutil.h
r6ffb6f r8c8bea 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: kutil.h,v 1.1 3 1998-12-15 10:08:50 pohlExp $ */6 /* $Id: kutil.h,v 1.14 1999-05-26 16:23:56 obachman Exp $ */ 7 7 /* 8 8 * ABSTRACT: kernel: utils for kStd … … 155 155 156 156 rOrderType_t spGetOrderType(ring r, int modrank, int syzcomp); 157 extern int spCheckCoeff(number *a, number *b); 157 158 158 159 inline TSet initT () { return (TSet)Alloc0(setmax*sizeof(TObject)); } -
Singular/modulop.h
r6ffb6f r8c8bea 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: modulop.h,v 1. 4 1999-05-10 15:10:51 SingularExp $ */6 /* $Id: modulop.h,v 1.5 1999-05-26 16:23:57 obachman Exp $ */ 7 7 /* 8 8 * ABSTRACT: numbers modulo p (<=32003) … … 51 51 return (number)npExpTable[x<npPminus1M ? x : x-npPminus1M]; 52 52 } 53 54 inline number npAddM(number a, number b) 55 { 56 int ka = (int)a + (int)b; 57 if (ka >= npPrimeM) ka -= npPrimeM; 58 return (number)ka; 59 } 60 61 inline BOOLEAN npIsZeroM (number a) 62 { 63 return 0 == (int)a; 64 } 65 53 66 /* 54 67 *inline number npMultM(number a, number b) -
Singular/polys-comp.h
r6ffb6f r8c8bea 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: polys-comp.h,v 1. 9 1998-06-12 17:41:32obachman Exp $ */6 /* $Id: polys-comp.h,v 1.10 1999-05-26 16:23:57 obachman Exp $ */ 7 7 8 8 /*************************************************************** … … 14 14 15 15 #include "polys-impl.h" 16 #include "syz.h" 16 17 17 18 #ifdef WORDS_BIGENDIAN … … 221 222 while(0) 222 223 224 225 #define _pMonComp_otSYZDPC_nwONE(p1, p2, d, actionD, actionE) \ 226 do \ 227 { \ 228 d = *((long*) &(p2->exp[0])) - *((long*) &(p1->exp[0])); \ 229 if (d) \ 230 { \ 231 const long c1 = pGetComp(p1); \ 232 const long c2 = pGetComp(p2); \ 233 if (c2 - c1 == d) \ 234 { \ 235 d = currcomponents[c1] - currcomponents[c2]; \ 236 } \ 237 actionD; \ 238 } \ 239 actionE; \ 240 } \ 241 while(0) 242 243 #define _pMonComp_otSYZDPC_nwTWO(p1, p2, d, actionD, actionE) \ 244 do \ 245 { \ 246 const long* s1 = (long*) &(p1->exp[0]); \ 247 const long* s2 = (long*) &(p2->exp[0]); \ 248 d = *s2 - *s1; \ 249 if (d) actionD; \ 250 d = *(s2 + 1) - *(s1 + 1); \ 251 if (d) \ 252 { \ 253 const long c1 = pGetComp(p1); \ 254 const long c2 = pGetComp(p2); \ 255 if (c2 - c1 == d) \ 256 { \ 257 d = currcomponents[c1] - currcomponents[c2]; \ 258 } \ 259 actionD; \ 260 } \ 261 actionE; \ 262 } \ 263 while(0) 264 265 #define _pMonComp_otSYZDPC_nwEVEN(p1, p2, length, d, actionD, actionE) \ 266 do \ 267 { \ 268 const long* s1 = (long*) &(p1->exp[0]); \ 269 const long* s2 = (long*) &(p2->exp[0]); \ 270 const long* const lb = s1 + length-1; \ 271 \ 272 for (;;) \ 273 { \ 274 d = *s2 - *s1; \ 275 if (d) actionD; \ 276 s1++; \ 277 if (s1 == lb) break; \ 278 s2++; \ 279 d = *s2 - *s1; \ 280 if (d) actionD; \ 281 s1++; \ 282 s2++; \ 283 } \ 284 \ 285 d = *(s2 + 1) - *s1; \ 286 if (d) \ 287 { \ 288 const long c1 = pGetComp(p1); \ 289 const long c2 = pGetComp(p2); \ 290 if (c2 - c1 == d) \ 291 { \ 292 d = currcomponents[c1] - currcomponents[c2]; \ 293 } \ 294 actionD; \ 295 } \ 296 actionE; \ 297 } \ 298 while(0) 299 300 #define _pMonComp_otSYZDPC_nwODD(p1, p2, length, d, actionD, actionE) \ 301 do \ 302 { \ 303 const long* s1 = (long*) &(p1->exp[0]); \ 304 const long* s2 = (long*) &(p2->exp[0]); \ 305 const long* const lb = s1 + length -1; \ 306 \ 307 for (;;) \ 308 { \ 309 d = *s2 - *s1; \ 310 if (d) actionD; \ 311 s1++; \ 312 s2++; \ 313 d = *s1 - *s2; \ 314 if (d) actionD; \ 315 s1++; \ 316 if (s1 == lb) break; \ 317 s2++; \ 318 } \ 319 \ 320 d = *(s2 + 1) - *s1; \ 321 if (d) \ 322 { \ 323 const long c1 = pGetComp(p1); \ 324 const long c2 = pGetComp(p2); \ 325 if (c2 - c1 == d) \ 326 { \ 327 d = currcomponents[c1] - currcomponents[c2]; \ 328 } \ 329 actionD; \ 330 } \ 331 actionE; \ 332 } \ 333 while(0) 334 335 #define _pMonComp_otSYZDPC_nwGEN(p1, p2, length, d, actionD, actionE) \ 336 do \ 337 { \ 338 const long* s1 = (long*) &(p1->exp[0]); \ 339 const long* s2 = (long*) &(p2->exp[0]); \ 340 const long* const lb = s1 + length -1; \ 341 \ 342 for (;;) \ 343 { \ 344 d = *s2 - *s1; \ 345 if (s1 == lb) break; \ 346 if (d) actionD; \ 347 s1++; \ 348 s2++; \ 349 } \ 350 \ 351 if (d) \ 352 { \ 353 const long c1 = pGetComp(p1); \ 354 const long c2 = pGetComp(p2); \ 355 if (c2 - c1 == d) \ 356 { \ 357 d = currcomponents[c1] - currcomponents[c2]; \ 358 } \ 359 actionD; \ 360 } \ 361 actionE; \ 362 } \ 363 while(0) 223 364 224 365 #else // ! WORDS_BIGENDIAN … … 419 560 } \ 420 561 \ 421 d = *s1 - *s2; \562 d = *s1 - *s2; \ 422 563 if (d) \ 423 564 { \ … … 430 571 while(0) 431 572 573 #define _pMonComp_otSYZDPC_nwODD(p1, p2, length, d, actionD, actionE) \ 574 do \ 575 { \ 576 const long* s1 = ((long*) p1) + pMonomSizeW-1; \ 577 const long* s2 = ((long*) p2) + pMonomSizeW-1; \ 578 const long* const lb = s1 - length +1; \ 579 \ 580 for (;;) \ 581 { \ 582 d = *s2 - *s1; \ 583 if (d) actionD; \ 584 s1--; \ 585 s2--; \ 586 d = *s2 - *s1; \ 587 if (d) actionD; \ 588 s1--; \ 589 if (s1 == lb) break; \ 590 s2--; \ 591 } \ 592 \ 593 d = *(s2 - 1) - *s1; \ 594 if (d) \ 595 { \ 596 const long c1 = pGetComp(p1); \ 597 const long c2 = pGetComp(p2); \ 598 if (c2 - c1 == d) \ 599 { \ 600 d = currcomponents[c1] - currcomponents[c2]; \ 601 } \ 602 actionD; \ 603 } \ 604 actionE; \ 605 } \ 606 while(0) 607 608 #define _pMonComp_otSYZDPC_nwEVEN(p1, p2, length, d, actionD, actionE) \ 609 do \ 610 { \ 611 const long* s1 = ((long*) p1) + pMonomSizeW-1; \ 612 const long* s2 = ((long*) p2) + pMonomSizeW-1; \ 613 const long* const lb = s1 - length +1; \ 614 \ 615 for (;;) \ 616 { \ 617 d = *s2 - *s1; \ 618 if (d) actionD; \ 619 s1--; \ 620 if (s1 == lb) break; \ 621 s2--; \ 622 d = *s2 - *s1; \ 623 if (d) actionD; \ 624 s1--; \ 625 s2--; \ 626 } \ 627 \ 628 d = *(s2 - 1) - *s1; \ 629 if (d) \ 630 { \ 631 const long c1 = pGetComp(p1); \ 632 const long c2 = pGetComp(p2); \ 633 if (c2 - c1 == d) \ 634 { \ 635 d = currcomponents[c1] - currcomponents[c2]; \ 636 } \ 637 actionD; \ 638 } \ 639 actionE; \ 640 } \ 641 while(0) 642 643 #define _pMonComp_otSYZDPC_nwTWO(p1, p2, d, actionD, actionE) \ 644 do \ 645 { \ 646 const long* s1 = ((long*) p1) + pMonomSizeW-1; \ 647 const long* s2 = ((long*) p2) + pMonomSizeW-1; \ 648 d = *s2 - *s1; \ 649 if (d) actionD; \ 650 d = *s2 - *s1; \ 651 if (d) actionD; \ 652 d = *(s2 -1) - *(s1 -1); \ 653 if (d) \ 654 { \ 655 const long c1 = pGetComp(p1); \ 656 const long c2 = pGetComp(p2); \ 657 if (c2 - c1 == d) \ 658 { \ 659 d = currcomponents[c1] - currcomponents[c2]; \ 660 } \ 661 actionD; \ 662 } \ 663 actionE; \ 664 } \ 665 while(0) 666 667 #define _pMonComp_otSYZDPC_nwONE(p1, p2, d, actionD, actionE) \ 668 do \ 669 { \ 670 d = *(((long*) p2) + pMonomSizeW-1) - *(((long*) p1) + pMonomSizeW-1); \ 671 if (d) \ 672 { \ 673 const long c1 = pGetComp(p1); \ 674 const long c2 = pGetComp(p2); \ 675 if (c2 - c1 == d) \ 676 { \ 677 d = currcomponents[c1] - currcomponents[c2]; \ 678 } \ 679 actionD; \ 680 } \ 681 actionE; \ 682 } \ 683 while(0) 684 685 #define _pMonComp_otSYZDPC_nwGEN(p1, p2, length, d, actionD, actionE) \ 686 do \ 687 { \ 688 const long* s1 = ((long*) p1) + pMonomSizeW-1; \ 689 const long* s2 = ((long*) p2) + pMonomSizeW-1; \ 690 const long* const lb = s1 - length +1; \ 691 \ 692 for (;;) \ 693 { \ 694 d = *s2 - *s1; \ 695 if (s1 == lb) break; \ 696 if (d) actionD; \ 697 s1--; \ 698 s2--; \ 699 } \ 700 \ 701 if (d) \ 702 { \ 703 const long c1 = pGetComp(p1); \ 704 const long c2 = pGetComp(p2); \ 705 if (c2 - c1 == d) \ 706 { \ 707 d = currcomponents[c1] - currcomponents[c2]; \ 708 } \ 709 actionD; \ 710 } \ 711 actionE; \ 712 } \ 713 while(0) 714 432 715 #endif // WORDS_BIGENDIAN 433 716 -
Singular/polys.cc
r6ffb6f r8c8bea 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: polys.cc,v 1.3 8 1999-05-25 16:49:39 obachman Exp $ */4 /* $Id: polys.cc,v 1.39 1999-05-26 16:23:59 obachman Exp $ */ 5 5 6 6 /* … … 1927 1927 } 1928 1928 1929 1930 // Splits *p into two polys: *q which consists of all monoms with 1931 // component == comp and *p of all other monoms *lq == pLength(*q) 1932 void pTakeOutComp(poly *r_p, Exponent_t comp, poly *r_q, int *lq) 1933 { 1934 spolyrec pp, qq; 1935 poly p, q, p_prev; 1936 int l = 0; 1937 1938 #ifdef HAVE_ASSUME 1939 int lp = pLength(*r_p); 1940 #endif 1941 1942 pNext(&pp) = *r_p; 1943 p = *r_p; 1944 p_prev = &pp; 1945 q = &qq; 1946 1947 while(p != NULL) 1948 { 1949 while (pGetComp(p) == comp) 1950 { 1951 pNext(q) = p; 1952 pIter(q); 1953 pSetComp(p, 0); 1954 pIter(p); 1955 l++; 1956 if (p == NULL) 1957 { 1958 pNext(p_prev) = NULL; 1959 goto Finish; 1960 } 1961 } 1962 pNext(p_prev) = p; 1963 p_prev = p; 1964 pIter(p); 1965 } 1966 1967 Finish: 1968 pNext(q) = NULL; 1969 *r_p = pNext(&pp); 1970 *r_q = pNext(&qq); 1971 *lq = l; 1972 #ifdef HAVE_ASSUME 1973 assume(pLength(*r_p) + pLength(*r_q) == lp); 1974 #endif 1975 pTest(*r_p); 1976 pTest(*r_q); 1977 } 1978 1979 void pDecrOrdTakeOutComp(poly *r_p, Exponent_t comp, Order_t order, 1980 poly *r_q, int *lq) 1981 { 1982 spolyrec pp, qq; 1983 poly p, q, p_prev; 1984 int l = 0; 1985 1986 pNext(&pp) = *r_p; 1987 p = *r_p; 1988 p_prev = &pp; 1989 q = &qq; 1990 1991 #ifdef HAVE_ASSUME 1992 if (p != NULL) 1993 { 1994 while (pNext(p) != NULL) 1995 { 1996 assume(pGetOrder(p) >= pGetOrder(pNext(p))); 1997 pIter(p); 1998 } 1999 } 2000 p = *r_p; 2001 #endif 2002 2003 while (p != NULL && pGetOrder(p) > order) pIter(p); 2004 2005 while(p != NULL && pGetOrder(p) == order) 2006 { 2007 while (pGetComp(p) == comp) 2008 { 2009 pNext(q) = p; 2010 pIter(q); 2011 pIter(p); 2012 pSetComp(p, 0); 2013 l++; 2014 if (p == NULL || pGetOrder(p) != order) 2015 { 2016 pNext(p_prev) = p; 2017 goto Finish; 2018 } 2019 } 2020 pNext(p_prev) = p; 2021 p_prev = p; 2022 pIter(p); 2023 } 2024 2025 Finish: 2026 pNext(q) = NULL; 2027 *r_p = pNext(&pp); 2028 *r_q = pNext(&qq); 2029 *lq = l; 2030 } 2031 1929 2032 poly pTakeOutComp1(poly * p, int k) 1930 2033 { -
Singular/polys.h
r6ffb6f r8c8bea 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: polys.h,v 1. 19 1998-12-03 11:02:37obachman Exp $ */6 /* $Id: polys.h,v 1.20 1999-05-26 16:24:00 obachman Exp $ */ 7 7 /* 8 8 * ABSTRACT - all basic methods to manipulate polynomials … … 298 298 BOOLEAN pVectorHasUnitB(poly p, int * k); 299 299 void pVectorHasUnit(poly p, int * k, int * len); 300 poly pTakeOutComp1(poly * p, int k); 301 // Splits *p into two polys: *q which consists of all monoms with 302 // component == comp and *p of all other monoms *lq == pLength(*q) 303 // On rreturn all components pf *q == 0 304 void pTakeOutComp(poly *p, Exponent_t comp, poly *q, int *lq); 305 // Similar to pTakeOutComp, except that only those components are 306 // taken out whose Order == order 307 // ASSUME: monomial ordering is Order compatible, i.e., if m1, m2 Monoms then 308 // m1 >= m2 ==> pGetOrder(m1) >= pGetOrder(m2) 309 void pDecrOrdTakeOutComp(poly *p, Exponent_t comp, Order_t order, 310 poly *q, int *lq); 311 // This is something weird -- Don't use it, unless you know what you are doing 300 312 poly pTakeOutComp(poly * p, int k); 301 poly pTakeOutComp1(poly * p, int k);302 313 void pDeleteComp(poly * p,int k); 303 314 void pNorm(poly p); -
Singular/ring.h
r6ffb6f r8c8bea 7 7 * ABSTRACT - the interpreter related ring operations 8 8 */ 9 /* $Id: ring.h,v 1.2 5 1999-05-10 15:10:54 SingularExp $ */9 /* $Id: ring.h,v 1.26 1999-05-26 16:24:00 obachman Exp $ */ 10 10 11 11 /* includes */ … … 106 106 // component is compatible with exp-vector order 107 107 rOrderType_Syz, // syzygy ordering 108 rOrderType_Schreyer // Schreyer ordering 108 rOrderType_Schreyer, // Schreyer ordering 109 rOrderType_Syz2dpc, // syzcomp2dpc 110 rOrderType_ExpNoComp // simple ordering, differences in component are 111 // not considered 109 112 } rOrderType_t; 110 113 -
Singular/spolys0.cc
r6ffb6f r8c8bea 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: spolys0.cc,v 1.1 3 1998-11-11 14:44:27 SingularExp $ */4 /* $Id: spolys0.cc,v 1.14 1999-05-26 16:24:01 obachman Exp $ */ 5 5 6 6 /* … … 29 29 * this value is used to control the spolys 30 30 */ 31 staticint spCheckCoeff(number *a, number *b)31 int spCheckCoeff(number *a, number *b) 32 32 { 33 33 int c = 0; -
Singular/structs.h
r6ffb6f r8c8bea 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: structs.h,v 1. 19 1999-04-29 11:38:58 SingularExp $ */6 /* $Id: structs.h,v 1.20 1999-05-26 16:24:02 obachman Exp $ */ 7 7 /* 8 8 * ABSTRACT … … 54 54 class procinfo; 55 55 class namerec; 56 class kBucket; 56 57 #endif 57 58 … … 106 107 typedef procinfo * procinfov; 107 108 typedef namerec * namehdl; 109 typedef kBucket* kBucket_pt; 108 110 109 111 struct _scmdnames -
Singular/syz.h
r6ffb6f r8c8bea 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: syz.h,v 1.1 2 1998-11-12 14:44:37 siebertExp $ */6 /* $Id: syz.h,v 1.13 1999-05-26 16:24:02 obachman Exp $ */ 7 7 /* 8 8 * ABSTRACT: Resolutions … … 94 94 syStrategy syMinimize(syStrategy syzstr); 95 95 void syKillEmptyEntres(resolvente res,int length); 96 97 extern int * currcomponents; 96 98 #endif
Note: See TracChangeset
for help on using the changeset viewer.
