Changeset cf42ab1 in git
- Timestamp:
- Dec 6, 2000, 12:03:33 PM (23 years ago)
- Branches:
- (u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
- Children:
- 81d00f6c5e73ee2ae0294081b3eb6ffc9485748f
- Parents:
- f7dade6bf24bb053c360ca399d303c8ffa2cc6da
- Location:
- Singular
- Files:
-
- 29 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/clapconv.cc
rf7dade rcf42ab1 3 3 * Computer Algebra System SINGULAR * 4 4 ****************************************/ 5 // $Id: clapconv.cc,v 1.2 8 2000-11-03 13:02:58 Singular Exp $5 // $Id: clapconv.cc,v 1.29 2000-12-06 11:03:08 Singular Exp $ 6 6 /* 7 7 * ABSTRACT: convert data between Singular and factory … … 16 16 #include "clapconv.h" 17 17 #include "numbers.h" 18 #include "modulop.h" 18 19 #include "longalg.h" 19 20 #include "polys.h" 20 #include "modulop.h"21 21 #include "febase.h" 22 22 #include "ipid.h" -
Singular/fglm.cc
rf7dade rcf42ab1 1 1 // emacs edit mode for this file is -*- C++ -*- 2 // $Id: fglm.cc,v 1.2 2 2000-09-18 09:18:57 obachmanExp $2 // $Id: fglm.cc,v 1.23 2000-12-06 11:03:09 Singular Exp $ 3 3 4 4 /**************************************** … … 171 171 // both rings are qrings, now check if both quotients define the same ideal. 172 172 // check if sring->qideal is contained in dring->qideal: 173 rSetHdl( dringHdl , TRUE);173 rSetHdl( dringHdl ); 174 174 //nSetMap( rInternalChar(sring), sring->parameter, npar, sring->minpoly ); 175 175 nSetMap( sring ); … … 184 184 idDelete( & sqind ); 185 185 idDelete( & sqindred ); 186 rSetHdl( sringHdl , TRUE);186 rSetHdl( sringHdl ); 187 187 if ( state != FglmOk ) return state; 188 188 // check if dring->qideal is contained in sring->qideal: … … 264 264 ideal destIdeal = NULL; 265 265 idhdl sourceRingHdl = (idhdl)first->data; 266 rSetHdl( sourceRingHdl , TRUE);266 rSetHdl( sourceRingHdl ); 267 267 ring sourceRing = currRing; 268 268 … … 289 289 } 290 290 if ( currRingHdl != destRingHdl ) 291 rSetHdl( destRingHdl , TRUE);291 rSetHdl( destRingHdl ); 292 292 switch (state) { 293 293 case FglmOk: -
Singular/fglmzero.cc
rf7dade rcf42ab1 1 1 // emacs edit mode for this file is -*- C++ -*- 2 // $Id: fglmzero.cc,v 1.3 0 2000-09-18 09:18:59 obachmanExp $2 // $Id: fglmzero.cc,v 1.31 2000-12-06 11:03:09 Singular Exp $ 3 3 4 4 /**************************************** … … 1137 1137 1138 1138 if ( currRingHdl != sourceRingHdl ) 1139 rSetHdl( sourceRingHdl , TRUE);1139 rSetHdl( sourceRingHdl ); 1140 1140 idealFunctionals L( 100, pVariables ); 1141 1141 fglmok = CalculateFunctionals( sourceIdeal, L ); 1142 1142 if ( deleteIdeal == TRUE ) 1143 1143 idDelete( & sourceIdeal ); 1144 rSetHdl( destRingHdl , TRUE);1144 rSetHdl( destRingHdl ); 1145 1145 if ( fglmok == TRUE ) { 1146 1146 L.map( IDRING( sourceRingHdl ) ); … … 1148 1148 } 1149 1149 if ( (switchBack == TRUE) && (currRingHdl != initialRingHdl) ) 1150 rSetHdl( initialRingHdl , TRUE);1150 rSetHdl( initialRingHdl ); 1151 1151 return fglmok; 1152 1152 } -
Singular/gnumpc.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: gnumpc.cc,v 1.1 3 2000-09-18 09:18:59 obachmanExp $ */4 /* $Id: gnumpc.cc,v 1.14 2000-12-06 11:03:09 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: computations with GMP complex floating-point numbers … … 14 14 #include "omalloc.h" 15 15 #include "numbers.h" 16 #include "modulop.h"17 16 #include "longrat.h" 18 17 -
Singular/grammar.y
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: grammar.y,v 1.8 6 2000-11-14 16:08:23Singular Exp $ */4 /* $Id: grammar.y,v 1.87 2000-12-06 11:03:10 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: SINGULAR shell grammatik … … 1442 1442 } 1443 1443 } 1444 if (h!=NULL) rSetHdl(h ,TRUE);1444 if (h!=NULL) rSetHdl(h); 1445 1445 else 1446 1446 { -
Singular/ideals.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ideals.cc,v 1.11 5 2000-12-05 09:05:58Singular Exp $ */4 /* $Id: ideals.cc,v 1.116 2000-12-06 11:03:10 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - all basic methods to manipulate ideals … … 1114 1114 1115 1115 if(syz_ring!=orig_ring) 1116 rChangeCurrRing(orig_ring ,TRUE);1116 rChangeCurrRing(orig_ring); 1117 1117 1118 1118 result = idInit(IDELEMS(temp1),rank); … … 1142 1142 if(syz_ring!=orig_ring) 1143 1143 { 1144 rChangeCurrRing(syz_ring ,FALSE);1144 rChangeCurrRing(syz_ring); 1145 1145 idDelete(&temp1); 1146 rChangeCurrRing(orig_ring ,TRUE);1146 rChangeCurrRing(orig_ring); 1147 1147 rKill(syz_ring); 1148 1148 } … … 1239 1239 1240 1240 if(syz_ring!=orig_ring) 1241 rChangeCurrRing(orig_ring ,TRUE);1241 rChangeCurrRing(orig_ring); 1242 1242 1243 1243 /* interprete result ----------------------------------------*/ … … 1264 1264 /* clean up ----------------------------------------------------*/ 1265 1265 if(syz_ring!=orig_ring) 1266 rChangeCurrRing(syz_ring ,FALSE);1266 rChangeCurrRing(syz_ring); 1267 1267 idDelete(&tempstd); 1268 1268 if(syz_ring!=orig_ring) 1269 1269 { 1270 rChangeCurrRing(orig_ring ,TRUE);1270 rChangeCurrRing(orig_ring); 1271 1271 rKill(syz_ring); 1272 1272 } … … 1396 1396 idSkipZeroes(s_h3); 1397 1397 s_h3->rank -= k; 1398 rChangeCurrRing(orig_ring , TRUE);1398 rChangeCurrRing(orig_ring); 1399 1399 s_h3 = idrMoveR_NoSort(s_h3, syz_ring); 1400 1400 rKill(syz_ring); … … 1443 1443 if (dp_C_ring != syz_ring) 1444 1444 { 1445 rChangeCurrRing(syz_ring , TRUE);1445 rChangeCurrRing(syz_ring); 1446 1446 rKill(dp_C_ring); 1447 1447 } … … 1495 1495 idDelete(&s_h1); 1496 1496 idSkipZeroes(s_h3); 1497 rChangeCurrRing(orig_ring , TRUE);1497 rChangeCurrRing(orig_ring); 1498 1498 s_h3 = idrMoveR_NoSort(s_h3, syz_ring); 1499 1499 rKill(syz_ring); … … 1571 1571 { 1572 1572 idDelete(&s_h1); 1573 rChangeCurrRing(orig_ring ,TRUE);1573 rChangeCurrRing(orig_ring); 1574 1574 } 1575 1575 … … 1799 1799 { 1800 1800 idDelete(&s_mod); 1801 rChangeCurrRing(orig_ring ,TRUE);1801 rChangeCurrRing(orig_ring); 1802 1802 s_result = idrMoveR_NoSort(s_result, syz_ring); 1803 1803 s_rest = idrMoveR_NoSort(s_rest, syz_ring); … … 2024 2024 { 2025 2025 // pDelete(&q); 2026 rChangeCurrRing(orig_ring ,TRUE);2026 rChangeCurrRing(orig_ring); 2027 2027 s_h3 = idrMoveR_NoSort(s_h3, syz_ring); 2028 2028 rKill(syz_ring); … … 2297 2297 // change into the new ring 2298 2298 //pChangeRing(pVariables,currRing->OrdSgn,ord,block0,block1,wv); 2299 rChangeCurrRing(&tmpR , TRUE);2299 rChangeCurrRing(&tmpR); 2300 2300 currRing = &tmpR; 2301 2301 h = idInit(IDELEMS(h1),h1->rank); … … 2307 2307 2308 2308 // go back to the original ring 2309 rChangeCurrRing(origR ,TRUE);2309 rChangeCurrRing(origR); 2310 2310 i = IDELEMS(hh)-1; 2311 2311 while ((i >= 0) && (hh->m[i] == NULL)) i--; … … 2327 2327 } 2328 2328 } 2329 rChangeCurrRing(&tmpR , FALSE);2329 rChangeCurrRing(&tmpR); 2330 2330 idDelete(&hh); 2331 rChangeCurrRing(origR , TRUE);2331 rChangeCurrRing(origR); 2332 2332 idSkipZeroes(h3); 2333 2333 omFree((ADDRESS)wv[0]); … … 2916 2916 { 2917 2917 idDelete(&s_temp); 2918 rChangeCurrRing(orig_ring ,TRUE);2918 rChangeCurrRing(orig_ring); 2919 2919 } 2920 2920 … … 2924 2924 if (syz_ring!=orig_ring) 2925 2925 { 2926 rChangeCurrRing(syz_ring ,FALSE);2926 rChangeCurrRing(syz_ring); 2927 2927 idDelete(&s_temp1); 2928 rChangeCurrRing(orig_ring ,TRUE);2928 rChangeCurrRing(orig_ring); 2929 2929 rKill(syz_ring); 2930 2930 } … … 3035 3035 if (syz_ring!=orig_ring) 3036 3036 { 3037 rChangeCurrRing(orig_ring ,TRUE);3037 rChangeCurrRing(orig_ring); 3038 3038 s_temp1 = idrMoveR_NoSort(s_temp1, syz_ring); 3039 3039 rKill(syz_ring); -
Singular/iparith.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: iparith.cc,v 1.23 7 2000-11-27 12:52:32Singular Exp $ */4 /* $Id: iparith.cc,v 1.238 2000-12-06 11:03:11 Singular Exp $ */ 5 5 6 6 /* … … 1645 1645 BITSET save_test=test; 1646 1646 naSetChar(rInternalChar(r),TRUE, r); 1647 nSetChar(currRing ,TRUE);1647 nSetChar(currRing); 1648 1648 test=save_test; 1649 1649 } -
Singular/ipassign.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipassign.cc,v 1.6 1 2000-10-19 15:00:13 obachmanExp $ */4 /* $Id: ipassign.cc,v 1.62 2000-12-06 11:03:14 Singular Exp $ */ 5 5 6 6 /* … … 472 472 //currRingHdl=(idhdl)res->data; 473 473 //currQuotient=qr->qideal; 474 rSetHdl((idhdl)res->data ,TRUE);474 rSetHdl((idhdl)res->data); 475 475 return FALSE; 476 476 } -
Singular/ipid.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipid.cc,v 1.4 5 2000-11-14 16:04:53 obachmanExp $ */4 /* $Id: ipid.cc,v 1.46 2000-12-06 11:03:15 Singular Exp $ */ 5 5 6 6 /* … … 506 506 { 507 507 needResetRing=TRUE; 508 rSetHdl(h ,FALSE);508 rSetHdl(h); 509 509 /* no complete init*/ 510 510 } … … 536 536 if (savecurrRingHdl!=NULL) 537 537 { 538 rSetHdl(savecurrRingHdl ,TRUE);538 rSetHdl(savecurrRingHdl); 539 539 } 540 540 else if (savecurrRing!=NULL) 541 541 { 542 rChangeCurrRing(savecurrRing ,TRUE);542 rChangeCurrRing(savecurrRing); 543 543 } 544 544 } -
Singular/iplib.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: iplib.cc,v 1. 79 2000-12-04 14:33:49Singular Exp $ */4 /* $Id: iplib.cc,v 1.80 2000-12-06 11:03:16 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: interpreter: LIB and help … … 483 483 if (iiLocalRing[myynest]!=NULL) 484 484 { 485 rSetHdl(rFindHdl(iiLocalRing[myynest],NULL, NULL) ,TRUE);485 rSetHdl(rFindHdl(iiLocalRing[myynest],NULL, NULL)); 486 486 iiLocalRing[myynest]=NULL; 487 487 namespaceroot->next->currRing = NULL; … … 510 510 if (NS_LRING!=NULL) 511 511 { 512 rSetHdl(rFindHdl(NS_LRING,NULL, NULL) ,TRUE);512 rSetHdl(rFindHdl(NS_LRING,NULL, NULL)); 513 513 NS_LRING=NULL; 514 514 } … … 582 582 if (iiLocalRing[myynest]!=NULL) 583 583 { 584 rSetHdl(rFindHdl(iiLocalRing[myynest],NULL, NULL) ,TRUE);584 rSetHdl(rFindHdl(iiLocalRing[myynest],NULL, NULL)); 585 585 iiLocalRing[myynest]=NULL; 586 586 } … … 596 596 if (NS_LRING!=NULL) 597 597 { 598 rSetHdl(rFindHdl(NS_LRING,NULL, NULL) ,TRUE);598 rSetHdl(rFindHdl(NS_LRING,NULL, NULL)); 599 599 NS_LRING=NULL; 600 600 } -
Singular/ipshell.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipshell.cc,v 1.5 7 2000-10-19 15:00:13 obachmanExp $ */4 /* $Id: ipshell.cc,v 1.58 2000-12-06 11:03:18 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: … … 279 279 && (IDRING(h)->idroot!=NULL)) 280 280 { 281 if (h!=currRingHdl) {changed=TRUE;rSetHdl(h ,FALSE);}281 if (h!=currRingHdl) {changed=TRUE;rSetHdl(h);} 282 282 killlocals0(v,&(IDRING(h)->idroot)); 283 283 } … … 293 293 { 294 294 //Print("=====> Toplevel: ring %s, lev: %d:\n",IDID(h),IDLEV(h)); 295 if (h!=currRingHdl) {changed=TRUE;rSetHdl(h ,FALSE);}295 if (h!=currRingHdl) {changed=TRUE;rSetHdl(h);} 296 296 killlocals0(v,&(IDRING(h)->idroot)); 297 297 } … … 307 307 { 308 308 //Print("=====> '%s': ring %s, lev: %d:\n",IDID(h),IDID(h0),IDLEV(h0)); 309 if (h0!=currRingHdl) {changed=TRUE;rSetHdl(h0 ,FALSE);}309 if (h0!=currRingHdl) {changed=TRUE;rSetHdl(h0);} 310 310 killlocals0(v,&(IDRING(h0)->idroot)); 311 311 } … … 321 321 currRing=NULL; 322 322 currRingHdl=NULL; 323 if (sh!=NULL) rSetHdl(sh ,TRUE);323 if (sh!=NULL) rSetHdl(sh); 324 324 } 325 325 -
Singular/maps.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: maps.cc,v 1. 29 2000-11-09 16:32:52 obachmanExp $ */4 /* $Id: maps.cc,v 1.30 2000-12-06 11:03:19 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - the mapping of polynomials to other rings … … 248 248 249 249 // change to new ring 250 rChangeCurrRing(&tmpR , FALSE);250 rChangeCurrRing(&tmpR); 251 251 if (id==NULL) 252 252 j = 0; … … 293 293 294 294 // let's get back to the original ring 295 rChangeCurrRing(sourcering , FALSE);295 rChangeCurrRing(sourcering); 296 296 temp1 = idInit(5,1); 297 297 j = 0; -
Singular/modulop.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: modulop.cc,v 1.2 1 2000-11-25 20:30:19 obachmanExp $ */4 /* $Id: modulop.cc,v 1.22 2000-12-06 11:03:20 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: numbers modulo p (<=32003) … … 212 212 void npSetChar(int c, ring r) 213 213 { 214 int i, w;215 216 if (c==npPrimeM) return;217 if (npPrimeM > 1)218 {219 omFreeSize( (ADDRESS)npExpTable,npPrimeM*sizeof(CARDINAL) );220 omFreeSize( (ADDRESS)npLogTable,npPrimeM*sizeof(CARDINAL) );221 }214 // int i, w; 215 216 // if (c==npPrimeM) return; 217 // if (npPrimeM > 1) 218 // { 219 // omFreeSize( (ADDRESS)npExpTable,npPrimeM*sizeof(CARDINAL) ); 220 // omFreeSize( (ADDRESS)npLogTable,npPrimeM*sizeof(CARDINAL) ); 221 // } 222 222 if ((c>1) || (c<(-1))) 223 223 { … … 225 225 else npPrimeM = -c; 226 226 npPminus1M = npPrimeM - 1; 227 npExpTable= (CARDINAL *)omAlloc( npPrimeM*sizeof(CARDINAL) ); 228 npLogTable= (CARDINAL *)omAlloc( npPrimeM*sizeof(CARDINAL) ); 229 omMarkAsStaticAddr(npExpTable); 230 omMarkAsStaticAddr(npLogTable); 231 npExpTable[0] = 1; 232 npLogTable[1] = 0; 233 if (npPrimeM > 2) 234 { 235 w = 1; 236 loop 237 { 238 npLogTable[1] = 0; 239 w++; 240 i = 0; 241 loop 242 { 243 i++; 244 npExpTable[i] = (int)(((long)w * (long)npExpTable[i-1]) % npPrimeM); 245 npLogTable[npExpTable[i]] = i; 246 if (/*(i == npPrimeM - 1 ) ||*/ (npExpTable[i] == 1)) 247 break; 248 } 249 if (i == npPrimeM - 1) 250 break; 251 } 252 npGen=w; 253 } 254 else 255 { 256 npExpTable[1] = 1; 257 npGen=1; 258 } 259 // if (npGen != npExpTable[1]) Print("npGen wrong:%d, %d\n",npGen, npExpTable[1]); 227 // npExpTable= (CARDINAL *)omAlloc( npPrimeM*sizeof(CARDINAL) ); 228 // npLogTable= (CARDINAL *)omAlloc( npPrimeM*sizeof(CARDINAL) ); 229 // omMarkAsStaticAddr(npExpTable); 230 // omMarkAsStaticAddr(npLogTable); 231 // memcpy(npExpTable,r->cf->npExpTable,npPrimeM*sizeof(CARDINAL)); 232 // memcpy(npLogTable,r->cf->npLogTable,npPrimeM*sizeof(CARDINAL)); 233 npExpTable=r->cf->npExpTable; 234 npLogTable=r->cf->npLogTable; 235 npGen = npExpTable[1]; 260 236 } 261 237 else … … 273 249 if ((c>1) || (c<(-1))) 274 250 { 275 // if (r->cf->npExpTable!=NULL)276 // Print("npExpTable!=NULL\n");277 // if (r->cf->npLogTable!=NULL)278 // Print("npLogTable!=NULL\n");279 251 if (c>1) r->cf->npPrimeM = c; 280 252 else r->cf->npPrimeM = -c; … … 283 255 r->cf->npLogTable= (CARDINAL *)omAlloc( r->cf->npPrimeM*sizeof(CARDINAL) ); 284 256 r->cf->npExpTable[0] = 1; 285 r->cf->npLogTable[ 1] = 0;257 r->cf->npLogTable[0] = 0; 286 258 if (r->cf->npPrimeM > 2) 287 259 { … … 308 280 { 309 281 r->cf->npExpTable[1] = 1; 282 r->cf->npLogTable[1] = 0; 310 283 } 311 284 } -
Singular/mpsr.h
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mpsr.h,v 1. 19 2000-09-18 09:19:21 obachmanExp $ */4 /* $Id: mpsr.h,v 1.20 2000-12-06 11:03:22 Singular Exp $ */ 5 5 /*************************************************************** 6 6 * … … 100 100 { 101 101 #ifdef PDEBUG 102 nSetChar(rg , TRUE);102 nSetChar(rg); 103 103 #else 104 nSetChar(rg , complete);104 nSetChar(rg); 105 105 #endif 106 106 rComplete(rg); -
Singular/mpsr_GetMisc.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mpsr_GetMisc.cc,v 1.2 2 2000-12-05 11:15:09 obachmanExp $ */4 /* $Id: mpsr_GetMisc.cc,v 1.23 2000-12-06 11:03:22 Singular Exp $ */ 5 5 6 6 /*************************************************************** … … 321 321 p_SetRingOfLeftv(mlv->lv, IDRING(rh)); 322 322 323 rSetHdl(rh , TRUE);323 rSetHdl(rh); 324 324 325 325 if (currRing != r) … … 336 336 // reset currRing for reasons explained above 337 337 if (currRingHdl != NULL) mpsr_SetCurrRing(IDRING(currRingHdl), TRUE); 338 rSetHdl(rh , TRUE);338 rSetHdl(rh); 339 339 rh->next = IDROOT; 340 340 IDROOT = rh; -
Singular/mpsr_Put.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mpsr_Put.cc,v 1.2 3 2000-12-05 11:15:09 obachmanExp $ */4 /* $Id: mpsr_Put.cc,v 1.24 2000-12-06 11:03:22 Singular Exp $ */ 5 5 6 6 /*************************************************************** … … 616 616 else 617 617 { 618 rSetHdl(h , TRUE);618 rSetHdl(h); 619 619 r = IDRING(h); 620 620 h2 = r->idroot; … … 659 659 MP_EndMsg(link); 660 660 omFreeBin(lv, sleftv_bin); 661 if (rh != NULL && rh != currRingHdl) rSetHdl(rh , TRUE);661 if (rh != NULL && rh != currRingHdl) rSetHdl(rh); 662 662 663 663 if (h == NULL && h2 == NULL) -
Singular/numbers.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 *****************************************/ 4 /* $Id: numbers.cc,v 1. 29 2000-12-01 15:41:31Singular Exp $ */4 /* $Id: numbers.cc,v 1.30 2000-12-06 11:03:24 Singular Exp $ */ 5 5 6 6 /* … … 96 96 * init nDelete for characteristic c (complete==FALSE) 97 97 */ 98 void nSetChar(ring r , BOOLEAN complete)98 void nSetChar(ring r) 99 99 { 100 100 int c=rInternalChar(r); 101 101 102 if (complete) 103 { 104 nChar=c; 105 } 102 nChar=c; 106 103 #ifdef LDEBUG 107 104 nDBDelete= r->cf->nDBDelete; … … 111 108 if (rField_is_Extension(r)) 112 109 { 113 naSetChar(c,complete,r); 114 if (complete) 115 { 116 test |= Sy_bit(OPT_INTSTRATEGY); /*intStrategy*/ 117 test &= ~Sy_bit(OPT_REDTAIL); /*noredTail*/ 118 } 110 naSetChar(c,TRUE,r); 111 test |= Sy_bit(OPT_INTSTRATEGY); /*intStrategy*/ 112 test &= ~Sy_bit(OPT_REDTAIL); /*noredTail*/ 119 113 } 120 114 else if (rField_is_Q(r)) 121 115 { 122 if (complete) 123 { 124 test |= Sy_bit(OPT_INTSTRATEGY); /*26*/ 125 } 116 test |= Sy_bit(OPT_INTSTRATEGY); /*26*/ 126 117 } 127 118 else if (rField_is_Zp(r)) 128 119 /*----------------------char. p----------------*/ 129 120 { 130 if (complete) 131 { 132 npSetChar(c, r); 133 test &= ~Sy_bit(OPT_INTSTRATEGY); /*26*/ 134 } 121 npSetChar(c, r); 122 test &= ~Sy_bit(OPT_INTSTRATEGY); /*26*/ 135 123 } 136 124 /* -------------- GF(p^m) -----------------------*/ 137 125 else if (rField_is_GF(r)) 138 126 { 139 if (complete) 140 { 141 test &= ~Sy_bit(OPT_INTSTRATEGY); /*26*/ 142 nfSetChar(c,r->parameter); 143 } 127 test &= ~Sy_bit(OPT_INTSTRATEGY); /*26*/ 128 nfSetChar(c,r->parameter); 144 129 } 145 130 /* -------------- R -----------------------*/ … … 164 149 } 165 150 #endif 166 if(complete) 167 { 168 nNew = r->cf->nNew; 169 nNormalize=r->cf->nNormalize; 170 nInit = r->cf->nInit; 171 nPar = r->cf->nPar; 172 nParDeg= r->cf->nParDeg; 173 nInt = r->cf->nInt; 174 nAdd = r->cf->nAdd; 175 nSub = r->cf->nSub; 176 nMult = r->cf->nMult; 177 nDiv = r->cf->nDiv; 178 nExactDiv= r->cf->nExactDiv; 179 nIntDiv= r->cf->nIntDiv; 180 nIntMod= r->cf->nIntMod; 181 nNeg = r->cf->nNeg; 182 nInvers= r->cf->nInvers; 183 nCopy = r->cf->nCopy; 184 nGreater = r->cf->nGreater; 185 nEqual = r->cf->nEqual; 186 nIsZero = r->cf->nIsZero; 187 nIsOne = r->cf->nIsOne; 188 nIsMOne = r->cf->nIsMOne; 189 nGreaterZero = r->cf->nGreaterZero; 190 nWrite = r->cf->nWrite; 191 nRead = r->cf->nRead; 192 nPower = r->cf->nPower; 193 nGcd = r->cf->nGcd; 194 nLcm = r->cf->nLcm; 195 nSetMap = r->cf->nSetMap; 196 nName= r->cf->nName; 197 nSize = r->cf->nSize; 198 nGetDenom = r->cf->nGetDenom; 199 #ifdef LDEBUG 200 nDBTest=r->cf->nDBTest; 201 #endif 202 if (!errorreported) nNULL=r->cf->nNULL; 203 } 151 nNew = r->cf->nNew; 152 nNormalize=r->cf->nNormalize; 153 nInit = r->cf->nInit; 154 nPar = r->cf->nPar; 155 nParDeg= r->cf->nParDeg; 156 nInt = r->cf->nInt; 157 nAdd = r->cf->nAdd; 158 nSub = r->cf->nSub; 159 nMult = r->cf->nMult; 160 nDiv = r->cf->nDiv; 161 nExactDiv= r->cf->nExactDiv; 162 nIntDiv= r->cf->nIntDiv; 163 nIntMod= r->cf->nIntMod; 164 nNeg = r->cf->nNeg; 165 nInvers= r->cf->nInvers; 166 nCopy = r->cf->nCopy; 167 nGreater = r->cf->nGreater; 168 nEqual = r->cf->nEqual; 169 nIsZero = r->cf->nIsZero; 170 nIsOne = r->cf->nIsOne; 171 nIsMOne = r->cf->nIsMOne; 172 nGreaterZero = r->cf->nGreaterZero; 173 nWrite = r->cf->nWrite; 174 nRead = r->cf->nRead; 175 nPower = r->cf->nPower; 176 nGcd = r->cf->nGcd; 177 nLcm = r->cf->nLcm; 178 nSetMap = r->cf->nSetMap; 179 nName= r->cf->nName; 180 nSize = r->cf->nSize; 181 nGetDenom = r->cf->nGetDenom; 182 #ifdef LDEBUG 183 nDBTest=r->cf->nDBTest; 184 #endif 185 if (!errorreported) nNULL=r->cf->nNULL; 204 186 } 205 187 -
Singular/numbers.h
rf7dade rcf42ab1 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: numbers.h,v 1. 19 2000-12-01 15:21:35Singular Exp $ */6 /* $Id: numbers.h,v 1.20 2000-12-06 11:03:26 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT: interface to coefficient aritmetics … … 76 76 void nInitChar(ring r); 77 77 void nKillChar(ring r); 78 void nSetChar(ring r , BOOLEAN complete);78 void nSetChar(ring r); 79 79 80 80 #endif -
Singular/pDebug.cc
rf7dade rcf42ab1 7 7 * Author: obachman (Olaf Bachmann) 8 8 * Created: 8/00 9 * Version: $Id: pDebug.cc,v 1.1 6 2000-12-05 11:15:09 obachmanExp $9 * Version: $Id: pDebug.cc,v 1.17 2000-12-06 11:03:26 Singular Exp $ 10 10 *******************************************************************/ 11 11 … … 445 445 446 446 #endif // PDEBUG_CC 447 -
Singular/polys-impl.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: polys-impl.cc,v 1.5 2 2000-10-30 13:40:24 obachmanExp $ */4 /* $Id: polys-impl.cc,v 1.53 2000-12-06 11:03:27 Singular Exp $ */ 5 5 6 6 /*************************************************************** … … 51 51 { 52 52 ring origRing = currRing; 53 rChangeCurrRing(rg , FALSE);53 rChangeCurrRing(rg); 54 54 pDelete(p); 55 rChangeCurrRing(origRing , FALSE);55 rChangeCurrRing(origRing); 56 56 } 57 57 -
Singular/ring.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ring.cc,v 1.14 6 2000-11-25 13:02:09Singular Exp $ */4 /* $Id: ring.cc,v 1.147 2000-12-06 11:03:27 Singular Exp $ */ 5 5 6 6 /* … … 84 84 // complete == FALSE : only delete operations are enabled 85 85 // complete == TRUE : full reset of all variables 86 void rChangeCurrRing(ring r , BOOLEAN complete)86 void rChangeCurrRing(ring r) 87 87 { 88 88 /*------------ set global ring vars --------------------------------*/ … … 92 92 { 93 93 rTest(r); 94 if (complete) 95 { 96 /*------------ set global ring vars --------------------------------*/ 97 currQuotient=r->qideal; 98 /*------------ set redTail, except reset by nSetChar or pSetGlobals */ 99 test |= Sy_bit(OPT_REDTAIL); 100 } 94 /*------------ set global ring vars --------------------------------*/ 95 currQuotient=r->qideal; 96 /*------------ set redTail, except reset by nSetChar or pSetGlobals */ 97 test |= Sy_bit(OPT_REDTAIL); 101 98 102 99 /*------------ global variables related to coefficients ------------*/ 103 nSetChar(r , complete);100 nSetChar(r); 104 101 105 102 /*------------ global variables related to polys -------------------*/ 106 pSetGlobals(r, complete); 107 108 if (complete) 109 { 103 pSetGlobals(r); 104 110 105 /*------------ set naMinimalPoly -----------------------------------*/ 111 if (r->minpoly!=NULL) 112 { 113 naMinimalPoly=((lnumber)r->minpoly)->z; 114 } 115 } 116 } 117 } 118 119 void rSetHdl(idhdl h, BOOLEAN complete) 106 if (r->minpoly!=NULL) 107 { 108 naMinimalPoly=((lnumber)r->minpoly)->z; 109 } 110 } 111 } 112 113 void rSetHdl(idhdl h) 120 114 { 121 115 int i; … … 129 123 rTest(rg); 130 124 } 131 else complete=FALSE;132 125 133 126 // clean up history … … 140 133 141 134 /*------------ change the global ring -----------------------*/ 142 rChangeCurrRing(rg ,complete);135 rChangeCurrRing(rg); 143 136 currRingHdl = h; 144 137 } … … 189 182 /* complete ring intializations */ 190 183 rComplete(r); 191 rSetHdl(tmp ,TRUE);184 rSetHdl(tmp); 192 185 return currRingHdl; 193 186 } … … 1290 1283 if (r2->minpoly!=NULL) 1291 1284 { 1292 nSetChar(r1 ,TRUE);1285 nSetChar(r1); 1293 1286 if ((strcmp(r1->parameter[0],r2->parameter[0])==0) /* 1 char */ 1294 1287 && naEqual(r1->minpoly,r2->minpoly)) … … 1298 1291 tmpR.minpoly=naCopy(r1->minpoly); 1299 1292 tmpR.P=1; 1300 nSetChar(currRing ,TRUE);1293 nSetChar(currRing); 1301 1294 } 1302 1295 else 1303 1296 { 1304 nSetChar(currRing ,TRUE);1297 nSetChar(currRing); 1305 1298 WerrorS("different minpolys"); 1306 1299 return -1; … … 1315 1308 tmpR.parameter[0]=omStrDup(r1->parameter[0]); 1316 1309 tmpR.P=1; 1317 nSetChar(r1 ,TRUE);1310 nSetChar(r1); 1318 1311 tmpR.minpoly=naCopy(r1->minpoly); 1319 nSetChar(currRing ,TRUE);1312 nSetChar(currRing); 1320 1313 } 1321 1314 else … … 1336 1329 tmpR.parameter[0]=omStrDup(r1->parameter[0]); 1337 1330 tmpR.P=1; 1338 nSetChar(r2 ,TRUE);1331 nSetChar(r2); 1339 1332 tmpR.minpoly=naCopy(r2->minpoly); 1340 nSetChar(currRing ,TRUE);1333 nSetChar(currRing); 1341 1334 } 1342 1335 else … … 1390 1383 if (r1->minpoly!=NULL) 1391 1384 { 1392 nSetChar(r1 ,TRUE);1385 nSetChar(r1); 1393 1386 tmpR.minpoly=naCopy(r1->minpoly); 1394 nSetChar(currRing ,TRUE);1387 nSetChar(currRing); 1395 1388 } 1396 1389 } … … 1416 1409 if (r2->minpoly!=NULL) 1417 1410 { 1418 nSetChar(r1 ,TRUE);1411 nSetChar(r1); 1419 1412 tmpR.minpoly=naCopy(r2->minpoly); 1420 nSetChar(currRing ,TRUE);1413 nSetChar(currRing); 1421 1414 } 1422 1415 } … … 1451 1444 if (r1->minpoly!=NULL) 1452 1445 { 1453 nSetChar(r1 ,TRUE);1446 nSetChar(r1); 1454 1447 tmpR.minpoly=naCopy(r1->minpoly); 1455 nSetChar(currRing ,TRUE);1448 nSetChar(currRing); 1456 1449 } 1457 1450 } … … 1480 1473 if (r2->minpoly!=NULL) 1481 1474 { 1482 nSetChar(r2 ,TRUE);1475 nSetChar(r2); 1483 1476 tmpR.minpoly=naCopy(r2->minpoly); 1484 nSetChar(currRing ,TRUE);1477 nSetChar(currRing); 1485 1478 } 1486 1479 } … … 3457 3450 { 3458 3451 ring old_ring = currRing; 3459 rChangeCurrRing(r , TRUE);3452 rChangeCurrRing(r); 3460 3453 if (old_ring->qideal != NULL) 3461 3454 { … … 3543 3536 { 3544 3537 ring old_r = currRing; 3545 rChangeCurrRing(new_r , TRUE);3538 rChangeCurrRing(new_r); 3546 3539 if (old_r->qideal != NULL) 3547 3540 { … … 3563 3556 if (new_r_1 != new_r && new_r_1 != old_r) rDelete(new_r_1); 3564 3557 rComplete(new_r, 1); 3565 rChangeCurrRing(new_r , TRUE);3558 rChangeCurrRing(new_r); 3566 3559 if (old_r->qideal != NULL) 3567 3560 { … … 3609 3602 res->OrdSgn = 1; 3610 3603 rComplete(res, 1); 3611 rChangeCurrRing(res , TRUE);3604 rChangeCurrRing(res); 3612 3605 return res; 3613 3606 } -
Singular/ring.h
rf7dade rcf42ab1 7 7 * ABSTRACT - the interpreter related ring operations 8 8 */ 9 /* $Id: ring.h,v 1. 59 2000-12-05 12:14:33 obachmanExp $ */9 /* $Id: ring.h,v 1.60 2000-12-06 11:03:29 Singular Exp $ */ 10 10 11 11 /* includes */ … … 16 16 17 17 18 void rChangeCurrRing(ring r , BOOLEAN complete = TRUE);19 void rSetHdl(idhdl h , BOOLEAN complete = TRUE);18 void rChangeCurrRing(ring r); 19 void rSetHdl(idhdl h); 20 20 ring rInit(sleftv* pn, sleftv* rv, sleftv* ord); 21 21 idhdl rDefault(char *s); -
Singular/silink.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: silink.cc,v 1.3 6 2000-09-18 09:19:33 obachmanExp $ */4 /* $Id: silink.cc,v 1.37 2000-12-06 11:03:29 Singular Exp $ */ 5 5 6 6 /* … … 497 497 if (! status ) status = DumpAsciiMaps(fd, h, NULL); 498 498 499 if (currRingHdl != rh) rSetHdl(rh , TRUE);499 if (currRingHdl != rh) rSetHdl(rh); 500 500 fprintf(fd, "RETURN();\n"); 501 501 fflush(fd); … … 515 515 // trouble with minpoly 516 516 if (IDTYP(h) == RING_CMD || IDTYP(h) == QRING_CMD) 517 rSetHdl(h , TRUE);517 rSetHdl(h); 518 518 519 519 if (DumpAsciiIdhdl(fd, h)) return TRUE; … … 545 545 { 546 546 char *rhs; 547 rSetHdl(rhdl , TRUE);547 rSetHdl(rhdl); 548 548 rhs = h->String(); 549 549 -
Singular/sparsmat.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: sparsmat.cc,v 1.4 5 2000-11-28 11:50:56 obachmanExp $ */4 /* $Id: sparsmat.cc,v 1.46 2000-12-06 11:03:30 Singular Exp $ */ 5 5 6 6 /* … … 155 155 tmpR.block1=block1; 156 156 rComplete(&tmpR,1); 157 rChangeCurrRing(&tmpR ,TRUE);157 rChangeCurrRing(&tmpR); 158 158 // fetch data from the old ring 159 159 II=idInit(IDELEMS(I),I->rank); … … 171 171 void smRingClean(ring origR, ip_sring &tmpR) 172 172 { 173 rChangeCurrRing(origR ,TRUE);173 rChangeCurrRing(origR); 174 174 rUnComplete(&tmpR); 175 175 omFreeSize((ADDRESS)tmpR.order,3*sizeof(int)); … … 216 216 if (origR!=NULL) 217 217 { 218 rChangeCurrRing(origR ,TRUE);218 rChangeCurrRing(origR); 219 219 save = res; 220 220 res = prCopyR( save, &tmpR); 221 rChangeCurrRing(&tmpR ,FALSE);221 rChangeCurrRing(&tmpR); 222 222 pDelete(&save); 223 223 smRingClean(origR,tmpR); … … 260 260 if (origR!=NULL) 261 261 { 262 rChangeCurrRing(origR ,TRUE);262 rChangeCurrRing(origR); 263 263 mm=idInit(IDELEMS(m),m->rank); 264 264 int k; 265 265 for (k=0;k<IDELEMS(m);k++) mm->m[k] = prCopyR( m->m[k], &tmpR); 266 rChangeCurrRing(&tmpR ,FALSE);266 rChangeCurrRing(&tmpR); 267 267 idDelete(&m); 268 268 smRingClean(origR,tmpR); … … 308 308 if (origR!=NULL) 309 309 { 310 rChangeCurrRing(origR ,TRUE);310 rChangeCurrRing(origR); 311 311 mm=idInit(IDELEMS(m),m->rank); 312 312 int k; 313 313 for (k=0;k<IDELEMS(m);k++) mm->m[k] = prCopyR( m->m[k], &tmpR); 314 rChangeCurrRing(&tmpR ,FALSE);314 rChangeCurrRing(&tmpR); 315 315 idDelete(&m); 316 316 smRingClean(origR,tmpR); … … 2343 2343 if ((origR!=NULL) && (ss!=NULL)) 2344 2344 { 2345 rChangeCurrRing(origR ,TRUE);2345 rChangeCurrRing(origR); 2346 2346 rr = idInit(IDELEMS(ss), 1); 2347 2347 for (k=0;k<IDELEMS(ss);k++) 2348 2348 rr->m[k] = prCopyR(ss->m[k], &tmpR); 2349 rChangeCurrRing(&tmpR ,FALSE);2349 rChangeCurrRing(&tmpR); 2350 2350 idDelete(&ss); 2351 2351 ss = rr; -
Singular/syz.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz.cc,v 1. 39 2000-10-19 15:00:23 obachmanExp $ */4 /* $Id: syz.cc,v 1.40 2000-12-06 11:03:30 Singular Exp $ */ 5 5 6 6 /* … … 586 586 if (origR != syz_ring) 587 587 { 588 rChangeCurrRing(origR , TRUE);588 rChangeCurrRing(origR); 589 589 for (i=0; i<=syzIndex; i++) 590 590 { -
Singular/syz0.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz0.cc,v 1.3 4 2000-11-14 16:05:02 obachmanExp $ */4 /* $Id: syz0.cc,v 1.35 2000-12-06 11:03:31 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 957 957 if (/*ringOrderChanged:*/ origR!=syRing && syRing != NULL) 958 958 { 959 rChangeCurrRing(origR , TRUE);959 rChangeCurrRing(origR); 960 960 // Thomas: Here I assume that all (!) polys of res live in tmpR 961 961 while ((syzIndex < *length) && (res[syzIndex])) -
Singular/syz1.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz1.cc,v 1.6 8 2000-11-14 16:05:02 obachmanExp $ */4 /* $Id: syz1.cc,v 1.69 2000-12-06 11:03:31 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 1653 1653 1654 1654 if ((syzstr->syRing != NULL) && (syzstr->syRing != origR)) 1655 rChangeCurrRing(syzstr->syRing , FALSE);1655 rChangeCurrRing(syzstr->syRing); 1656 1656 1657 1657 if (syzstr->resPairs!=NULL) … … 1742 1742 if ((syzstr->syRing != NULL) && (syzstr->syRing != origR)) 1743 1743 { 1744 rChangeCurrRing(origR , FALSE);1744 rChangeCurrRing(origR); 1745 1745 rKill(syzstr->syRing); 1746 1746 } … … 2559 2559 2560 2560 assume(syzstr->syRing != NULL); 2561 rChangeCurrRing(syzstr->syRing , TRUE);2561 rChangeCurrRing(syzstr->syRing); 2562 2562 //Print("laeufts "); 2563 2563 syzstr->bucket = kBucketCreate(); … … 2608 2608 if (syzstr->syRing != NULL) 2609 2609 { 2610 rChangeCurrRing(origR ,TRUE);2610 rChangeCurrRing(origR); 2611 2611 // Thomas: now make sure that all data which you need is pFetchCopied 2612 2612 // maybe incoporate it into syReorder ?? … … 2757 2757 kBucketDestroy(&(syzstr->bucket)); 2758 2758 if (origR != syzstr->syRing) 2759 rChangeCurrRing(origR ,TRUE);2759 rChangeCurrRing(origR); 2760 2760 pDeleteLm(&redpol); 2761 2761 if (TEST_OPT_PROT) PrintLn(); -
Singular/syz2.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz2.cc,v 1. 19 2000-10-19 15:25:42 obachmanExp $ */4 /* $Id: syz2.cc,v 1.20 2000-12-06 11:03:32 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 1084 1084 kBucketDestroy(&(syzstr->syz_bucket)); 1085 1085 if (origR != syzstr->syRing) 1086 rChangeCurrRing(origR ,TRUE);1086 rChangeCurrRing(origR); 1087 1087 else 1088 1088 currRing = origR; -
Singular/syz3.cc
rf7dade rcf42ab1 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz3.cc,v 1. 5 2000-09-18 09:19:37 obachmanExp $ */4 /* $Id: syz3.cc,v 1.6 2000-12-06 11:03:33 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 1897 1897 omFreeSize((ADDRESS)res,len*sizeof(ideal)); 1898 1898 idDelete(&initial); 1899 rChangeCurrRing(syzstr->syRing , TRUE);1899 rChangeCurrRing(syzstr->syRing); 1900 1900 rKill(dp_C_ring); 1901 1901 } … … 2017 2017 if (origR!=syzstr->syRing) 2018 2018 { 2019 rChangeCurrRing(origR ,TRUE);2019 rChangeCurrRing(origR); 2020 2020 index = 0; 2021 2021 while ((index<=*length) && (syzstr->fullres[index]!=NULL))
Note: See TracChangeset
for help on using the changeset viewer.