Changeset f9b0bd in git
- Timestamp:
- Jul 28, 2016, 11:55:04 AM (8 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 7b03761efc366bdaf44e4ac64daa8ae01254efc5e20ddd2f0d01da7ec5ab00e4404f601d29910ba5
- Parents:
- 7b9b8e5baba86b2ea7dc3d91652cd2ae491db203
- Files:
-
- 37 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/dyn_modules/syzextra/syzextra.cc
r7b9b8e5 rf9b0bd 2684 2684 if( OPT__DEBUG ) 2685 2685 { 2686 Print ("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: ");2686 PrintS("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: "); 2687 2687 dPrint(syzterm, r, r, 0); 2688 2688 } … … 2787 2787 if( OPT__DEBUG ) 2788 2788 { 2789 Print ("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: ");2789 PrintS("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: "); 2790 2790 dPrint(syzterm, r, r, 0); 2791 2791 } … … 2897 2897 if( OPT__DEBUG ) 2898 2898 { 2899 Print ("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: ");2899 PrintS("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: "); 2900 2900 dPrint(syzterm, r, r, 0); 2901 2901 } … … 3000 3000 if( OPT__DEBUG ) 3001 3001 { 3002 Print ("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: ");3002 PrintS("_FindReducer::Test SYZTERM: q == syzterm !:((, syzterm is: "); 3003 3003 dPrint(syzterm, r, r, 0); 3004 3004 } -
Singular/extra.cc
r7b9b8e5 rf9b0bd 2316 2316 else if (strcmp(s,"posInT19")==0) 2317 2317 test_PosInT=posInT19; 2318 else Print ("valid posInT:0,1,2,11,110,13,15,17,17_c,19,_EcartFDegpLength,_FDegpLength,_pLength,_EcartpLength\n");2318 else PrintS("valid posInT:0,1,2,11,110,13,15,17,17_c,19,_EcartFDegpLength,_FDegpLength,_pLength,_EcartpLength\n"); 2319 2319 } 2320 2320 else … … 3105 3105 p=(poly)h->CopyD(); 3106 3106 h=h->next; 3107 // Print ("poly is done\n");3107 // PrintS("poly is done\n"); 3108 3108 } 3109 3109 else return TRUE; … … 3113 3113 q = I->m; 3114 3114 h=h->next; 3115 // Print ("ideal is done\n");3115 // PrintS("ideal is done\n"); 3116 3116 } 3117 3117 else return TRUE; … … 3120 3120 is=(int)((long)(h->Data())); 3121 3121 // res->rtyp=INT_CMD; 3122 // Print ("int is done\n");3122 // PrintS("int is done\n"); 3123 3123 // res->rtyp=IDEAL_CMD; 3124 3124 if (rIsPluralRing(currRing)) … … 3130 3130 pl[k] = pLength(I->m[k]); 3131 3131 } 3132 Print ("starting redRat\n");3132 PrintS("starting redRat\n"); 3133 3133 //res->data = (char *) 3134 3134 redRat(&p, q, pl, (int)IDELEMS(I),is,currRing); -
Singular/fevoices.cc
r7b9b8e5 rf9b0bd 106 106 p->prev=currentVoice; 107 107 currentVoice=p; 108 //Print ("Next:");108 //PrintS("Next:"); 109 109 } 110 110 … … 158 158 yylineno=currentVoice->start_lineno; 159 159 //Voice *p=currentVoice; 160 //Print ("-----------------\ncurr:");160 //PrintS("-----------------\ncurr:"); 161 161 //do 162 162 //{ … … 165 165 //} 166 166 //while (p!=NULL); 167 //Print ("----------------\n");167 //PrintS("----------------\n"); 168 168 return FALSE; 169 169 } … … 225 225 //printf("start buffer typ %d\n",t); 226 226 //Voice *p=currentVoice; 227 //Print ("-----------------\ncurr:");227 //PrintS("-----------------\ncurr:"); 228 228 //do 229 229 //{ … … 232 232 //} 233 233 //while (p!=NULL); 234 //Print ("----------------\n");234 //PrintS("----------------\n"); 235 235 } 236 236 … … 244 244 // typ,BT_name[typ], currentVoice); 245 245 //Voice *p=currentVoice; 246 //Print ("-----------------\ncurr:");246 //PrintS("-----------------\ncurr:"); 247 247 //do 248 248 //{ … … 251 251 //} 252 252 //while (p!=NULL); 253 //Print ("----------------\n");253 //PrintS("----------------\n"); 254 254 if (typ == BT_break) // valid inside for, while. may skip if, else 255 255 { … … 350 350 //{ 351 351 //Voice *p=currentVoice; 352 //Print ("-----------------\ncurr:");352 //PrintS("-----------------\ncurr:"); 353 353 //do 354 354 //{ … … 357 357 //} 358 358 //while (p!=NULL); 359 //Print ("----------------\n");359 //PrintS("----------------\n"); 360 360 //} 361 361 if (currentVoice!=NULL) -
Singular/iparith.cc
r7b9b8e5 rf9b0bd 2460 2460 if (hasFlag(u, FLAG_STD)) setFlag(&uuAsLeftv,FLAG_STD); 2461 2461 assumeStdFlag(&uuAsLeftv); 2462 Print ("// NOTE: computation of Hilbert series etc. is being\n");2463 Print ("// performed for generic fibre, that is, over Q\n");2462 PrintS("// NOTE: computation of Hilbert series etc. is being\n"); 2463 PrintS("// performed for generic fibre, that is, over Q\n"); 2464 2464 intvec *module_w=(intvec*)atGet(&uuAsLeftv,"isHomog",INTVEC_CMD); 2465 2465 intvec *iv=hFirstSeries(uu,module_w,currRing->qideal); … … 3924 3924 if (hasFlag(v, FLAG_STD)) setFlag(&vvAsLeftv,FLAG_STD); 3925 3925 assumeStdFlag(&vvAsLeftv); 3926 Print ("// NOTE: computation of degree is being performed for\n");3927 Print ("// generic fibre, that is, over Q\n");3926 PrintS("// NOTE: computation of degree is being performed for\n"); 3927 PrintS("// generic fibre, that is, over Q\n"); 3928 3928 intvec *module_w=(intvec*)atGet(&vvAsLeftv,"isHomog",INTVEC_CMD); 3929 3929 scDegree(vv,module_w,currRing->qideal); … … 4296 4296 if (hasFlag(v, FLAG_STD)) setFlag(&vvAsLeftv,FLAG_STD); 4297 4297 assumeStdFlag(&vvAsLeftv); 4298 Print ("// NOTE: computation of Hilbert series etc. is being\n");4299 Print ("// performed for generic fibre, that is, over Q\n");4298 PrintS("// NOTE: computation of Hilbert series etc. is being\n"); 4299 PrintS("// performed for generic fibre, that is, over Q\n"); 4300 4300 intvec *module_w=(intvec*)atGet(&vvAsLeftv,"isHomog",INTVEC_CMD); 4301 4301 //scHilbertPoly(vv,currRing->qideal); … … 4316 4316 if (rField_is_Ring_Z(currRing)) 4317 4317 { 4318 Print ("// NOTE: computation of Hilbert series etc. is being\n");4319 Print ("// performed for generic fibre, that is, over Q\n");4318 PrintS("// NOTE: computation of Hilbert series etc. is being\n"); 4319 PrintS("// performed for generic fibre, that is, over Q\n"); 4320 4320 } 4321 4321 res->data=(void *)hSecondSeries((intvec *)v->Data()); … … 5932 5932 if (hasFlag(u, FLAG_STD)) setFlag(&uuAsLeftv,FLAG_STD); 5933 5933 assumeStdFlag(&uuAsLeftv); 5934 Print ("// NOTE: computation of Hilbert series etc. is being\n");5935 Print ("// performed for generic fibre, that is, over Q\n");5934 PrintS("// NOTE: computation of Hilbert series etc. is being\n"); 5935 PrintS("// performed for generic fibre, that is, over Q\n"); 5936 5936 intvec *module_w=(intvec*)atGet(&uuAsLeftv,"isHomog",INTVEC_CMD); 5937 5937 intvec *iv=hFirstSeries(uu,module_w,currRing->qideal,wdegree); … … 9119 9119 //if(i>=0 && i<sArithBase.nCmdUsed) 9120 9120 // return i; 9121 //Print ("RET-2\n");9121 //PrintS("RET-2\n"); 9122 9122 return -2; 9123 9123 } -
Singular/iplib.cc
r7b9b8e5 rf9b0bd 1230 1230 proc->data.s.example_lineno, proc->data.s.example_start); 1231 1231 else if(proc->language==LANG_C) 1232 Print ("type: object\n");1232 PrintS("type: object\n"); 1233 1233 } 1234 1234 } -
Singular/links/sing_dbm.cc
r7b9b8e5 rf9b0bd 123 123 if (!SI_LINK_CLOSE_P(l)) 124 124 { 125 if (!dbClose(l)) {Print ("cannot close link!\n");}125 if (!dbClose(l)) {PrintS("cannot close link!\n");} 126 126 } 127 127 //(SI_LINK_CLOSE_P(l)) automatically 128 128 if (dbOpen(l, SI_LINK_READ)) return NULL; 129 129 } 130 if (SI_LINK_RW_OPEN_P(l)) {Print ("I/O Error!\n");}130 if (SI_LINK_RW_OPEN_P(l)) {PrintS("I/O Error!\n");} 131 131 132 132 if(key!=NULL) … … 210 210 if (strcmp(l->mode,"rw")!=0) // r-mode 211 211 { 212 Print ("Write error on readonly source\n");212 PrintS("Write error on readonly source\n"); 213 213 } 214 214 else //rw-mode … … 218 218 if (!SI_LINK_CLOSE_P(l)) 219 219 { 220 if (!dbClose(l)) {Print ("close error\n");};220 if (!dbClose(l)) {PrintS("close error\n");}; 221 221 } 222 if (!dbOpen(l,SI_LINK_WRITE)) {Print ("open_for_write error\n");}222 if (!dbOpen(l,SI_LINK_WRITE)) {PrintS("open_for_write error\n");} 223 223 } 224 224 } … … 238 238 ret = gdbm_store(db->db, d_key, d_value, GDBM_REPLACE); 239 239 // db->actual=d_key; 240 if (ret==-1) {Print ("reader calls gdbm_store!");}240 if (ret==-1) {PrintS("reader calls gdbm_store!");} 241 241 if (ret==0) 242 242 { b=FALSE; } -
Singular/walk.cc
r7b9b8e5 rf9b0bd 2 2 * Computer Algebra System SINGULAR * 3 3 *****************************************/ 4 /* $Id$ */5 4 /* 6 5 * ABSTRACT: Implementation of the Groebner walk … … 2000 1999 { 2001 2000 #ifndef SING_NDEBUG 2002 Print ("\n//MwalkNextWeightCC: t_nenner=0\n");2001 PrintS("\n//MwalkNextWeightCC: t_nenner=0\n"); 2003 2002 #endif 2004 2003 delete diff_weight; … … 2095 2094 mpz_out_str( stdout, 10, t_nenner); 2096 2095 Print(" * %d)", (*curr_weight)[j]); 2097 Print (" + ("); mpz_out_str( stdout, 10, t_zaehler);2096 PrintS(" + ("); mpz_out_str( stdout, 10, t_zaehler); 2098 2097 Print(" * %d) = ", (*diff_weight)[j]); 2099 2098 mpz_out_str( stdout, 10, s_nenner); … … 2395 2394 { 2396 2395 #ifndef SING_NDEBUG 2397 Print ("\n//MwalkNextWeightCC: t_nenner=0\n");2396 PrintS("\n//MwalkNextWeightCC: t_nenner=0\n"); 2398 2397 #endif 2399 2398 delete diff_weight; … … 2479 2478 mpz_out_str( stdout, 10, t_nenner); 2480 2479 Print(" * %d)", (*curr_weight)[j]); 2481 Print (" + ("); mpz_out_str( stdout, 10, t_zaehler);2480 PrintS(" + ("); mpz_out_str( stdout, 10, t_zaehler); 2482 2481 Print(" * %d) = ", (*diff_weight)[j]); 2483 2482 mpz_out_str( stdout, 10, s_nenner); … … 6655 6654 if(printout > 1) 6656 6655 { 6657 Print ("\n Mpwalk: there is a polynomial in Gomega with at least 3 monomials.\n");6656 PrintS("\n Mpwalk: there is a polynomial in Gomega with at least 3 monomials.\n"); 6658 6657 } 6659 6658 // low-dimensional facet of the cone … … 7103 7102 if(printout > 0) 7104 7103 { 7105 Print ("\n//** rec_fractal_call: Wrong cone. Tau doesn't stay in the correct cone.\n");7104 PrintS("\n//** rec_fractal_call: Wrong cone. Tau doesn't stay in the correct cone.\n"); 7106 7105 } 7107 7106 … … 7125 7124 if(printout > 0) 7126 7125 { 7127 Print ("\n//** rec_fractal_call: Updated vectors are equal to the old vectors.\n");7126 PrintS("\n//** rec_fractal_call: Updated vectors are equal to the old vectors.\n"); 7128 7127 } 7129 7128 delete Xtautmp; … … 7278 7277 if(printout > 1) 7279 7278 { 7280 Print ("\n//** rec_fractal_call: Maximal recursion depth.\n");7279 PrintS("\n//** rec_fractal_call: Maximal recursion depth.\n"); 7281 7280 } 7282 7281 #ifdef TIME_TEST -
kernel/GBEngine/f5gb.cc
r7b9b8e5 rf9b0bd 278 278 //Print("IN F5INC\n"); 279 279 /* 280 Print ("\n\n\nRULES: \n");280 PrintS("\n\n\nRULES: \n"); 281 281 RNode* tempR = rules->getFirst(); 282 282 Print("%p\n",tempR); … … 330 330 pSetCoeff(lcm,nOne); 331 331 pSetm(lcm); 332 Print ("LCM: ");332 PrintS("LCM: "); 333 333 pWrite(lcm); 334 334 if(pDeg(lcm) <= pDeg(gPrev->getLast()->getPoly())) { … … 372 372 temp = temp->getNext(); 373 373 } 374 Print ("------------------\n");374 PrintS("------------------\n"); 375 375 return isDGb; 376 376 } … … 680 680 //Print("------------------------------IN CRITERION 2/1-----------------------------------------\n"); 681 681 /* 682 Print ("RULES: \n");682 PrintS("RULES: \n"); 683 683 RNode* tempR = rules->getFirst(); 684 684 Print("%p\n",tempR); … … 793 793 //Print("LAST RuleOld TESTED: %p",testedRuleOld); 794 794 /* 795 Print ("RULES: \n");795 PrintS("RULES: \n"); 796 796 RNode* tempR = rules->getFirst(); 797 797 while(NULL != tempR) { … … 1040 1040 //numberRejectedF5CriticalPairs == 7) { 1041 1041 /* 1042 Print ("--------------------------------- rejected F5-critical pair-------------------------------------\n");1042 PrintS("--------------------------------- rejected F5-critical pair-------------------------------------\n"); 1043 1043 pWrite(pHead(ppMult_qq(temp->getT1(),temp->getLp1Poly()))); 1044 Print ("Label: ");1044 PrintS("Label: "); 1045 1045 pWrite(ppMult_qq(temp->getT1(),temp->getLp1Term())); 1046 1046 Print("%d\n",temp->getDel()); 1047 Print ("Comes from:\n ");1047 PrintS("Comes from:\n "); 1048 1048 pWrite(pHead(temp->getLp1Poly())); 1049 Print ("Label: ");1049 PrintS("Label: "); 1050 1050 pWrite(temp->getLp1Term()); 1051 1051 Print("%d\n",temp->getLp1Index()); 1052 1052 pWrite(pHead(temp->getLp2Poly())); 1053 Print ("Label: ");1053 PrintS("Label: "); 1054 1054 pWrite(temp->getLp2Term()); 1055 1055 Print("%d\n",temp->getLp2Index()); 1056 1056 //Print("--------------------------------------LIST OF GB PAIRS REJECTED-----------------------------------------\n"); 1057 1057 //rejectedGBList->print(); 1058 Print ("--------------------------------------------------------------------------------------------------------\n");1058 PrintS("--------------------------------------------------------------------------------------------------------\n"); 1059 1059 //if(temp->getLp1Index() < 7) { 1060 1060 sPolyList->insertByLabel(ppMult_qq(temp->getT1(),temp->getLp1Term()),temp->getLp1Index(),sp,tempRule->getRuleOld()); … … 1531 1531 //pDelete(&redPoly); 1532 1532 } 1533 else { 1534 Print("\nELEMENT ADDED TO GPREV: "); 1533 else 1534 { 1535 PrintS("\nELEMENT ADDED TO GPREV: "); 1535 1536 pNorm(redPoly); 1536 if(highestDegree < pDeg(redPoly)) { 1537 highestDegree = pDeg(redPoly); 1538 } 1537 if(highestDegree < pDeg(redPoly)) 1538 { 1539 highestDegree = pDeg(redPoly); 1540 } 1539 1541 pWrite(pHead(redPoly)); 1540 1542 //pWrite(l->getTerm()); … … 1889 1891 ========================================================================== 1890 1892 */ 1891 ideal F5main(ideal id, ring r, int opt, int plus, int termination) { 1892 switch(opt) { 1893 ideal F5main(ideal id, ring r, int opt, int plus, int termination) 1894 { 1895 switch(opt) 1896 { 1893 1897 case 0: 1894 Print ("\nComputations are done by the standard F5 Algorithm");1898 PrintS("\nComputations are done by the standard F5 Algorithm"); 1895 1899 break; 1896 1900 case 1: 1897 Print ("\nComputations are done by the variant F5R of the F5 Algorithm");1901 PrintS("\nComputations are done by the variant F5R of the F5 Algorithm"); 1898 1902 break; 1899 1903 case 2: 1900 Print ("\nComputations are done by the variant F5C of the F5 Algorithm");1904 PrintS("\nComputations are done by the variant F5C of the F5 Algorithm"); 1901 1905 break; 1902 1906 default: … … 1944 1948 if(NULL != id->m[j]) { 1945 1949 if(pComparePolys(id->m[j],ONE)) { 1946 Print ("One Polynomial in Input => Computations stopped\n");1950 PrintS("One Polynomial in Input => Computations stopped\n"); 1947 1951 ideal idNew = idInit(1,1); 1948 1952 idNew->m[0] = ONE; -
kernel/GBEngine/f5lists.cc
r7b9b8e5 rf9b0bd 392 392 393 393 // for debugging 394 void LNode::print() { 394 void LNode::print() 395 { 395 396 LNode* temp = this; 396 Print ("___________________List of S-polynomials______________________:\n");397 PrintS("___________________List of S-polynomials______________________:\n"); 397 398 while(NULL != temp && NULL != temp->data) { 398 399 Print("Index: %d\n",temp->getIndex()); 399 Print ("Term: ");400 PrintS("Term: "); 400 401 pWrite(temp->getTerm()); 401 Print ("Poly: ");402 PrintS("Poly: "); 402 403 pWrite(temp->getPoly()); 403 404 temp = temp->next; 404 405 } 405 Print ("_______________________________________________________________\n");406 PrintS("_______________________________________________________________\n"); 406 407 } 407 408 … … 883 884 884 885 // for debugging 885 void CNode::print() { 886 void CNode::print() 887 { 886 888 CNode* temp = this; 887 Print("___________________List of critical pairs______________________:\n"); 888 while(NULL != temp) { 889 PrintS("___________________List of critical pairs______________________:\n"); 890 while(NULL != temp) 891 { 889 892 pWrite(ppMult_qq(temp->getT1(),temp->getLp1Term())); 890 893 Print("LP1 Index: %d\n",temp->getLp1Index()); 891 Print ("T1: ");894 PrintS("T1: "); 892 895 pWrite(temp->getT1()); 893 896 Print("%p\n",temp->getT1()); 894 Print ("LP1 Term: ");897 PrintS("LP1 Term: "); 895 898 pWrite(temp->getLp1Term()); 896 Print ("LP1 Poly: ");899 PrintS("LP1 Poly: "); 897 900 pWrite(temp->getLp1Poly()); 898 901 Print("LP2 Index: %d\n",temp->getLp2Index()); 899 Print ("T2: ");902 PrintS("T2: "); 900 903 pWrite(temp->getT2()); 901 904 Print("%p\n",temp->getT2()); 902 Print ("LP2 Term: ");905 PrintS("LP2 Term: "); 903 906 pWrite(temp->getLp2Term()); 904 Print ("LP2 Poly: ");907 PrintS("LP2 Poly: "); 905 908 pWrite(temp->getLp2Poly()); 906 Print ("\n");909 PrintLn(); 907 910 temp = temp->next; 908 911 } -
kernel/GBEngine/gr_kstd2.cc
r7b9b8e5 rf9b0bd 1204 1204 { 1205 1205 #ifdef PDEBUG 1206 Print ("unit element detected:");1206 PrintS("unit element detected:"); 1207 1207 p_wrp(strat->P.p,currRing); 1208 1208 #endif … … 1240 1240 PrintLn(); 1241 1241 #if MYTEST 1242 Print ("s: "); pWrite(strat->P.p);1242 PrintS("s: "); pWrite(strat->P.p); 1243 1243 #endif 1244 1244 -
kernel/GBEngine/kstd1.cc
r7b9b8e5 rf9b0bd 2646 2646 { 2647 2647 /* error: no local ord yet with shifts */ 2648 Print ("No local ordering possible for shifts");2648 PrintS("No local ordering possible for shifts"); 2649 2649 return(NULL); 2650 2650 } -
kernel/GBEngine/kstd2.cc
r7b9b8e5 rf9b0bd 712 712 //#if 1 713 713 #ifdef DEBUGF5 714 Print ("------- IN REDSIG -------\n");714 PrintS("------- IN REDSIG -------\n"); 715 715 Print("p: "); 716 716 pWrite(pHead(h->p)); 717 Print ("p1: ");717 PrintS("p1: "); 718 718 pWrite(pHead(h->p1)); 719 Print ("p2: ");719 PrintS("p2: "); 720 720 pWrite(pHead(h->p2)); 721 Print ("---------------------------\n");721 PrintS("---------------------------\n"); 722 722 #endif 723 723 poly h_p; … … 790 790 #ifdef DEBUGF5 791 791 Print("BEFORE REDUCTION WITH %d:\n",ii); 792 Print ("--------------------------------\n");792 PrintS("--------------------------------\n"); 793 793 pWrite(h->sig); 794 794 pWrite(strat->T[ii].sig); … … 797 797 pWrite(pHead(h->p2)); 798 798 pWrite(pHead(strat->T[ii].p)); 799 Print ("--------------------------------\n");799 PrintS("--------------------------------\n"); 800 800 printf("INDEX OF REDUCER T: %d\n",ii); 801 801 #endif … … 1979 1979 //#if 1 1980 1980 #ifdef DEBUGF5 1981 Print ("SIG OF NEXT PAIR TO HANDLE IN SIG-BASED ALGORITHM\n");1982 Print ("-------------------------------------------------\n");1981 PrintS("SIG OF NEXT PAIR TO HANDLE IN SIG-BASED ALGORITHM\n"); 1982 PrintS("-------------------------------------------------\n"); 1983 1983 pWrite(strat->P.sig); 1984 1984 pWrite(pHead(strat->P.p)); 1985 1985 pWrite(pHead(strat->P.p1)); 1986 1986 pWrite(pHead(strat->P.p2)); 1987 Print ("-------------------------------------------------\n");1987 PrintS("-------------------------------------------------\n"); 1988 1988 #endif 1989 1989 if (pNext(strat->P.p) == strat->tail) … … 2035 2035 //#if 1 2036 2036 #ifdef DEBUGF5 2037 Print ("Poly before red: ");2037 PrintS("Poly before red: "); 2038 2038 pWrite(pHead(strat->P.p)); 2039 2039 pWrite(strat->P.sig); … … 2068 2068 #ifdef DEBUGF5 2069 2069 if (red_result != 0) { 2070 Print ("Poly after red: ");2070 PrintS("Poly after red: "); 2071 2071 pWrite(pHead(strat->P.p)); 2072 2072 pWrite(strat->P.GetLmCurrRing()); … … 2311 2311 printf("---------------------------\n"); 2312 2312 Print(" %d. ELEMENT ADDED TO GCURR:\n",strat->sl+1); 2313 Print ("LEAD POLY: "); pWrite(pHead(strat->S[strat->sl]));2314 Print ("SIGNATURE: "); pWrite(strat->sig[strat->sl]);2313 PrintS("LEAD POLY: "); pWrite(pHead(strat->S[strat->sl])); 2314 PrintS("SIGNATURE: "); pWrite(strat->sig[strat->sl]); 2315 2315 #endif 2316 2316 /* … … 2358 2358 //#if 1 2359 2359 #ifdef DEBUGF5 2360 Print ("ADDING STUFF TO SYZ : ");2360 PrintS("ADDING STUFF TO SYZ : "); 2361 2361 //pWrite(strat->P.p); 2362 2362 pWrite(strat->P.sig); … … 2730 2730 //#if 1 2731 2731 #ifdef DEBUGF5 2732 Print ("NEXT PAIR TO HANDLE IN INTERRED ALGORITHM\n");2733 Print ("-------------------------------------------------\n");2732 PrintS("NEXT PAIR TO HANDLE IN INTERRED ALGORITHM\n"); 2733 PrintS("-------------------------------------------------\n"); 2734 2734 pWrite(pHead(strat->P.p)); 2735 2735 pWrite(pHead(strat->P.p1)); 2736 2736 pWrite(pHead(strat->P.p2)); 2737 2737 printf("%d\n",strat->tl); 2738 Print ("-------------------------------------------------\n");2738 PrintS("-------------------------------------------------\n"); 2739 2739 #endif 2740 2740 if (pNext(strat->P.p) == strat->tail) … … 2788 2788 2789 2789 #ifdef DEBUGF5 2790 Print ("Poly before red: ");2790 PrintS("Poly before red: "); 2791 2791 pWrite(strat->P.p); 2792 2792 #endif … … 2871 2871 //#if 1 2872 2872 #ifdef DEBUGF5 2873 Print ("ELEMENT ADDED TO GCURR DURING INTERRED: ");2873 PrintS("ELEMENT ADDED TO GCURR DURING INTERRED: "); 2874 2874 pWrite(pHead(strat->S[strat->sl])); 2875 2875 pWrite(strat->sig[strat->sl]); … … 2928 2928 //#if 1 2929 2929 #if DEBUGF5 2930 Print ("------------------- STRAT S ---------------------\n");2930 PrintS("------------------- STRAT S ---------------------\n"); 2931 2931 cc = 0; 2932 2932 while (cc<strat->tl+1) … … 2937 2937 cc++; 2938 2938 } 2939 Print ("-------------------------------------------------\n");2940 Print ("------------------- STRAT T ---------------------\n");2939 PrintS("-------------------------------------------------\n"); 2940 PrintS("------------------- STRAT T ---------------------\n"); 2941 2941 cc = 0; 2942 2942 while (cc<strat->tl+1) … … 2947 2947 cc++; 2948 2948 } 2949 Print ("-------------------------------------------------\n");2950 Print ("------------------- STRAT L ---------------------\n");2949 PrintS("-------------------------------------------------\n"); 2950 PrintS("------------------- STRAT L ---------------------\n"); 2951 2951 cc = 0; 2952 2952 while (cc<strat->Ll+1) … … 2959 2959 cc++; 2960 2960 } 2961 Print ("-------------------------------------------------\n");2961 PrintS("-------------------------------------------------\n"); 2962 2962 printf("F5C DONE\nSTRAT SL: %d -- %d\n",strat->sl, strat->currIdx); 2963 2963 #endif -
kernel/GBEngine/kutil.cc
r7b9b8e5 rf9b0bd 2103 2103 //#if 1 2104 2104 #ifdef DEBUGF5 2105 Print ("P1 ");2105 PrintS("P1 "); 2106 2106 pWrite(pHead(p)); 2107 Print ("P2 ");2107 PrintS("P2 "); 2108 2108 pWrite(pHead(strat->S[i])); 2109 Print ("M1 ");2109 PrintS("M1 "); 2110 2110 pWrite(m1); 2111 Print ("M2 ");2111 PrintS("M2 "); 2112 2112 pWrite(m2); 2113 2113 #endif … … 2120 2120 //#if 1 2121 2121 #ifdef DEBUGF5 2122 Print ("----------------\n");2122 PrintS("----------------\n"); 2123 2123 pWrite(pSigMult); 2124 2124 pWrite(sSigMult); 2125 Print ("----------------\n");2125 PrintS("----------------\n"); 2126 2126 Lp.checked = 0; 2127 2127 #endif … … 3660 3660 #ifdef OLI_DEBUG 3661 3661 Print("%d, (%d, %d), ind = (%d, %d)\n", cabsind, cexp[1], cexp[2], cind[1], cind[2]); 3662 Print ("zPoly : ");3662 PrintS("zPoly : "); 3663 3663 wrp(zeroPoly); 3664 Print ("\n");3664 PrintLn(); 3665 3665 #endif 3666 3666 enterOneZeroPairRing(zeroPoly, t_p, p, ecart, strat, atR); … … 3720 3720 #ifdef OLI_DEBUG 3721 3721 Print("%d, (%d, %d), ind = (%d, %d)\n", cabsind, cexp[1], cexp[2], cind[1], cind[2]); 3722 Print ("zPoly : ");3722 PrintS("zPoly : "); 3723 3723 wrp(zeroPoly); 3724 Print ("\n");3724 PrintLn(); 3725 3725 #endif 3726 3726 // Add to ideal … … 5879 5879 //#if 1 5880 5880 #ifdef DEBUGF5 5881 Print ("syzygy criterion checks: ");5881 PrintS("syzygy criterion checks: "); 5882 5882 pWrite(sig); 5883 5883 #endif … … 5911 5911 //#if 1 5912 5912 #ifdef DEBUGF5 5913 Print ("--- syzygy criterion checks: ");5913 PrintS("--- syzygy criterion checks: "); 5914 5914 pWrite(sig); 5915 5915 #endif … … 5961 5961 //#if 1 5962 5962 #ifdef DEBUGF5 5963 Print ("checking with: ");5963 PrintS("checking with: "); 5964 5964 pWrite(strat->sig[k]); 5965 5965 pWrite(pHead(strat->S[k])); … … 5976 5976 } 5977 5977 #ifdef DEBUGF5 5978 Print ("ALL ELEMENTS OF S\n----------------------------------------\n");5978 PrintS("ALL ELEMENTS OF S\n----------------------------------------\n"); 5979 5979 for(int kk = 0; kk<strat->sl+1; kk++) 5980 5980 { 5981 5981 pWrite(pHead(strat->S[kk])); 5982 5982 } 5983 Print ("------------------------------\n");5983 PrintS("------------------------------\n"); 5984 5984 #endif 5985 5985 return FALSE; … … 8036 8036 pWrite(strat->sig[k]); 8037 8037 } 8038 Print ("--- LIST S END ---\n");8038 PrintS("--- LIST S END ---\n"); 8039 8039 #endif 8040 8040 } -
kernel/GBEngine/nc.cc
r7b9b8e5 rf9b0bd 39 39 p_Test(p, currRing); 40 40 #if 0 41 Print ("p: "); // !41 PrintS("p: "); // ! 42 42 p_Write(p, currRing); 43 43 #endif … … 57 57 p_Test(q, currRing); 58 58 #if 0 59 Print ("Reducing p: "); // !59 PrintS("Reducing p: "); // ! 60 60 p_Write(p, currRing); 61 Print ("With q: "); // !61 PrintS("With q: "); // ! 62 62 p_Write(q, currRing); 63 63 #endif … … 73 73 p_Write(q, currRing); 74 74 75 Print ("With p:");75 PrintS("With p:"); 76 76 p_Write(p, currRing); 77 77 … … 87 87 p_Test(q, currRing); 88 88 #if 0 89 Print ("reductum q/p: ");89 PrintS("reductum q/p: "); 90 90 p_Write(q, currRing); 91 91 92 // Print ("With J!\n");92 // PrintS("With J!\n"); 93 93 #endif 94 94 #endif … … 100 100 p_Test(q, currRing); 101 101 #if 0 102 Print ("NF(J/currRing->qideal)=> q: "); // !102 PrintS("NF(J/currRing->qideal)=> q: "); // ! 103 103 p_Write(q, currRing); 104 104 #endif … … 151 151 idTest(J); // in currRing! 152 152 #if 0 153 Print ("J:");153 PrintS("J:"); 154 154 idPrint(J); 155 155 PrintLn(); … … 162 162 idTest(K); // in currRing! 163 163 #if 0 164 Print ("+K:");164 PrintS("+K:"); 165 165 idPrint(K); 166 166 PrintLn(); … … 191 191 idTest(J); // in currRing! 192 192 #if 0 193 Print ("J:");193 PrintS("J:"); 194 194 idPrint(J); 195 195 PrintLn(); … … 208 208 if (IDELEMS(s)!=IDELEMS(T)) 209 209 { 210 Print ("ideals of diff. size!!!");210 PrintS("ideals of diff. size!!!"); 211 211 } 212 212 #endif … … 344 344 s_h2=idCopy(s_h3); 345 345 idDelete(&s_h3); 346 Print ("...computing Syz");346 PrintS("...computing Syz"); 347 347 s_h3 = kStd(s_h2, currRing->qideal,(tHomog)FALSE,NULL,NULL,syzcomp,idI); 348 348 SI_RESTORE_OPT1(save1); … … 380 380 if (flagcnt == N) 381 381 { 382 Print ("the input is a two--sided ideal");382 PrintS("the input is a two--sided ideal"); 383 383 return(I); 384 384 } … … 407 407 res->m[i-1]=p; 408 408 } 409 Print ("final std");409 PrintS("final std"); 410 410 res = kStd(res, currRing->qideal,testHomog,NULL,NULL,0,0,NULL); 411 411 idSkipZeroes(res); … … 414 414 else 415 415 { 416 Print ("No syzygies");416 PrintS("No syzygies"); 417 417 return(I); 418 418 } -
kernel/GBEngine/test.cc
r7b9b8e5 rf9b0bd 440 440 poly pp = pp_Mult_qq( p, p, R); 441 441 442 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );443 444 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );442 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 443 444 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 445 445 446 446 … … 467 467 468 468 // print p1 + p2 469 Print ("p1: "); pWrite0(p1);470 Print (" + p2: "); pWrite0(p2);471 Print (" ---- >>>> ");469 PrintS("p1: "); pWrite0(p1); 470 PrintS(" + p2: "); pWrite0(p2); 471 PrintS(" ---- >>>> "); 472 472 473 473 // compute p1+p2 -
kernel/combinatorics/test.cc
r7b9b8e5 rf9b0bd 306 306 poly pp = pp_Mult_qq( p, p, R); 307 307 308 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );309 310 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );308 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 309 310 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 311 311 312 312 … … 333 333 334 334 // print p1 + p2 335 Print ("p1: "); pWrite0(p1);336 Print (" + p2: "); pWrite0(p2);337 Print (" ---- >>>> ");335 PrintS("p1: "); pWrite0(p1); 336 PrintS(" + p2: "); pWrite0(p2); 337 PrintS(" ---- >>>> "); 338 338 339 339 // compute p1+p2 -
kernel/fglm/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/groebner_walk/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/linear_algebra/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/maps/fast_maps.cc
r7b9b8e5 rf9b0bd 395 395 // do the actual evaluation 396 396 maPoly_Eval(mp, src_r, dest_id, dest_r, length); 397 if (TEST_OPT_PROT) Print (".");397 if (TEST_OPT_PROT) PrintS("."); 398 398 399 399 // collect the results back into an ideal 400 400 ideal res_dest_id = maIdeal_2_Ideal(mideal, dest_r); 401 if (TEST_OPT_PROT) Print (".");401 if (TEST_OPT_PROT) PrintS("."); 402 402 403 403 // convert result back to image_r … … 415 415 res_image_id = res_dest_id; 416 416 417 if (TEST_OPT_PROT) Print (".");417 if (TEST_OPT_PROT) PrintS("."); 418 418 419 419 // clean-up the rings … … 421 421 422 422 if (TEST_OPT_PROT) 423 Print ("\n");423 PrintLn(); 424 424 425 425 idTest(res_image_id); … … 559 559 if (cost > next_print_cost) 560 560 { 561 Print ("-");561 PrintS("-"); 562 562 next_print_cost += total_cost; 563 563 } -
kernel/maps/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/numeric/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/oswrapper/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/spectrum/test.cc
r7b9b8e5 rf9b0bd 304 304 poly pp = pp_Mult_qq( p, p, R); 305 305 306 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );307 308 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );306 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 307 308 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 309 309 310 310 … … 331 331 332 332 // print p1 + p2 333 Print ("p1: "); pWrite0(p1);334 Print (" + p2: "); pWrite0(p2);335 Print (" ---- >>>> ");333 PrintS("p1: "); pWrite0(p1); 334 PrintS(" + p2: "); pWrite0(p2); 335 PrintS(" ---- >>>> "); 336 336 337 337 // compute p1+p2 -
kernel/test.cc
r7b9b8e5 rf9b0bd 550 550 poly pp = pp_Mult_qq( p, p, R); 551 551 552 Print ("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) );553 554 Print ("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) );552 PrintS("p: "); p_Write0(p, R); Print(", deg(p): %ld", p_Totaldegree(p, R)); assume( 1 == p_Totaldegree(p, R) ); 553 554 PrintS("; p*p : "); p_Write0(pp, R); Print("deg(pp): %ld\n", p_Totaldegree(pp, R)); assume( 2 == p_Totaldegree(pp, R) ); 555 555 556 556 … … 577 577 578 578 // print p1 + p2 579 Print ("p1: "); pWrite0(p1);580 Print (" + p2: "); pWrite0(p2);581 Print (" ---- >>>> ");579 PrintS("p1: "); pWrite0(p1); 580 PrintS(" + p2: "); pWrite0(p2); 581 PrintS(" ---- >>>> "); 582 582 583 583 // compute p1+p2 -
libpolys/coeffs/bigintmat.cc
r7b9b8e5 rf9b0bd 1677 1677 #if 0 1678 1678 char * s; 1679 ::Print ("mat over Z is \n");1679 ::PrintS("mat over Z is \n"); 1680 1680 ::Print("%s\n", s = nCoeffString(basecoeffs())); 1681 1681 omFree(s); … … 1744 1744 // get the gcd in position and the 0 in the other: 1745 1745 #ifdef CF_DEB 1746 ::Print ("applying trafo\n");1746 ::PrintS("applying trafo\n"); 1747 1747 StringSetS(""); 1748 1748 n_Write(co1, basecoeffs()); StringAppendS("\t"); … … 1806 1806 1807 1807 #if 0 1808 ::Print ("hnf over Z is \n");1808 ::PrintS("hnf over Z is \n"); 1809 1809 Print(); 1810 1810 ::Print("\n(%d x %d)\n", rows(), cols()); … … 1965 1965 //b can have multiple columns. 1966 1966 #if 0 1967 Print ("reduce_mod_howell: A:\n");1967 PrintS("reduce_mod_howell: A:\n"); 1968 1968 A->Print(); 1969 Print ("\nb:\n");1969 PrintS("\nb:\n"); 1970 1970 b->Print(); 1971 1971 #endif … … 1981 1981 1982 1982 #if 0 1983 Print ("\nx:\n");1983 PrintS("\nx:\n"); 1984 1984 x->Print(); 1985 Print ("\neps:\n");1985 PrintS("\neps:\n"); 1986 1986 eps->Print(); 1987 Print ("\n****************************************\n");1987 PrintS("\n****************************************\n"); 1988 1988 #endif 1989 1989 return; … … 2036 2036 delete B; 2037 2037 #if 0 2038 Print ("\nx:\n");2038 PrintS("\nx:\n"); 2039 2039 x->Print(); 2040 Print ("\neps:\n");2040 PrintS("\neps:\n"); 2041 2041 eps->Print(); 2042 Print ("\n****************************************\n");2042 PrintS("\n****************************************\n"); 2043 2043 #endif 2044 2044 } … … 2094 2094 n_InpMult(den, dz, Z); 2095 2095 #if 0 2096 Print ("den increasing to ");2096 PrintS("den increasing to "); 2097 2097 n_Print(den, Z); 2098 Print ("\n");2098 PrintLn(); 2099 2099 #endif 2100 2100 } … … 2108 2108 #if 0 2109 2109 L->Print(); 2110 Print ("\n * 1/");2110 PrintS("\n * 1/"); 2111 2111 n_Print(den, Z); 2112 Print ("\n");2112 PrintLn(); 2113 2113 #endif 2114 2114 return den; … … 2429 2429 x->simplifyContentDen(&den); 2430 2430 #if 0 2431 Print ("sol = 1/");2431 PrintS("sol = 1/"); 2432 2432 n_Print(den, R); 2433 Print (" *\n");2433 PrintS(" *\n"); 2434 2434 x->Print(); 2435 Print ("\n");2435 PrintLn(); 2436 2436 #endif 2437 2437 return den; … … 2441 2441 { 2442 2442 #if 0 2443 Print ("Solve Ax=b for A=\n");2443 PrintS("Solve Ax=b for A=\n"); 2444 2444 A->Print(); 2445 Print ("\nb = \n");2445 PrintS("\nb = \n"); 2446 2446 b->Print(); 2447 Print ("\nx = \n");2447 PrintS("\nx = \n"); 2448 2448 x->Print(); 2449 Print ("\n");2449 PrintLn(); 2450 2450 #endif 2451 2451 … … 2565 2565 Print("\n2:x: %ld\n", x); 2566 2566 x->Print(); 2567 Print ("\n");2567 PrintLn(); 2568 2568 #endif 2569 2569 } … … 2586 2586 } 2587 2587 #if 0 2588 Print ("Diag ? %d\n", diag);2588 PrintS("Diag ? %d\n", diag); 2589 2589 a->Print(); 2590 Print ("\n");2590 PrintLn(); 2591 2591 #endif 2592 2592 if (diag) break; … … 2611 2611 { 2612 2612 #if 0 2613 Print ("Kernel of ");2613 PrintS("Kernel of "); 2614 2614 a->Print(); 2615 Print (" modulo ");2615 PrintS(" modulo "); 2616 2616 n_Print(p, q); 2617 Print ("\n");2617 PrintLn(); 2618 2618 #endif 2619 2619 … … 2622 2622 diagonalForm(m, &U, &V); 2623 2623 #if 0 2624 Print ("\ndiag form: ");2624 PrintS("\ndiag form: "); 2625 2625 m->Print(); 2626 Print ("\nU:\n");2626 PrintS("\nU:\n"); 2627 2627 U->Print(); 2628 Print ("\nV:\n");2628 PrintS("\nV:\n"); 2629 2629 V->Print(); 2630 Print ("\n");2630 PrintLn(); 2631 2631 #endif 2632 2632 -
libpolys/coeffs/flintcf_Q.cc
r7b9b8e5 rf9b0bd 71 71 static void CoeffWrite(const coeffs r, BOOLEAN details) 72 72 { 73 Print ("// coefficients: flint fmpq_poly\n");73 PrintS("// coefficients: flint fmpq_poly\n"); 74 74 } 75 75 static BOOLEAN CoeffIsEqual(const coeffs r, n_coeffType n, void * parameter) -
libpolys/coeffs/rintegers.cc
r7b9b8e5 rf9b0bd 1412 1412 number two = nrzInit(2, R); 1413 1413 #if 0 1414 Print ("Farey start with ");1414 PrintS("Farey start with "); 1415 1415 n_Print(r, R); 1416 Print (" mod ");1416 PrintS(" mod "); 1417 1417 n_Print(N, R); 1418 Print ("\n");1418 PrintLn(); 1419 1419 #endif 1420 1420 while (1) -
libpolys/coeffs/rmodulon.cc
r7b9b8e5 rf9b0bd 446 446 #endif 447 447 nrnDelete(&xx, r); 448 if (!nrnIsOne(ui, r)) { 448 if (!nrnIsOne(ui, r)) 449 { 449 450 #ifdef CF_DEB 450 Print ("Scaling\n");451 PrintS("Scaling\n"); 451 452 #endif 452 453 number uii = nrnInvers(ui, r); -
libpolys/polys/ext_fields/algext.cc
r7b9b8e5 rf9b0bd 1497 1497 1498 1498 assume( A != NULL ); 1499 Print ("// polynomial ring as coefficient ring :\n");1499 PrintS("// polynomial ring as coefficient ring :\n"); 1500 1500 rWrite(A); 1501 1501 PrintLn(); -
libpolys/polys/ext_fields/transext.cc
r7b9b8e5 rf9b0bd 216 216 { 217 217 Print("ERROR in %s:%d: constant den. poly / Zp\n",f,l); 218 Print ("NUM: "); p_Write(num, ntRing);219 Print ("DEN: "); p_Write(den, ntRing);218 PrintS("NUM: "); p_Write(num, ntRing); 219 PrintS("DEN: "); p_Write(den, ntRing); 220 220 return FALSE; 221 221 } … … 224 224 { 225 225 Print("ERROR in %s:%d: non-monic den. poly / Zp\n",f,l); 226 Print ("NUM: "); p_Write(num, ntRing);227 Print ("DEN: "); p_Write(den, ntRing);226 PrintS("NUM: "); p_Write(num, ntRing); 227 PrintS("DEN: "); p_Write(den, ntRing); 228 228 return FALSE; 229 229 } … … 238 238 { 239 239 Print("ERROR in %s:%d: 1 != GCD between num. & den. poly\n",f,l); 240 Print ("GCD: "); p_Write(gcd, ntRing);241 Print ("NUM: "); p_Write(num, ntRing);242 Print ("DEN: "); p_Write(den, ntRing);240 PrintS("GCD: "); p_Write(gcd, ntRing); 241 PrintS("NUM: "); p_Write(num, ntRing); 242 PrintS("DEN: "); p_Write(den, ntRing); 243 243 return FALSE; 244 244 } -
libpolys/polys/matpol.cc
r7b9b8e5 rf9b0bd 699 699 * for(i=1;i<=c;i++) 700 700 * { 701 * if(MATELEM(a,j,i)!=NULL) Print ("X");702 * else Print ("0");701 * if(MATELEM(a,j,i)!=NULL) PrintS("X"); 702 * else PrintS("0"); 703 703 * } 704 * Print ("\n");704 * PrintLn(); 705 705 * } 706 706 *} -
libpolys/polys/monomials/p_polys.cc
r7b9b8e5 rf9b0bd 291 291 p->exp[o->data.wp64.place]=a_1; 292 292 p->exp[o->data.wp64.place+1]=a_0; 293 // if(p_Setm_error) Print ("***************************\n294 // ***************************\n295 // **WARNING: overflow error**\n296 // ***************************\n297 // ***************************\n");293 // if(p_Setm_error) PrintS("***************************\n" 294 // "***************************\n" 295 // "**WARNING: overflow error**\n" 296 // "***************************\n" 297 // "***************************\n"); 298 298 break; 299 299 } -
libpolys/polys/monomials/ring.cc
r7b9b8e5 rf9b0bd 4086 4086 else 4087 4087 { 4088 Print ("{");4088 PrintS("{"); 4089 4089 for( i=0; i <= limit; i++ ) 4090 4090 Print("%d ", syz_index[i]); 4091 Print ("}");4091 PrintS("}"); 4092 4092 } 4093 4093 … … 4211 4211 { 4212 4212 PrintLn(); 4213 Print ("pFDeg : ");4213 PrintS("pFDeg : "); 4214 4214 #define pFDeg_CASE(A) if(r->pFDeg == A) PrintS( "" #A "" ) 4215 4215 pFDeg_CASE(p_Totaldegree); else … … 4224 4224 PrintLn(); 4225 4225 } 4226 Print ("pSetm:");4226 PrintS("pSetm:"); 4227 4227 void p_Setm_Dummy(poly p, const ring r); 4228 4228 void p_Setm_TotalDegree(poly p, const ring r); -
libpolys/polys/nc/ncSAFormula.cc
r7b9b8e5 rf9b0bd 52 52 { 53 53 #if OUTPUT 54 Print ("ncInitSpecialPowersMultiplication(ring), ring: \n");54 PrintS("ncInitSpecialPowersMultiplication(ring), ring: \n"); 55 55 rWrite(r, TRUE); 56 56 PrintLn(); … … 84 84 { 85 85 #if OUTPUT 86 Print("AreCommutingVariables(ring, k: %d, i: %d)!", j, i); 87 PrintLn(); 86 Print("AreCommutingVariables(ring, k: %d, i: %d)!\n", j, i); 88 87 #endif 89 88 … … 136 135 { 137 136 #if OUTPUT 138 Print("AnalyzePair(ring, i: %d, j: %d):", i, j); 139 PrintLn(); 137 Print("AnalyzePair(ring, i: %d, j: %d):\n", i, j); 140 138 #endif 141 139 … … 220 218 { 221 219 #if OUTPUT 222 Print ("CFormulaPowerMultiplier::CFormulaPowerMultiplier(ring)!");220 PrintS("CFormulaPowerMultiplier::CFormulaPowerMultiplier(ring)!"); 223 221 PrintLn(); 224 222 #endif … … 237 235 { 238 236 #if OUTPUT 239 Print ("CFormulaPowerMultiplier::~CFormulaPowerMultiplier()!");237 PrintS("CFormulaPowerMultiplier::~CFormulaPowerMultiplier()!"); 240 238 PrintLn(); 241 239 #endif … … 263 261 { 264 262 #if OUTPUT 265 Print("ncSA_1xy0x0y0(var(%d)^{%d}, var(%d)^{%d}, r)!", j, m, i, n); 266 PrintLn(); 263 Print("ncSA_1xy0x0y0(var(%d)^{%d}, var(%d)^{%d}, r)!\n", j, m, i, n); 267 264 #endif 268 265 … … 281 278 { 282 279 #if OUTPUT 283 Print("ncSA_{M = -1}xy0x0y0(var(%d)^{%d}, var(%d)^{%d}, r)!", j, m, i, n); 284 PrintLn(); 280 Print("ncSA_{M = -1}xy0x0y0(var(%d)^{%d}, var(%d)^{%d}, r)!\n", j, m, i, n); 285 281 #endif 286 282 … … 301 297 { 302 298 #if OUTPUT 303 Print("ncSA_Qxy0x0y0(var(%d)^{%d}, var(%d)^{%d}, Q, r)!", j, m, i, n); 304 PrintLn(); 299 Print("ncSA_Qxy0x0y0(var(%d)^{%d}, var(%d)^{%d}, Q, r)!\n", j, m, i, n); 305 300 #endif 306 301 … … 350 345 { 351 346 #if OUTPUT 352 Print("ncSA_1xy0x0yG(var(%d)^{%d}, var(%d)^{%d}, G, r)!", j, m, i, n); 353 PrintLn(); 347 Print("ncSA_1xy0x0yG(var(%d)^{%d}, var(%d)^{%d}, G, r)!\n", j, m, i, n); 354 348 number t = n_Copy(m_g, r); 355 349 PrintS("Parameter G: "); n_Write(t, r); … … 450 444 { 451 445 #if OUTPUT 452 Print("ncSA_1xy0x0yT2(var(%d)^{%d}, var(%d)^{%d}, t: var(%d), r)!", j, m, i, n, m_k); 453 PrintLn(); 446 Print("ncSA_1xy0x0yT2(var(%d)^{%d}, var(%d)^{%d}, t: var(%d), r)!\n", j, m, i, n, m_k); 454 447 #endif 455 448 … … 633 626 { 634 627 #if OUTPUT 635 Print("ncSA_1xyAx0y0(var(%d)^{%d}, var(%d)^{%d}, A, r)!", j, m, i, n); 636 PrintLn(); 628 Print("ncSA_1xyAx0y0(var(%d)^{%d}, var(%d)^{%d}, A, r)!\n", j, m, i, n); 637 629 number t = n_Copy(m_shiftCoef, r); 638 630 PrintS("Parameter A: "); n_Write(t, r); … … 646 638 { 647 639 #if OUTPUT 648 Print("ncSA_1xy0xBy0(var(%d)^{%d}, var(%d)^{%d}, B, r)!", j, m, i, n); 649 PrintLn(); 640 Print("ncSA_1xy0xBy0(var(%d)^{%d}, var(%d)^{%d}, B, r)!\n", j, m, i, n); 650 641 number t = n_Copy(m_shiftCoef, r); 651 642 PrintS("Parameter B: "); n_Write(t, r); … … 664 655 { 665 656 #if OUTPUT 666 Print("ncSA_Multiply(type: %d, ring, (var(%d)^{%d} * var(%d)^{%d}, r)!", (int)type, j, m, i, n); 667 PrintLn(); 657 Print("ncSA_Multiply(type: %d, ring, (var(%d)^{%d} * var(%d)^{%d}, r)!\n", (int)type, j, m, i, n); 668 658 #endif 669 659 -
libpolys/polys/nc/old.gring.cc
r7b9b8e5 rf9b0bd 407 407 if (side) 408 408 { 409 Print ("gnc_p_Mult_mm: Multiplication in the left module from the right");409 PrintS("gnc_p_Mult_mm: Multiplication in the left module from the right"); 410 410 } 411 411 #endif … … 1622 1622 p_Test(p2, r); 1623 1623 #if MYTEST 1624 Print ("p1: "); p_Write(p1, r);1625 Print ("p2: "); p_Write(p2, r);1624 PrintS("p1: "); p_Write(p1, r); 1625 PrintS("p2: "); p_Write(p2, r); 1626 1626 #endif 1627 1627 #endif … … 1675 1675 #ifdef PDEBUG 1676 1676 #if MYTEST 1677 Print ("m1: "); pWrite(m1);1678 Print ("m2: "); pWrite(m2);1677 PrintS("m1: "); pWrite(m1); 1678 PrintS("m2: "); pWrite(m2); 1679 1679 #endif 1680 1680 #endif … … 1723 1723 1724 1724 #if MYTEST 1725 Print ("M1: "); pWrite(M1);1726 Print ("M2: "); pWrite(M2);1725 PrintS("M1: "); pWrite(M1); 1726 PrintS("M2: "); pWrite(M2); 1727 1727 #endif 1728 1728 #endif … … 1731 1731 { 1732 1732 #ifdef PDEBUG 1733 Print ("\np1 = ");1733 PrintS("\np1 = "); 1734 1734 p_Write(p1, r); 1735 1735 1736 Print ("m1 = ");1736 PrintS("m1 = "); 1737 1737 p_Write(m1, r); 1738 1738 1739 Print ("p2 = ");1739 PrintS("p2 = "); 1740 1740 p_Write(p2, r); 1741 1741 1742 Print ("m2 = ");1742 PrintS("m2 = "); 1743 1743 p_Write(m2, r); 1744 1744 … … 1790 1790 1791 1791 #if MYTEST 1792 Print ("M1: "); pWrite(M1);1793 Print ("M2: "); pWrite(M2);1792 PrintS("M1: "); pWrite(M1); 1793 PrintS("M2: "); pWrite(M2); 1794 1794 #endif 1795 1795 #endif … … 1802 1802 1803 1803 #if MYTEST 1804 Print ("M2: "); pWrite(M2);1804 PrintS("M2: "); pWrite(M2); 1805 1805 #endif 1806 1806 … … 1831 1831 1832 1832 #if MYTEST 1833 Print ("M1: "); pWrite(M1);1833 PrintS("M1: "); pWrite(M1); 1834 1834 #endif 1835 1835 … … 1842 1842 1843 1843 #if MYTEST 1844 Print ("M2: "); pWrite(M2);1844 PrintS("M2: "); pWrite(M2); 1845 1845 #endif 1846 1846 … … 1860 1860 1861 1861 #if MYTEST 1862 Print ("M1: "); pWrite(M1);1862 PrintS("M1: "); pWrite(M1); 1863 1863 #endif 1864 1864 … … 1872 1872 1873 1873 #if MYTEST 1874 Print ("M2: "); pWrite(M2);1874 PrintS("M2: "); pWrite(M2); 1875 1875 #endif 1876 1876 … … 2015 2015 const ring r = b->bucket_ring; 2016 2016 #ifdef PDEBUG 2017 // Print (">*");2017 // PrintS(">*"); 2018 2018 #endif 2019 2019 … … 2025 2025 p_Test(p, r); 2026 2026 #if MYTEST 2027 Print ("p: "); p_Write(p, r);2027 PrintS("p: "); p_Write(p, r); 2028 2028 #endif 2029 2029 #endif … … 2041 2041 2042 2042 #if MYTEST 2043 Print ("pLmB: "); p_Write(pLmB, r);2043 PrintS("pLmB: "); p_Write(pLmB, r); 2044 2044 #endif 2045 2045 #endif … … 2051 2051 p_Test(m, r); 2052 2052 #if MYTEST 2053 Print ("m: "); p_Write(m, r);2053 PrintS("m: "); p_Write(m, r); 2054 2054 #endif 2055 2055 #endif … … 2079 2079 #ifdef PDEBUG 2080 2080 p_Test(pp, r); 2081 // Print ("PP: "); pWrite(pp);2081 // PrintS("PP: "); pWrite(pp); 2082 2082 #endif 2083 2083 … … 2086 2086 2087 2087 #ifdef PDEBUG 2088 // Print ("*>");2088 // PrintS("*>"); 2089 2089 #endif 2090 2090 } -
libpolys/polys/nc/sca.cc
r7b9b8e5 rf9b0bd 385 385 386 386 #ifdef PDEBUG 387 // Print ("sca_p_Mult_mm\n"); // !387 // PrintS("sca_p_Mult_mm\n"); // ! 388 388 389 389 p_Test(pPoly, rRing); … … 471 471 472 472 #ifdef PDEBUG 473 // Print ("sca_pp_Mult_mm\n"); // !473 // PrintS("sca_pp_Mult_mm\n"); // ! 474 474 475 475 p_Test(pPoly, rRing); … … 581 581 582 582 #ifdef PDEBUG 583 // Print ("sca_mm_Mult_pp\n"); // !583 // PrintS("sca_mm_Mult_pp\n"); // ! 584 584 585 585 p_Test(pPoly, rRing); … … 1460 1460 1461 1461 #if 0 1462 Print ("m_KillSquares, m = "); // !1462 PrintS("m_KillSquares, m = "); // ! 1463 1463 p_Write(m, r); 1464 1464 #endif … … 1487 1487 1488 1488 #if 0 1489 Print ("p_KillSquares, p = "); // !1489 PrintS("p_KillSquares, p = "); // ! 1490 1490 p_Write(p, r); 1491 1491 #endif … … 1519 1519 p_Test(pResult, r); 1520 1520 #if 0 1521 Print ("p_KillSquares => "); // !1521 PrintS("p_KillSquares => "); // ! 1522 1522 p_Write(pResult, r); 1523 1523 #endif
Note: See TracChangeset
for help on using the changeset viewer.