- Timestamp:
- Nov 14, 2022, 11:23:20 AM (17 months ago)
- Branches:
- (u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')
- Children:
- 96fc6774cff6a43918cd7ab4d12e66e053b43e91
- Parents:
- 317c1453d644836d66288dc2a633068067f64ab7
- Location:
- Singular
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/dyn_modules/cohomo/cohomo.cc
r317c14 r5416d1 49 49 void listprint(std::vector<int> vec) 50 50 { 51 inti;51 unsigned i; 52 52 for(i=0;i<vec.size();i++) 53 53 { … … 65 65 void listsprint(std::vector<std::vector<int> > posMat) 66 66 { 67 int i,j;67 unsigned i; 68 68 for(i=0;i<posMat.size();i++) 69 69 { … … 97 97 void lpprint( std::vector<poly> pv) 98 98 { 99 for( inti=0;i<pv.size();i++)99 for(unsigned i=0;i<pv.size();i++) 100 100 { 101 101 Print(" _[%d]=",i+1); … … 114 114 void lpsprint(std::vector<std::vector<poly> > pvs) 115 115 { 116 for( inti=0;i<pvs.size();i++)116 for(unsigned i=0;i<pvs.size();i++) 117 117 { 118 118 Print("[%d]:\n",i+1); … … 143 143 bool IsinL(int a, std::vector<int> vec) 144 144 { 145 inti;145 unsigned i; 146 146 for(i=0;i<vec.size();i++) 147 147 { … … 162 162 std::vector<int> vecIntersection(std::vector<int> p, std::vector<int> q) 163 163 { 164 inti;164 unsigned i; 165 165 std::vector<int> inte; 166 166 for(i=0;i<p.size();i++) … … 184 184 bool vEv(std::vector<int> vec1,std::vector<int> vec2) 185 185 { 186 int i,j, lg1=vec1.size(),lg2=vec2.size();186 unsigned j, lg1=vec1.size(),lg2=vec2.size(); 187 187 if(lg1!=lg2) 188 188 { … … 455 455 ideal idMake(std::vector<std::vector<int> > vecs) 456 456 { 457 int lv=vecs.size(), i , j;457 int lv=vecs.size(), i; 458 458 poly p; 459 459 ideal id_re=idInit(1,1); … … 474 474 ideal idmodulo(ideal h1,ideal h2) 475 475 { 476 int i;477 476 ideal gb=kStd(h2,NULL,testHomog,NULL,NULL,0,0,NULL); 478 477 idSkipZeroes(gb); … … 486 485 int pcoef(poly p, int m) 487 486 { 488 int i, j,co; poly q=pCopy(p);487 int i,co; poly q=pCopy(p); 489 488 for(i=1;i<=currRing->N;i++) 490 489 { … … 505 504 bool vInp(int m,poly p) 506 505 { 507 int i;508 506 poly q=pCopy(p); 509 507 while (q!=NULL) … … 523 521 std::vector<int> vMake(poly p) 524 522 { 525 int i; poly q=pCopy(p);523 int i; 526 524 std::vector<int> vbase; 527 525 for(i=1;i<=currRing->N;i++) … … 559 557 std::vector<std::vector<int> > vecqring(std::vector<std::vector<int> > vec1, std::vector<std::vector<int> > vec2) 560 558 { 561 int i,j;562 559 ideal h1=idMake(vec1), h2=idMake(vec2); 563 560 ideal h=idmodulo(h1,h2); … … 3116 3113 pWrite(b); 3117 3114 intvec *solve=gradedpiece2n(h, a, b); 3118 3115 delete solve; 3119 3116 gp++; 3120 3117 } -
Singular/walk.cc
r317c14 r5416d1 1632 1632 } 1633 1633 1634 CHECK_OVERFLOW:1634 //CHECK_OVERFLOW: 1635 1635 1636 1636 for(i=0; i<niv; i++) … … 2401 2401 } 2402 2402 2403 SIMPLIFY_GCD:2403 //SIMPLIFY_GCD: 2404 2404 2405 2405 // simplify the vectors curr_weight and diff_weight (C-int) … … 2509 2509 } 2510 2510 2511 TEST_OVERFLOW:2511 //TEST_OVERFLOW: 2512 2512 2513 2513 for (j=0; j<nRing; j++) … … 7244 7244 #endif 7245 7245 7246 FRACTAL_MSTDCC:7246 //FRACTAL_MSTDCC: 7247 7247 if(printout > 0) 7248 7248 { … … 7817 7817 #endif 7818 7818 7819 FRACTAL_MSTDCC:7819 //FRACTAL_MSTDCC: 7820 7820 if(printout > 0) 7821 7821 {
Note: See TracChangeset
for help on using the changeset viewer.