Changeset 17e692 in git
- Timestamp:
- Mar 8, 1999, 7:11:50 PM (25 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- 2a10547f349f40ba3e6a890b93b03d6cb4b37f52
- Parents:
- be0d84532eb45d49b654745e810a1a7a534d71ff
- Location:
- Singular
- Files:
-
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/fglm.cc
rbe0d84 r17e692 1 1 // emacs edit mode for this file is -*- C++ -*- 2 // $Id: fglm.cc,v 1.1 5 1999-03-08 17:30:32Singular Exp $2 // $Id: fglm.cc,v 1.16 1999-03-08 18:11:39 Singular Exp $ 3 3 4 4 /**************************************** … … 124 124 state= FglmIncompatibleRings; 125 125 } 126 if ( sring->N != dring->N ) { 126 if ( sring->N != dring->N ) 127 { 127 128 WerrorS( "rings must have same number of variables" ); 128 129 state= FglmIncompatibleRings; 129 130 } 130 if ( sring->P != dring->P ) { 131 if ( rPar(sring) != rPar(dring) ) 132 { 131 133 WerrorS( "rings must have same number of parameters" ); 132 134 state= FglmIncompatibleRings; … … 136 138 // check if the names of the variables resp. parameters do agree: 137 139 int nvar = sring->N; 138 int npar = sring->P;140 int npar = rPar(sring); 139 141 int * pperm; 140 142 if ( npar > 0 ) -
Singular/fglmzero.cc
rbe0d84 r17e692 1 1 // emacs edit mode for this file is -*- C++ -*- 2 // $Id: fglmzero.cc,v 1.2 0 1999-03-08 17:30:33Singular Exp $2 // $Id: fglmzero.cc,v 1.21 1999-03-08 18:11:41 Singular Exp $ 3 3 4 4 /**************************************** … … 141 141 maFindPerm( source->names, source->N, NULL, 0, currRing->names, currRing->N, NULL, 0, perm, NULL ); 142 142 nSetMap( rInternalChar(source), source->parameter, 143 source->P, source->minpoly );143 rPar(source), source->minpoly ); 144 144 145 145 matHeader ** temp = (matHeader **)Alloc( _nfunc*sizeof( matHeader * )); … … 147 147 for ( col= 0, colp= func[var]; col < _size; col++, colp++ ) { 148 148 if ( colp->owner == TRUE ) { 149 for ( row= colp->size-1, elemp= colp->elems; row >= 0; row--, elemp++ ) { 149 for ( row= colp->size-1, elemp= colp->elems; row >= 0; 150 row--, elemp++ ) 151 { 150 152 newelem= nMap( elemp->elem ); 151 153 nDelete( & elemp->elem ); -
Singular/iparith.cc
rbe0d84 r17e692 1488 1488 if (iiOp==IMAP_CMD) 1489 1489 { 1490 if (!nSetMap(rInternalChar(r),r->parameter,r ->P,r->minpoly))1490 if (!nSetMap(rInternalChar(r),r->parameter,rPar(r),r->minpoly)) 1491 1491 { 1492 1492 if (iiOp!=IMAP_CMD) … … 1508 1508 } 1509 1509 BITSET save_test=test; 1510 naSetChar(rInternalChar(r),TRUE,r->parameter,r->P); 1511 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter,currRing->P); 1510 naSetChar(rInternalChar(r),TRUE,r->parameter,rPar(r)); 1511 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1512 rPar(currRing)); 1512 1513 test=save_test; 1513 1514 } … … 1515 1516 if (par_perm_size!=0) 1516 1517 par_perm=(int *)Alloc0(par_perm_size*sizeof(int)); 1517 maFindPerm(r->names, r->N, r->parameter, r->P, 1518 currRing->names,currRing->N,currRing->parameter, currRing->P, 1518 maFindPerm(r->names, r->N, 1519 r->parameter, rPar(r), 1520 currRing->names,currRing->N, 1521 currRing->parameter, rPar(currRing), 1519 1522 perm,par_perm); 1520 1523 } … … 2884 2887 static BOOLEAN jjRPAR(leftv res, leftv v) 2885 2888 { 2886 res->data = (char *) ((ring)v->Data())->P;2889 res->data = (char *)rPar(((ring)v->Data())); 2887 2890 return FALSE; 2888 2891 } -
Singular/ipassign.cc
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipassign.cc,v 1.4 5 1999-03-08 17:30:36Singular Exp $ */4 /* $Id: ipassign.cc,v 1.46 1999-03-08 18:11:45 Singular Exp $ */ 5 5 6 6 /* … … 117 117 { 118 118 if ((currRing->parameter!=NULL) 119 && (( currRing->P>1)119 && ((rPar(currRing)>1) 120 120 || (rField_is_GF()))) 121 121 { -
Singular/ipshell.cc
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipshell.cc,v 1.3 4 1999-03-08 17:30:37Singular Exp $ */4 /* $Id: ipshell.cc,v 1.35 1999-03-08 18:11:46 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: … … 571 571 if (!nSetMap(rInternalChar(IDRING(r)), 572 572 IDRING(r)->parameter, 573 IDRING(r)->P,573 rPar(IDRING(r)), 574 574 IDRING(r)->minpoly)) 575 575 { -
Singular/longalg.cc
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: longalg.cc,v 1. 29 1999-03-08 17:30:40Singular Exp $ */4 /* $Id: longalg.cc,v 1.30 1999-03-08 18:11:47 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: algebraic numbers … … 2389 2389 for(i=0;i<nop;i++) 2390 2390 { 2391 if ((i>= currRing->P)2391 if ((i>=rPar(currRing)) 2392 2392 ||(strcmp(par[i],currRing->parameter[i])!=0)) 2393 2393 return FALSE; … … 2443 2443 for(i=0;i<nop;i++) 2444 2444 { 2445 if ((i>= currRing->P)2445 if ((i>=rPar(currRing)) 2446 2446 ||(strcmp(par[i],currRing->parameter[i])!=0)) 2447 2447 return FALSE; -
Singular/maps.cc
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: maps.cc,v 1.1 2 1999-03-08 17:30:41Singular Exp $ */4 /* $Id: maps.cc,v 1.13 1999-03-08 18:11:48 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - the mapping of polynomials to other rings … … 351 351 /* the simplest case:*/ 352 352 if(r==currRing) return pCopy(p); 353 nSetMap(rInternalChar(r),r->parameter,r ->P,r->minpoly);353 nSetMap(rInternalChar(r),r->parameter,rPar(r),r->minpoly); 354 354 int *perm=(int *)Alloc0((r->N+1)*sizeof(int)); 355 355 //int *par_perm=(int *)Alloc0(rPar(r)*sizeof(int)); 356 maFindPerm(r->names,r->N, r->parameter, r ->P,357 currRing->names,currRing->N,currRing->parameter, currRing->P,356 maFindPerm(r->names,r->N, r->parameter, rPar(r), 357 currRing->names,currRing->N,currRing->parameter, rPar(currRing), 358 358 perm,NULL/*par_perm*/); 359 359 poly res=pPermPoly(p,perm,r/*,par_perm,rPar(r)*/); -
Singular/mpsr.h
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mpsr.h,v 1.1 3 1999-03-08 17:30:43Singular Exp $ */4 /* $Id: mpsr.h,v 1.14 1999-03-08 18:11:48 Singular Exp $ */ 5 5 /*************************************************************** 6 6 * … … 100 100 { 101 101 #ifdef PDEBUG 102 nSetChar(rInternalChar(rg), TRUE, rg->parameter,r g->P);102 nSetChar(rInternalChar(rg), TRUE, rg->parameter,rPar(rg)); 103 103 #else 104 nSetChar(rInternalChar(rg), complete, rg->parameter,r g->P);104 nSetChar(rInternalChar(rg), complete, rg->parameter,rPar(rg)); 105 105 #endif 106 106 pChangeRing(rg->N, rg->OrdSgn, rg->order, rg->block0, rg->block1, -
Singular/mpsr_GetMisc.cc
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: mpsr_GetMisc.cc,v 1.1 2 1999-03-08 17:30:46Singular Exp $ */4 /* $Id: mpsr_GetMisc.cc,v 1.13 1999-03-08 18:11:49 Singular Exp $ */ 5 5 6 6 /*************************************************************** … … 113 113 // orig: r1->ch == r2->ch ??? 114 114 || (r1->N != r2->N) || (r1->OrdSgn != r2->OrdSgn) 115 || (r 1->P != r2->P))115 || (rPar(r1) != rPar(r2))) 116 116 return 0; 117 117 … … 186 186 if (r2 == NULL) return 0; 187 187 188 if ((r1->N > r2->N) || (r1->OrdSgn != r2->OrdSgn) || (r 1->P > r2->P))188 if ((r1->N > r2->N) || (r1->OrdSgn != r2->OrdSgn) || (rPar(r1) > rPar(r2))) 189 189 return 0; 190 190 … … 202 202 return 0; 203 203 204 for (i=0; i<r 1->P;i++)204 for (i=0; i<rPar(r1);i++) 205 205 { 206 206 if (strcmp(r1->parameter[i], r2->parameter[i])!=0) … … 341 341 number nn = (number) l->data; 342 342 mpsr_SetCurrRing(to_ring, TRUE); 343 nSetMap(rInternalChar(from_ring), from_ring->parameter, from_ring->P, from_ring->minpoly); 343 nSetMap(rInternalChar(from_ring), from_ring->parameter, 344 rPar(from_ring), from_ring->minpoly); 344 345 l->data = (void *) nMap(nn); 345 346 mpsr_SetCurrRing(from_ring, FALSE); -
Singular/ring.cc
rbe0d84 r17e692 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ring.cc,v 1.4 3 1999-02-10 16:00:04Singular Exp $ */4 /* $Id: ring.cc,v 1.44 1999-03-08 18:11:50 Singular Exp $ */ 5 5 6 6 /* … … 67 67 68 68 /*------------ global variables related to coefficients ------------*/ 69 nSetChar(r->ch, complete, r->parameter, r ->P);69 nSetChar(r->ch, complete, r->parameter, rPar(r)); 70 70 71 71 /*------------ global variables related to polys -------------------*/ … … 161 161 if ((rg->parameter!=NULL) && (rg->ch<2)) 162 162 { 163 for (i=0;i<r g->P;i++)163 for (i=0;i<rPar(rg);i++) 164 164 { 165 165 if(strlen(rg->parameter[i])>1) … … 731 731 732 732 733 if ( (r->parameter!=NULL)&&(r->ch>1))733 if (rField_is_GF(r)) 734 734 PrintS("// # ground field : "); 735 735 else 736 736 PrintS("// characteristic : "); 737 if (r->ch==-1) PrintS("0 (real)\n"); /* R */ 738 else if (r->ch<0) Print ("%d\n",-r->ch); /* Fp(a) */ 739 else if (r->ch==1) PrintS("0\n"); /* Q(a) */ 740 else Print ("%d\n",r->ch); /* Fq, Fp, Q */ 737 if ( rField_is_R(r) ) PrintS("0 (real)\n"); /* R */ 738 else Print ("%d\n",rChar(r)); /* Fp(a) */ 741 739 if (r->parameter!=NULL) 742 740 { … … 746 744 char **sp=r->parameter; 747 745 int nop=0; 748 while (nop<r ->P)746 while (nop<rPar(r)) 749 747 { 750 748 PrintS(*sp); … … 926 924 int len=0; 927 925 char **s=r->parameter; 928 while (len<r ->P)926 while (len<rPar(r)) 929 927 { 930 928 FreeL((ADDRESS)*s); … … 932 930 len++; 933 931 } 934 Free((ADDRESS)r->parameter,r ->P*sizeof(char *));932 Free((ADDRESS)r->parameter,rPar(r)*sizeof(char *)); 935 933 } 936 934 Free((ADDRESS)r->VarOffset, (r->N +1)*sizeof(int)); … … 1206 1204 } 1207 1205 int l=0; 1208 for(i=0; i<r ->P;i++)1206 for(i=0; i<rPar(r);i++) 1209 1207 { 1210 1208 l+=(strlen(r->parameter[i])+1); … … 1222 1220 tt[0]=','; 1223 1221 tt[1]='\0'; 1224 for(i=0; i<r ->P;i++)1222 for(i=0; i<rPar(r);i++) 1225 1223 { 1226 1224 strcat(s,tt); … … 1237 1235 int l=2; 1238 1236 1239 for (i=0; i<r ->P; i++)1237 for (i=0; i<rPar(r); i++) 1240 1238 { 1241 1239 l+=strlen(r->parameter[i])+1; … … 1243 1241 char *s=(char *)AllocL(l); 1244 1242 s[0]='\0'; 1245 for (i=0; i<r ->P-1; i++)1243 for (i=0; i<rPar(r)-1; i++) 1246 1244 { 1247 1245 strcat(s,r->parameter[i]); … … 1313 1311 memset(&tmpR,0,sizeof(tmpR)); 1314 1312 /* check coeff. field =====================================================*/ 1315 if (r 1->ch==r2->ch)1316 { 1317 tmpR.ch=r 1->ch;1318 if ( (r1->ch==0)||(r1->ch>=2)) /* Q, Z/p, GF(p,n)*/1313 if (rInternalChar(r1)==rInternalChar(r2)) 1314 { 1315 tmpR.ch=rInternalChar(r1); 1316 if (rField_is_Q(r1)||rField_is_Zp(r1)||rField_is_GF(r1)) /*Q, Z/p, GF(p,n)*/ 1319 1317 { 1320 1318 if (r1->parameter!=NULL) … … 1339 1337 if (r2->minpoly!=NULL) 1340 1338 { 1341 nSetChar(r 1->ch,TRUE,r1->parameter,r1->P);1339 nSetChar(rInternalChar(r1),TRUE,r1->parameter,rPar(r1)); 1342 1340 if ((strcmp(r1->parameter[0],r2->parameter[0])==0) /* 1 char */ 1343 1341 && naEqual(r1->minpoly,r2->minpoly)) … … 1347 1345 tmpR.minpoly=naCopy(r1->minpoly); 1348 1346 tmpR.P=1; 1349 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1347 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1348 rPar(currRing)); 1350 1349 } 1351 1350 else 1352 1351 { 1353 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1352 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1353 rPar(currRing)); 1354 1354 WerrorS("different minpolys"); 1355 1355 return -1; … … 1359 1359 { 1360 1360 if ((strcmp(r1->parameter[0],r2->parameter[0])==0) /* 1 char */ 1361 && (r 2->P==1))1361 && (rPar(r2)==1)) 1362 1362 { 1363 1363 tmpR.parameter=(char **)Alloc0(sizeof(char *)); 1364 1364 tmpR.parameter[0]=mstrdup(r1->parameter[0]); 1365 1365 tmpR.P=1; 1366 nSetChar(r 1->ch,TRUE,r1->parameter,r1->P);1366 nSetChar(rInternalChar(r1),TRUE,r1->parameter,rPar(r1)); 1367 1367 tmpR.minpoly=naCopy(r1->minpoly); 1368 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1368 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1369 rPar(currRing)); 1369 1370 } 1370 1371 else … … 1380 1381 { 1381 1382 if ((strcmp(r1->parameter[0],r2->parameter[0])==0) /* 1 char */ 1382 && (r 1->P==1))1383 && (rPar(r1)==1)) 1383 1384 { 1384 1385 tmpR.parameter=(char **)Alloc(sizeof(char *)); 1385 1386 tmpR.parameter[0]=mstrdup(r1->parameter[0]); 1386 1387 tmpR.P=1; 1387 nSetChar(r 2->ch,TRUE,r2->parameter,r2->P);1388 nSetChar(rInternalChar(r2),TRUE,r2->parameter,rPar(r2)); 1388 1389 tmpR.minpoly=naCopy(r2->minpoly); 1389 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1390 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1391 rPar(currRing)); 1390 1392 } 1391 1393 else … … 1400 1402 tmpR.parameter=(char **)Alloc(len*sizeof(char *)); 1401 1403 int i; 1402 for (i=0;i<r 1->P;i++)1404 for (i=0;i<rPar(r1);i++) 1403 1405 { 1404 1406 tmpR.parameter[i]=mstrdup(r1->parameter[i]); 1405 1407 } 1406 1408 int j,l; 1407 for(j=0;j<r 2->P;j++)1409 for(j=0;j<rPar(r2);j++) 1408 1410 { 1409 1411 for(l=0;l<i;l++) … … 1433 1435 || (r2->ch==-r1->ch)) /* Z/p */ 1434 1436 { 1435 tmpR.ch=r 1->ch;1437 tmpR.ch=rInternalChar(r1); 1436 1438 tmpR.parameter=(char **)Alloc(rPar(r1)*sizeof(char *)); 1437 tmpR.P=r 1->P;1439 tmpR.P=rPar(r1); 1438 1440 memcpy(tmpR.parameter,r1->parameter,rPar(r1)*sizeof(char *)); 1439 1441 if (r1->minpoly!=NULL) 1440 1442 { 1441 nSetChar(r 1->ch,TRUE,r1->parameter,r1->P);1443 nSetChar(rInternalChar(r1),TRUE,r1->parameter,rPar(r1)); 1442 1444 tmpR.minpoly=naCopy(r1->minpoly); 1443 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1445 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1446 rPar(currRing)); 1444 1447 } 1445 1448 } … … 1459 1462 if ((r2->ch<-1)||(r2->ch==1)) /* Z/p(a),Q(a) */ 1460 1463 { 1461 tmpR.ch=r 2->ch;1462 tmpR.P=r 2->P;1464 tmpR.ch=rInternalChar(r2); 1465 tmpR.P=rPar(r2); 1463 1466 tmpR.parameter=(char **)Alloc(rPar(r2)*sizeof(char *)); 1464 1467 memcpy(tmpR.parameter,r2->parameter,rPar(r2)*sizeof(char *)); 1465 1468 if (r2->minpoly!=NULL) 1466 1469 { 1467 nSetChar(r 1->ch,TRUE,r1->parameter,r1->P);1470 nSetChar(rInternalChar(r1),TRUE,r1->parameter,rPar(r1)); 1468 1471 tmpR.minpoly=naCopy(r2->minpoly); 1469 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1472 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1473 rPar(currRing)); 1470 1474 } 1471 1475 } … … 1490 1494 if (r2->ch==0) /* Q */ 1491 1495 { 1492 tmpR.ch=r 1->ch;1496 tmpR.ch=rInternalChar(r1); 1493 1497 tmpR.P=rPar(r1); 1494 1498 tmpR.parameter=(char **)Alloc0(rPar(r1)*sizeof(char *)); 1495 1499 int i; 1496 for(i=0;i<r 1->P;i++)1500 for(i=0;i<rPar(r1);i++) 1497 1501 { 1498 1502 tmpR.parameter[i]=mstrdup(r1->parameter[i]); … … 1500 1504 if (r1->minpoly!=NULL) 1501 1505 { 1502 nSetChar(r 1->ch,TRUE,r1->parameter,r1->P);1506 nSetChar(rInternalChar(r1),TRUE,r1->parameter,rPar(r1)); 1503 1507 tmpR.minpoly=naCopy(r1->minpoly); 1504 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1508 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1509 rPar(currRing)); 1505 1510 } 1506 1511 } … … 1519 1524 else if (r2->ch==-r1->ch) /* Z/p(a) */ 1520 1525 { 1521 tmpR.ch=r 2->ch;1526 tmpR.ch=rInternalChar(r2); 1522 1527 tmpR.P=rPar(r2); 1523 1528 tmpR.parameter=(char **)Alloc(rPar(r2)*sizeof(char *)); 1524 1529 int i; 1525 for(i=0;i<r 2->P;i++)1530 for(i=0;i<rPar(r2);i++) 1526 1531 { 1527 1532 tmpR.parameter[i]=mstrdup(r2->parameter[i]); … … 1529 1534 if (r2->minpoly!=NULL) 1530 1535 { 1531 nSetChar(r 2->ch,TRUE,r2->parameter,r2->P);1536 nSetChar(rInternalChar(r2),TRUE,r2->parameter,rPar(r2)); 1532 1537 tmpR.minpoly=naCopy(r2->minpoly); 1533 nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P); 1538 nSetChar(rInternalChar(currRing),TRUE,currRing->parameter, 1539 rPar(currRing)); 1534 1540 } 1535 1541 } … … 1557 1563 else if ((r2->parameter!=NULL) && (strlen(r1->names[i])==1)) 1558 1564 { 1559 for(j=0;j<r 2->P;j++)1565 for(j=0;j<rPar(r2);j++) 1560 1566 { 1561 1567 if (strcmp(r1->names[i],r2->parameter[j])==0) … … 1586 1592 else if ((r1->parameter!=NULL) && (strlen(r2->names[i])==1)) 1587 1593 { 1588 for(j=0;j<r 1->P;j++)1594 for(j=0;j<rPar(r1);j++) 1589 1595 { 1590 1596 if (strcmp(r2->names[i],r1->parameter[j])==0) … … 1760 1766 res->parameter=(char **)Alloc(l*sizeof(char *)); 1761 1767 int i; 1762 for(i=0;i<r ->P;i++)1768 for(i=0;i<rPar(r);i++) 1763 1769 { 1764 1770 res->parameter[i]=mstrdup(r->parameter[i]);
Note: See TracChangeset
for help on using the changeset viewer.