Changeset 861529 in git
- Timestamp:
- Jul 26, 2011, 1:21:51 PM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
- Children:
- 92058150caf53dc60a028c63bafb64f39bfa73a8
- Parents:
- b7cfaff1d9a4ec8364a64a54d2b7e009f91418e2
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-07-26 13:21:51+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:53:34+01:00
- Files:
-
- 6 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/iparith.cc
rb7cfaf r861529 6407 6407 { 6408 6408 if(v1->Typ()==POLY_CMD) 6409 p Shift(&R->m[0],-1);6409 p_Shift(&R->m[0],-1,currRing); 6410 6410 L->m[1].data=(void *)R->m[0]; 6411 6411 R->m[0]=NULL; -
kernel/ideals.cc
rb7cfaf r861529 274 274 rChangeCurrRing(r); 275 275 // create 1-t, t 276 poly omt=p One();277 p SetExp(omt,r->N,1);278 poly t=p Copy(omt);279 p Setm(omt);280 omt=p Neg(omt);281 omt=p Add(omt,pOne());276 poly omt=p_One(currRing); 277 p_SetExp(omt,r->N,1,currRing); 278 poly t=p_Copy(omt,currRing); 279 p_Setm(omt,currRing); 280 omt=p_Neg(omt,currRing); 281 omt=p_Add_q(omt,pOne(),currRing); 282 282 // compute (1-t)*h1 283 h1=(ideal)mp MultP((matrix)h1,omt);283 h1=(ideal)mp_MultP((matrix)h1,omt,currRing); 284 284 // compute t*h2 285 h2=(ideal)mp MultP((matrix)h2,pCopy(t));285 h2=(ideal)mp_MultP((matrix)h2,pCopy(t),currRing); 286 286 // (1-t)h1 + t*h2 287 287 h=idInit(IDELEMS(h1)+IDELEMS(h2),1); … … 347 347 348 348 ring orig_ring=currRing; 349 ring syz_ring=rCurrRingAssure_SyzComp(); 349 ring syz_ring=rAssure_SyzComp(orig_ring,TRUE); 350 rChangeCurrRing(syz_ring); 350 351 rSetSyzComp(length, syz_ring); 351 352 … … 360 361 temp->m[k] = pCopy(first->m[i]); 361 362 else 362 temp->m[k] = prCopyR(first->m[i], orig_ring );363 temp->m[k] = prCopyR(first->m[i], orig_ring, syz_ring); 363 364 q = pOne(); 364 365 pSetComp(q,i+1+length); 365 366 pSetmComp(q); 366 if (flength==0) p Shift(&(temp->m[k]),1);367 if (flength==0) p_Shift(&(temp->m[k]),1,currRing); 367 368 p = temp->m[k]; 368 369 while (pNext(p)!=NULL) pIter(p); … … 378 379 temp->m[k] = pCopy(second->m[i]); 379 380 else 380 temp->m[k] = prCopyR(second->m[i], orig_ring );381 if (slength==0) p Shift(&(temp->m[k]),1);381 temp->m[k] = prCopyR(second->m[i], orig_ring,currRing); 382 if (slength==0) p_Shift(&(temp->m[k]),1,currRing); 382 383 k++; 383 384 } … … 486 487 487 488 ring orig_ring=currRing; 488 ring syz_ring=rCurrRingAssure_SyzComp(); 489 ring syz_ring=rAssure_SyzComp(orig_ring,TRUE); 490 rChangeCurrRing(syz_ring); 489 491 rSetSyzComp(syzComp, syz_ring); 490 492 … … 515 517 bigmat->m[i] = pCopy(arg[j]->m[l]); 516 518 else 517 bigmat->m[i] = prCopyR(arg[j]->m[l], orig_ring );518 p Shift(&(bigmat->m[i]),k*maxrk+isIdeal);519 bigmat->m[i] = prCopyR(arg[j]->m[l], orig_ring,currRing); 520 p_Shift(&(bigmat->m[i]),k*maxrk+isIdeal,currRing); 519 521 i++; 520 522 } … … 542 544 else 543 545 p = prCopyR(tempstd->m[j], syz_ring); 544 p Shift(&p,-syzComp-isIdeal);546 p_Shift(&p,-syzComp-isIdeal,currRing); 545 547 result->m[k] = p; 546 548 k++; … … 578 580 if (k == 0) 579 581 { 580 for (j=0; j<=i; j++) p Shift(&(h2->m[j]),1);582 for (j=0; j<=i; j++) p_Shift(&(h2->m[j]),1,currRing); 581 583 k = 1; 582 584 } … … 678 680 { 679 681 ideal result=idFreeModule(idElemens_h1/*IDELEMS(h1)*/); 680 int curr_syz_limit=rGetCurrSyzLimit( );682 int curr_syz_limit=rGetCurrSyzLimit(currRing); 681 683 if (curr_syz_limit>0) 682 684 for (ii=0;ii<idElemens_h1/*IDELEMS(h1)*/;ii++) 683 685 { 684 686 if (h1->m[ii]!=NULL) 685 p Shift(&h1->m[ii],curr_syz_limit);687 p_Shift(&h1->m[ii],curr_syz_limit,currRing); 686 688 } 687 689 return result; … … 692 694 assume(currRing != NULL); 693 695 ring orig_ring=currRing; 694 ring syz_ring=rCurrRingAssure_SyzComp(); 696 ring syz_ring=rAssure_SyzComp(orig_ring.TRUE); 697 rChangeCurrRing(syz_ring); 695 698 696 699 if (setSyzComp) … … 723 726 { 724 727 if (p_MinComp(s_h3->m[j],syz_ring) > k) 725 p Shift(&s_h3->m[j], -k);728 p_Shift(&s_h3->m[j], -k,currRing); 726 729 else 727 730 pDelete(&s_h3->m[j]); … … 814 817 assume(currRing != NULL); 815 818 ring orig_ring=currRing; 816 ring syz_ring=rCurrRingAssure_SyzComp(); 819 ring syz_ring=rAssure_SyzComp(orig_ring,TRUE); 820 rChangeCurrRing(syz_ring); 817 821 818 822 rSetSyzComp(k,syz_ring); … … 869 873 { 870 874 *syz=idFreeModule(IDELEMS(h1)); 871 int curr_syz_limit=rGetCurrSyzLimit( );875 int curr_syz_limit=rGetCurrSyzLimit(currRing); 872 876 if (curr_syz_limit>0) 873 877 for (int ii=0;ii<IDELEMS(h1);ii++) 874 878 { 875 879 if (h1->m[ii]!=NULL) 876 p Shift(&h1->m[ii],curr_syz_limit);880 p_Shift(&h1->m[ii],curr_syz_limit,currRing); 877 881 } 878 882 } … … 887 891 888 892 ring orig_ring = currRing; 889 ring syz_ring = rCurrRingAssure_SyzComp(); 893 ring syz_ring = rAssure_SyzComp(orig_ring,TRUE); 894 rChangeCurrRing(syz_ring); 890 895 rSetSyzComp(k,syz_ring); 891 896 … … 930 935 } 931 936 } 932 if (!inputIsIdeal) p Shift(&(s_h3->m[j]), -1);937 if (!inputIsIdeal) p_Shift(&(s_h3->m[j]), -1,currRing); 933 938 } 934 939 else … … 937 942 if (lift3) 938 943 { 939 p Shift(&s_h3->m[j], -k);944 p_Shift(&s_h3->m[j], -k,currRing); 940 945 (*syz)->m[j]=s_h3->m[j]; 941 946 s_h3->m[j]=NULL; … … 1094 1099 1095 1100 ring orig_ring=currRing; 1096 ring syz_ring=rCurrRingAssure_SyzComp(); 1101 ring syz_ring=rAssure_SyzComp(orig_ring,TRUE); 1102 rChangeCurrRing(syz_ring); 1097 1103 rSetSyzComp(k,syz_ring); 1098 1104 … … 1132 1138 { 1133 1139 if (s_temp->m[j-1]!=NULL) 1134 p Shift(&(s_temp->m[j-1]),1);1140 p_Shift(&(s_temp->m[j-1]),1,currRing); 1135 1141 } 1136 1142 } … … 1185 1191 } 1186 1192 } 1187 p Shift(&(s_result->m[j]),-k);1193 p_Shift(&(s_result->m[j]),-k,currRing); 1188 1194 pNeg(s_result->m[j]); 1189 1195 } … … 1195 1201 if (s_rest->m[j-1]!=NULL) 1196 1202 { 1197 p Shift(&(s_rest->m[j-1]),-1);1203 p_Shift(&(s_rest->m[j-1]),-1,currRing); 1198 1204 s_rest->m[j-1] = s_rest->m[j-1]; 1199 1205 } … … 1245 1251 } 1246 1252 } 1247 p Shift(&s_result->m[i],-comps_to_add);1253 p_Shift(&s_result->m[i],-comps_to_add,currRing); 1248 1254 } 1249 1255 } … … 1351 1357 p = pCopy(h2->m[i]); 1352 1358 if (k2 == 0) 1353 p Shift(&p,j*k+1);1359 p_Shift(&p,j*k+1,currRing); 1354 1360 else 1355 p Shift(&p,j*k);1361 p_Shift(&p,j*k,currRing); 1356 1362 q = pAdd(q,p); 1357 1363 j++; … … 1381 1387 { 1382 1388 p = pCopy_noCheck(h4->m[i-1]); 1383 p Shift(&p,1);1389 p_Shift(&p,1,currRing); 1384 1390 h4->m[i] = p; 1385 1391 } … … 1397 1403 p = pCopy(temph1->m[l]); 1398 1404 if (k1 == 0) 1399 p Shift(&p,ll*k+1);1405 p_Shift(&p,ll*k+1,currRing); 1400 1406 else 1401 p Shift(&p,ll*k);1407 p_Shift(&p,ll*k,currRing); 1402 1408 if (kkk >= IDELEMS(h4)) 1403 1409 { … … 1454 1460 1455 1461 ring orig_ring=currRing; 1456 ring syz_ring=rCurrRingAssure_SyzComp(); 1462 ring syz_ring=rAssure_SyzComp(orig_ring.TRUE); 1463 rChangeCurrRing(syz_ring); 1457 1464 rSetSyzComp(kmax-1,syz_ring); 1458 1465 if (orig_ring!=syz_ring) … … 1495 1502 { 1496 1503 if (resultIsIdeal) 1497 p Shift(&s_h3->m[i],-kmax);1504 p_Shift(&s_h3->m[i],-kmax,currRing); 1498 1505 else 1499 p Shift(&s_h3->m[i],-kmax+1);1506 p_Shift(&s_h3->m[i],-kmax+1,currRing); 1500 1507 } 1501 1508 else … … 2138 2145 else 2139 2146 { 2140 p Shift(&(temp1->m[i]),-length);2147 p_Shift(&(temp1->m[i]),-length,currRing); 2141 2148 } 2142 2149 } … … 2199 2206 if(temp->m[i]!=NULL) 2200 2207 { 2201 if (slength==0) p Shift(&(temp->m[i]),1);2208 if (slength==0) p_Shift(&(temp->m[i]),1,currRing); 2202 2209 p = temp->m[i]; 2203 2210 while (pNext(p)!=NULL) pIter(p); … … 2217 2224 { 2218 2225 temp->m[k] = pCopy(h1->m[i]); 2219 if (flength==0) p Shift(&(temp->m[k]),1);2226 if (flength==0) p_Shift(&(temp->m[k]),1,currRing); 2220 2227 k++; 2221 2228 } … … 2224 2231 2225 2232 ring orig_ring=currRing; 2226 ring syz_ring=rCurrRingAssure_SyzComp(); 2233 ring syz_ring=rAssure_SyzComp(orig_ring.TRUE); 2234 rChangeCurrRing(syz_ring); 2227 2235 rSetSyzComp(length, syz_ring); 2228 2236 ideal s_temp; … … 2259 2267 else 2260 2268 { 2261 p Shift(&(s_temp1->m[i]),-length);2269 p_Shift(&(s_temp1->m[i]),-length,currRing); 2262 2270 } 2263 2271 } -
kernel/ideals.h
rb7cfaf r861529 116 116 int pLowVar (poly p); 117 117 /*-the minimal index of used variables - 1-*/ 118 void pShift (poly * p,int i);119 /*- verschiebt die Indizes der Modulerzeugenden um i -*/120 118 void idInitChoise (int r,int beg,int end,BOOLEAN *endch,int * choise); 121 119 void idGetNextChoise (int r,int end,BOOLEAN *endch,int * choise); -
kernel/syz.cc
rb7cfaf r861529 598 598 for (j=0; j<IDELEMS(res[i]); j++) 599 599 { 600 p Shift(&res[i]->m[j], -rGetMaxSyzComp(i));600 p_Shift(&res[i]->m[j], -rGetMaxSyzComp(i),currRing); 601 601 } 602 602 } -
kernel/syz0.cc
rb7cfaf r861529 423 423 IDELEMS(result) += 16; 424 424 } 425 //p Shift(&toRed,-rkF);425 //p_Shift(&toRed,-rkF,currRing); 426 426 pNorm(toRed); 427 427 (*Shdl)[Sl] = toRed; … … 839 839 { 840 840 if (arg->m[i]!=NULL) 841 p Shift(&arg->m[i],-j);841 p_Shift(&arg->m[i],-j,currRing); 842 842 } 843 843 } -
kernel/syz3.cc
rb7cfaf r861529 123 123 if (pGetComp(gen)>0) 124 124 { 125 p Shift(&gen,-1);126 p Shift(&neg_gen,-1);125 p_Shift(&gen,-1,currRing); 126 p_Shift(&neg_gen,-1,currRing); 127 127 } 128 128 while (index>0) … … 194 194 syzstr->res[index]->m[i+start] = pCopy(current_ideal->m[i]); 195 195 syzstr->res[index]->m[i+start] = pMult_mm(syzstr->res[index]->m[i+start],w_gen); 196 p Shift(&syzstr->res[index]->m[i+start],current_tl);196 p_Shift(&syzstr->res[index]->m[i+start],current_tl,currRing); 197 197 syzstr->res[index]->m[i+start] = pAdd(syzstr->res[index]->m[i+start], 198 198 ppMult_qq(current_repr->m[i],p)); … … 201 201 pMult_mm(syzstr->orderedRes[index]->m[i+start],w_gen); 202 202 if ((*syzstr->Tl)[index]!=0) 203 p Shift(&syzstr->orderedRes[index]->m[i+start],(*syzstr->Tl)[index]);203 p_Shift(&syzstr->orderedRes[index]->m[i+start],(*syzstr->Tl)[index],currRing); 204 204 } 205 205 } … … 212 212 totake[index]->m[i+start_ttk] = 213 213 pMult_mm(pCopy(totake[index-1]->m[i]),w_gen); 214 p Shift(&totake[index]->m[i+start_ttk],current_tl);214 p_Shift(&totake[index]->m[i+start_ttk],current_tl,currRing); 215 215 #ifdef FULL_TOTAKE 216 216 poly pp=pCopy(p); 217 p Shift(&pp,i+1);217 p_Shift(&pp,i+1,currRing); 218 218 totake[index]->m[i+start_ttk] = pAdd(totake[index]->m[i+start_ttk],pp); 219 219 #endif … … 690 690 tso.p = NULL; 691 691 p = pCopy(tso.p1); 692 p Shift(&p,-1);692 p_Shift(&p,-1,currRing); 693 693 #ifdef WITH_BUCKET 694 694 poly pp; … … 706 706 pDelete(&pp); 707 707 p = pCopy(tso.p2); 708 p Shift(&p,-1);708 p_Shift(&p,-1,currRing); 709 709 pp = pCopy(old_repr->m[tso.ind1]); 710 710 il=-1; … … 719 719 tso.syz = pMult(p,pCopy(old_repr->m[tso.ind2])); 720 720 p = pCopy(tso.p2); 721 p Shift(&p,-1);721 p_Shift(&p,-1,currRing); 722 722 tso.syz = pSub(tso.syz,pMult(p,pCopy(old_repr->m[tso.ind1]))); 723 723 #endif … … 1232 1232 pNext(pp1) = NULL; 1233 1233 pNext(pp2) = NULL; 1234 //p Shift(&p1,-ac);1235 //p Shift(&p2,-ac);1234 //p_Shift(&p1,-ac,currRing); 1235 //p_Shift(&p2,-ac,currRing); 1236 1236 tp1 = pMult(tp1,pCopy(p2)); 1237 1237 tp2 = pMult(tp2,pCopy(p1)); … … 1779 1779 { 1780 1780 if (temp->m[j]!=NULL) 1781 p Shift(&temp->m[j],1);1781 p_Shift(&temp->m[j],1,currRing); 1782 1782 } 1783 1783 }
Note: See TracChangeset
for help on using the changeset viewer.