Changeset 15100
- Timestamp:
- 05/24/13 13:02:48 (12 years ago)
- Location:
- issm/trunk-jpl/src
- Files:
-
- 215 edited
Legend:
- Unmodified
- Added
- Removed
-
issm/trunk-jpl/src/c/analyses/DakotaSpawnCore.cpp
r15099 r15100 62 62 femmodel->parameters->FindParam(&control_analysis,InversionIscontrolEnum); 63 63 64 if(VerboseQmu()) _p printString_("qmu iteration: " << counter << "\n");64 if(VerboseQmu()) _printf0_("qmu iteration: " << counter << "\n"); 65 65 66 66 /* only cpu 0, running dakota is providing us with variables and variables_descriptors and numresponses: broadcast onto other cpus: */ … … 71 71 72 72 /*Determine solution sequence: */ 73 if(VerboseQmu()) _p printString_("Starting " << EnumToStringx(solution_type) << " core:" << "\n");73 if(VerboseQmu()) _printf0_("Starting " << EnumToStringx(solution_type) << " core:" << "\n"); 74 74 WrapperCorePointerFromSolutionEnum(&solutioncore,femmodel->parameters,solution_type,nodakotacore); 75 75 … … 78 78 79 79 /*compute responses: */ 80 if(VerboseQmu()) _p printString_("compute dakota responses:" << "\n");80 if(VerboseQmu()) _printf0_("compute dakota responses:" << "\n"); 81 81 femmodel->DakotaResponsesx(d_responses,responses_descriptors,numresponsedescriptors,d_numresponses); 82 82 -
issm/trunk-jpl/src/c/analyses/ResetBoundaryConditions.cpp
r15099 r15100 13 13 Nodes *nodes = NULL; 14 14 15 if(VerboseSolution()) _p printString_(" updating boundary conditions..." << "\n");15 if(VerboseSolution()) _printf0_(" updating boundary conditions..." << "\n"); 16 16 17 17 /*set current analysis: */ -
issm/trunk-jpl/src/c/analyses/ad_core.cpp
r15099 r15100 49 49 if(!(num_dependents*num_independents)) return; 50 50 51 if(VerboseAutodiff())_p printString_(" start ad core" << "\n");51 if(VerboseAutodiff())_printf0_(" start ad core" << "\n"); 52 52 53 53 /*retrieve state variable: */ … … 286 286 tapestats(1,tape_stats); //reading of tape statistics 287 287 if(VerboseAutodiff()){ 288 _p printString_(" ADOLC statistics: " << "\n");289 _p printString_(" "<<setw(45)<<left<<"Number of independents: " <<tape_stats[0] << "\n");290 _p printString_(" "<<setw(45)<<left<<"Number of dependents: " <<tape_stats[1] << "\n");291 _p printString_(" "<<setw(45)<<left<<"Maximal number of live active variables: " <<tape_stats[2] << "\n");292 _p printString_(" "<<setw(45)<<left<<"Size of value stack (number of overwrites): " <<tape_stats[3] << "\n");293 _p printString_(" "<<setw(45)<<left<<"Buffer size (a multiple of eight): " <<tape_stats[4] << "\n");294 _p printString_(" "<<setw(45)<<left<<"Total number of operations recorded: " <<tape_stats[5] << "\n");295 } 296 if(VerboseAutodiff())_p printString_(" end AD core" << "\n");288 _printf0_(" ADOLC statistics: " << "\n"); 289 _printf0_(" "<<setw(45)<<left<<"Number of independents: " <<tape_stats[0] << "\n"); 290 _printf0_(" "<<setw(45)<<left<<"Number of dependents: " <<tape_stats[1] << "\n"); 291 _printf0_(" "<<setw(45)<<left<<"Maximal number of live active variables: " <<tape_stats[2] << "\n"); 292 _printf0_(" "<<setw(45)<<left<<"Size of value stack (number of overwrites): " <<tape_stats[3] << "\n"); 293 _printf0_(" "<<setw(45)<<left<<"Buffer size (a multiple of eight): " <<tape_stats[4] << "\n"); 294 _printf0_(" "<<setw(45)<<left<<"Total number of operations recorded: " <<tape_stats[5] << "\n"); 295 } 296 if(VerboseAutodiff())_printf0_(" end AD core" << "\n"); 297 297 298 298 /*Free resources: */ -
issm/trunk-jpl/src/c/analyses/adjointbalancethickness_core.cpp
r15099 r15100 19 19 20 20 /*compute thickness */ 21 if(VerboseSolution()) _p printString_(" computing thickness" << "\n");21 if(VerboseSolution()) _printf0_(" computing thickness" << "\n"); 22 22 femmodel->SetCurrentConfiguration(BalancethicknessAnalysisEnum); 23 23 solutionsequence_linear(femmodel); … … 27 27 28 28 /*compute adjoint*/ 29 if(VerboseSolution()) _p printString_(" computing adjoint" << "\n");29 if(VerboseSolution()) _printf0_(" computing adjoint" << "\n"); 30 30 femmodel->SetCurrentConfiguration(BalancethicknessAnalysisEnum,AdjointBalancethicknessAnalysisEnum); 31 31 solutionsequence_adjoint_linear(femmodel); … … 33 33 /*Save results*/ 34 34 if(save_results){ 35 if(VerboseSolution()) _p printString_(" saving results" << "\n");35 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 36 36 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,AdjointEnum); 37 37 } -
issm/trunk-jpl/src/c/analyses/adjointdiagnostic_core.cpp
r15099 r15100 22 22 23 23 /*Compute velocities*/ 24 if(VerboseSolution()) _p printString_(" computing velocities" << "\n");24 if(VerboseSolution()) _printf0_(" computing velocities" << "\n"); 25 25 femmodel->SetCurrentConfiguration(DiagnosticHorizAnalysisEnum); 26 26 solutionsequence_nonlinear(femmodel,conserve_loads); … … 30 30 31 31 /*Compute adjoint*/ 32 if(VerboseSolution()) _p printString_(" computing adjoint" << "\n");32 if(VerboseSolution()) _printf0_(" computing adjoint" << "\n"); 33 33 femmodel->SetCurrentConfiguration(DiagnosticHorizAnalysisEnum,AdjointHorizAnalysisEnum); 34 34 solutionsequence_adjoint_linear(femmodel); … … 36 36 /*Save results*/ 37 37 if(save_results){ 38 if(VerboseSolution()) _p printString_(" saving results" << "\n");38 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 39 39 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,AdjointxEnum); 40 40 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,AdjointyEnum); -
issm/trunk-jpl/src/c/analyses/balancethickness_core.cpp
r15099 r15100 21 21 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 22 22 23 if(VerboseSolution()) _p printString_("call computational core:" << "\n");23 if(VerboseSolution()) _printf0_("call computational core:" << "\n"); 24 24 solutionsequence_linear(femmodel); 25 25 26 26 if(save_results){ 27 if(VerboseSolution()) _p printString_(" saving results" << "\n");27 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 28 28 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,ThicknessEnum); 29 29 } -
issm/trunk-jpl/src/c/analyses/bedslope_core.cpp
r15099 r15100 18 18 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 19 19 20 if(VerboseSolution()) _p printString_(" computing slope" << "\n");20 if(VerboseSolution()) _printf0_(" computing slope" << "\n"); 21 21 22 22 /*Call on core computations: */ … … 27 27 28 28 if(save_results){ 29 if(VerboseSolution()) _p printString_(" saving results" << "\n");29 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 30 30 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,BedSlopeXEnum); 31 31 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,BedSlopeYEnum); -
issm/trunk-jpl/src/c/analyses/control_core.cpp
r15099 r15100 66 66 67 67 /*Launch once a complete solution to set up all inputs*/ 68 if(VerboseControl()) _p printString_(" preparing initial solution" << "\n");68 if(VerboseControl()) _printf0_(" preparing initial solution" << "\n"); 69 69 if(isstokes) solutioncore(femmodel); 70 70 … … 81 81 82 82 /*Display info*/ 83 if(VerboseControl()) _p printString_("\n" << " control method step " << n+1 << "/" << nsteps << "\n");83 if(VerboseControl()) _printf0_("\n" << " control method step " << n+1 << "/" << nsteps << "\n"); 84 84 for(i=0;i<num_responses;i++) step_responses[i]=reCast<int,IssmDouble>(responses[n*num_responses+i]); 85 85 femmodel->parameters->SetParam(step_responses,1,num_responses,StepResponsesEnum); … … 88 88 if(solution_type==SteadystateSolutionEnum) solutioncore(femmodel); 89 89 90 if(VerboseControl()) _p printString_(" compute adjoint state:" << "\n");90 if(VerboseControl()) _printf0_(" compute adjoint state:" << "\n"); 91 91 adjointcore(femmodel); 92 92 gradient_core(femmodel,n,search_scalar==0); … … 98 98 } 99 99 100 if(VerboseControl()) _p printString_(" optimizing along gradient direction" << "\n");100 if(VerboseControl()) _printf0_(" optimizing along gradient direction" << "\n"); 101 101 optpars.maxiter=reCast<int,IssmDouble>(maxiter[n]); optpars.cm_jump=cm_jump[n]; 102 102 BrentSearch(&search_scalar,J+n,&optpars,&objectivefunction,&optargs); 103 103 104 if(VerboseControl()) _p printString_(" updating parameter using optimized search scalar" << "\n"); //true means update save controls104 if(VerboseControl()) _printf0_(" updating parameter using optimized search scalar" << "\n"); //true means update save controls 105 105 InputControlUpdatex(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,search_scalar,true); 106 106 … … 108 108 } 109 109 110 if(VerboseControl()) _p printString_(" preparing final solution" << "\n");110 if(VerboseControl()) _printf0_(" preparing final solution" << "\n"); 111 111 femmodel->parameters->SetParam(true,SaveResultsEnum); 112 112 solutioncore(femmodel); … … 142 142 if (!xIsNan<IssmDouble>(tol_cm) && J<tol_cm){ 143 143 converged=true; 144 if(VerboseConvergence()) _p printString_(" Convergence criterion reached: J = " << J << " < " << tol_cm);144 if(VerboseConvergence()) _printf0_(" Convergence criterion reached: J = " << J << " < " << tol_cm); 145 145 } 146 146 -
issm/trunk-jpl/src/c/analyses/controltao_core.cpp
r15099 r15100 54 54 /*Initialize TAO*/ 55 55 TaoCreate(IssmComm::GetComm(),&tao); 56 if(VerboseControl()) _p printString_(" Initializing the Toolkit for Advanced Optimization (TAO)" << "\n");56 if(VerboseControl()) _printf0_(" Initializing the Toolkit for Advanced Optimization (TAO)" << "\n"); 57 57 TaoSetFromOptions(tao); 58 58 TaoSetType(tao,"tao_blmvm"); … … 79 79 80 80 /*Solver optimization problem*/ 81 if(VerboseControl()) _p printString_(" Starting optimization" << "\n");81 if(VerboseControl()) _printf0_(" Starting optimization" << "\n"); 82 82 TaoSolve(tao); 83 83 TaoView(tao,PETSC_VIEWER_STDOUT_WORLD); … … 90 90 91 91 /*Finalize*/ 92 if(VerboseControl()) _p printString_(" preparing final solution" << "\n");92 if(VerboseControl()) _printf0_(" preparing final solution" << "\n"); 93 93 femmodel->parameters->SetParam(true,SaveResultsEnum); 94 94 void (*solutioncore)(FemModel*)=NULL; … … 166 166 167 167 TaoGetSolutionStatus(tao, &its, &f, &gnorm, &cnorm, &xdiff, NULL); 168 if(its==0) _p printString_("Iter Function Residual | List of contributions" << "\n");169 if(its==0) _p printString_("-----------------------------------+-----------------------" << "\n");170 _p printString_(setw(4)<<its<<" "<<setw(12)<<setprecision(7)<<f<<" "<<setw(12)<<setprecision(7)<<gnorm<<" | ");168 if(its==0) _printf0_("Iter Function Residual | List of contributions" << "\n"); 169 if(its==0) _printf0_("-----------------------------------+-----------------------" << "\n"); 170 _printf0_(setw(4)<<its<<" "<<setw(12)<<setprecision(7)<<f<<" "<<setw(12)<<setprecision(7)<<gnorm<<" | "); 171 171 user->J[its]=f; 172 172 … … 174 174 for(i=0;i<num_responses;i++){ 175 175 femmodel->Responsex(&f,EnumToStringx(responses[i]),false,i); 176 _p printString_(" "<<setw(12)<<setprecision(7)<<f);176 _printf0_(" "<<setw(12)<<setprecision(7)<<f); 177 177 } 178 _p printString_("" << "\n");178 _printf0_("" << "\n"); 179 179 180 180 /*Clean-up and return*/ -
issm/trunk-jpl/src/c/analyses/diagnostic_core.cpp
r15099 r15100 58 58 if(ishutter){ 59 59 60 if(VerboseSolution()) _p printString_(" computing hutter velocities" << "\n");60 if(VerboseSolution()) _printf0_(" computing hutter velocities" << "\n"); 61 61 62 62 //Take the last velocity into account so that the velocity on the MacAyeal domain is not zero … … 71 71 if ((ismacayealpattyn || isl1l2) ^ isstokes){ // ^ = xor 72 72 73 if(VerboseSolution()) _p printString_(" computing velocities" << "\n");73 if(VerboseSolution()) _printf0_(" computing velocities" << "\n"); 74 74 femmodel->SetCurrentConfiguration(DiagnosticHorizAnalysisEnum); 75 75 if(newton>0) … … 81 81 if (ismacayealpattyn && isstokes){ 82 82 83 if(VerboseSolution()) _p printString_(" computing coupling macayealpattyn and stokes velocities and pressure " << "\n");83 if(VerboseSolution()) _printf0_(" computing coupling macayealpattyn and stokes velocities and pressure " << "\n"); 84 84 solutionsequence_stokescoupling_nonlinear(femmodel,conserve_loads); 85 85 } … … 87 87 if (dim==3 & (ishutter || ismacayealpattyn)){ 88 88 89 if(VerboseSolution()) _p printString_(" computing vertical velocities" << "\n");89 if(VerboseSolution()) _printf0_(" computing vertical velocities" << "\n"); 90 90 femmodel->SetCurrentConfiguration(DiagnosticVertAnalysisEnum); 91 91 solutionsequence_linear(femmodel); … … 93 93 94 94 if(save_results){ 95 if(VerboseSolution()) _p printString_(" saving results" << "\n");95 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 96 96 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,VxEnum); 97 97 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,VyEnum); -
issm/trunk-jpl/src/c/analyses/enthalpy_core.cpp
r15099 r15100 18 18 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 19 19 20 if(VerboseSolution()) _p printString_(" computing enthalpy" << "\n");20 if(VerboseSolution()) _printf0_(" computing enthalpy" << "\n"); 21 21 femmodel->SetCurrentConfiguration(EnthalpyAnalysisEnum); 22 22 solutionsequence_nonlinear(femmodel,true); … … 26 26 27 27 if(save_results){ 28 if(VerboseSolution()) _p printString_(" saving results" << "\n");28 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 29 29 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,TemperatureEnum); 30 30 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,EnthalpyEnum); -
issm/trunk-jpl/src/c/analyses/gia_core.cpp
r15099 r15100 26 26 femmodel->parameters->FindParam(&configuration_type,ConfigurationTypeEnum); 27 27 28 if(VerboseSolution()) _p printString_(" computing GIA" << "\n");28 if(VerboseSolution()) _printf0_(" computing GIA" << "\n"); 29 29 30 30 /*Call on core computations: */ … … 50 50 51 51 if(save_results){ 52 if(VerboseSolution()) _p printString_(" saving results" << "\n");52 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 53 53 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,GiaWEnum); 54 54 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,GiadWdtEnum); -
issm/trunk-jpl/src/c/analyses/gradient_core.cpp
r15099 r15100 20 20 21 21 /*Compute gradient*/ 22 if(VerboseControl()) _p printString_(" compute cost function gradient" << "\n");22 if(VerboseControl()) _printf0_(" compute cost function gradient" << "\n"); 23 23 Gradjx(&gradient,&norm_list,femmodel->elements,femmodel->nodes, femmodel->vertices,femmodel->loads, femmodel->materials,femmodel->parameters); 24 24 25 25 if (orthogonalize){ 26 if(VerboseControl()) _p printString_(" orthogonalization" << "\n");26 if(VerboseControl()) _printf0_(" orthogonalization" << "\n"); 27 27 ControlInputGetGradientx(&old_gradient,femmodel->elements,femmodel->nodes, femmodel->vertices,femmodel->loads, femmodel->materials,femmodel->parameters); 28 28 Orthx(&new_gradient,gradient,old_gradient); delete old_gradient; delete gradient; -
issm/trunk-jpl/src/c/analyses/hydrology_core.cpp
r15099 r15100 51 51 for(i=0;i<nsteps;i++){ 52 52 53 if(nsteps)if(VerboseSolution()) _p printString_("time step:" << i+1 << "/" << nsteps << "\n");53 if(nsteps)if(VerboseSolution()) _printf0_("time step:" << i+1 << "/" << nsteps << "\n"); 54 54 time+=dt; 55 55 step+=1; … … 58 58 59 59 if (hydrology_model==HydrologyshreveEnum){ 60 if(VerboseSolution()) _p printString_(" computing water column" << "\n");60 if(VerboseSolution()) _printf0_(" computing water column" << "\n"); 61 61 femmodel->SetCurrentConfiguration(HydrologyShreveAnalysisEnum); 62 62 solutionsequence_nonlinear(femmodel,modify_loads); … … 67 67 68 68 if(save_results && ((i+1)%output_frequency==0 || (i+1)==nsteps)){ 69 if(VerboseSolution()) _p printString_(" saving results " << "\n");69 if(VerboseSolution()) _printf0_(" saving results " << "\n"); 70 70 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,WatercolumnEnum); 71 71 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,HydrologyWaterVxEnum); … … 73 73 74 74 /*unload results*/ 75 if(VerboseSolution()) _p printString_(" saving temporary results" << "\n");75 if(VerboseSolution()) _printf0_(" saving temporary results" << "\n"); 76 76 OutputResultsx(femmodel->elements, femmodel->nodes, femmodel->vertices, femmodel->loads, femmodel->materials, femmodel->parameters,femmodel->results); 77 77 } … … 82 82 femmodel->parameters->FindParam(&isefficientlayer,HydrologydcIsefficientlayerEnum); 83 83 84 if(VerboseSolution()) _p printString_(" computing water transfer" << "\n");84 if(VerboseSolution()) _printf0_(" computing water transfer" << "\n"); 85 85 86 if(VerboseSolution()) _p printString_(" computing water head" << "\n");86 if(VerboseSolution()) _printf0_(" computing water head" << "\n"); 87 87 solutionsequence_hydro_nonlinear(femmodel); 88 88 if(save_results && ((i+1)%output_frequency==0 || (i+1)==nsteps)){ 89 if(VerboseSolution()) _p printString_(" saving results " << "\n");89 if(VerboseSolution()) _printf0_(" saving results " << "\n"); 90 90 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,SedimentHeadEnum); 91 91 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,SedimentHeadResidualEnum); … … 94 94 } 95 95 /*unload results*/ 96 if(VerboseSolution()) _p printString_(" saving temporary results" << "\n");96 if(VerboseSolution()) _printf0_(" saving temporary results" << "\n"); 97 97 OutputResultsx(femmodel->elements, femmodel->nodes, femmodel->vertices, femmodel->loads, femmodel->materials, femmodel->parameters,femmodel->results); 98 98 } -
issm/trunk-jpl/src/c/analyses/prognostic_core.cpp
r15099 r15100 32 32 33 33 if(issmbgradients){ 34 if(VerboseSolution)_print String_(" call smb gradients module\n" << "\n");34 if(VerboseSolution)_printf_(" call smb gradients module\n" << "\n"); 35 35 SmbGradientsx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters); 36 36 } 37 37 if(ispdd){ 38 38 if(isdelta18o){ 39 if(VerboseSolution()) _p printString_(" call Delta18oParametrization module" << "\n");39 if(VerboseSolution()) _printf0_(" call Delta18oParametrization module" << "\n"); 40 40 Delta18oParameterizationx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters); 41 41 } 42 if(VerboseSolution()) _p printString_(" call positive degree day module" << "\n");42 if(VerboseSolution()) _printf0_(" call positive degree day module" << "\n"); 43 43 PositiveDegreeDayx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters); 44 44 } 45 if(VerboseSolution()) _p printString_(" call computational core" << "\n");45 if(VerboseSolution()) _printf0_(" call computational core" << "\n"); 46 46 solutionsequence_linear(femmodel); 47 47 48 48 if(save_results){ 49 if(VerboseSolution()) _p printString_(" saving results" << "\n");49 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 50 50 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,ThicknessEnum); 51 51 femmodel->RequestedOutputsx(requested_outputs,numoutputs); -
issm/trunk-jpl/src/c/analyses/steadystate_core.cpp
r15099 r15100 48 48 for(;;){ 49 49 50 if(VerboseSolution()) _p printString_(" computing temperature and velocity for step: " << step << "\n");50 if(VerboseSolution()) _printf0_(" computing temperature and velocity for step: " << step << "\n"); 51 51 #ifdef _HAVE_THERMAL_ 52 52 if(isenthalpy==0){ … … 63 63 #endif 64 64 65 if(VerboseSolution()) _p printString_(" computing new velocity" << "\n");65 if(VerboseSolution()) _printf0_(" computing new velocity" << "\n"); 66 66 diagnostic_core(femmodel); 67 67 GetSolutionFromInputsx(&ug,femmodel->elements, femmodel->nodes, femmodel->vertices,femmodel->loads, femmodel->materials, femmodel->parameters); 68 68 69 69 if(step>1){ 70 if(VerboseSolution()) _p printString_(" checking steadystate convergence" << "\n");70 if(VerboseSolution()) _printf0_(" checking steadystate convergence" << "\n"); 71 71 if(steadystateconvergence(tg,tg_old,ug,ug_old,reltol)) break; 72 72 } 73 73 if(step>maxiter){ 74 if(VerboseSolution()) _p printString_(" maximum number steadystate iterations " << maxiter << " reached" << "\n");74 if(VerboseSolution()) _printf0_(" maximum number steadystate iterations " << maxiter << " reached" << "\n"); 75 75 break; 76 76 } … … 83 83 84 84 if(save_results){ 85 if(VerboseSolution()) _p printString_(" saving results" << "\n");85 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 86 86 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,VxEnum); 87 87 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,VyEnum); … … 117 117 if (xIsNan<IssmDouble>(ndu) || xIsNan<IssmDouble>(nu)) _error_("convergence criterion is NaN!"); 118 118 if((ndu/nu)<reltol){ 119 if(VerboseConvergence()) _p printString_("\n"<<setw(50)<<left<<" Velocity convergence: norm(du)/norm(u)"<<ndu/nu*100<<" < "<<reltol*100<<" %" << "\n");119 if(VerboseConvergence()) _printf0_("\n"<<setw(50)<<left<<" Velocity convergence: norm(du)/norm(u)"<<ndu/nu*100<<" < "<<reltol*100<<" %" << "\n"); 120 120 } 121 121 else{ 122 if(VerboseConvergence()) _p printString_("\n"<<setw(50)<<left<<" Velocity convergence: norm(du)/norm(u)"<<ndu/nu*100<<" > "<<reltol*100<<" %" << "\n");122 if(VerboseConvergence()) _printf0_("\n"<<setw(50)<<left<<" Velocity convergence: norm(du)/norm(u)"<<ndu/nu*100<<" > "<<reltol*100<<" %" << "\n"); 123 123 converged=false; 124 124 } … … 129 129 if (xIsNan<IssmDouble>(ndt) || xIsNan<IssmDouble>(nt)) _error_("convergence criterion is NaN!"); 130 130 if((ndt/nt)<reltol){ 131 if(VerboseConvergence()) _p printString_(setw(50)<<left<<" Temperature convergence: norm(dt)/norm(t)"<<ndt/nt*100<<" < "<<reltol*100<<" %" << "\n");131 if(VerboseConvergence()) _printf0_(setw(50)<<left<<" Temperature convergence: norm(dt)/norm(t)"<<ndt/nt*100<<" < "<<reltol*100<<" %" << "\n"); 132 132 } 133 133 else{ 134 if(VerboseConvergence()) _p printString_(setw(50)<<left<<" Temperature convergence: norm(dt)/norm(t)"<<ndt/nt*100<<" > "<<reltol*100<<" %" << "\n");134 if(VerboseConvergence()) _printf0_(setw(50)<<left<<" Temperature convergence: norm(dt)/norm(t)"<<ndt/nt*100<<" > "<<reltol*100<<" %" << "\n"); 135 135 converged=false; 136 136 } -
issm/trunk-jpl/src/c/analyses/surfaceslope_core.cpp
r15099 r15100 18 18 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 19 19 20 if(VerboseSolution()) _p printString_("computing slope..." << "\n");20 if(VerboseSolution()) _printf0_("computing slope..." << "\n"); 21 21 22 22 /*Call on core computations: */ … … 27 27 28 28 if(save_results){ 29 if(VerboseSolution()) _p printString_("saving results:" << "\n");29 if(VerboseSolution()) _printf0_("saving results:" << "\n"); 30 30 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,SurfaceSlopeXEnum); 31 31 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,SurfaceSlopeYEnum); -
issm/trunk-jpl/src/c/analyses/thermal_core.cpp
r15099 r15100 25 25 } 26 26 27 if(VerboseSolution()) _p printString_(" computing temperatures" << "\n");27 if(VerboseSolution()) _printf0_(" computing temperatures" << "\n"); 28 28 femmodel->SetCurrentConfiguration(ThermalAnalysisEnum); 29 29 solutionsequence_thermal_nonlinear(femmodel); 30 30 31 if(VerboseSolution()) _p printString_(" computing melting" << "\n");31 if(VerboseSolution()) _printf0_(" computing melting" << "\n"); 32 32 femmodel->SetCurrentConfiguration(MeltingAnalysisEnum); 33 33 solutionsequence_linear(femmodel); 34 34 35 35 if(save_results){ 36 if(VerboseSolution()) _p printString_(" saving results" << "\n");36 if(VerboseSolution()) _printf0_(" saving results" << "\n"); 37 37 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,TemperatureEnum); 38 38 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,BasalforcingsMeltingRateEnum); -
issm/trunk-jpl/src/c/analyses/transient_core.cpp
r15099 r15100 85 85 femmodel->parameters->SetParam(step,StepEnum); 86 86 87 if(VerboseSolution()) _p printString_("iteration " << step << "/" << floor((finaltime-time)/dt)+step << " time [yr]: " << time/yts << " (time step: " << dt/yts << ")" << "\n");87 if(VerboseSolution()) _printf0_("iteration " << step << "/" << floor((finaltime-time)/dt)+step << " time [yr]: " << time/yts << " (time step: " << dt/yts << ")" << "\n"); 88 88 if(step%output_frequency==0 || time==finaltime) 89 89 save_results=true; … … 93 93 94 94 if(isthermal && dim==3){ 95 if(VerboseSolution()) _p printString_(" computing temperatures" << "\n");95 if(VerboseSolution()) _printf0_(" computing temperatures" << "\n"); 96 96 #ifdef _HAVE_THERMAL_ 97 97 if(isenthalpy==0){ … … 107 107 108 108 if(isdiagnostic){ 109 if(VerboseSolution()) _p printString_(" computing new velocity" << "\n");109 if(VerboseSolution()) _printf0_(" computing new velocity" << "\n"); 110 110 #ifdef _HAVE_DIAGNOSTIC_ 111 111 diagnostic_core(femmodel); … … 116 116 117 117 if(isprognostic){ 118 if(VerboseSolution()) _p printString_(" computing new thickness" << "\n");118 if(VerboseSolution()) _printf0_(" computing new thickness" << "\n"); 119 119 prognostic_core(femmodel); 120 if(VerboseSolution()) _p printString_(" updating vertices positions" << "\n");120 if(VerboseSolution()) _printf0_(" updating vertices positions" << "\n"); 121 121 femmodel->UpdateVertexPositionsx(); 122 122 } 123 123 124 124 if(isgroundingline){ 125 if(VerboseSolution()) _p printString_(" computing new grounding line position" << "\n");125 if(VerboseSolution()) _printf0_(" computing new grounding line position" << "\n"); 126 126 #ifdef _HAVE_GROUNDINGLINE_ 127 127 GroundinglineMigrationx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters); … … 131 131 } 132 132 if(isgia){ 133 if(VerboseSolution()) _p printString_(" computing glacial isostatic adjustment" << "\n");133 if(VerboseSolution()) _printf0_(" computing glacial isostatic adjustment" << "\n"); 134 134 #ifdef _HAVE_GIA_ 135 135 gia_core(femmodel); … … 142 142 /*unload results*/ 143 143 if(save_results){ 144 if(VerboseSolution()) _p printString_(" saving transient results" << "\n");144 if(VerboseSolution()) _printf0_(" saving transient results" << "\n"); 145 145 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,SurfaceEnum); 146 146 InputToResultx(femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters,BedEnum); … … 158 158 } 159 159 160 if(VerboseSolution()) _p printString_(" saving temporary results" << "\n");160 if(VerboseSolution()) _printf0_(" saving temporary results" << "\n"); 161 161 OutputResultsx(femmodel->elements, femmodel->nodes, femmodel->vertices, femmodel->loads, femmodel->materials, femmodel->parameters,femmodel->results); 162 162 } -
issm/trunk-jpl/src/c/bamg/BamgVertex.cpp
r15099 r15100 15 15 void BamgVertex::Echo(void){ 16 16 17 _print String_("Vertex:" << "\n");18 _print String_(" integer coordinates i.x: " << i.x << ", i.y: " << i.y << "\n");19 _print String_(" Euclidean coordinates r.x: " << r.x << ", r.y: " << r.y << "\n");20 _print String_(" ReferenceNumber = " << ReferenceNumber << "\n");17 _printf_("Vertex:" << "\n"); 18 _printf_(" integer coordinates i.x: " << i.x << ", i.y: " << i.y << "\n"); 19 _printf_(" Euclidean coordinates r.x: " << r.x << ", r.y: " << r.y << "\n"); 20 _printf_(" ReferenceNumber = " << ReferenceNumber << "\n"); 21 21 m.Echo(); 22 22 -
issm/trunk-jpl/src/c/bamg/Edge.cpp
r15099 r15100 27 27 /*FUNCTION Edge::Echo {{{*/ 28 28 void Edge::Echo(void){ 29 _print String_("Edge:" << "\n");30 _print String_(" pointers towards two vertices: " << v[0] << " " << v[1] << "\n");31 _print String_(" ReferenceNumber = " << ReferenceNumber << "\n");32 _print String_(" GeomEdgeHook = " << GeomEdgeHook << "\n");33 _print String_(" two adjacent edges on the same curve: " << adj[0] << " " << adj[1] << "\n");29 _printf_("Edge:" << "\n"); 30 _printf_(" pointers towards two vertices: " << v[0] << " " << v[1] << "\n"); 31 _printf_(" ReferenceNumber = " << ReferenceNumber << "\n"); 32 _printf_(" GeomEdgeHook = " << GeomEdgeHook << "\n"); 33 _printf_(" two adjacent edges on the same curve: " << adj[0] << " " << adj[1] << "\n"); 34 34 } 35 35 /*}}}*/ -
issm/trunk-jpl/src/c/bamg/EigenMetric.cpp
r15099 r15100 114 114 void EigenMetric::Echo(void){ 115 115 116 _print String_("EigenMetric:" << "\n");117 _print String_(" lambda1: " << lambda1 << "\n");118 _print String_(" lambda2: " << lambda2 << "\n");119 _print String_(" v.x: " << v.x << "\n");120 _print String_(" v.y: " << v.y << "\n");116 _printf_("EigenMetric:" << "\n"); 117 _printf_(" lambda1: " << lambda1 << "\n"); 118 _printf_(" lambda2: " << lambda2 << "\n"); 119 _printf_(" v.x: " << v.x << "\n"); 120 _printf_(" v.y: " << v.y << "\n"); 121 121 122 122 return; -
issm/trunk-jpl/src/c/bamg/Geometry.cpp
r15099 r15100 47 47 Geometry::~Geometry() { 48 48 /*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, MeshGeom.cpp/~Geometry)*/ 49 if(NbRef>0){ _print String_("Trying to delete geometry and NbRef>0, probably due to an error"); return;}49 if(NbRef>0){ _printf_("Trying to delete geometry and NbRef>0, probably due to an error"); return;} 50 50 if(vertices) delete [] vertices; vertices=0; 51 51 if(edges) delete [] edges; edges=0; … … 80 80 //Vertices 81 81 if (bamggeom->Vertices){ 82 if(verbose>5) _print String_(" processing Vertices" << "\n");82 if(verbose>5) _printf_(" processing Vertices" << "\n"); 83 83 if (bamggeom->VerticesSize[1]!=3) _error_("Vertices should have 3 columns"); 84 84 vertices = new GeomVertex[nbv]; … … 125 125 double* verticeslength=NULL; 126 126 127 if(verbose>5) _print String_(" processing Edges" << "\n");127 if(verbose>5) _printf_(" processing Edges" << "\n"); 128 128 if (bamggeom->EdgesSize[1]!=3) _error_("Edges should have 3 columns"); 129 129 edges = new GeomEdge[nbe]; … … 180 180 //hVertices 181 181 if(bamgopts->hVertices && bamgopts->hVerticesSize[0]==nbv){ 182 if(verbose>5) _print String_(" processing hVertices" << "\n");182 if(verbose>5) _printf_(" processing hVertices" << "\n"); 183 183 for (i=0;i< nbv;i++){ 184 184 if (!xIsNan<IssmPDouble>(bamgopts->hVertices[i])){ … … 190 190 //MetricVertices 191 191 if(bamgopts->metric && bamgopts->metric[0]==nbv){ 192 if(verbose>5) _print String_(" processing MetricVertices" << "\n");192 if(verbose>5) _printf_(" processing MetricVertices" << "\n"); 193 193 for (i=0;i< nbv;i++) { 194 194 vertices[i].m = Metric((double)bamgopts->metric[i*3+0],(double)bamgopts->metric[i*3+1],(double)bamgopts->metric[i*3+2]); … … 198 198 //MaxCornerAngle 199 199 if (bamgopts->MaxCornerAngle){ 200 if(verbose>5) _print String_(" processing MaxCornerAngle" << "\n");200 if(verbose>5) _printf_(" processing MaxCornerAngle" << "\n"); 201 201 MaxCornerAngle=bamgopts->MaxCornerAngle*Pi/180; 202 202 } … … 204 204 //TangentAtEdges 205 205 if (bamggeom->TangentAtEdges){ 206 if(verbose>5) _print String_(" processing TangentAtEdges");206 if(verbose>5) _printf_(" processing TangentAtEdges"); 207 207 if (bamggeom->TangentAtEdgesSize[1]!=4) _error_("TangentAtEdges should have 4 columns"); 208 208 int n,i,j,k; … … 223 223 //Corners 224 224 if(bamggeom->Corners){ 225 if(verbose>5) _print String_(" processing Corners");225 if(verbose>5) _printf_(" processing Corners"); 226 226 if (bamggeom->CornersSize[1]!=1) _error_("Corners should have 1 column"); 227 227 n=bamggeom->CornersSize[0]; … … 237 237 //RequiredVertices 238 238 if(bamggeom->RequiredVertices){ 239 if(verbose>5) _print String_(" processing RequiredVertices" << "\n");239 if(verbose>5) _printf_(" processing RequiredVertices" << "\n"); 240 240 if (bamggeom->RequiredVerticesSize[1]!=1) _error_("RequiredVertices should have 1 column"); 241 241 n=bamggeom->RequiredVerticesSize[0]; … … 249 249 //RequiredEdges 250 250 if(bamggeom->RequiredEdges){ 251 if(verbose>5) _print String_(" processing RequiredEdges" << "\n");251 if(verbose>5) _printf_(" processing RequiredEdges" << "\n"); 252 252 if (bamggeom->RequiredEdgesSize[1]!=1) _error_("RequiredEdges should have 1 column"); 253 253 n=bamggeom->RequiredEdgesSize[0]; … … 261 261 //SubDomain 262 262 if(bamggeom->SubDomains){ 263 if(verbose>5) _print String_(" processing SubDomains" << "\n");263 if(verbose>5) _printf_(" processing SubDomains" << "\n"); 264 264 if (bamggeom->SubDomainsSize[1]!=4) _error_("SubDomains should have 4 columns"); 265 265 nbsubdomains=bamggeom->SubDomainsSize[0]; … … 293 293 294 294 /*Vertices*/ 295 if(verbose>5) _print String_(" writing Vertices" << "\n");295 if(verbose>5) _printf_(" writing Vertices" << "\n"); 296 296 bamggeom->VerticesSize[0]=nbv; 297 297 bamggeom->VerticesSize[1]=3; … … 309 309 310 310 /*Edges*/ 311 if(verbose>5) _print String_(" writing Edges" << "\n");311 if(verbose>5) _printf_(" writing Edges" << "\n"); 312 312 bamggeom->EdgesSize[0]=nbe; 313 313 bamggeom->EdgesSize[1]=3; … … 327 327 328 328 /*RequiredEdges*/ 329 if(verbose>5) _print String_(" writing " << nbreq << " RequiredEdges" << "\n");329 if(verbose>5) _printf_(" writing " << nbreq << " RequiredEdges" << "\n"); 330 330 bamggeom->RequiredEdgesSize[0]=nbreq; 331 331 bamggeom->RequiredEdgesSize[1]=1; … … 344 344 345 345 /*RequiredVertices*/ 346 if(verbose>5) _print String_(" writing " << nbreqv << " RequiredVertices" << "\n");346 if(verbose>5) _printf_(" writing " << nbreqv << " RequiredVertices" << "\n"); 347 347 bamggeom->RequiredVerticesSize[0]=nbreqv; 348 348 bamggeom->RequiredVerticesSize[1]=1; … … 359 359 360 360 /*SubDomains*/ 361 if(verbose>5) _print String_(" writing SubDomains" << "\n");361 if(verbose>5) _printf_(" writing SubDomains" << "\n"); 362 362 bamggeom->SubDomainsSize[0]=nbsubdomains; 363 363 bamggeom->SubDomainsSize[1]=4; … … 373 373 374 374 /*TangentAtEdges*/ 375 if(verbose>5) _print String_(" writing TangentAtEdges" << "\n");375 if(verbose>5) _printf_(" writing TangentAtEdges" << "\n"); 376 376 bamggeom->TangentAtEdgesSize[0]=nbtan; 377 377 bamggeom->TangentAtEdgesSize[1]=4; … … 402 402 void Geometry::Echo(void){ 403 403 404 _print String_("Geometry:" << "\n");405 _print String_(" nbv (number of vertices) : " << nbv << "\n");406 _print String_(" nbe (number of edges) : " << nbe << "\n");407 _print String_(" nbsubdomains: " << nbsubdomains << "\n");408 _print String_(" nbcurves: " << nbcurves << "\n");409 _print String_(" vertices: " << vertices << "\n");410 _print String_(" edges: " << edges << "\n");411 _print String_(" quadtree: " << quadtree << "\n");412 _print String_(" subdomains: " << subdomains << "\n");413 _print String_(" curves: " << curves << "\n");414 _print String_(" pmin (x,y): (" << pmin.x << " " << pmin.y << ")" << "\n");415 _print String_(" pmax (x,y): (" << pmax.x << " " << pmax.y << ")" << "\n");416 _print String_(" coefIcoor: " << coefIcoor << "\n");417 _print String_(" MaxCornerAngle: " << MaxCornerAngle << "\n");404 _printf_("Geometry:" << "\n"); 405 _printf_(" nbv (number of vertices) : " << nbv << "\n"); 406 _printf_(" nbe (number of edges) : " << nbe << "\n"); 407 _printf_(" nbsubdomains: " << nbsubdomains << "\n"); 408 _printf_(" nbcurves: " << nbcurves << "\n"); 409 _printf_(" vertices: " << vertices << "\n"); 410 _printf_(" edges: " << edges << "\n"); 411 _printf_(" quadtree: " << quadtree << "\n"); 412 _printf_(" subdomains: " << subdomains << "\n"); 413 _printf_(" curves: " << curves << "\n"); 414 _printf_(" pmin (x,y): (" << pmin.x << " " << pmin.y << ")" << "\n"); 415 _printf_(" pmax (x,y): (" << pmax.x << " " << pmax.y << ")" << "\n"); 416 _printf_(" coefIcoor: " << coefIcoor << "\n"); 417 _printf_(" MaxCornerAngle: " << MaxCornerAngle << "\n"); 418 418 419 419 return; … … 524 524 /*if there is a vertex found that is to close to vertices[i] -> error*/ 525 525 if( v && Norme1(v->r - vertices[i].r) < eps ){ 526 _print String_("reference numbers: " << v->ReferenceNumber << " " << vertices[i].ReferenceNumber << "\n");527 _print String_("Id: " << i+1 << "\n");528 _print String_("Coords: ["<<v->r.x<<" "<<v->r.y<<"] ["<<vertices[i].r.x<<" "<<vertices[i].r.y<<"]" << "\n");526 _printf_("reference numbers: " << v->ReferenceNumber << " " << vertices[i].ReferenceNumber << "\n"); 527 _printf_("Id: " << i+1 << "\n"); 528 _printf_("Coords: ["<<v->r.x<<" "<<v->r.y<<"] ["<<vertices[i].r.x<<" "<<vertices[i].r.y<<"]" << "\n"); 529 529 530 530 delete [] next_p; … … 869 869 if (bge<=0) { 870 870 if(NbTry) { 871 _print String_("Fatal Error: on the class Mesh before call Geometry::ProjectOnCurve" << "\n");872 _print String_("That bug might come from:" << "\n");873 _print String_(" 1) a mesh edge containing more than " << mxe/2 << " geometrical edges" << "\n");874 _print String_(" 2) code bug : be sure that we call Mesh::SetVertexFieldOn() before" << "\n");875 _print String_("To solve the problem do a coarsening of the geometrical mesh or change the constant value of mxe (dangerous)" << "\n");871 _printf_("Fatal Error: on the class Mesh before call Geometry::ProjectOnCurve" << "\n"); 872 _printf_("That bug might come from:" << "\n"); 873 _printf_(" 1) a mesh edge containing more than " << mxe/2 << " geometrical edges" << "\n"); 874 _printf_(" 2) code bug : be sure that we call Mesh::SetVertexFieldOn() before" << "\n"); 875 _printf_("To solve the problem do a coarsening of the geometrical mesh or change the constant value of mxe (dangerous)" << "\n"); 876 876 _error_("see above"); 877 877 } … … 886 886 while (eg1 != (GeomEdge*) vg1 && (*eg1)(direction1) != (GeomVertex*) vg1) { 887 887 if(tge>=mxe ) { 888 _print String_("WARNING: on the class Mesh before call Geometry::ProjectOnCurve is having issues (isn't it Eric?)" << "\n");888 _printf_("WARNING: on the class Mesh before call Geometry::ProjectOnCurve is having issues (isn't it Eric?)" << "\n"); 889 889 NbTry++; 890 890 if (NbTry<2) goto retry; 891 _print String_("Fatal Error: on the class Mesh before call Geometry::ProjectOnCurve" << "\n");892 _print String_("That bug might come from:" << "\n");893 _print String_(" 1) a mesh edge contening more than " << mxe/2 << " geometrical edges" << "\n");894 _print String_(" 2) code bug : be sure that we call Mesh::SetVertexFieldOn() before" << "\n");895 _print String_("To solve the problem do a coarsening of the geometrical mesh or change the constant value of mxe (dangerous)" << "\n");891 _printf_("Fatal Error: on the class Mesh before call Geometry::ProjectOnCurve" << "\n"); 892 _printf_("That bug might come from:" << "\n"); 893 _printf_(" 1) a mesh edge contening more than " << mxe/2 << " geometrical edges" << "\n"); 894 _printf_(" 2) code bug : be sure that we call Mesh::SetVertexFieldOn() before" << "\n"); 895 _printf_("To solve the problem do a coarsening of the geometrical mesh or change the constant value of mxe (dangerous)" << "\n"); 896 896 _error_("see above"); 897 897 } -
issm/trunk-jpl/src/c/bamg/ListofIntersectionTriangles.cpp
r15099 r15100 169 169 //x.Echo(); 170 170 //y.Echo(); 171 //_print String_("cx = " << cx << ", cy=" << cy << "\n");171 //_printf_("cx = " << cx << ", cy=" << cy << "\n"); 172 172 173 173 si += sint; … … 188 188 MaxNbSeg *= 2; 189 189 if (verbosity>3){ 190 _print String_(" reshape lSegsI from " << mneo << " to " << MaxNbSeg << "\n");190 _printf_(" reshape lSegsI from " << mneo << " to " << MaxNbSeg << "\n"); 191 191 } 192 192 _assert_(lSegsI && NbSeg<MaxNbSeg); … … 213 213 for (int i=0;i<MaxSize;i++) nw[i] = lIntTria[i]; 214 214 long int verbosity=0; 215 if(verbosity>3) _print String_(" ListofIntersectionTriangles ReShape Maxsize " << MaxSize << " -> " << MaxNbSeg << "\n");215 if(verbosity>3) _printf_(" ListofIntersectionTriangles ReShape Maxsize " << MaxSize << " -> " << MaxNbSeg << "\n"); 216 216 MaxSize = newsize; 217 217 delete [] lIntTria;// remove old -
issm/trunk-jpl/src/c/bamg/Mesh.cpp
r15099 r15100 31 31 if(bamggeom->Edges==NULL) { 32 32 /*Recreate geometry if needed*/ 33 _print String_("WARNING: mesh present but no geometry found. Reconstructing..." << "\n");33 _printf_("WARNING: mesh present but no geometry found. Reconstructing..." << "\n"); 34 34 BuildGeometryFromMesh(bamgopts); 35 35 Gh.PostRead(); … … 103 103 if (kk[i]>=0) kk[i]=k++; 104 104 } 105 _print String_(" number of vertices " << k << ", remove = " << Tho.nbv - k << "\n");106 _print String_(" number of triangles " << kt << ", remove = " << nbInT-kt << "\n");107 _print String_(" number of New boundary edge " << nbNewBedge << "\n");105 _printf_(" number of vertices " << k << ", remove = " << Tho.nbv - k << "\n"); 106 _printf_(" number of triangles " << kt << ", remove = " << nbInT-kt << "\n"); 107 _printf_(" number of New boundary edge " << nbNewBedge << "\n"); 108 108 long imaxnbv =k; 109 109 Init(imaxnbv); … … 281 281 282 282 //Vertices 283 if (verbose) _print String_("Reading vertices (" << nbv << ")" << "\n");283 if (verbose) _printf_("Reading vertices (" << nbv << ")" << "\n"); 284 284 vertices=xNew<BamgVertex>(nbv); 285 285 orderedvertices=xNew<BamgVertex*>(nbv); … … 295 295 296 296 //Triangles 297 if (verbose) _print String_("Reading triangles (" << nbt << ")" << "\n");297 if (verbose) _printf_("Reading triangles (" << nbt << ")" << "\n"); 298 298 triangles =new Triangle[maxnbt]; //we cannot allocate only nbt triangles since 299 299 nodeflags=xNew<bool>(nbv); … … 311 311 312 312 /*Recreate geometry: */ 313 if (verbose) _print String_("Building Geometry" << "\n");313 if (verbose) _printf_("Building Geometry" << "\n"); 314 314 BuildGeometryFromMesh(); 315 if (verbose) _print String_("Completing geometry" << "\n");315 if (verbose) _printf_("Completing geometry" << "\n"); 316 316 Gh.PostRead(); 317 317 … … 320 320 for(i=0;i<nbv;i++){ 321 321 if(!nodeflags[i]){ 322 _print String_("Vertex " << i+1 << " does not belong to any element" << "\n");322 _printf_("Vertex " << i+1 << " does not belong to any element" << "\n"); 323 323 isorphan=true; 324 324 } … … 347 347 //Vertices 348 348 if(bamgmesh->Vertices){ 349 if(verbose>5) _print String_(" processing Vertices" << "\n");349 if(verbose>5) _printf_(" processing Vertices" << "\n"); 350 350 351 351 vertices=xNew<BamgVertex>(nbv); … … 368 368 //Triangles 369 369 if(bamgmesh->Triangles){ 370 if(verbose>5) _print String_(" processing Triangles" << "\n");370 if(verbose>5) _printf_(" processing Triangles" << "\n"); 371 371 triangles =new Triangle[maxnbt]; //we cannot allocate only nbt triangles since 372 372 //other triangles will be added for each edge … … 386 386 //Quadrilaterals 387 387 if(bamgmesh->Quadrilaterals){ 388 if(verbose>5) _print String_(" processing Quadrilaterals" << "\n");388 if(verbose>5) _printf_(" processing Quadrilaterals" << "\n"); 389 389 long i1,i2,i3,i4; 390 390 triangles =new Triangle[nbt]; … … 408 408 //VerticesOnGeomEdge 409 409 if(bamgmesh->VerticesOnGeomEdge){ 410 if(verbose>5) _print String_(" processing VerticesOnGeomEdge" << "\n");410 if(verbose>5) _printf_(" processing VerticesOnGeomEdge" << "\n"); 411 411 NbVerticesOnGeomEdge=bamgmesh->VerticesOnGeomEdgeSize[0]; 412 412 VerticesOnGeomEdge= new VertexOnGeom[NbVerticesOnGeomEdge] ; … … 423 423 //VerticesOnGeomVertex 424 424 if(bamgmesh->VerticesOnGeomVertexSize[0]){ 425 if(verbose>5) _print String_(" processing VerticesOnGeomVertex" << "\n");425 if(verbose>5) _printf_(" processing VerticesOnGeomVertex" << "\n"); 426 426 NbVerticesOnGeomVertex=bamgmesh->VerticesOnGeomVertexSize[0]; 427 427 VerticesOnGeomVertex = new VertexOnGeom[NbVerticesOnGeomVertex] ; … … 439 439 double* len=NULL; 440 440 441 if(verbose>5) _print String_(" processing Edges" << "\n");441 if(verbose>5) _printf_(" processing Edges" << "\n"); 442 442 nbe=bamgmesh->EdgesSize[0]; 443 443 edges= new Edge[nbe]; … … 499 499 //EdgeOnGeomEdge 500 500 if(bamgmesh->EdgesOnGeomEdge){ 501 if(verbose>5) _print String_(" processing EdgesOnGeomEdge" << "\n");501 if(verbose>5) _printf_(" processing EdgesOnGeomEdge" << "\n"); 502 502 int i1,i2,i,j; 503 503 i2=bamgmesh->EdgesOnGeomEdgeSize[0]; … … 516 516 if(bamgmesh->SubDomains){ 517 517 long i3,head,direction; 518 if(verbose>5) _print String_(" processing SubDomains" << "\n");518 if(verbose>5) _printf_(" processing SubDomains" << "\n"); 519 519 nbsubdomains=bamgmesh->SubDomainsSize[0]; 520 520 subdomains = new SubDomain [ nbsubdomains ]; … … 585 585 586 586 /*Vertices*/ 587 if(verbose>5) _print String_(" writing Vertices" << "\n");587 if(verbose>5) _printf_(" writing Vertices" << "\n"); 588 588 bamgmesh->VerticesSize[0]=nbv; 589 589 bamgmesh->VerticesSize[1]=3; … … 598 598 599 599 /*Edges*/ 600 if(verbose>5) _print String_(" writing Edges" << "\n");600 if(verbose>5) _printf_(" writing Edges" << "\n"); 601 601 bamgmesh->EdgesSize[0]=nbe; 602 602 bamgmesh->EdgesSize[1]=3; … … 615 615 616 616 /*Element edges*/ 617 if(verbose>5) _print String_(" writing element edges" << "\n");617 if(verbose>5) _printf_(" writing element edges" << "\n"); 618 618 SetOfEdges4* edge4=new SetOfEdges4(nbt*3,nbv); 619 619 double* elemedge=NULL; … … 671 671 672 672 /*IssmSegments*/ 673 if(verbose>5) _print String_(" writing IssmSegments" << "\n");673 if(verbose>5) _printf_(" writing IssmSegments" << "\n"); 674 674 bamgmesh->IssmSegmentsSize[0]=NumIssmSegments; 675 675 bamgmesh->IssmSegmentsSize[1]=4; … … 714 714 715 715 /*Triangles*/ 716 if(verbose>5) _print String_(" writing Triangles" << "\n");716 if(verbose>5) _printf_(" writing Triangles" << "\n"); 717 717 k=nbInT-nbq*2; 718 718 num=0; … … 735 735 736 736 /*Quadrilaterals*/ 737 if(verbose>5) _print String_(" writing Quadrilaterals" << "\n");737 if(verbose>5) _printf_(" writing Quadrilaterals" << "\n"); 738 738 bamgmesh->QuadrilateralsSize[0]=nbq; 739 739 bamgmesh->QuadrilateralsSize[1]=5; … … 756 756 757 757 /*SubDomains*/ 758 if(verbose>5) _print String_(" writing SubDomains" << "\n");758 if(verbose>5) _printf_(" writing SubDomains" << "\n"); 759 759 bamgmesh->SubDomainsSize[0]=nbsubdomains; 760 760 bamgmesh->SubDomainsSize[1]=4; … … 770 770 771 771 /*SubDomainsFromGeom*/ 772 if(verbose>5) _print String_(" writing SubDomainsFromGeom" << "\n");772 if(verbose>5) _printf_(" writing SubDomainsFromGeom" << "\n"); 773 773 bamgmesh->SubDomainsFromGeomSize[0]=Gh.nbsubdomains; 774 774 bamgmesh->SubDomainsFromGeomSize[1]=4; … … 784 784 785 785 /*VerticesOnGeomVertex*/ 786 if(verbose>5) _print String_(" writing VerticesOnGeomVertex" << "\n");786 if(verbose>5) _printf_(" writing VerticesOnGeomVertex" << "\n"); 787 787 bamgmesh->VerticesOnGeomVertexSize[0]=NbVerticesOnGeomVertex; 788 788 bamgmesh->VerticesOnGeomVertexSize[1]=2; … … 798 798 799 799 /*VertexOnGeomEdge*/ 800 if(verbose>5) _print String_(" writing VerticesOnGeomEdge" << "\n");800 if(verbose>5) _printf_(" writing VerticesOnGeomEdge" << "\n"); 801 801 bamgmesh->VerticesOnGeomEdgeSize[0]=NbVerticesOnGeomEdge; 802 802 bamgmesh->VerticesOnGeomEdgeSize[1]=3; … … 815 815 816 816 /*EdgesOnGeomEdge*/ 817 if(verbose>5) _print String_(" writing EdgesOnGeomEdge" << "\n");817 if(verbose>5) _printf_(" writing EdgesOnGeomEdge" << "\n"); 818 818 k=0; 819 819 for (i=0;i<nbe;i++){ … … 835 835 836 836 /*Element Connectivity*/ 837 if(verbose>5) _print String_(" writing Element connectivity" << "\n");837 if(verbose>5) _printf_(" writing Element connectivity" << "\n"); 838 838 bamgmesh->ElementConnectivitySize[0]=nbt-nbtout; 839 839 bamgmesh->ElementConnectivitySize[1]=3; … … 855 855 856 856 /*ElementNodal Connectivity*/ 857 if(verbose>5) _print String_(" writing Nodal element connectivity" << "\n");857 if(verbose>5) _printf_(" writing Nodal element connectivity" << "\n"); 858 858 bamgmesh->NodalElementConnectivitySize[0]=nbv; 859 859 bamgmesh->NodalElementConnectivitySize[1]=connectivitymax_1; … … 870 870 871 871 /*Nodal Connectivity*/ 872 if(verbose>5) _print String_(" writing Nodal connectivity" << "\n");872 if(verbose>5) _printf_(" writing Nodal connectivity" << "\n"); 873 873 //chaining algorithm (again...) 874 874 int* head_2=NULL; … … 924 924 925 925 /*Cracked vertices*/ 926 if(verbose>5) _print String_(" writing Cracked vertices" << "\n");926 if(verbose>5) _printf_(" writing Cracked vertices" << "\n"); 927 927 bamgmesh->CrackedVerticesSize[0]=NbCrackedVertices; 928 928 bamgmesh->CrackedVerticesSize[1]=2; … … 936 936 937 937 /*Cracked vertices*/ 938 if(verbose>5) _print String_(" writing Cracked vertices" << "\n");938 if(verbose>5) _printf_(" writing Cracked vertices" << "\n"); 939 939 bamgmesh->CrackedEdgesSize[0]=NbCrackedEdges; 940 940 bamgmesh->CrackedEdgesSize[1]=4; … … 964 964 int i,j; 965 965 966 if(bamgopts->verbose>3) _print String_(" processing metric" << "\n");966 if(bamgopts->verbose>3) _printf_(" processing metric" << "\n"); 967 967 double hmin = Max(bamgopts->hmin,MinimalHmin()); 968 968 double hmax = Min(bamgopts->hmax,MaximalHmax()); … … 1265 1265 1266 1266 //display info 1267 if (verbose > 1) _print String_(" BoundAnisotropy by " << anisomax << "\n");1267 if (verbose > 1) _printf_(" BoundAnisotropy by " << anisomax << "\n"); 1268 1268 1269 1269 double h1=1.e30,h2=1e-30; … … 1292 1292 //display info 1293 1293 if (verbose>2){ 1294 _print String_(" input: Hmin = " << pow(h2,-0.5) << ", Hmax = " << pow(h1,-0.5) << ", factor of anisotropy max = " << pow(rx,0.5) << "\n");1295 _print String_(" output: Hmin = " << pow(hn2,-0.5) << ", Hmax = " << pow(hn1,-0.5)<< ", factor of anisotropy max = " <<pow(rnx,0.5) << "\n");1294 _printf_(" input: Hmin = " << pow(h2,-0.5) << ", Hmax = " << pow(h1,-0.5) << ", factor of anisotropy max = " << pow(rx,0.5) << "\n"); 1295 _printf_(" output: Hmin = " << pow(hn2,-0.5) << ", Hmax = " << pow(hn1,-0.5)<< ", factor of anisotropy max = " <<pow(rnx,0.5) << "\n"); 1296 1296 } 1297 1297 } … … 1315 1315 1316 1316 //display info 1317 if (verbose>1) _print String_(" construction of the geometry from the 2d mesh" << "\n");1317 if (verbose>1) _printf_(" construction of the geometry from the 2d mesh" << "\n"); 1318 1318 1319 1319 //check that the mesh is not empty … … 1375 1375 //else (see 3 lines above), the edge has been called more than twice: return error 1376 1376 else { 1377 _print String_("The edge (" << GetId(triangles[i][VerticesOfTriangularEdge[j][0]]) << "," << GetId(triangles[i][VerticesOfTriangularEdge[j][1]]) << ") belongs to more than 2 triangles (" << k << ")" << "\n");1378 _print String_("Edge " << j << " of triangle " << i << "\n");1379 _print String_("Edge " << (-st[k]+2)%3 << " of triangle " << (-st[k]+2)/3 << "\n");1380 _print String_("Edge " << triangles[(-st[k]+2)/3].NuEdgeTriangleAdj((int)((-st[k]+2)%3)) << " of triangle " << GetId(triangles[(-st[k]+2)/3].TriangleAdj((int)((-st[k]+2)%3))) << "\n");1377 _printf_("The edge (" << GetId(triangles[i][VerticesOfTriangularEdge[j][0]]) << "," << GetId(triangles[i][VerticesOfTriangularEdge[j][1]]) << ") belongs to more than 2 triangles (" << k << ")" << "\n"); 1378 _printf_("Edge " << j << " of triangle " << i << "\n"); 1379 _printf_("Edge " << (-st[k]+2)%3 << " of triangle " << (-st[k]+2)/3 << "\n"); 1380 _printf_("Edge " << triangles[(-st[k]+2)/3].NuEdgeTriangleAdj((int)((-st[k]+2)%3)) << " of triangle " << GetId(triangles[(-st[k]+2)/3].TriangleAdj((int)((-st[k]+2)%3))) << "\n"); 1381 1381 _error_("An edge belongs to more than 2 triangles"); 1382 1382 } … … 1390 1390 //display info 1391 1391 if(verbose>5) { 1392 _print String_(" info on Mesh:" << "\n");1393 _print String_(" - number of vertices = " << nbv << "\n");1394 _print String_(" - number of triangles = " << nbt << "\n");1395 _print String_(" - number of given edges = " << nbe << "\n");1396 _print String_(" - number of all edges = " << nbedges << "\n");1397 _print String_(" - Euler number 1 - nb of holes = " << nbt-nbedges+nbv << "\n");1392 _printf_(" info on Mesh:" << "\n"); 1393 _printf_(" - number of vertices = " << nbv << "\n"); 1394 _printf_(" - number of triangles = " << nbt << "\n"); 1395 _printf_(" - number of given edges = " << nbe << "\n"); 1396 _printf_(" - number of all edges = " << nbedges << "\n"); 1397 _printf_(" - Euler number 1 - nb of holes = " << nbt-nbedges+nbv << "\n"); 1398 1398 } 1399 1399 … … 1426 1426 1427 1427 //display info 1428 if(verbose>4) _print String_(" Construction of the edges " << nbe << "\n");1428 if(verbose>4) _printf_(" Construction of the edges " << nbe << "\n"); 1429 1429 1430 1430 for (i=0;i<nbedges;i++){ … … 1452 1452 edges[add].ReferenceNumber=edgessave[i].ReferenceNumber; 1453 1453 edges[add].GeomEdgeHook=edgessave[i].GeomEdgeHook; // HACK to get required edges 1454 _print String_("oh no..." << "\n");1454 _printf_("oh no..." << "\n"); 1455 1455 } 1456 1456 else … … 1567 1567 } 1568 1568 } 1569 if (verbose> 3) _print String_(" The Number of sub domain = " << nbsubdomains << "\n");1569 if (verbose> 3) _printf_(" The Number of sub domain = " << nbsubdomains << "\n"); 1570 1570 1571 1571 //build subdomains … … 1619 1619 Gh.nbsubdomains = nbsubdomains; 1620 1620 Gh.subdomains = new GeomSubDomain[nbsubdomains]; 1621 if (verbose>3) _print String_(" number of vertices = " << Gh.nbv << "\n number of edges = " << Gh.nbe << "\n");1621 if (verbose>3) _printf_(" number of vertices = " << Gh.nbv << "\n number of edges = " << Gh.nbe << "\n"); 1622 1622 NbVerticesOnGeomVertex = Gh.nbv; 1623 1623 VerticesOnGeomVertex = new VertexOnGeom[NbVerticesOnGeomVertex]; … … 1791 1791 //display infos 1792 1792 if(verbose>1) { 1793 _print String_(" Construction of Metric: number of field: " << nbsol << " (nbt=" << nbt << ", nbv=" << nbv << ")" << "\n");1793 _printf_(" Construction of Metric: number of field: " << nbsol << " (nbt=" << nbt << ", nbv=" << nbv << ")" << "\n"); 1794 1794 } 1795 1795 … … 1863 1863 1864 1864 //display info 1865 if(verbose>2) _print String_(" Solution " << nusol << ", Min = " << smin << ", Max = " << smax << ", Delta = " << sdelta << "\n");1865 if(verbose>2) _printf_(" Solution " << nusol << ", Min = " << smin << ", Max = " << smax << ", Delta = " << sdelta << "\n"); 1866 1866 1867 1867 //skip constant field 1868 1868 if (sdelta < 1.0e-10*Max(absmax,1e-20)){ 1869 _print String_(" Solution " << nusol << " is constant, skipping..." << "\n");1869 _printf_(" Solution " << nusol << " is constant, skipping..." << "\n"); 1870 1870 continue; 1871 1871 } … … 1993 1993 //display infos 1994 1994 if(verbose>1) { 1995 _print String_(" Construction of Metric: number of field: " << nbsol << " (nbt=" << nbt << ", nbv=" << nbv << ")" << "\n");1995 _printf_(" Construction of Metric: number of field: " << nbsol << " (nbt=" << nbt << ", nbv=" << nbv << ")" << "\n"); 1996 1996 } 1997 1997 … … 2076 2076 2077 2077 //display info 2078 if(verbose>2) _print String_(" Solution " << nusol << ", Min = " << smin << ", Max = " << smax << ", Delta = " << sdelta << ", number of fields = " << nbsol << "\n");2078 if(verbose>2) _printf_(" Solution " << nusol << ", Min = " << smin << ", Max = " << smax << ", Delta = " << sdelta << ", number of fields = " << nbsol << "\n"); 2079 2079 2080 2080 //skip constant field 2081 2081 if (sdelta < 1.0e-10*Max(absmax,1e-20) ){ 2082 if (verbose>2) _print String_(" Solution " << nusol << " is constant, skipping..." << "\n");2082 if (verbose>2) _printf_(" Solution " << nusol << " is constant, skipping..." << "\n"); 2083 2083 continue; 2084 2084 } … … 2265 2265 //Return if no edge is cracked 2266 2266 if(k==0) return; 2267 if (verbose>4) _print String_(" number of Cracked Edges = " << k << "\n");2267 if (verbose>4) _printf_(" number of Cracked Edges = " << k << "\n"); 2268 2268 2269 2269 //Initialize Cracked edge … … 2306 2306 2307 2307 //Add new vertices 2308 if (verbose>4) _print String_(" number of Cracked Vertices = " << NbCrackedVertices << "\n");2308 if (verbose>4) _printf_(" number of Cracked Vertices = " << NbCrackedVertices << "\n"); 2309 2309 if (NbCrackedVertices){ 2310 2310 CrackedVertices=xNew<long>(2*NbCrackedVertices); … … 2375 2375 } 2376 2376 } 2377 //_print String_(element_renu[GetId(ta.t)] << " -> " << GetId((*ta.t)[0])+1 << " " << GetId((*ta.t)[1])+1 << " " << GetId((*ta.t)[2])+1 << ", edge [" << i1 << "->" << j1 << " " << i2 << "->" << j2 << "]" << "\n");2377 //_printf_(element_renu[GetId(ta.t)] << " -> " << GetId((*ta.t)[0])+1 << " " << GetId((*ta.t)[1])+1 << " " << GetId((*ta.t)[2])+1 << ", edge [" << i1 << "->" << j1 << " " << i2 << "->" << j2 << "]" << "\n"); 2378 2378 ta = Next(ta).Adj(); 2379 2379 if (count++>50) _error_("Maximum number of iteration exceeded"); … … 2399 2399 int i; 2400 2400 2401 _print String_("Mesh Echo:" << "\n");2402 _print String_(" nbv = " << nbv << "\n");2403 _print String_(" nbt = " << nbt << "\n");2404 _print String_(" nbe = " << nbe << "\n");2405 _print String_(" nbq = " << nbq << "\n");2406 _print String_(" index:" << "\n");2401 _printf_("Mesh Echo:" << "\n"); 2402 _printf_(" nbv = " << nbv << "\n"); 2403 _printf_(" nbt = " << nbt << "\n"); 2404 _printf_(" nbe = " << nbe << "\n"); 2405 _printf_(" nbq = " << nbq << "\n"); 2406 _printf_(" index:" << "\n"); 2407 2407 for (i=0;i<nbt;i++){ 2408 _print String_(" " << setw(4) << i+1 << ": ["2408 _printf_(" " << setw(4) << i+1 << ": [" 2409 2409 << setw(4) << (((BamgVertex *)triangles[i](0))?GetId(triangles[i][0])+1:0) << " " 2410 2410 << setw(4) << (((BamgVertex *)triangles[i](0))?GetId(triangles[i][1])+1:0) << " " 2411 2411 << setw(4) << (((BamgVertex *)triangles[i](0))?GetId(triangles[i][2])+1:0) << "]"); 2412 2412 } 2413 _print String_(" coordinates:" << "\n");2413 _printf_(" coordinates:" << "\n"); 2414 2414 for (i=0;i<nbv;i++){ 2415 _print String_(" " << setw(4) << i+1 << ": [" << vertices[i].r.x << " " << vertices[i].r.y << "]" << "\n");2415 _printf_(" " << setw(4) << i+1 << ": [" << vertices[i].r.x << " " << vertices[i].r.y << "]" << "\n"); 2416 2416 } 2417 2417 … … 2427 2427 2428 2428 //display 2429 if (verbose > 2) _print String_(" ForceBoundary nb of edge: " << nbe << "\n");2429 if (verbose > 2) _printf_(" ForceBoundary nb of edge: " << nbe << "\n"); 2430 2430 2431 2431 //check that there is no triangle with 0 determinant … … 2458 2458 Nbswap += vertices[j].Optim(1,0); 2459 2459 } 2460 if (verbose > 3) _print String_(" number of inforced edge = " << nbfe << ", number of swap= " << Nbswap << "\n");2460 if (verbose > 3) _printf_(" number of inforced edge = " << nbfe << ", number of swap= " << Nbswap << "\n"); 2461 2461 } 2462 2462 /*}}}*/ … … 2468 2468 2469 2469 if (verbose >2){ 2470 if (OutSide) _print String_(" Find all external sub-domain" << "\n");2471 else _print String_(" Find all internal sub-domain" << "\n");2470 if (OutSide) _printf_(" Find all external sub-domain" << "\n"); 2471 else _printf_(" Find all internal sub-domain" << "\n"); 2472 2472 } 2473 2473 short * HeapArete = new short[nbt]; … … 2613 2613 }//while (t) 2614 2614 } 2615 if(verbose>4) _print String_(" Number of removes subdomains (OutSideMesh) = " << nbsubdomains-j << "\n");2615 if(verbose>4) _printf_(" Number of removes subdomains (OutSideMesh) = " << nbsubdomains-j << "\n"); 2616 2616 nbsubdomains=j; 2617 2617 } … … 2692 2692 2693 2693 if (inew < nbsubdomains) { 2694 if (verbose>5) _print String_("WARNING: " << nbsubdomains-inew << " SubDomains are being removed" << "\n");2694 if (verbose>5) _printf_("WARNING: " << nbsubdomains-inew << " SubDomains are being removed" << "\n"); 2695 2695 nbsubdomains=inew;} 2696 2696 … … 2799 2799 2800 2800 //Display info 2801 if (verbose>2) _print String_(" Insert initial " << nbv << " vertices" << "\n");2801 if (verbose>2) _printf_(" Insert initial " << nbv << " vertices" << "\n"); 2802 2802 2803 2803 //Compute integer coordinates for the existing vertices … … 2890 2890 /*Now, add the vertices One by One*/ 2891 2891 long NbSwap=0; 2892 if (verbose>3) _print String_(" Begining of insertion process..." << "\n");2892 if (verbose>3) _printf_(" Begining of insertion process..." << "\n"); 2893 2893 2894 2894 for (int icount=2; icount<nbv; icount++) { … … 2913 2913 //Display info 2914 2914 if (verbose>3) { 2915 _print String_(" NbSwap of insertion: " << NbSwap << "\n");2916 _print String_(" NbSwap/nbv: " << NbSwap/nbv << "\n");2915 _printf_(" NbSwap of insertion: " << NbSwap << "\n"); 2916 _printf_(" NbSwap/nbv: " << NbSwap/nbv << "\n"); 2917 2917 } 2918 2918 … … 2928 2928 NbSwap += orderedvertices[is1]->Optim(0,0); 2929 2929 if (verbose>3) { 2930 _print String_(" Optim Loop: " << Nbloop << "\n");2931 _print String_(" NbSwap/nbv: " << NbSwap/nbv << "\n");2930 _printf_(" Optim Loop: " << Nbloop << "\n"); 2931 _printf_(" NbSwap/nbv: " << NbSwap/nbv << "\n"); 2932 2932 } 2933 2933 if(!NbSwap) break; … … 2952 2952 2953 2953 //display info if required 2954 if (verbose>5) _print String_(" Try to Insert " << nbvnew << " new points" << "\n");2954 if (verbose>5) _printf_(" Try to Insert " << nbvnew << " new points" << "\n"); 2955 2955 2956 2956 //return if no new points … … 3002 3002 } 3003 3003 if (verbose>3) { 3004 _print String_(" number of new points: " << iv << "\n");3005 _print String_(" number of to close (?) points: " << nbv-iv << "\n");3006 _print String_(" number of swap after: " << NbSwap << "\n");3004 _printf_(" number of new points: " << iv << "\n"); 3005 _printf_(" number of to close (?) points: " << nbv-iv << "\n"); 3006 _printf_(" number of swap after: " << NbSwap << "\n"); 3007 3007 } 3008 3008 nbv = iv; 3009 3009 3010 3010 for (i=nbvold;i<nbv;i++) NbSwap += vertices[i].Optim(1); 3011 if (verbose>3) _print String_(" NbSwap=" << NbSwap << "\n");3011 if (verbose>3) _printf_(" NbSwap=" << NbSwap << "\n"); 3012 3012 3013 3013 NbTSwap += NbSwap ; … … 3055 3055 if (!e[i]){ 3056 3056 kk++; 3057 if(kk<10) _print String_("BUG: the geometrical edge " << i << " is on no edge curve" << "\n");3057 if(kk<10) _printf_("BUG: the geometrical edge " << i << " is on no edge curve" << "\n"); 3058 3058 } 3059 3059 } … … 3069 3069 long int verbose=0; 3070 3070 3071 if (verbose>2) _print String_("MakeQuadrangles costheta = " << costheta << "\n");3071 if (verbose>2) _printf_("MakeQuadrangles costheta = " << costheta << "\n"); 3072 3072 3073 3073 if (costheta >1) { 3074 if (verbose>5) _print String_(" do nothing: costheta > 1" << "\n");3074 if (verbose>5) _printf_(" do nothing: costheta > 1" << "\n"); 3075 3075 } 3076 3076 … … 3098 3098 nbq = kk; 3099 3099 if (verbose>2){ 3100 _print String_(" number of quadrilaterals = " << nbq << "\n");3101 _print String_(" number of triangles = " << nbt-nbtout- nbq*2 << "\n");3102 _print String_(" number of outside triangles = " << nbtout << "\n");3100 _printf_(" number of quadrilaterals = " << nbq << "\n"); 3101 _printf_(" number of triangles = " << nbt-nbtout- nbq*2 << "\n"); 3102 _printf_(" number of outside triangles = " << nbtout << "\n"); 3103 3103 } 3104 3104 delete [] qq; … … 3126 3126 3127 3127 const double maxsubdiv2 = maxsubdiv*maxsubdiv; 3128 if(verbose>1) _print String_(" Limit the subdivision of a edges in the new mesh by " << maxsubdiv << "\n");3128 if(verbose>1) _printf_(" Limit the subdivision of a edges in the new mesh by " << maxsubdiv << "\n"); 3129 3129 // for all the edges 3130 3130 // if the len of the edge is to long … … 3169 3169 } 3170 3170 if(verbose>3){ 3171 _print String_(" number of metric changes = " << nbchange << ", maximum number of subdivision of a edges before change = " << pow(lmax,0.5) << "\n");3171 _printf_(" number of metric changes = " << nbchange << ", maximum number of subdivision of a edges before change = " << pow(lmax,0.5) << "\n"); 3172 3172 } 3173 3173 } … … 3223 3223 /*First, insert old points if requested*/ 3224 3224 if (KeepVertices && (&Bh != this) && (nbv+Bh.nbv< maxnbv)){ 3225 if (verbose>5) _print String_(" Inserting initial mesh points" << "\n");3225 if (verbose>5) _printf_(" Inserting initial mesh points" << "\n"); 3226 3226 for (i=0;i<Bh.nbv;i++){ 3227 3227 BamgVertex &bv=Bh[i]; … … 3242 3242 // Big loop (most time consuming) 3243 3243 int iter=0; 3244 if (verbose>5) _print String_(" Big loop" << "\n");3244 if (verbose>5) _printf_(" Big loop" << "\n"); 3245 3245 do { 3246 3246 /*Update variables*/ … … 3473 3473 // find extrema coordinates of vertices pmin,pmax 3474 3474 long i; 3475 if(verbose>2) _print String_(" Reconstruct mesh of " << nbv << " vertices" << "\n");3475 if(verbose>2) _printf_(" Reconstruct mesh of " << nbv << " vertices" << "\n"); 3476 3476 3477 3477 //initialize orderedvertices … … 3530 3530 //Display info if required 3531 3531 if(verbose>5) { 3532 _print String_(" info of Mesh:" << "\n");3533 _print String_(" - number of vertices = " << nbv << " " << "\n");3534 _print String_(" - number of triangles = " << nbt << " " << "\n");3535 _print String_(" - number of given edges = " << nbe << " " << "\n");3536 _print String_(" - number of all edges = " << edge4->nb() << "\n");3537 _print String_(" - Euler number 1 - nb of holes = " << nbt-edge4->nb()+nbv << "\n");3532 _printf_(" info of Mesh:" << "\n"); 3533 _printf_(" - number of vertices = " << nbv << " " << "\n"); 3534 _printf_(" - number of triangles = " << nbt << " " << "\n"); 3535 _printf_(" - number of given edges = " << nbe << " " << "\n"); 3536 _printf_(" - number of all edges = " << edge4->nb() << "\n"); 3537 _printf_(" - Euler number 1 - nb of holes = " << nbt-edge4->nb()+nbv << "\n"); 3538 3538 } 3539 3539 … … 3552 3552 if (k<10) { 3553 3553 //print only 10 edges 3554 _print String_("Lost boundary edges " << i << " : " << edge4->i(i) << " " << edge4->j(i) << "\n");3554 _printf_("Lost boundary edges " << i << " : " << edge4->i(i) << " " << edge4->j(i) << "\n"); 3555 3555 } 3556 3556 else if (k==10){ 3557 _print String_("Other lost boundary edges not shown..." << "\n");3557 _printf_("Other lost boundary edges not shown..." << "\n"); 3558 3558 } 3559 3559 } … … 3743 3743 /*Check that the 2 vertices are on geometry AND required*/ 3744 3744 if(!edges[i][j].GeomEdgeHook->IsRequiredVertex()){ 3745 _print String_("ReconstructExistingMesh error message: problem with the edge number " << i+1 << ": [" << GetId(edges[i][0])+1 << " " << GetId(edges[i][1])+1 << "]" << "\n");3746 _print String_("This edge is on geometrical edge number " << Gh.GetId(edges[i].GeomEdgeHook)+1 << "\n");3745 _printf_("ReconstructExistingMesh error message: problem with the edge number " << i+1 << ": [" << GetId(edges[i][0])+1 << " " << GetId(edges[i][1])+1 << "]" << "\n"); 3746 _printf_("This edge is on geometrical edge number " << Gh.GetId(edges[i].GeomEdgeHook)+1 << "\n"); 3747 3747 if (edges[i][j].GeomEdgeHook->OnGeomVertex()) 3748 _print String_("the vertex number " << GetId(edges[i][j])+1 << " of this edge is a geometric BamgVertex number " << Gh.GetId(edges[i][j].GeomEdgeHook->gv)+1 << "\n");3748 _printf_("the vertex number " << GetId(edges[i][j])+1 << " of this edge is a geometric BamgVertex number " << Gh.GetId(edges[i][j].GeomEdgeHook->gv)+1 << "\n"); 3749 3749 else if (edges[i][j].GeomEdgeHook->OnGeomEdge()) 3750 _print String_("the vertex number " << GetId(edges[i][j])+1 << " of this edge is a geometric Edge number " << Gh.GetId(edges[i][j].GeomEdgeHook->ge)+1 << "\n");3750 _printf_("the vertex number " << GetId(edges[i][j])+1 << " of this edge is a geometric Edge number " << Gh.GetId(edges[i][j].GeomEdgeHook->ge)+1 << "\n"); 3751 3751 else 3752 _print String_("Its pointer is " << edges[i][j].GeomEdgeHook << "\n");3753 3754 _print String_("This edge is on geometry and has no adjacent edge (open curve) and one of the tip is not required" << "\n");3752 _printf_("Its pointer is " << edges[i][j].GeomEdgeHook << "\n"); 3753 3754 _printf_("This edge is on geometry and has no adjacent edge (open curve) and one of the tip is not required" << "\n"); 3755 3755 _error_("See above (might be cryptic...)"); 3756 3756 } … … 3840 3840 long it,ie,i; 3841 3841 3842 _print String_("renumbering triangles" << "\n");3842 _printf_("renumbering triangles" << "\n"); 3843 3843 for ( it=0;it<nbt;it++) 3844 3844 triangles[it].Renumbering(vertices,ve,renu); 3845 3845 3846 _print String_("renumbering edges" << "\n");3846 _printf_("renumbering edges" << "\n"); 3847 3847 for ( ie=0;ie<nbe;ie++) 3848 3848 edges[ie].Renumbering(vertices,ve,renu); 3849 3849 3850 _print String_("renumbering vertices on geom" << "\n");3850 _printf_("renumbering vertices on geom" << "\n"); 3851 3851 for (i=0;i< NbVerticesOnGeomVertex;i++) 3852 3852 { … … 3856 3856 } 3857 3857 3858 _print String_("renumbering vertices on edge" << "\n");3858 _printf_("renumbering vertices on edge" << "\n"); 3859 3859 for (i=0;i< NbVerticesOnGeomEdge;i++) 3860 3860 { … … 3864 3864 } 3865 3865 3866 _print String_("renumbering vertices on Bth vertex" << "\n");3866 _printf_("renumbering vertices on Bth vertex" << "\n"); 3867 3867 for (i=0;i< NbVertexOnBThVertex;i++) 3868 3868 { … … 3954 3954 number_of_errors++; 3955 3955 if (number_of_errors<20){ 3956 _print String_("Area of Triangle " << i+1 << " < 0 (det=" << triangles[i].det << ")" << "\n");3956 _printf_("Area of Triangle " << i+1 << " < 0 (det=" << triangles[i].det << ")" << "\n"); 3957 3957 } 3958 3958 } … … 4022 4022 gammamn=sqrt(gammamn); 4023 4023 gammamx=sqrt(gammamx); 4024 _print String_(" Adaptmesh info:" << "\n");4025 _print String_(" number of triangles = " << nt << "\n");4026 _print String_(" hmin = " << hmin << ", hmax=" << hmax << "\n");4027 _print String_(" area = " << area << ", M area = " << Marea << ", M area/( |Khat| nt) = " << Marea/(aireKh*nt) << "\n");4028 _print String_(" infinite-regularity(?): min = " << gammamn << ", max = " << gammamx << "\n");4029 _print String_(" anisomax = " << pow(alpha2,0.5) << ", beta max = " << 1./pow(beta/aireKh,0.5) << ", min = " << 1./pow(beta0/aireKh,0.5) << "\n");4024 _printf_(" Adaptmesh info:" << "\n"); 4025 _printf_(" number of triangles = " << nt << "\n"); 4026 _printf_(" hmin = " << hmin << ", hmax=" << hmax << "\n"); 4027 _printf_(" area = " << area << ", M area = " << Marea << ", M area/( |Khat| nt) = " << Marea/(aireKh*nt) << "\n"); 4028 _printf_(" infinite-regularity(?): min = " << gammamn << ", max = " << gammamx << "\n"); 4029 _printf_(" anisomax = " << pow(alpha2,0.5) << ", beta max = " << 1./pow(beta/aireKh,0.5) << ", min = " << 1./pow(beta0/aireKh,0.5) << "\n"); 4030 4030 } 4031 4031 /*}}}*/ … … 4061 4061 } 4062 4062 } 4063 _print String_(" --- Histogram of the unit mesh, nb of edges = " << nbedges << "\n");4064 _print String_(" length of edge in | %% of edge | Nb of edges " << "\n");4065 _print String_(" --------------------+-------------+-------------" << "\n");4063 _printf_(" --- Histogram of the unit mesh, nb of edges = " << nbedges << "\n"); 4064 _printf_(" length of edge in | %% of edge | Nb of edges " << "\n"); 4065 _printf_(" --------------------+-------------+-------------" << "\n"); 4066 4066 for (i=0;i<=kmax;i++){ 4067 if (i==0) _print String_( " " << setw(10) << 0.);4068 else _print String_( " " << setw(10) << exp(lmin+i/delta));4069 if (i==kmax) _print String_(" +inf ");4070 else _print String_( " " << setw(10) << exp(lmin+(i+1)/delta));4071 _print String_("| " << setw(10) << (long((10000. * histo[i])/ nbedges)/100.) << " |" << "\n");4072 _print String_(" " << histo[i] << "\n");4073 } 4074 _print String_(" --------------------+-------------+-------------" << "\n");4067 if (i==0) _printf_( " " << setw(10) << 0.); 4068 else _printf_( " " << setw(10) << exp(lmin+i/delta)); 4069 if (i==kmax) _printf_(" +inf "); 4070 else _printf_( " " << setw(10) << exp(lmin+(i+1)/delta)); 4071 _printf_("| " << setw(10) << (long((10000. * histo[i])/ nbedges)/100.) << " |" << "\n"); 4072 _printf_(" " << histo[i] << "\n"); 4073 } 4074 _printf_(" --------------------+-------------+-------------" << "\n"); 4075 4075 } 4076 4076 /*}}}*/ … … 4098 4098 for ( k=0;k<NbVerticesOnGeomEdge;k++ ) 4099 4099 tstart[ GetId(VerticesOnGeomEdge[k].meshvertex)]=&vide; 4100 if(verbose>2) _print String_(" SmoothingVertex: nb Iteration = " << nbiter << ", Omega=" << omega << "\n");4100 if(verbose>2) _printf_(" SmoothingVertex: nb Iteration = " << nbiter << ", Omega=" << omega << "\n"); 4101 4101 for (k=0;k<nbiter;k++) 4102 4102 { … … 4110 4110 if (tstart[i] != &vide) // not a boundary vertex 4111 4111 NbSwap += vertices[i].Optim(1); 4112 if (verbose>3) _print String_(" move max = " << pow(delta,0.5) << ", iteration = " << k << ", nb of swap = " << NbSwap << "\n");4112 if (verbose>3) _printf_(" move max = " << pow(delta,0.5) << ", iteration = " << k << ", nb of swap = " << NbSwap << "\n"); 4113 4113 } 4114 4114 … … 4124 4124 4125 4125 if(raisonmax<1.1) return; 4126 if(verbose > 1) _print String_(" Mesh::SmoothMetric raisonmax = " << raisonmax << "\n");4126 if(verbose > 1) _printf_(" Mesh::SmoothMetric raisonmax = " << raisonmax << "\n"); 4127 4127 CreateSingleVertexToTriangleConnectivity(); 4128 4128 long i,j,kch,kk,ip; … … 4190 4190 Exchange(first_np_or_next_t0,first_np_or_next_t1); 4191 4191 } 4192 if(verbose>2) _print String_(" number of iterations = " << kch << "\n");4192 if(verbose>2) _printf_(" number of iterations = " << kch << "\n"); 4193 4193 delete [] first_np_or_next_t0; 4194 4194 delete [] first_np_or_next_t1; … … 4378 4378 || (bb=Area2( t[0].r , A.r , t[2].r )) < 0.0 4379 4379 || (cc=Area2( t[0].r , t[1].r , A.r )) < 0.0)){ 4380 _print String_(ke + nbvold << " not in triangle " << i << " In= " << !!t.link << " " << aa << " " << bb << " " << cc << " " << dd << "\n");4380 _printf_(ke + nbvold << " not in triangle " << i << " In= " << !!t.link << " " << aa << " " << bb << " " << cc << " " << dd << "\n"); 4381 4381 _error_("Number of triangles with P2 interpolation Problem"); 4382 4382 } … … 4386 4386 || (bb=Area2( tt[0].r , A.r , tt[2].r )) < 0 4387 4387 || (cc=Area2( tt[0].r , tt[1].r , A.r )) < 0)){ 4388 _print String_(ke + nbvold << " not in triangle " << ii << " In= " << !!tt.link << " " << aa << " " << bb << " " << cc << " " << dd << "\n");4388 _printf_(ke + nbvold << " not in triangle " << ii << " In= " << !!tt.link << " " << aa << " " << bb << " " << cc << " " << dd << "\n"); 4389 4389 _error_("Number of triangles with P2 interpolation Problem"); 4390 4390 } … … 4679 4679 4680 4680 if (verbose>2){ 4681 _print String_(" number of quadrilaterals = " << nbq << "\n");4682 _print String_(" number of triangles = " << nbt-nbtout- nbq*2 << "\n");4683 _print String_(" number of outside triangles = " << nbtout << "\n");4681 _printf_(" number of quadrilaterals = " << nbq << "\n"); 4682 _printf_(" number of triangles = " << nbt-nbtout- nbq*2 << "\n"); 4683 _printf_(" number of outside triangles = " << nbtout << "\n"); 4684 4684 } 4685 4685 … … 4748 4748 Triangle *tcvi = TriangleFindFromCoord(vi.i,det3); 4749 4749 if (tcvi && !tcvi->link) { 4750 _print String_("problem inserting point in SplitInternalEdgeWithBorderVertices (tcvj && !tcvj->link)" << "\n");4750 _printf_("problem inserting point in SplitInternalEdgeWithBorderVertices (tcvj && !tcvj->link)" << "\n"); 4751 4751 } 4752 4752 … … 4760 4760 } 4761 4761 if (verbose>3) { 4762 _print String_(" number of points: " << iv << "\n");4763 _print String_(" number of swap to split internal edges with border vertices: " << NbSwap << "\n");4762 _printf_(" number of points: " << iv << "\n"); 4763 _printf_(" number of swap to split internal edges with border vertices: " << NbSwap << "\n"); 4764 4764 nbv = iv; 4765 4765 } 4766 4766 } 4767 if (NbSplitEdge>nbv-nbvold) _print String_("WARNING: not enough vertices to split all internal edges, we lost " << NbSplitEdge - ( nbv-nbvold) << " edges..." << "\n");4768 if (verbose>2) _print String_("SplitInternalEdgeWithBorderVertices: Number of splited edge " << NbSplitEdge << "\n");4767 if (NbSplitEdge>nbv-nbvold) _printf_("WARNING: not enough vertices to split all internal edges, we lost " << NbSplitEdge - ( nbv-nbvold) << " edges..." << "\n"); 4768 if (verbose>2) _printf_("SplitInternalEdgeWithBorderVertices: Number of splited edge " << NbSplitEdge << "\n"); 4769 4769 4770 4770 return NbSplitEdge; … … 4936 4936 4937 4937 //Vertices 4938 if(verbose) _print String_("Reading vertices (" << nbv << ")" << "\n");4938 if(verbose) _printf_("Reading vertices (" << nbv << ")" << "\n"); 4939 4939 for (i=0;i<nbv;i++){ 4940 4940 vertices[i].r.x=x[i]; … … 5248 5248 5249 5249 //Insert points inside existing triangles 5250 if (verbose>4) _print String_(" -- current number of vertices = " << nbv << "\n");5251 if (verbose>3) _print String_(" Creating initial Constrained Delaunay Triangulation..." << "\n");5252 if (verbose>3) _print String_(" Inserting boundary points" << "\n");5250 if (verbose>4) _printf_(" -- current number of vertices = " << nbv << "\n"); 5251 if (verbose>3) _printf_(" Creating initial Constrained Delaunay Triangulation..." << "\n"); 5252 if (verbose>3) _printf_(" Inserting boundary points" << "\n"); 5253 5253 Insert(); 5254 5254 5255 5255 //Force the boundary 5256 if (verbose>3) _print String_(" Forcing boundaries" << "\n");5256 if (verbose>3) _printf_(" Forcing boundaries" << "\n"); 5257 5257 ForceBoundary(); 5258 5258 5259 5259 //Extract SubDomains 5260 if (verbose>3) _print String_(" Extracting subdomains" << "\n");5260 if (verbose>3) _printf_(" Extracting subdomains" << "\n"); 5261 5261 FindSubDomain(); 5262 5262 5263 if (verbose>3) _print String_(" Inserting internal points" << "\n");5263 if (verbose>3) _printf_(" Inserting internal points" << "\n"); 5264 5264 NewPoints(*this,bamgopts,0) ; 5265 if (verbose>4) _print String_(" -- current number of vertices = " << nbv << "\n");5265 if (verbose>4) _printf_(" -- current number of vertices = " << nbv << "\n"); 5266 5266 } 5267 5267 /*}}}*/ … … 5366 5366 int nc=ei.GeomEdgeHook->CurveNumber; 5367 5367 5368 //_print String_("Dealing with curve number " << nc << "\n");5369 //_print String_("edge on geometry is same as GhCurve? " << (ei.GeomEdgeHook==Gh.curves[nc].FirstEdge || ei.GeomEdgeHook==Gh.curves[nc].LastEdge)?"yes":"no" << "\n");5368 //_printf_("Dealing with curve number " << nc << "\n"); 5369 //_printf_("edge on geometry is same as GhCurve? " << (ei.GeomEdgeHook==Gh.curves[nc].FirstEdge || ei.GeomEdgeHook==Gh.curves[nc].LastEdge)?"yes":"no" << "\n"); 5370 5370 //if(ei.GeomEdgeHook==Gh.curves[nc].FirstEdge || ei.GeomEdgeHook==Gh.curves[nc].LastEdge){ 5371 // _print String_("Do we have the right extremity? curve first vertex -> " << ((GeomVertex *)*ei[je].GeomEdgeHook==&(*Gh.curves[nc].FirstEdge)[Gh.curves[nc].FirstVertexIndex])?"yes":"no" << "\n");5372 // _print String_("Do we have the right extremity? curve last vertex -> " << ((GeomVertex *)*ei[je].GeomEdgeHook==&(*Gh.curves[nc].LastEdge)[Gh.curves[nc].LastVertexIndex])?"yes":"no" << "\n");5371 // _printf_("Do we have the right extremity? curve first vertex -> " << ((GeomVertex *)*ei[je].GeomEdgeHook==&(*Gh.curves[nc].FirstEdge)[Gh.curves[nc].FirstVertexIndex])?"yes":"no" << "\n"); 5372 // _printf_("Do we have the right extremity? curve last vertex -> " << ((GeomVertex *)*ei[je].GeomEdgeHook==&(*Gh.curves[nc].LastEdge)[Gh.curves[nc].LastVertexIndex])?"yes":"no" << "\n"); 5373 5373 //} 5374 5374 //BUG FIX from original bamg … … 5577 5577 5578 5578 //Insert points inside existing triangles 5579 if (verbose>4) _print String_(" -- current number of vertices = " << nbv << "\n");5580 if (verbose>3) _print String_(" Creating initial Constrained Delaunay Triangulation..." << "\n");5581 if (verbose>3) _print String_(" Inserting boundary points" << "\n");5579 if (verbose>4) _printf_(" -- current number of vertices = " << nbv << "\n"); 5580 if (verbose>3) _printf_(" Creating initial Constrained Delaunay Triangulation..." << "\n"); 5581 if (verbose>3) _printf_(" Inserting boundary points" << "\n"); 5582 5582 Insert(); 5583 5583 5584 5584 //Force the boundary 5585 if (verbose>3) _print String_(" Forcing boundaries" << "\n");5585 if (verbose>3) _printf_(" Forcing boundaries" << "\n"); 5586 5586 ForceBoundary(); 5587 5587 5588 5588 //Extract SubDomains 5589 if (verbose>3) _print String_(" Extracting subdomains" << "\n");5589 if (verbose>3) _printf_(" Extracting subdomains" << "\n"); 5590 5590 FindSubDomain(); 5591 5591 5592 if (verbose>3) _print String_(" Inserting internal points" << "\n");5592 if (verbose>3) _printf_(" Inserting internal points" << "\n"); 5593 5593 NewPoints(BTh,bamgopts,KeepVertices) ; 5594 if (verbose>4) _print String_(" -- current number of vertices = " << nbv << "\n");5594 if (verbose>4) _printf_(" -- current number of vertices = " << nbv << "\n"); 5595 5595 } 5596 5596 /*}}}*/ -
issm/trunk-jpl/src/c/bamg/Metric.cpp
r15099 r15100 71 71 void Metric::Echo(void){ 72 72 73 _print String_("Metric:" << "\n");74 _print String_(" [a11 a21 a22]: [" << a11 << " " << a21 << " " << a22 << "]" << "\n");73 _printf_("Metric:" << "\n"); 74 _printf_(" [a11 a21 a22]: [" << a11 << " " << a21 << " " << a22 << "]" << "\n"); 75 75 76 76 return; … … 200 200 LastMetricInterpole.lab=l; 201 201 LastMetricInterpole.opt=i; 202 if (i>200 && kkk++<10) _print String_("WARNING: LengthInterpole: ( i=" << i << " l=" << l << " sss=" << sss << " ) " << sstop << "\n");202 if (i>200 && kkk++<10) _printf_("WARNING: LengthInterpole: ( i=" << i << " l=" << l << " sss=" << sss << " ) " << sstop << "\n"); 203 203 return l; 204 204 } -
issm/trunk-jpl/src/c/bamg/Triangle.cpp
r15099 r15100 109 109 int i; 110 110 111 _print String_("Triangle:" << "\n");112 _print String_(" vertices pointer towards three vertices" << "\n");113 _print String_(" vertices[0] vertices[1] vertices[2] = " << vertices[0] << " " << vertices[1] << " " << vertices[2] << "\n");114 _print String_(" adj pointer towards three adjacent triangles" << "\n");115 _print String_(" adj[0] adj[1] adj[2] = " << adj[0] << " " << adj[1] << " " << adj[2] << "\n");116 _print String_(" det (integer triangle determinant) = " << det << "\n");111 _printf_("Triangle:" << "\n"); 112 _printf_(" vertices pointer towards three vertices" << "\n"); 113 _printf_(" vertices[0] vertices[1] vertices[2] = " << vertices[0] << " " << vertices[1] << " " << vertices[2] << "\n"); 114 _printf_(" adj pointer towards three adjacent triangles" << "\n"); 115 _printf_(" adj[0] adj[1] adj[2] = " << adj[0] << " " << adj[1] << " " << adj[2] << "\n"); 116 _printf_(" det (integer triangle determinant) = " << det << "\n"); 117 117 if (link){ 118 _print String_(" link (pointer toward duplicate triangle)= " << link << "\n");118 _printf_(" link (pointer toward duplicate triangle)= " << link << "\n"); 119 119 } 120 120 else{ 121 _print String_(" color = " << color << "\n");122 } 123 124 _print String_("\nThree vertices:" << "\n");121 _printf_(" color = " << color << "\n"); 122 } 123 124 _printf_("\nThree vertices:" << "\n"); 125 125 for(i=0;i<3;i++){ 126 126 if (vertices[i]){ … … 128 128 } 129 129 else{ 130 _print String_(" vertex " << i+1 << " does not exist" << "\n");130 _printf_(" vertex " << i+1 << " does not exist" << "\n"); 131 131 } 132 132 } -
issm/trunk-jpl/src/c/classes/Constraints/SpcDynamic.cpp
r15099 r15100 42 42 void SpcDynamic::Echo(void){ 43 43 44 _print String_("SpcDynamic:" << "\n");45 _print String_(" sid: " << sid << "\n");46 _print String_(" nodeid: " << nodeid << "\n");47 _print String_(" dof: " << dof << "\n");48 _print String_(" value: " << value << "\n");49 _print String_(" isset: " <<(isset?"true":"false") << "\n");50 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");44 _printf_("SpcDynamic:" << "\n"); 45 _printf_(" sid: " << sid << "\n"); 46 _printf_(" nodeid: " << nodeid << "\n"); 47 _printf_(" dof: " << dof << "\n"); 48 _printf_(" value: " << value << "\n"); 49 _printf_(" isset: " <<(isset?"true":"false") << "\n"); 50 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 51 51 return; 52 52 } -
issm/trunk-jpl/src/c/classes/Constraints/SpcStatic.cpp
r15099 r15100 41 41 void SpcStatic::Echo(void){ 42 42 43 _print String_("SpcStatic:" << "\n");44 _print String_(" sid: " << sid << "\n");45 _print String_(" nodeid: " << nodeid << "\n");46 _print String_(" dof: " << dof << "\n");47 _print String_(" value: " << value << "\n");48 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");43 _printf_("SpcStatic:" << "\n"); 44 _printf_(" sid: " << sid << "\n"); 45 _printf_(" nodeid: " << nodeid << "\n"); 46 _printf_(" dof: " << dof << "\n"); 47 _printf_(" value: " << value << "\n"); 48 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 49 49 return; 50 50 } … … 53 53 void SpcStatic::DeepEcho(void){ 54 54 55 _print String_("SpcStatic:" << "\n");56 _print String_(" sid: " << sid << "\n");57 _print String_(" nodeid: " << nodeid << "\n");58 _print String_(" dof: " << dof << "\n");59 _print String_(" value: " << value << "\n");60 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");55 _printf_("SpcStatic:" << "\n"); 56 _printf_(" sid: " << sid << "\n"); 57 _printf_(" nodeid: " << nodeid << "\n"); 58 _printf_(" dof: " << dof << "\n"); 59 _printf_(" value: " << value << "\n"); 60 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 61 61 return; 62 62 } -
issm/trunk-jpl/src/c/classes/Constraints/SpcTransient.cpp
r15099 r15100 56 56 57 57 int i; 58 _print String_("SpcTransient:" << "\n");59 _print String_(" sid: " << sid << "\n");60 _print String_(" nodeid: " << nodeid << "\n");61 _print String_(" dof: " << dof << "\n");62 _print String_(" nsteps: " << nsteps << "\n");63 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");64 _print String_(" steps|times|values" << "\n");58 _printf_("SpcTransient:" << "\n"); 59 _printf_(" sid: " << sid << "\n"); 60 _printf_(" nodeid: " << nodeid << "\n"); 61 _printf_(" dof: " << dof << "\n"); 62 _printf_(" nsteps: " << nsteps << "\n"); 63 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 64 _printf_(" steps|times|values" << "\n"); 65 65 for(i=0;i<nsteps;i++){ 66 _print String_(i << "-" << times[i] << ":" << values[i] << "\n");66 _printf_(i << "-" << times[i] << ":" << values[i] << "\n"); 67 67 } 68 68 return; -
issm/trunk-jpl/src/c/classes/Contour.h
r15099 r15100 57 57 /*FUNCTION Echo(){{{*/ 58 58 void Echo(void){ 59 _print String_(" Contour: " << id << "\n");60 _print String_(" nods: " << nods << "\n");61 _print String_(" closed: " << (closed?"true":"false") << "\n");59 _printf_(" Contour: " << id << "\n"); 60 _printf_(" nods: " << nods << "\n"); 61 _printf_(" closed: " << (closed?"true":"false") << "\n"); 62 62 if(nods){ 63 _print String_(" x , y:" << "\n");63 _printf_(" x , y:" << "\n"); 64 64 for(int i=0;i<nods;i++){ 65 _print String_(i << ": " << x[i] << " | " << y[i] << "\n");65 _printf_(i << ": " << x[i] << " | " << y[i] << "\n"); 66 66 } 67 67 } -
issm/trunk-jpl/src/c/classes/DependentObject.cpp
r15099 r15100 40 40 void DependentObject::Echo(void){ 41 41 42 _print String_("DependentObject:" << "\n");43 _print String_(" name: " << EnumToStringx(this->name) << "\n");42 _printf_("DependentObject:" << "\n"); 43 _printf_(" name: " << EnumToStringx(this->name) << "\n"); 44 44 if(this->type==0) 45 _print String_(" type: scalar" << "\n");45 _printf_(" type: scalar" << "\n"); 46 46 else if(this->type==1) 47 _print String_(" type: vertex" << "\n");47 _printf_(" type: vertex" << "\n"); 48 48 else 49 49 _error_(" unknown type: " << this->type); 50 if(this->index>=0) _print String_(" index: " << this->index << "\n");50 if(this->index>=0) _printf_(" index: " << this->index << "\n"); 51 51 } 52 52 /*}}}*/ -
issm/trunk-jpl/src/c/classes/DofIndexing.cpp
r15099 r15100 163 163 void DofIndexing::Echo(void){ 164 164 165 _print String_("DofIndexing:" << "\n");166 _print String_(" gsize: " << gsize << "\n");167 _print String_(" clone: " << clone << "\n");165 _printf_("DofIndexing:" << "\n"); 166 _printf_(" gsize: " << gsize << "\n"); 167 _printf_(" clone: " << clone << "\n"); 168 168 } 169 169 /*}}}*/ … … 173 173 int i; 174 174 175 _print String_("DofIndexing:" << "\n");176 _print String_(" gsize: " << gsize << "\n");177 _print String_(" fsize: " << fsize << "\n");178 _print String_(" ssize: " << ssize << "\n");179 _print String_(" clone: " << clone << "\n");180 181 _print String_(" set membership: f,s sets " << "\n");175 _printf_("DofIndexing:" << "\n"); 176 _printf_(" gsize: " << gsize << "\n"); 177 _printf_(" fsize: " << fsize << "\n"); 178 _printf_(" ssize: " << ssize << "\n"); 179 _printf_(" clone: " << clone << "\n"); 180 181 _printf_(" set membership: f,s sets " << "\n"); 182 182 for(i=0;i<gsize;i++){ 183 _print String_(" dof " << i << ": " <<(f_set[i]?"true":"false")<< " " <<(s_set[i]?"true":"false") << "\n");184 } 185 186 _print String_(" svalues (" << this->ssize << "): |");183 _printf_(" dof " << i << ": " <<(f_set[i]?"true":"false")<< " " <<(s_set[i]?"true":"false") << "\n"); 184 } 185 186 _printf_(" svalues (" << this->ssize << "): |"); 187 187 for(i=0;i<this->gsize;i++){ 188 if(this->s_set[i])_print String_(" " << svalues[i] << " |");189 } 190 _print String_("" << "\n");188 if(this->s_set[i])_printf_(" " << svalues[i] << " |"); 189 } 190 _printf_("" << "\n"); 191 191 192 192 if(doftype){ 193 _print String_(" doftype: |");193 _printf_(" doftype: |"); 194 194 for(i=0;i<gsize;i++){ 195 _print String_(" " << doftype[i] << " |");195 _printf_(" " << doftype[i] << " |"); 196 196 } 197 _print String_("" << "\n");198 } 199 else _print String_(" doftype: NULL" << "\n");200 201 _print String_(" g_doflist (" << this->gsize << "): |");197 _printf_("" << "\n"); 198 } 199 else _printf_(" doftype: NULL" << "\n"); 200 201 _printf_(" g_doflist (" << this->gsize << "): |"); 202 202 for(i=0;i<this->gsize;i++){ 203 _print String_(" " << gdoflist[i] << " |");204 } 205 _print String_("" << "\n");206 207 _print String_(" f_doflist (" << this->fsize << "): |");203 _printf_(" " << gdoflist[i] << " |"); 204 } 205 _printf_("" << "\n"); 206 207 _printf_(" f_doflist (" << this->fsize << "): |"); 208 208 for(i=0;i<this->fsize;i++){ 209 _print String_(" " << fdoflist[i] << " |");210 } 211 _print String_("" << "\n");212 213 _print String_(" s_doflist (" << this->ssize << "): |");209 _printf_(" " << fdoflist[i] << " |"); 210 } 211 _printf_("" << "\n"); 212 213 _printf_(" s_doflist (" << this->ssize << "): |"); 214 214 for(i=0;i<this->ssize;i++){ 215 _print String_(" " << sdoflist[i] << " |");216 } 217 _print String_("" << "\n");215 _printf_(" " << sdoflist[i] << " |"); 216 } 217 _printf_("" << "\n"); 218 218 } 219 219 /*}}}*/ -
issm/trunk-jpl/src/c/classes/ElementResults/BoolElementResult.cpp
r15099 r15100 42 42 void BoolElementResult::DeepEcho(void){ 43 43 44 _print String_("BoolElementResult:" << "\n");45 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");46 _print String_(" value: "<<(this->value?"true":"false") << "\n");47 _print String_(" step: " << this->step << "\n");48 _print String_(" time: " << this->time << "\n");44 _printf_("BoolElementResult:" << "\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 46 _printf_(" value: "<<(this->value?"true":"false") << "\n"); 47 _printf_(" step: " << this->step << "\n"); 48 _printf_(" time: " << this->time << "\n"); 49 49 } 50 50 /*}}}*/ -
issm/trunk-jpl/src/c/classes/ElementResults/DoubleElementResult.cpp
r15099 r15100 42 42 void DoubleElementResult::DeepEcho(void){ 43 43 44 _print String_("DoubleElementResult:" << "\n");45 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");46 _print String_(" value: " << this->value << "\n");47 _print String_(" step: " << this->step << "\n");48 _print String_(" time: " << this->time << "\n");44 _printf_("DoubleElementResult:" << "\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 46 _printf_(" value: " << this->value << "\n"); 47 _printf_(" step: " << this->step << "\n"); 48 _printf_(" time: " << this->time << "\n"); 49 49 } 50 50 /*}}}*/ -
issm/trunk-jpl/src/c/classes/ElementResults/PentaP1ElementResult.cpp
r15099 r15100 44 44 void PentaP1ElementResult::DeepEcho(void){ 45 45 46 _print String_("PentaP1ElementResult:" << "\n");47 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");48 _print String_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << " " << this->values[3] << " " << this->values[4] << " " << this->values[5] << "]" << "\n");49 _print String_(" step: " << this->step << "\n");50 _print String_(" time: " << this->time << "\n");46 _printf_("PentaP1ElementResult:" << "\n"); 47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 48 _printf_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << " " << this->values[3] << " " << this->values[4] << " " << this->values[5] << "]" << "\n"); 49 _printf_(" step: " << this->step << "\n"); 50 _printf_(" time: " << this->time << "\n"); 51 51 52 52 } -
issm/trunk-jpl/src/c/classes/ElementResults/TriaP1ElementResult.cpp
r15099 r15100 44 44 void TriaP1ElementResult::DeepEcho(void){ 45 45 46 _print String_("TriaP1ElementResult:" << "\n");47 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");48 _print String_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << "]" << "\n");49 _print String_(" step: " << this->step << "\n");50 _print String_(" time: " << this->time << "\n");46 _printf_("TriaP1ElementResult:" << "\n"); 47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 48 _printf_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << "]" << "\n"); 49 _printf_(" step: " << this->step << "\n"); 50 _printf_(" time: " << this->time << "\n"); 51 51 } 52 52 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Elements/Penta.cpp
r15099 r15100 668 668 void Penta::DeepEcho(void){ 669 669 670 _print String_("Penta:" << "\n");671 _print String_(" id: " << id << "\n");670 _printf_("Penta:" << "\n"); 671 _printf_(" id: " << id << "\n"); 672 672 nodes[0]->DeepEcho(); 673 673 nodes[1]->DeepEcho(); … … 678 678 material->DeepEcho(); 679 679 matpar->DeepEcho(); 680 _print String_(" neighbor ids: " << verticalneighbors[0]->Id() << "-" << verticalneighbors[1]->Id() << "\n");681 _print String_(" parameters" << "\n");680 _printf_(" neighbor ids: " << verticalneighbors[0]->Id() << "-" << verticalneighbors[1]->Id() << "\n"); 681 _printf_(" parameters" << "\n"); 682 682 parameters->DeepEcho(); 683 _print String_(" inputs" << "\n");683 _printf_(" inputs" << "\n"); 684 684 inputs->DeepEcho(); 685 _print String_(" results" << "\n");685 _printf_(" results" << "\n"); 686 686 results->DeepEcho(); 687 _print String_("neighboor sids: " << "\n");688 _print String_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n");687 _printf_("neighboor sids: " << "\n"); 688 _printf_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n"); 689 689 } 690 690 /*}}}*/ … … 1335 1335 } 1336 1336 else{ 1337 _print String_("Interpolation " << EnumToStringx(interp) << " not supported" << "\n");1337 _printf_("Interpolation " << EnumToStringx(interp) << " not supported" << "\n"); 1338 1338 } 1339 1339 } … … 4560 4560 /*Check solution*/ 4561 4561 if(xIsNan<IssmDouble>(values[i])) _error_("NaN found in solution vector"); 4562 //if(values[i]<0) _print String_("temperature < 0°K found in solution vector" << "\n");4563 //if(values[i]>275) _print String_("temperature > 275°K found in solution vector (Paterson's rheology associated is negative)" << "\n");4562 //if(values[i]<0) _printf_("temperature < 0°K found in solution vector" << "\n"); 4563 //if(values[i]>275) _printf_("temperature > 275°K found in solution vector (Paterson's rheology associated is negative)" << "\n"); 4564 4564 } 4565 4565 -
issm/trunk-jpl/src/c/classes/Elements/Tria.cpp
r15099 r15100 935 935 void Tria::DeepEcho(void){ 936 936 937 _print String_("Tria:" << "\n");938 _print String_(" id: " << id << "\n");937 _printf_("Tria:" << "\n"); 938 _printf_(" id: " << id << "\n"); 939 939 if(nodes){ 940 940 nodes[0]->DeepEcho(); … … 942 942 nodes[2]->DeepEcho(); 943 943 } 944 else _print String_("nodes = NULL" << "\n");944 else _printf_("nodes = NULL" << "\n"); 945 945 946 946 if (material) material->DeepEcho(); 947 else _print String_("material = NULL" << "\n");947 else _printf_("material = NULL" << "\n"); 948 948 949 949 if (matpar) matpar->DeepEcho(); 950 else _print String_("matpar = NULL" << "\n");951 952 _print String_(" parameters" << "\n");950 else _printf_("matpar = NULL" << "\n"); 951 952 _printf_(" parameters" << "\n"); 953 953 if (parameters) parameters->DeepEcho(); 954 else _print String_("parameters = NULL" << "\n");955 956 _print String_(" inputs" << "\n");954 else _printf_("parameters = NULL" << "\n"); 955 956 _printf_(" inputs" << "\n"); 957 957 if (inputs) inputs->DeepEcho(); 958 else _print String_("inputs=NULL" << "\n");958 else _printf_("inputs=NULL" << "\n"); 959 959 960 960 if (results) results->DeepEcho(); 961 else _print String_("results=NULL" << "\n");962 963 _print String_("neighboor sids: " << "\n");964 _print String_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n");961 else _printf_("results=NULL" << "\n"); 962 963 _printf_("neighboor sids: " << "\n"); 964 _printf_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n"); 965 965 966 966 return; … … 1047 1047 /*FUNCTION Tria::Echo{{{*/ 1048 1048 void Tria::Echo(void){ 1049 _print String_("Tria:" << "\n");1050 _print String_(" id: " << id << "\n");1049 _printf_("Tria:" << "\n"); 1050 _printf_(" id: " << id << "\n"); 1051 1051 if(nodes){ 1052 1052 nodes[0]->Echo(); … … 1054 1054 nodes[2]->Echo(); 1055 1055 } 1056 else _print String_("nodes = NULL" << "\n");1056 else _printf_("nodes = NULL" << "\n"); 1057 1057 1058 1058 if (material) material->Echo(); 1059 else _print String_("material = NULL" << "\n");1059 else _printf_("material = NULL" << "\n"); 1060 1060 1061 1061 if (matpar) matpar->Echo(); 1062 else _print String_("matpar = NULL" << "\n");1063 1064 _print String_(" parameters" << "\n");1062 else _printf_("matpar = NULL" << "\n"); 1063 1064 _printf_(" parameters" << "\n"); 1065 1065 if (parameters) parameters->Echo(); 1066 else _print String_("parameters = NULL" << "\n");1067 1068 _print String_(" inputs" << "\n");1066 else _printf_("parameters = NULL" << "\n"); 1067 1068 _printf_(" inputs" << "\n"); 1069 1069 if (inputs) inputs->Echo(); 1070 else _print String_("inputs=NULL" << "\n");1070 else _printf_("inputs=NULL" << "\n"); 1071 1071 1072 1072 if (results) results->Echo(); 1073 else _print String_("results=NULL" << "\n");1074 1075 _print String_("neighboor sids: " << "\n");1076 _print String_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n");1073 else _printf_("results=NULL" << "\n"); 1074 1075 _printf_("neighboor sids: " << "\n"); 1076 _printf_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n"); 1077 1077 } 1078 1078 /*}}}*/ … … 1559 1559 } 1560 1560 else{ 1561 _print String_("Interpolation " << EnumToStringx(interp) << " not supported" << "\n");1561 _printf_("Interpolation " << EnumToStringx(interp) << " not supported" << "\n"); 1562 1562 } 1563 1563 } -
issm/trunk-jpl/src/c/classes/ExternalResults/GenericExternalResult.h
r15099 r15100 33 33 /*Diverse: must be in front, as it is used in what follows*/ 34 34 void GenericEcho(void){/*{{{*/ 35 _print String_(" id: " << this->id << "\n");36 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");37 _print String_(" step: " << this->step << "\n");38 _print String_(" time: " << this->time << "\n");35 _printf_(" id: " << this->id << "\n"); 36 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 37 _printf_(" step: " << this->step << "\n"); 38 _printf_(" time: " << this->time << "\n"); 39 39 } 40 40 /*}}}*/ … … 143 143 template <> inline void GenericExternalResult<bool>::DeepEcho(void){ /*{{{*/ 144 144 145 _print String_("GenericExternalResult<bool>:" << "\n");146 this->GenericEcho(); 147 _print String_(" value: " <<(this->value?"true":"false") << "\n");145 _printf_("GenericExternalResult<bool>:" << "\n"); 146 this->GenericEcho(); 147 _printf_(" value: " <<(this->value?"true":"false") << "\n"); 148 148 149 149 } /*}}}*/ … … 155 155 template <> inline void GenericExternalResult<int>::DeepEcho(void){ /*{{{*/ 156 156 157 _print String_("GenericExternalResult<int>:" << "\n");158 this->GenericEcho(); 159 _print String_(" value: " << this->value << "\n");157 _printf_("GenericExternalResult<int>:" << "\n"); 158 this->GenericEcho(); 159 _printf_(" value: " << this->value << "\n"); 160 160 161 161 } /*}}}*/ … … 167 167 template <> inline void GenericExternalResult<double>::DeepEcho(void){ /*{{{*/ 168 168 169 _print String_("GenericExternalResult<double>:" << "\n");170 this->GenericEcho(); 171 _print String_(" value: " << this->value << "\n");169 _printf_("GenericExternalResult<double>:" << "\n"); 170 this->GenericEcho(); 171 _printf_(" value: " << this->value << "\n"); 172 172 173 173 } /*}}}*/ … … 192 192 template <> inline void GenericExternalResult<char*>::DeepEcho(void){ /*{{{*/ 193 193 194 _print String_("GenericExternalResult<char*>:" << "\n");195 this->GenericEcho(); 196 _print String_(" value: " << this->value << "\n");194 _printf_("GenericExternalResult<char*>:" << "\n"); 195 this->GenericEcho(); 196 _printf_(" value: " << this->value << "\n"); 197 197 198 198 } /*}}}*/ … … 252 252 template <> inline void GenericExternalResult<IssmPDouble*>::Echo(void){ /*{{{*/ 253 253 254 _print String_("GenericExternalResult<IssmPDouble*>:" << "\n");255 this->GenericEcho(); 256 _print String_(" matrix size: " << this->M << "-" << this->N << "\n");254 _printf_("GenericExternalResult<IssmPDouble*>:" << "\n"); 255 this->GenericEcho(); 256 _printf_(" matrix size: " << this->M << "-" << this->N << "\n"); 257 257 258 258 } /*}}}*/ … … 261 261 int i,j; 262 262 263 _print String_("GenericExternalResult<IssmPDouble*>:" << "\n");264 this->GenericEcho(); 265 266 _print String_(" matrix size: " << this->M << "-" << this->N << "\n");263 _printf_("GenericExternalResult<IssmPDouble*>:" << "\n"); 264 this->GenericEcho(); 265 266 _printf_(" matrix size: " << this->M << "-" << this->N << "\n"); 267 267 for (i=0;i<this->M;i++){ 268 _print String_(" [ ");268 _printf_(" [ "); 269 269 for (j=0;j<this->N;j++){ 270 _print String_( " " << setw(11) << setprecision (5) << this->value[i*this->N+j]);270 _printf_( " " << setw(11) << setprecision (5) << this->value[i*this->N+j]); 271 271 } 272 _print String_(" ]" << "\n");272 _printf_(" ]" << "\n"); 273 273 } 274 274 -
issm/trunk-jpl/src/c/classes/FemModel.cpp
r15099 r15100 118 118 this->parameters->FindParam(&lockfilename,LockFileNameEnum); 119 119 if (waitonlock>0){ 120 _p printString_("write lock file:" << "\n");120 _printf0_("write lock file:" << "\n"); 121 121 WriteLockFile(lockfilename); 122 122 } … … 137 137 /*Before we delete the profiler, report statistics for this run: */ 138 138 profiler->Tag(Finish); //final tagging 139 _p printString_("" << "\n");140 _p printString_(" "<<setw(40)<<left<<"FemModel initialization elapsed time:"<<profiler->DeltaTime(StartInit,FinishInit) << "\n");141 _p printString_(" "<<setw(40)<<left<<"Core solution elapsed time:"<<profiler->DeltaTime(StartCore,FinishCore) << "\n");142 _p printString_("" << "\n");143 _p printString_(" Total elapsed time:"139 _printf0_("" << "\n"); 140 _printf0_(" "<<setw(40)<<left<<"FemModel initialization elapsed time:"<<profiler->DeltaTime(StartInit,FinishInit) << "\n"); 141 _printf0_(" "<<setw(40)<<left<<"Core solution elapsed time:"<<profiler->DeltaTime(StartCore,FinishCore) << "\n"); 142 _printf0_("" << "\n"); 143 _printf0_(" Total elapsed time:" 144 144 <<profiler->DeltaTimeModHour(Start,Finish)<<" hrs " 145 145 <<profiler->DeltaTimeModMin(Start,Finish)<<" min " 146 146 <<profiler->DeltaTimeModSec(Start,Finish)<<" sec" 147 147 ); 148 _p printString_("" << "\n");148 _printf0_("" << "\n"); 149 149 150 150 /*Now delete: */ … … 153 153 /*Finalize PETSC for this model: */ 154 154 #ifdef _HAVE_PETSC_ 155 _p printString_("closing Petsc" << "\n");155 _printf0_("closing Petsc" << "\n"); 156 156 PetscFinalize(); 157 157 #endif … … 164 164 void FemModel::Echo(void){ 165 165 166 _print String_("FemModel echo: " << "\n");167 _print String_(" number of fem models: " << nummodels << "\n");168 _print String_(" analysis_type_list: " << "\n");169 for(int i=0;i<nummodels;i++)_print String_(" " << i << ": " << EnumToStringx(analysis_type_list[i]) << "\n");170 _print String_(" current analysis_type: " << "\n");171 _print String_(" " << analysis_counter << ": " << EnumToStringx(analysis_type_list[analysis_counter]) << "\n");166 _printf_("FemModel echo: " << "\n"); 167 _printf_(" number of fem models: " << nummodels << "\n"); 168 _printf_(" analysis_type_list: " << "\n"); 169 for(int i=0;i<nummodels;i++)_printf_(" " << i << ": " << EnumToStringx(analysis_type_list[i]) << "\n"); 170 _printf_(" current analysis_type: " << "\n"); 171 _printf_(" " << analysis_counter << ": " << EnumToStringx(analysis_type_list[analysis_counter]) << "\n"); 172 172 173 173 } … … 208 208 for(i=0;i<nummodels;i++){ 209 209 210 if(VerboseMProcessor()) _p printString_(" Processing finite element model of analysis " << EnumToStringx(analysis_type_list[i]) << ":" << "\n");210 if(VerboseMProcessor()) _printf0_(" Processing finite element model of analysis " << EnumToStringx(analysis_type_list[i]) << ":" << "\n"); 211 211 analysis_type=analysis_type_list[i]; 212 212 this->SetCurrentConfiguration(analysis_type); 213 213 214 214 if(i==0){ 215 if(VerboseMProcessor()) _p printString_(" creating vertex degrees of freedom" << "\n");215 if(VerboseMProcessor()) _printf0_(" creating vertex degrees of freedom" << "\n"); 216 216 VerticesDofx(vertices,parameters); //only call once, we only have one set of vertices 217 217 } 218 218 219 if(VerboseMProcessor()) _p printString_(" resolving node constraints" << "\n");219 if(VerboseMProcessor()) _printf0_(" resolving node constraints" << "\n"); 220 220 SpcNodesx(nodes,constraints,parameters,analysis_type); 221 221 222 if(VerboseMProcessor()) _p printString_(" creating nodal degrees of freedom" << "\n");222 if(VerboseMProcessor()) _printf0_(" creating nodal degrees of freedom" << "\n"); 223 223 NodesDofx(nodes,parameters,analysis_type); 224 224 225 if(VerboseMProcessor()) _p printString_(" configuring element and loads" << "\n");225 if(VerboseMProcessor()) _printf0_(" configuring element and loads" << "\n"); 226 226 ConfigureObjectsx(elements, loads, nodes, vertices, materials,parameters); 227 227 } … … 247 247 void FemModel::OutputResults(void){ 248 248 249 _p printString_("write results to disk:" << "\n");249 _printf0_("write results to disk:" << "\n"); 250 250 251 251 /*Just call the OutputResultsx module: */ … … 294 294 if(this->parameters->Exist(ToolkitsOptionsStringsEnum)){ 295 295 ToolkitsOptionsFromAnalysis(this->parameters,analysis_type); 296 if(VerboseSolver()) _p printString_(" toolkits Options set for analysis type: " << EnumToStringx(analysis_type) << "\n");296 if(VerboseSolver()) _printf0_(" toolkits Options set for analysis type: " << EnumToStringx(analysis_type) << "\n"); 297 297 } 298 298 … … 317 317 void (*solutioncore)(FemModel*)=NULL; //core solution function pointer 318 318 319 _p printString_("call computational core:" << "\n");319 _printf0_("call computational core:" << "\n"); 320 320 321 321 /*Retrieve solution_type from parameters: */ … … 343 343 solution_memory=profiler->Memory(FinishCore); 344 344 345 _p printString_("Solution elapsed time : " << solution_time << " Seconds" << "\n");346 _p printString_("Solution elapsed flops : " << solution_flops << " Flops" << "\n");347 _p printString_("Solution memory used : " << solution_memory << " Bytes" << "\n");345 _printf0_("Solution elapsed time : " << solution_time << " Seconds" << "\n"); 346 _printf0_("Solution elapsed flops : " << solution_flops << " Flops" << "\n"); 347 _printf0_("Solution memory used : " << solution_memory << " Bytes" << "\n"); 348 348 349 349 /*Add to results: */ … … 676 676 677 677 /*start module: */ 678 if(VerboseModule()) _p printString_(" Updating constraints for time: " << time << "\n");678 if(VerboseModule()) _printf0_(" Updating constraints for time: " << time << "\n"); 679 679 680 680 /*First, update dof constraints in nodes, using constraints: */ … … 829 829 830 830 /*Display message*/ 831 if(VerboseModule()) _p printString_(" Generating matrices" << "\n");831 if(VerboseModule()) _printf0_(" Generating matrices" << "\n"); 832 832 833 833 /*retrive parameters: */ … … 1548 1548 /*Synthesize echo: {{{*/ 1549 1549 if(my_rank==0){ 1550 _print String_(" responses: " << d_numresponses << ": ");1551 for(i=0;i<d_numresponses-1;i++)_print String_(d_responses[i] << "|");1552 _print String_(d_responses[d_numresponses-1]);1553 _print String_("" << "\n");1550 _printf_(" responses: " << d_numresponses << ": "); 1551 for(i=0;i<d_numresponses-1;i++)_printf_(d_responses[i] << "|"); 1552 _printf_(d_responses[d_numresponses-1]); 1553 _printf_("" << "\n"); 1554 1554 } 1555 1555 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Hook.cpp
r15099 r15100 66 66 int i; 67 67 if (num){ 68 _print String_(" Hook: " << "\n");69 _print String_(" num=" << this->num << "\n");70 _print String_(" ids: ");71 for (i=0;i<this->num;i++) _print String_(this->ids[i] << " ");72 _print String_("" << "\n");73 _print String_(" offsets: ");74 for (i=0;i<this->num;i++) _print String_(this->offsets[i] << " ");75 _print String_("" << "\n");68 _printf_(" Hook: " << "\n"); 69 _printf_(" num=" << this->num << "\n"); 70 _printf_(" ids: "); 71 for (i=0;i<this->num;i++) _printf_(this->ids[i] << " "); 72 _printf_("" << "\n"); 73 _printf_(" offsets: "); 74 for (i=0;i<this->num;i++) _printf_(this->offsets[i] << " "); 75 _printf_("" << "\n"); 76 76 } 77 77 else{ 78 _print String_(" Hook: num=0 " << "\n");78 _printf_(" Hook: num=0 " << "\n"); 79 79 } 80 80 } … … 85 85 int i; 86 86 if (num){ 87 _print String_(" Hook: " << "\n");88 _print String_(" num=" << this->num << "\n");89 _print String_(" ids: ");90 for (i=0;i<this->num;i++) _print String_(this->ids[i] << " ");91 _print String_("" << "\n");92 _print String_(" offsets: ");93 for (i=0;i<this->num;i++) _print String_(this->offsets[i] << " ");94 _print String_("" << "\n");95 if (!objects) _print String_(" warning: object not hooked yet" << "\n");87 _printf_(" Hook: " << "\n"); 88 _printf_(" num=" << this->num << "\n"); 89 _printf_(" ids: "); 90 for (i=0;i<this->num;i++) _printf_(this->ids[i] << " "); 91 _printf_("" << "\n"); 92 _printf_(" offsets: "); 93 for (i=0;i<this->num;i++) _printf_(this->offsets[i] << " "); 94 _printf_("" << "\n"); 95 if (!objects) _printf_(" warning: object not hooked yet" << "\n"); 96 96 else{ 97 _print String_(" objects:\n ");97 _printf_(" objects:\n "); 98 98 for (i=0;i<this->num;i++){ 99 _print String_(" object " << i << "\n");99 _printf_(" object " << i << "\n"); 100 100 if(objects[i]) objects[i]->DeepEcho(); 101 else _print String_(" no object hooked yet (not configured)" << "\n");101 else _printf_(" no object hooked yet (not configured)" << "\n"); 102 102 } 103 103 } 104 104 } 105 105 else{ 106 _print String_(" Hook: num=0 " << "\n");106 _printf_(" Hook: num=0 " << "\n"); 107 107 } 108 108 } -
issm/trunk-jpl/src/c/classes/IndependentObject.cpp
r15099 r15100 41 41 void IndependentObject::Echo(void){ 42 42 43 _print String_("IndependentObject:" << "\n");44 _print String_(" name: " << EnumToStringx(this->name) << "\n");43 _printf_("IndependentObject:" << "\n"); 44 _printf_(" name: " << EnumToStringx(this->name) << "\n"); 45 45 if(this->type==0) 46 _print String_(" type: scalar" << "\n");46 _printf_(" type: scalar" << "\n"); 47 47 else if(this->type==1) 48 _print String_(" type: vertex" << "\n");48 _printf_(" type: vertex" << "\n"); 49 49 else 50 50 _error_(" unknown type: " << this->type); 51 _print String_(" numberofvertices: " << this->numberofvertices << "\n");51 _printf_(" numberofvertices: " << this->numberofvertices << "\n"); 52 52 } 53 53 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/BoolInput.cpp
r15099 r15100 40 40 void BoolInput::DeepEcho(void){ 41 41 42 _print String_("BoolInput:" << "\n");43 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");44 _print String_(" value: " <<(value?"true":"false") << "\n");42 _printf_("BoolInput:" << "\n"); 43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 44 _printf_(" value: " <<(value?"true":"false") << "\n"); 45 45 } 46 46 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/ControlInput.cpp
r15099 r15100 67 67 void ControlInput::DeepEcho(void){ 68 68 69 _print String_("ControlInput:" << "\n");70 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");71 _print String_("---values: " << "\n"); if (values) values->Echo();72 _print String_("---savedvalues: " << "\n");if (savedvalues) savedvalues->Echo();73 _print String_("---minvalues: " << "\n"); if (minvalues) minvalues->Echo();74 _print String_("---maxvalues: " << "\n"); if (maxvalues) maxvalues->Echo();75 _print String_("---gradient: " << "\n"); if (gradient) gradient->Echo();69 _printf_("ControlInput:" << "\n"); 70 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 71 _printf_("---values: " << "\n"); if (values) values->Echo(); 72 _printf_("---savedvalues: " << "\n");if (savedvalues) savedvalues->Echo(); 73 _printf_("---minvalues: " << "\n"); if (minvalues) minvalues->Echo(); 74 _printf_("---maxvalues: " << "\n"); if (maxvalues) maxvalues->Echo(); 75 _printf_("---gradient: " << "\n"); if (gradient) gradient->Echo(); 76 76 } 77 77 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/DatasetInput.cpp
r15099 r15100 42 42 void DatasetInput::DeepEcho(void){ 43 43 44 _print String_("DatasetInput:" << "\n");45 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");46 _print String_("---inputs: " << "\n"); inputs->Echo();44 _printf_("DatasetInput:" << "\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 46 _printf_("---inputs: " << "\n"); inputs->Echo(); 47 47 } 48 48 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/DoubleInput.cpp
r15099 r15100 40 40 void DoubleInput::DeepEcho(void){ 41 41 42 _print String_("DoubleInput:" << "\n");43 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");44 _print String_(" value: " << this->value << "\n");42 _printf_("DoubleInput:" << "\n"); 43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 44 _printf_(" value: " << this->value << "\n"); 45 45 } 46 46 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/IntInput.cpp
r15099 r15100 35 35 void IntInput::DeepEcho(void){ 36 36 37 _print String_("IntInput:" << "\n");38 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");39 _print String_(" value: " << (int)this->value << "\n");37 _printf_("IntInput:" << "\n"); 38 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 39 _printf_(" value: " << (int)this->value << "\n"); 40 40 } 41 41 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/PentaP1Input.cpp
r15099 r15100 51 51 void PentaP1Input::DeepEcho(void){ 52 52 53 _print String_("PentaP1Input:" << "\n");54 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");55 _print String_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << " " << this->values[3] << " " << this->values[4] << " " << this->values[5] << "]" << "\n");53 _printf_("PentaP1Input:" << "\n"); 54 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 55 _printf_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << " " << this->values[3] << " " << this->values[4] << " " << this->values[5] << "]" << "\n"); 56 56 } 57 57 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Inputs/TransientInput.cpp
r15099 r15100 61 61 int i; 62 62 63 _print String_("TransientInput:" << "\n");64 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");65 _print String_(" numtimesteps: " << this->numtimesteps << "\n");66 _print String_("---inputs: " << "\n");63 _printf_("TransientInput:" << "\n"); 64 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 65 _printf_(" numtimesteps: " << this->numtimesteps << "\n"); 66 _printf_("---inputs: " << "\n"); 67 67 for(i=0;i<this->numtimesteps;i++){ 68 _print String_(" time: " << this->timesteps[i] << " " << "\n");68 _printf_(" time: " << this->timesteps[i] << " " << "\n"); 69 69 ((Input*)this->inputs->GetObjectByOffset(i))->Echo(); 70 70 } -
issm/trunk-jpl/src/c/classes/Inputs/TriaP1Input.cpp
r15099 r15100 51 51 void TriaP1Input::DeepEcho(void){ 52 52 53 _print String_("TriaP1Input:" << "\n");54 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");55 _print String_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << "]" << "\n");53 _printf_("TriaP1Input:" << "\n"); 54 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 55 _printf_(" values: [" << this->values[0] << " " << this->values[1] << " " << this->values[2] << "]" << "\n"); 56 56 } 57 57 /*}}}*/ -
issm/trunk-jpl/src/c/classes/IoModel.cpp
r15099 r15100 84 84 for(int i=0;i<MaximumNumberOfEnums;i++){ 85 85 if(this->data[i]){ 86 _p printString_("Info: previous pointer of " << EnumToStringx(i) << " has not been freed (DeleteData has not been called)" << "\n");86 _printf0_("Info: previous pointer of " << EnumToStringx(i) << " has not been freed (DeleteData has not been called)" << "\n"); 87 87 } 88 88 } … … 125 125 else{ 126 126 if(record_enum!=MaximumNumberOfEnums){ 127 _p printString_("" << "\n");128 _p printString_("=========================================================================" << "\n");129 _p printString_(" Enums in marshalled file are not compatible with compiled code " << "\n");130 _p printString_(" " << "\n");131 _p printString_(" * If you are running ISSM on a remote cluster: " << "\n");132 _p printString_(" make sure that you are using the same version of ISSM on your local " << "\n");133 _p printString_(" machine and remote cluster (you might need to run svn update) " << "\n");134 _p printString_(" * If you are running ISSM on your local machine: " << "\n");135 _p printString_(" make sure that all the code is compiled (modules and executables) " << "\n");136 _p printString_(" * If you are a developer and just added a new Enum: " << "\n");137 _p printString_(" you might need to run ./Synchronize.sh in src/c/EnumDefinitions " << "\n");138 _p printString_(" and recompile " << "\n");139 _p printString_("=========================================================================" << "\n");140 _p printString_("" << "\n");127 _printf0_("" << "\n"); 128 _printf0_("=========================================================================" << "\n"); 129 _printf0_(" Enums in marshalled file are not compatible with compiled code " << "\n"); 130 _printf0_(" " << "\n"); 131 _printf0_(" * If you are running ISSM on a remote cluster: " << "\n"); 132 _printf0_(" make sure that you are using the same version of ISSM on your local " << "\n"); 133 _printf0_(" machine and remote cluster (you might need to run svn update) " << "\n"); 134 _printf0_(" * If you are running ISSM on your local machine: " << "\n"); 135 _printf0_(" make sure that all the code is compiled (modules and executables) " << "\n"); 136 _printf0_(" * If you are a developer and just added a new Enum: " << "\n"); 137 _printf0_(" you might need to run ./Synchronize.sh in src/c/EnumDefinitions " << "\n"); 138 _printf0_(" and recompile " << "\n"); 139 _printf0_("=========================================================================" << "\n"); 140 _printf0_("" << "\n"); 141 141 _error_("Enums not consistent (See error message above)"); 142 142 } -
issm/trunk-jpl/src/c/classes/Loads/Friction.cpp
r15099 r15100 43 43 /*FUNCTION Friction::Echo {{{*/ 44 44 void Friction::Echo(void){ 45 _print String_("Friction:" << "\n");46 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");47 _print String_(" element_type: " << this->element_type << "\n");45 _printf_("Friction:" << "\n"); 46 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 47 _printf_(" element_type: " << this->element_type << "\n"); 48 48 inputs->Echo(); 49 49 matpar->Echo(); -
issm/trunk-jpl/src/c/classes/Loads/Icefront.cpp
r15099 r15100 134 134 /*FUNCTION Icefront::Echo {{{*/ 135 135 void Icefront::Echo(void){ 136 _print String_("Icefront:" << "\n");137 _print String_(" id: " << id << "\n");138 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");136 _printf_("Icefront:" << "\n"); 137 _printf_(" id: " << id << "\n"); 138 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 139 139 hnodes->Echo(); 140 140 hvertices->Echo(); 141 141 helement->Echo(); 142 142 hmatpar->Echo(); 143 _print String_(" parameters: " << parameters << "\n");143 _printf_(" parameters: " << parameters << "\n"); 144 144 if(parameters)parameters->Echo(); 145 _print String_(" inputs: " << inputs << "\n");145 _printf_(" inputs: " << inputs << "\n"); 146 146 if(inputs)inputs->Echo(); 147 147 } … … 150 150 void Icefront::DeepEcho(void){ 151 151 152 _print String_("Icefront:" << "\n");153 _print String_(" id: " << id << "\n");154 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");152 _printf_("Icefront:" << "\n"); 153 _printf_(" id: " << id << "\n"); 154 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 155 155 hnodes->DeepEcho(); 156 156 hvertices->DeepEcho(); 157 157 helement->DeepEcho(); 158 158 hmatpar->DeepEcho(); 159 _print String_(" parameters: " << parameters << "\n");159 _printf_(" parameters: " << parameters << "\n"); 160 160 if(parameters)parameters->DeepEcho(); 161 _print String_(" inputs: " << inputs << "\n");161 _printf_(" inputs: " << inputs << "\n"); 162 162 if(inputs)inputs->DeepEcho(); 163 163 } -
issm/trunk-jpl/src/c/classes/Loads/Numericalflux.cpp
r15099 r15100 155 155 /*FUNCTION Numericalflux::Echo {{{*/ 156 156 void Numericalflux::Echo(void){ 157 _print String_("Numericalflux:" << "\n");158 _print String_(" id: " << id << "\n");159 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");157 _printf_("Numericalflux:" << "\n"); 158 _printf_(" id: " << id << "\n"); 159 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 160 160 hnodes->Echo(); 161 161 hvertices->Echo(); 162 162 helement->Echo(); 163 _print String_(" parameters: " << parameters << "\n");164 _print String_(" inputs: " << inputs << "\n");163 _printf_(" parameters: " << parameters << "\n"); 164 _printf_(" inputs: " << inputs << "\n"); 165 165 } 166 166 /*}}}*/ … … 168 168 void Numericalflux::DeepEcho(void){ 169 169 170 _print String_("Numericalflux:" << "\n");171 _print String_(" id: " << id << "\n");172 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");170 _printf_("Numericalflux:" << "\n"); 171 _printf_(" id: " << id << "\n"); 172 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 173 173 hnodes->DeepEcho(); 174 174 hvertices->DeepEcho(); 175 175 helement->DeepEcho(); 176 _print String_(" parameters" << "\n");176 _printf_(" parameters" << "\n"); 177 177 if(parameters) 178 178 parameters->DeepEcho(); 179 179 else 180 _print String_(" NULL" << "\n");181 _print String_(" inputs" << "\n");180 _printf_(" NULL" << "\n"); 181 _printf_(" inputs" << "\n"); 182 182 inputs->DeepEcho(); 183 183 -
issm/trunk-jpl/src/c/classes/Loads/Pengrid.cpp
r15099 r15100 103 103 void Pengrid::DeepEcho(void){ 104 104 105 _print String_("Pengrid:" << "\n");106 _print String_(" id: " << id << "\n");107 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");105 _printf_("Pengrid:" << "\n"); 106 _printf_(" id: " << id << "\n"); 107 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 108 108 hnode->DeepEcho(); 109 109 helement->DeepEcho(); 110 110 hmatpar->DeepEcho(); 111 _print String_(" active " << this->active << "\n");112 _print String_(" zigzag_counter " << this->zigzag_counter << "\n");113 _print String_(" parameters" << "\n");111 _printf_(" active " << this->active << "\n"); 112 _printf_(" zigzag_counter " << this->zigzag_counter << "\n"); 113 _printf_(" parameters" << "\n"); 114 114 parameters->DeepEcho(); 115 _print String_(" inputs" << "\n");115 _printf_(" inputs" << "\n"); 116 116 inputs->DeepEcho(); 117 117 } -
issm/trunk-jpl/src/c/classes/Loads/Penpair.cpp
r15099 r15100 51 51 void Penpair::Echo(void){ 52 52 53 _print String_("Penpair:" << "\n");54 _print String_(" id: " << id << "\n");55 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");53 _printf_("Penpair:" << "\n"); 54 _printf_(" id: " << id << "\n"); 55 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 56 56 hnodes->Echo(); 57 57 … … 62 62 void Penpair::DeepEcho(void){ 63 63 64 _print String_("Penpair:" << "\n");65 _print String_(" id: " << id << "\n");66 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");64 _printf_("Penpair:" << "\n"); 65 _printf_(" id: " << id << "\n"); 66 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 67 67 hnodes->DeepEcho(); 68 68 -
issm/trunk-jpl/src/c/classes/Loads/Riftfront.cpp
r15099 r15100 138 138 input=(Input*)this->inputs->GetInput(FractionIncrementEnum); input->GetInputValue(&fractionincrement); 139 139 140 _print String_("Riftfront:" << "\n");141 _print String_(" id: " << id << "\n");142 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");143 _print String_(" hnodes: " << hnodes << "\n");144 _print String_(" helements: " << helements << "\n");145 _print String_(" hmatpar: " << hmatpar << "\n");146 _print String_(" parameters: " << parameters << "\n");147 _print String_(" inputs: " << inputs << "\n");148 _print String_(" internal parameters: " << "\n");149 _print String_(" normal: " << normal[0] << "|" << normal[1] << "\n");150 _print String_(" length: " << length << "\n");151 _print String_(" penalty_lock: " << penalty_lock << "\n");152 _print String_(" active: " <<(active ? "true":"false") << "\n");153 _print String_(" counter: " << counter << "\n");154 _print String_(" prestable: " << (prestable ? "true":"false") << "\n");155 _print String_(" material_converged: " << (material_converged ? "true":"false") << "\n");156 _print String_(" fill: " << fill << "\n");157 _print String_(" friction: " << friction << "\n");158 _print String_(" fraction: " << fraction << "\n");159 _print String_(" fractionincrement: " << fractionincrement << "\n");160 _print String_(" state: " << state << "\n");161 _print String_(" frozen: " << (frozen ? "true":"false") << "\n");140 _printf_("Riftfront:" << "\n"); 141 _printf_(" id: " << id << "\n"); 142 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 143 _printf_(" hnodes: " << hnodes << "\n"); 144 _printf_(" helements: " << helements << "\n"); 145 _printf_(" hmatpar: " << hmatpar << "\n"); 146 _printf_(" parameters: " << parameters << "\n"); 147 _printf_(" inputs: " << inputs << "\n"); 148 _printf_(" internal parameters: " << "\n"); 149 _printf_(" normal: " << normal[0] << "|" << normal[1] << "\n"); 150 _printf_(" length: " << length << "\n"); 151 _printf_(" penalty_lock: " << penalty_lock << "\n"); 152 _printf_(" active: " <<(active ? "true":"false") << "\n"); 153 _printf_(" counter: " << counter << "\n"); 154 _printf_(" prestable: " << (prestable ? "true":"false") << "\n"); 155 _printf_(" material_converged: " << (material_converged ? "true":"false") << "\n"); 156 _printf_(" fill: " << fill << "\n"); 157 _printf_(" friction: " << friction << "\n"); 158 _printf_(" fraction: " << fraction << "\n"); 159 _printf_(" fractionincrement: " << fractionincrement << "\n"); 160 _printf_(" state: " << state << "\n"); 161 _printf_(" frozen: " << (frozen ? "true":"false") << "\n"); 162 162 163 163 } … … 166 166 void Riftfront::DeepEcho(void){ 167 167 168 _print String_("Riftfront:" << "\n");169 _print String_(" id: " << id << "\n");170 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");168 _printf_("Riftfront:" << "\n"); 169 _printf_(" id: " << id << "\n"); 170 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 171 171 hnodes->DeepEcho(); 172 172 helements->DeepEcho(); 173 173 hmatpar->DeepEcho(); 174 _print String_(" parameters" << "\n");174 _printf_(" parameters" << "\n"); 175 175 if(parameters)parameters->DeepEcho(); 176 _print String_(" inputs" << "\n");176 _printf_(" inputs" << "\n"); 177 177 if(inputs)inputs->DeepEcho(); 178 178 } … … 687 687 this->fraction+=fractionincrement; 688 688 if (this->fraction>1)this->fraction=(IssmDouble)1.0; 689 //_print String_("riftfront " << this->Id() << " fraction: " << this->fraction << "\n");689 //_printf_("riftfront " << this->Id() << " fraction: " << this->fraction << "\n"); 690 690 } 691 691 … … 702 702 this->active=activate; 703 703 704 //if ((penetration>0) && (this->active==1))_print String_("Riftfront " << Id() << " wants to be released" << "\n");704 //if ((penetration>0) && (this->active==1))_printf_("Riftfront " << Id() << " wants to be released" << "\n"); 705 705 706 706 /*assign output pointer: */ -
issm/trunk-jpl/src/c/classes/Materials/Matdamageice.cpp
r15099 r15100 55 55 void Matdamageice::Echo(void){ 56 56 57 _print String_("Matdamageice:" << "\n");58 _print String_(" mid: " << mid << "\n");59 _print String_(" inputs:" << "\n");57 _printf_("Matdamageice:" << "\n"); 58 _printf_(" mid: " << mid << "\n"); 59 _printf_(" inputs:" << "\n"); 60 60 inputs->Echo(); 61 _print String_(" element:" << "\n");61 _printf_(" element:" << "\n"); 62 62 helement->Echo(); 63 63 } … … 66 66 void Matdamageice::DeepEcho(void){ 67 67 68 _print String_("Matdamageice:" << "\n");69 _print String_(" mid: " << mid << "\n");70 _print String_(" inputs:" << "\n");68 _printf_("Matdamageice:" << "\n"); 69 _printf_(" mid: " << mid << "\n"); 70 _printf_(" inputs:" << "\n"); 71 71 inputs->DeepEcho(); 72 _print String_(" element:" << "\n");72 _printf_(" element:" << "\n"); 73 73 helement->Echo(); 74 74 } -
issm/trunk-jpl/src/c/classes/Materials/Matice.cpp
r15099 r15100 69 69 void Matice::Echo(void){ 70 70 71 _print String_("Matice:" << "\n");72 _print String_(" mid: " << mid << "\n");73 _print String_(" inputs:" << "\n");71 _printf_("Matice:" << "\n"); 72 _printf_(" mid: " << mid << "\n"); 73 _printf_(" inputs:" << "\n"); 74 74 inputs->Echo(); 75 _print String_(" element:" << "\n");75 _printf_(" element:" << "\n"); 76 76 helement->Echo(); 77 77 } … … 80 80 void Matice::DeepEcho(void){ 81 81 82 _print String_("Matice:" << "\n");83 _print String_(" mid: " << mid << "\n");84 _print String_(" inputs:" << "\n");82 _printf_("Matice:" << "\n"); 83 _printf_(" mid: " << mid << "\n"); 84 _printf_(" inputs:" << "\n"); 85 85 inputs->DeepEcho(); 86 _print String_(" element:" << "\n");86 _printf_(" element:" << "\n"); 87 87 helement->Echo(); 88 88 } -
issm/trunk-jpl/src/c/classes/Materials/Matpar.cpp
r15099 r15100 95 95 void Matpar::Echo(void){ 96 96 97 _print String_("Matpar:" << "\n");98 _print String_(" mid: " << mid << "\n");99 _print String_(" rho_ice: " << rho_ice << "\n");100 _print String_(" rho_water: " << rho_water << "\n");101 _print String_(" rho_freshwater: " << rho_freshwater << "\n");102 _print String_(" mu_water: " << mu_water << "\n");103 _print String_(" heatcapacity: " << heatcapacity << "\n");104 _print String_(" thermalconductivity: " << thermalconductivity << "\n");105 _print String_(" latentheat: " << latentheat << "\n");106 _print String_(" beta: " << beta << "\n");107 _print String_(" meltingpoint: " << meltingpoint << "\n");108 _print String_(" referencetemperature: " << referencetemperature << "\n");109 _print String_(" mixed_layer_capacity: " << mixed_layer_capacity << "\n");110 _print String_(" thermal_exchange_velocity: " << thermal_exchange_velocity << "\n");111 _print String_(" g: " << g << "\n");112 _print String_(" desfac: " << desfac << "\n");113 _print String_(" s0p: " << s0p << "\n");97 _printf_("Matpar:" << "\n"); 98 _printf_(" mid: " << mid << "\n"); 99 _printf_(" rho_ice: " << rho_ice << "\n"); 100 _printf_(" rho_water: " << rho_water << "\n"); 101 _printf_(" rho_freshwater: " << rho_freshwater << "\n"); 102 _printf_(" mu_water: " << mu_water << "\n"); 103 _printf_(" heatcapacity: " << heatcapacity << "\n"); 104 _printf_(" thermalconductivity: " << thermalconductivity << "\n"); 105 _printf_(" latentheat: " << latentheat << "\n"); 106 _printf_(" beta: " << beta << "\n"); 107 _printf_(" meltingpoint: " << meltingpoint << "\n"); 108 _printf_(" referencetemperature: " << referencetemperature << "\n"); 109 _printf_(" mixed_layer_capacity: " << mixed_layer_capacity << "\n"); 110 _printf_(" thermal_exchange_velocity: " << thermal_exchange_velocity << "\n"); 111 _printf_(" g: " << g << "\n"); 112 _printf_(" desfac: " << desfac << "\n"); 113 _printf_(" s0p: " << s0p << "\n"); 114 114 return; 115 115 } -
issm/trunk-jpl/src/c/classes/Node.cpp
r15099 r15100 155 155 void Node::Echo(void){ 156 156 157 _print String_("Node:" << "\n");158 _print String_(" id: " << id << "\n");159 _print String_(" sid: " << sid << "\n");160 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");157 _printf_("Node:" << "\n"); 158 _printf_(" id: " << id << "\n"); 159 _printf_(" sid: " << sid << "\n"); 160 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 161 161 indexing.Echo(); 162 _print String_(" hvertex: not displayed" << "\n");163 _print String_(" inputs: " << inputs << "\n");162 _printf_(" hvertex: not displayed" << "\n"); 163 _printf_(" inputs: " << inputs << "\n"); 164 164 165 165 } … … 168 168 void Node::DeepEcho(void){ 169 169 170 _print String_("Node:" << "\n");171 _print String_(" id: " << id << "\n");172 _print String_(" sid: " << sid << "\n");173 _print String_(" analysis_type: " << EnumToStringx(analysis_type) << "\n");170 _printf_("Node:" << "\n"); 171 _printf_(" id: " << id << "\n"); 172 _printf_(" sid: " << sid << "\n"); 173 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 174 174 indexing.DeepEcho(); 175 _print String_("Vertex:" << "\n");175 _printf_("Vertex:" << "\n"); 176 176 hvertex->DeepEcho(); 177 _print String_(" inputs" << "\n");177 _printf_(" inputs" << "\n"); 178 178 179 179 } -
issm/trunk-jpl/src/c/classes/Options/GenericOption.h
r15099 r15100 64 64 bool flag=true; 65 65 66 if(flag) _p printString_(indent << " name: \"" << name << "\"" << "\n");67 if(flag) _p printString_(indent << " numel: " << numel << "\n");68 if(flag) _p printString_(indent << " ndims: " << ndims << "\n");66 if(flag) _printf0_(indent << " name: \"" << name << "\"" << "\n"); 67 if(flag) _printf0_(indent << " numel: " << numel << "\n"); 68 if(flag) _printf0_(indent << " ndims: " << ndims << "\n"); 69 69 if(size){ 70 70 StringFromSize(cstr,size,ndims); 71 if(flag) _p printString_(indent << " size: " << cstr << "\n");71 if(flag) _printf0_(indent << " size: " << cstr << "\n"); 72 72 } 73 else if(flag) _p printString_(indent << " size: [empty]" << "\n");74 _print String_(indent << " value: " << value << "\n");;73 else if(flag) _printf0_(indent << " size: [empty]" << "\n"); 74 _printf_(indent << " value: " << value << "\n");; 75 75 } /*}}}*/ 76 76 int Id(){/*{{{*/ -
issm/trunk-jpl/src/c/classes/Options/Options.h
r15099 r15100 64 64 } 65 65 else{ 66 if(GetOption(name)) _print String_("WARNING: option "<<name<<" found but fetched format not consistent, defaulting..." << "\n");66 if(GetOption(name)) _printf_("WARNING: option "<<name<<" found but fetched format not consistent, defaulting..." << "\n"); 67 67 *pvalue=default_value; 68 68 } -
issm/trunk-jpl/src/c/classes/Params/BoolParam.cpp
r15099 r15100 43 43 void BoolParam::DeepEcho(void){ 44 44 45 _print String_("BoolParam:" << "\n");46 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");47 _print String_(" value: " <<(this->value?"true":"false") << "\n");45 _printf_("BoolParam:" << "\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 47 _printf_(" value: " <<(this->value?"true":"false") << "\n"); 48 48 } 49 49 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Params/DataSetParam.cpp
r15099 r15100 44 44 void DataSetParam::DeepEcho(void){ 45 45 46 _print String_("DataSetParam:" << "\n");47 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");46 _printf_("DataSetParam:" << "\n"); 47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 48 48 this->value->Echo(); 49 49 } -
issm/trunk-jpl/src/c/classes/Params/DoubleMatArrayParam.cpp
r15099 r15100 82 82 void DoubleMatArrayParam::Echo(void){ 83 83 84 _print String_("DoubleMatArrayParam:" << "\n");85 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");86 _print String_(" array size: " << this->M << "\n");87 _print String_(" array pointer: " << this->array << "\n");84 _printf_("DoubleMatArrayParam:" << "\n"); 85 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 86 _printf_(" array size: " << this->M << "\n"); 87 _printf_(" array pointer: " << this->array << "\n"); 88 88 89 89 } … … 96 96 IssmDouble* matrix=NULL; 97 97 98 _print String_("DoubleMatArrayParam:" << "\n");99 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");100 _print String_(" array size: " << this->M << "\n");101 for(i=0;i<M;i++){ 102 _print String_(" array " << i << " (" << mdim_array[i] << "x" << ndim_array[i] << "):" << "\n");98 _printf_("DoubleMatArrayParam:" << "\n"); 99 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 100 _printf_(" array size: " << this->M << "\n"); 101 for(i=0;i<M;i++){ 102 _printf_(" array " << i << " (" << mdim_array[i] << "x" << ndim_array[i] << "):" << "\n"); 103 103 matrix=array[i]; 104 104 m=mdim_array[i]; … … 106 106 107 107 for(j=0;j<m;j++){ 108 _print String_(" ");109 for(k=0;k<n;k++)_print String_(*(matrix+n*j+k) << " ");110 _print String_("" << "\n");108 _printf_(" "); 109 for(k=0;k<n;k++)_printf_(*(matrix+n*j+k) << " "); 110 _printf_("" << "\n"); 111 111 } 112 112 } -
issm/trunk-jpl/src/c/classes/Params/DoubleMatParam.cpp
r15099 r15100 43 43 void DoubleMatParam::Echo(void){ 44 44 45 _print String_("DoubleMatParam:" << "\n");46 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");47 _print String_(" matrix size: " << this->M << "x" << this->N << "\n");45 _printf_("DoubleMatParam:" << "\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 47 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 48 48 49 49 } … … 54 54 int i,j; 55 55 56 _print String_("DoubleMatParam:" << "\n");57 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");58 _print String_(" matrix size: " << this->M << "x" << this->N << "\n");56 _printf_("DoubleMatParam:" << "\n"); 57 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 58 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 59 59 for(i=0;i<this->M;i++){ 60 60 for(i=0;i<this->N;i++){ 61 _print String_(i << " " << j << " " << *(this->value+N*i+j) << "\n");61 _printf_(i << " " << j << " " << *(this->value+N*i+j) << "\n"); 62 62 } 63 63 } -
issm/trunk-jpl/src/c/classes/Params/DoubleParam.cpp
r15099 r15100 40 40 void DoubleParam::DeepEcho(void){ 41 41 42 _print String_("DoubleParam:" << "\n");43 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");44 _print String_(" value: " << this->value << "\n");42 _printf_("DoubleParam:" << "\n"); 43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 44 _printf_(" value: " << this->value << "\n"); 45 45 } 46 46 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Params/DoubleVecParam.cpp
r15099 r15100 42 42 void DoubleVecParam::Echo(void){ 43 43 44 _print String_("DoubleVecParam:" << "\n");45 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");46 _print String_(" vector size: " << this->M << "\n");44 _printf_("DoubleVecParam:" << "\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 46 _printf_(" vector size: " << this->M << "\n"); 47 47 48 48 } … … 53 53 int i; 54 54 55 _print String_("DoubleVecParam:" << "\n");56 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");57 _print String_(" vector size: " << this->M << "\n");55 _printf_("DoubleVecParam:" << "\n"); 56 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 57 _printf_(" vector size: " << this->M << "\n"); 58 58 for(i=0;i<this->M;i++){ 59 _print String_(i << " " << this->values[i] << "\n");59 _printf_(i << " " << this->values[i] << "\n"); 60 60 } 61 61 } -
issm/trunk-jpl/src/c/classes/Params/FileParam.cpp
r15099 r15100 43 43 void FileParam::DeepEcho(void){ 44 44 45 _print String_("FileParam:" << "\n");46 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");47 _print String_(" value: " << this->value << "\n");45 _printf_("FileParam:" << "\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 47 _printf_(" value: " << this->value << "\n"); 48 48 } 49 49 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Params/GenericParam.h
r15099 r15100 39 39 // that any structured P must provide the friend << operator 40 40 void DeepEcho() { 41 _print String_("GenericParam:" << "\n");42 _print String_(" enum: " << myEnumVal << " (" << EnumToStringx(myEnumVal) << ")" << "\n");43 _print String_(" value: " << myP << "\n");;41 _printf_("GenericParam:" << "\n"); 42 _printf_(" enum: " << myEnumVal << " (" << EnumToStringx(myEnumVal) << ")" << "\n"); 43 _printf_(" value: " << myP << "\n");; 44 44 } 45 45 void Echo() {DeepEcho();}; -
issm/trunk-jpl/src/c/classes/Params/IntMatParam.cpp
r15099 r15100 43 43 void IntMatParam::Echo(void){ 44 44 45 _print String_("IntMatParam:" << "\n");46 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");47 _print String_(" matrix size: " << this->M << "x" << this->N << "\n");45 _printf_("IntMatParam:" << "\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 47 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 48 48 49 49 } … … 54 54 int i,j; 55 55 56 _print String_("IntMatParam:" << "\n");57 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");58 _print String_(" matrix size: " << this->M << "x" << this->N << "\n");56 _printf_("IntMatParam:" << "\n"); 57 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 58 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 59 59 for(i=0;i<this->M;i++){ 60 60 for(i=0;i<this->N;i++){ 61 _print String_("(" << i << "," << j << ") " << *(this->value+N*i+j) << "\n");61 _printf_("(" << i << "," << j << ") " << *(this->value+N*i+j) << "\n"); 62 62 } 63 63 } -
issm/trunk-jpl/src/c/classes/Params/IntParam.cpp
r15099 r15100 43 43 void IntParam::DeepEcho(void){ 44 44 45 _print String_("IntParam:" << "\n");46 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");47 _print String_(" value: " << this->value << "\n");45 _printf_("IntParam:" << "\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 47 _printf_(" value: " << this->value << "\n"); 48 48 } 49 49 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Params/IntVecParam.cpp
r15099 r15100 58 58 void IntVecParam::Echo(void){ 59 59 60 _print String_("IntVecParam:" << "\n");61 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");62 _print String_(" vector size: " << this->M << "\n");60 _printf_("IntVecParam:" << "\n"); 61 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 62 _printf_(" vector size: " << this->M << "\n"); 63 63 64 64 } … … 69 69 int i; 70 70 71 _print String_("IntVecParam:" << "\n");72 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");73 _print String_(" vector size: " << this->M << "\n");71 _printf_("IntVecParam:" << "\n"); 72 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 73 _printf_(" vector size: " << this->M << "\n"); 74 74 for(i=0;i<this->M;i++){ 75 _print String_(i << " " << this->values[i] << "\n");75 _printf_(i << " " << this->values[i] << "\n"); 76 76 } 77 77 } -
issm/trunk-jpl/src/c/classes/Params/MatrixParam.cpp
r15099 r15100 42 42 void MatrixParam::Echo(void){ 43 43 44 _print String_("MatrixParam:" << "\n");45 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");44 _printf_("MatrixParam:" << "\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 46 46 47 47 } … … 50 50 void MatrixParam::DeepEcho(void){ 51 51 52 _print String_("MatrixParam:" << "\n");53 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");52 _printf_("MatrixParam:" << "\n"); 53 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 54 54 this->value->Echo(); 55 55 } -
issm/trunk-jpl/src/c/classes/Params/StringArrayParam.cpp
r15099 r15100 70 70 char* string=NULL; 71 71 72 _print String_("StringArrayParam:" << "\n");73 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");72 _printf_("StringArrayParam:" << "\n"); 73 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 74 74 for(i=0;i<this->numstrings;i++){ 75 75 string=this->value[i]; 76 _print String_(" " << i << ": " << string << "\n");76 _printf_(" " << i << ": " << string << "\n"); 77 77 } 78 78 } -
issm/trunk-jpl/src/c/classes/Params/StringParam.cpp
r15099 r15100 44 44 /*FUNCTION StringParam::DeepEcho{{{*/ 45 45 void StringParam::DeepEcho(void){ 46 _print String_("StringParam:" << "\n");47 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");48 _print String_(" value: " << this->value << "\n");46 _printf_("StringParam:" << "\n"); 47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 48 _printf_(" value: " << this->value << "\n"); 49 49 } 50 50 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Params/TransientParam.cpp
r15099 r15100 47 47 void TransientParam::Echo(void){ 48 48 49 _print String_("TransientParam:" << "\n");50 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");51 _print String_(" size: " << this->N << "\n");49 _printf_("TransientParam:" << "\n"); 50 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 51 _printf_(" size: " << this->N << "\n"); 52 52 53 53 } … … 56 56 void TransientParam::DeepEcho(void){ 57 57 58 _print String_("TransientParam:" << "\n");59 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");60 _print String_(" size: " << this->N << "\n");58 _printf_("TransientParam:" << "\n"); 59 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 60 _printf_(" size: " << this->N << "\n"); 61 61 for(int i=0;i<this->N;i++){ 62 _print String_( "time: " << this->timesteps[i] << " value: " << this->values[i] << "\n");62 _printf_( "time: " << this->timesteps[i] << " value: " << this->values[i] << "\n"); 63 63 } 64 64 } -
issm/trunk-jpl/src/c/classes/Params/VectorParam.cpp
r15099 r15100 44 44 void VectorParam::Echo(void){ 45 45 46 _print String_("VectorParam:" << "\n");47 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");46 _printf_("VectorParam:" << "\n"); 47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 48 48 49 49 } … … 52 52 void VectorParam::DeepEcho(void){ 53 53 54 _print String_("VectorParam:" << "\n");55 _print String_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n");54 _printf_("VectorParam:" << "\n"); 55 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")" << "\n"); 56 56 value->Echo(); 57 57 } -
issm/trunk-jpl/src/c/classes/Profiler.cpp
r15099 r15100 36 36 void Profiler::Echo(void){ 37 37 38 _print String_("Profiler:" << "\n");39 _print String_(" time tags: " << "\n");38 _printf_("Profiler:" << "\n"); 39 _printf_(" time tags: " << "\n"); 40 40 this->time->Echo(); 41 41 … … 45 45 void Profiler::DeepEcho(void){ 46 46 47 _print String_("Profiler:" << "\n");48 _print String_(" time tags: " << "\n");47 _printf_("Profiler:" << "\n"); 48 _printf_(" time tags: " << "\n"); 49 49 this->time->DeepEcho(); 50 50 -
issm/trunk-jpl/src/c/classes/Segment.h
r15099 r15100 52 52 void Echo(void){ 53 53 54 _print String_("Segment:" << "\n");55 _print String_(" eid: " << eid << "\n");56 _print String_(" node 1: " << this->x1 << "|" << this->y1 << "\n");57 _print String_(" node 2: " << this->x2 << "|" << this->y2 << "\n");54 _printf_("Segment:" << "\n"); 55 _printf_(" eid: " << eid << "\n"); 56 _printf_(" node 1: " << this->x1 << "|" << this->y1 << "\n"); 57 _printf_(" node 2: " << this->x2 << "|" << this->y2 << "\n"); 58 58 59 59 } -
issm/trunk-jpl/src/c/classes/Vertex.cpp
r15099 r15100 62 62 void Vertex::Echo(void){ 63 63 64 _print String_("Vertex:" << "\n");65 _print String_(" id: " << id << "\n");66 _print String_(" sid: " << sid << "\n");67 _print String_(" pid: " << pid << "\n");68 _print String_(" x: " << x << "\n");69 _print String_(" y: " << y << "\n");70 _print String_(" z: " << z << "\n");71 _print String_(" sigma: " << sigma << "\n");72 _print String_(" connectivity: " << connectivity << "\n");73 _print String_(" clone: " << clone << "\n");64 _printf_("Vertex:" << "\n"); 65 _printf_(" id: " << id << "\n"); 66 _printf_(" sid: " << sid << "\n"); 67 _printf_(" pid: " << pid << "\n"); 68 _printf_(" x: " << x << "\n"); 69 _printf_(" y: " << y << "\n"); 70 _printf_(" z: " << z << "\n"); 71 _printf_(" sigma: " << sigma << "\n"); 72 _printf_(" connectivity: " << connectivity << "\n"); 73 _printf_(" clone: " << clone << "\n"); 74 74 75 75 return; -
issm/trunk-jpl/src/c/classes/gauss/GaussPenta.cpp
r15099 r15100 251 251 void GaussPenta::Echo(void){ 252 252 253 _print String_("GaussPenta:" << "\n");254 _print String_(" numgauss: " << numgauss << "\n");253 _printf_("GaussPenta:" << "\n"); 254 _printf_(" numgauss: " << numgauss << "\n"); 255 255 256 256 if (weights){ 257 _print String_(" weights = [");258 for(int i=0;i<numgauss;i++) _print String_(" " << weights[i] << "\n");259 _print String_("]" << "\n");260 } 261 else _print String_("weights = NULL" << "\n");257 _printf_(" weights = ["); 258 for(int i=0;i<numgauss;i++) _printf_(" " << weights[i] << "\n"); 259 _printf_("]" << "\n"); 260 } 261 else _printf_("weights = NULL" << "\n"); 262 262 if (coords1){ 263 _print String_(" coords1 = [");264 for(int i=0;i<numgauss;i++) _print String_(" " << coords1[i] << "\n");265 _print String_("]" << "\n");266 } 267 else _print String_("coords1 = NULL" << "\n");263 _printf_(" coords1 = ["); 264 for(int i=0;i<numgauss;i++) _printf_(" " << coords1[i] << "\n"); 265 _printf_("]" << "\n"); 266 } 267 else _printf_("coords1 = NULL" << "\n"); 268 268 if (coords2){ 269 _print String_(" coords2 = [");270 for(int i=0;i<numgauss;i++) _print String_(" " << coords2[i] << "\n");271 _print String_("]" << "\n");272 } 273 else _print String_("coords2 = NULL" << "\n");269 _printf_(" coords2 = ["); 270 for(int i=0;i<numgauss;i++) _printf_(" " << coords2[i] << "\n"); 271 _printf_("]" << "\n"); 272 } 273 else _printf_("coords2 = NULL" << "\n"); 274 274 if (coords3){ 275 _print String_(" coords3 = [");276 for(int i=0;i<numgauss;i++) _print String_(" " << coords3[i] << "\n");277 _print String_("]" << "\n");278 } 279 else _print String_("coords3 = NULL" << "\n");275 _printf_(" coords3 = ["); 276 for(int i=0;i<numgauss;i++) _printf_(" " << coords3[i] << "\n"); 277 _printf_("]" << "\n"); 278 } 279 else _printf_("coords3 = NULL" << "\n"); 280 280 if (coords4){ 281 _print String_(" coords4 = [");282 for(int i=0;i<numgauss;i++) _print String_(" " << coords4[i] << "\n");283 _print String_("]" << "\n");284 } 285 else _print String_("coords4 = NULL" << "\n");286 287 _print String_(" weight = " << weight << "\n");288 _print String_(" coord1 = " << coord1 << "\n");289 _print String_(" coord2 = " << coord2 << "\n");290 _print String_(" coord3 = " << coord3 << "\n");291 _print String_(" coord4 = " << coord4 << "\n");281 _printf_(" coords4 = ["); 282 for(int i=0;i<numgauss;i++) _printf_(" " << coords4[i] << "\n"); 283 _printf_("]" << "\n"); 284 } 285 else _printf_("coords4 = NULL" << "\n"); 286 287 _printf_(" weight = " << weight << "\n"); 288 _printf_(" coord1 = " << coord1 << "\n"); 289 _printf_(" coord2 = " << coord2 << "\n"); 290 _printf_(" coord3 = " << coord3 << "\n"); 291 _printf_(" coord4 = " << coord4 << "\n"); 292 292 293 293 } -
issm/trunk-jpl/src/c/classes/gauss/GaussTria.cpp
r15099 r15100 263 263 void GaussTria::Echo(void){ 264 264 265 _print String_("GaussTria:" << "\n");266 _print String_(" numgauss: " << numgauss << "\n");265 _printf_("GaussTria:" << "\n"); 266 _printf_(" numgauss: " << numgauss << "\n"); 267 267 268 268 if (weights){ 269 _print String_(" weights = [");270 for(int i=0;i<numgauss;i++) _print String_(" " << weights[i] << "\n");271 _print String_("]" << "\n");272 } 273 else _print String_("weights = NULL" << "\n");269 _printf_(" weights = ["); 270 for(int i=0;i<numgauss;i++) _printf_(" " << weights[i] << "\n"); 271 _printf_("]" << "\n"); 272 } 273 else _printf_("weights = NULL" << "\n"); 274 274 if (coords1){ 275 _print String_(" coords1 = [");276 for(int i=0;i<numgauss;i++) _print String_(" " << coords1[i] << "\n");277 _print String_("]" << "\n");278 } 279 else _print String_("coords1 = NULL" << "\n");275 _printf_(" coords1 = ["); 276 for(int i=0;i<numgauss;i++) _printf_(" " << coords1[i] << "\n"); 277 _printf_("]" << "\n"); 278 } 279 else _printf_("coords1 = NULL" << "\n"); 280 280 if (coords2){ 281 _print String_(" coords2 = [");282 for(int i=0;i<numgauss;i++) _print String_(" " << coords2[i] << "\n");283 _print String_("]" << "\n");284 } 285 else _print String_("coords2 = NULL" << "\n");281 _printf_(" coords2 = ["); 282 for(int i=0;i<numgauss;i++) _printf_(" " << coords2[i] << "\n"); 283 _printf_("]" << "\n"); 284 } 285 else _printf_("coords2 = NULL" << "\n"); 286 286 if (coords3){ 287 _print String_(" coords3 = [");288 for(int i=0;i<numgauss;i++) _print String_(" " << coords3[i] << "\n");289 _print String_("]" << "\n");290 } 291 else _print String_("coords3 = NULL" << "\n");292 293 _print String_(" weight = " << weight << "\n");294 _print String_(" coord1 = " << coord1 << "\n");295 _print String_(" coord2 = " << coord2 << "\n");296 _print String_(" coord3 = " << coord3 << "\n");287 _printf_(" coords3 = ["); 288 for(int i=0;i<numgauss;i++) _printf_(" " << coords3[i] << "\n"); 289 _printf_("]" << "\n"); 290 } 291 else _printf_("coords3 = NULL" << "\n"); 292 293 _printf_(" weight = " << weight << "\n"); 294 _printf_(" coord1 = " << coord1 << "\n"); 295 _printf_(" coord2 = " << coord2 << "\n"); 296 _printf_(" coord3 = " << coord3 << "\n"); 297 297 298 298 } -
issm/trunk-jpl/src/c/classes/kriging/ExponentialVariogram.cpp
r15099 r15100 47 47 /*FUNCTION ExponentialVariogram::Echo {{{*/ 48 48 void ExponentialVariogram::Echo(void){ 49 _print String_("ExponentialVariogram" << "\n");50 _print String_(" nugget: " << this->nugget << "\n");51 _print String_(" sill : " << this->sill << "\n");52 _print String_(" range : " << this->range << "\n");49 _printf_("ExponentialVariogram" << "\n"); 50 _printf_(" nugget: " << this->nugget << "\n"); 51 _printf_(" sill : " << this->sill << "\n"); 52 _printf_(" range : " << this->range << "\n"); 53 53 } 54 54 /*}}}*/ -
issm/trunk-jpl/src/c/classes/kriging/GaussianVariogram.cpp
r15099 r15100 47 47 /*FUNCTION GaussianVariogram::Echo {{{*/ 48 48 void GaussianVariogram::Echo(void){ 49 _print String_("GaussianVariogram" << "\n");50 _print String_(" nugget: " << this->nugget << "\n");51 _print String_(" sill : " << this->sill << "\n");52 _print String_(" range : " << this->range << "\n");49 _printf_("GaussianVariogram" << "\n"); 50 _printf_(" nugget: " << this->nugget << "\n"); 51 _printf_(" sill : " << this->sill << "\n"); 52 _printf_(" range : " << this->range << "\n"); 53 53 } 54 54 /*}}}*/ … … 89 89 gamma = (sill-nugget)*(1.-exp(-h2/(a*range*range))) + nugget; 90 90 91 //if(h2>1000*1000) _print String_("gamma = " << gamma << " h= " << sqrt(h2) << "\n");92 _print String_("h = " << sqrt(h2) << " gamma = " << gamma << "\n");91 //if(h2>1000*1000) _printf_("gamma = " << gamma << " h= " << sqrt(h2) << "\n"); 92 _printf_("h = " << sqrt(h2) << " gamma = " << gamma << "\n"); 93 93 return gamma; 94 94 } -
issm/trunk-jpl/src/c/classes/kriging/Observation.cpp
r15099 r15100 35 35 void Observation::Echo(void){ 36 36 37 _print String_("Observation" << "\n");38 _print String_(" index : " << this->index << "\n");39 _print String_(" x : " << this->x << "\n");40 _print String_(" y : " << this->y << "\n");41 _print String_(" xi : " << "\n"); printbinary(this->xi); _printString_("\n");42 _print String_(" yi : " << "\n"); printbinary(this->yi); _printString_("\n");43 _print String_(" weight: " << this->weight << "\n");44 _print String_(" value : " << this->value << "\n");37 _printf_("Observation" << "\n"); 38 _printf_(" index : " << this->index << "\n"); 39 _printf_(" x : " << this->x << "\n"); 40 _printf_(" y : " << this->y << "\n"); 41 _printf_(" xi : " << "\n"); printbinary(this->xi); _printf_("\n"); 42 _printf_(" yi : " << "\n"); printbinary(this->yi); _printf_("\n"); 43 _printf_(" weight: " << this->weight << "\n"); 44 _printf_(" value : " << this->value << "\n"); 45 45 } 46 46 /*}}}*/ -
issm/trunk-jpl/src/c/classes/kriging/Observations.cpp
r15099 r15100 77 77 78 78 /*Initialize Quadtree*/ 79 _p printString_("Generating quadtree with a maximum box size " << minlength << " (depth=" << maxdepth << ")... ");79 _printf0_("Generating quadtree with a maximum box size " << minlength << " (depth=" << maxdepth << ")... "); 80 80 this->quadtree = new Quadtree(xmin,xmax,ymin,ymax,maxdepth); 81 81 … … 107 107 } 108 108 } 109 _p printString_("done" << "\n");110 _p printString_("Initial number of observations: " << n << "\n");111 _p printString_(" Final number of observations: " << this->quadtree->NbObs << "\n");109 _printf0_("done" << "\n"); 110 _printf0_("Initial number of observations: " << n << "\n"); 111 _printf0_(" Final number of observations: " << this->quadtree->NbObs << "\n"); 112 112 } 113 113 /*}}}*/ -
issm/trunk-jpl/src/c/classes/kriging/PowerVariogram.cpp
r15099 r15100 48 48 /*FUNCTION PowerVariogram::Echo {{{*/ 49 49 void PowerVariogram::Echo(void){ 50 _print String_("PowerVariogram" << "\n");51 _print String_(" nugget: " << this->nugget << "\n");52 _print String_(" slope : " << this->slope << "\n");53 _print String_(" power : " << this->power << "\n");50 _printf_("PowerVariogram" << "\n"); 51 _printf_(" nugget: " << this->nugget << "\n"); 52 _printf_(" slope : " << this->slope << "\n"); 53 _printf_(" power : " << this->power << "\n"); 54 54 } 55 55 /*}}}*/ … … 85 85 gamma = this->nugget + this->slope*pow(h,this->power); 86 86 87 //if(h>1000) _print String_("gamma = " << gamma << " h=" << h << "\n");87 //if(h>1000) _printf_("gamma = " << gamma << " h=" << h << "\n"); 88 88 return gamma; 89 89 } -
issm/trunk-jpl/src/c/classes/kriging/Quadtree.cpp
r15099 r15100 297 297 void Quadtree::Echo(void){ 298 298 299 _print String_("Quadtree:" << "\n");300 _print String_(" MaxDepth = " << this->MaxDepth << "\n");301 _print String_(" NbQuadtreeBox = " << this->NbQuadtreeBox << "\n");302 _print String_(" NbObs = " << this->NbObs << "\n");303 _print String_(" root = " << this->root << "\n");299 _printf_("Quadtree:" << "\n"); 300 _printf_(" MaxDepth = " << this->MaxDepth << "\n"); 301 _printf_(" NbQuadtreeBox = " << this->NbQuadtreeBox << "\n"); 302 _printf_(" NbObs = " << this->NbObs << "\n"); 303 _printf_(" root = " << this->root << "\n"); 304 304 305 305 }/*}}}*/ … … 307 307 void Quadtree::DeepEcho(void){ 308 308 309 _print String_("Quadtree:" << "\n");310 _print String_(" MaxDepth = " << this->MaxDepth << "\n");311 _print String_(" NbQuadtreeBox = " << this->NbQuadtreeBox << "\n");312 _print String_(" NbObs = " << this->NbObs << "\n");313 _print String_(" root = " << this->root << "\n");309 _printf_("Quadtree:" << "\n"); 310 _printf_(" MaxDepth = " << this->MaxDepth << "\n"); 311 _printf_(" NbQuadtreeBox = " << this->NbQuadtreeBox << "\n"); 312 _printf_(" NbObs = " << this->NbObs << "\n"); 313 _printf_(" root = " << this->root << "\n"); 314 314 boxcontainer->Echo(); 315 315 … … 512 512 void Quadtree::QuadtreeBox::Echo(void){ 513 513 514 _print String_("QuadtreeBox:" << "\n");515 _print String_(" nbitems = " << this->nbitems << "\n");516 _print String_(" xcenter = " << this->xcenter << "\n");517 _print String_(" ycenter = " << this->ycenter << "\n");518 _print String_(" length = " << this->length << "\n");514 _printf_("QuadtreeBox:" << "\n"); 515 _printf_(" nbitems = " << this->nbitems << "\n"); 516 _printf_(" xcenter = " << this->xcenter << "\n"); 517 _printf_(" ycenter = " << this->ycenter << "\n"); 518 _printf_(" length = " << this->length << "\n"); 519 519 520 520 }/*}}}*/ -
issm/trunk-jpl/src/c/classes/kriging/SphericalVariogram.cpp
r15099 r15100 47 47 /*FUNCTION SphericalVariogram::Echo {{{*/ 48 48 void SphericalVariogram::Echo(void){ 49 _print String_("SphericalVariogram" << "\n");50 _print String_(" nugget: " << this->nugget << "\n");51 _print String_(" sill : " << this->sill << "\n");52 _print String_(" range : " << this->range << "\n");49 _printf_("SphericalVariogram" << "\n"); 50 _printf_(" nugget: " << this->nugget << "\n"); 51 _printf_(" sill : " << this->sill << "\n"); 52 _printf_(" range : " << this->range << "\n"); 53 53 } 54 54 /*}}}*/ -
issm/trunk-jpl/src/c/classes/matrix/ElementMatrix.cpp
r15099 r15100 377 377 378 378 int i,j; 379 _print String_("Element Matrix echo:" << "\n");380 _print String_(" nrows: " << this->nrows << "\n");381 _print String_(" ncols: " << this->ncols << "\n");382 _print String_(" dofsymmetrical: " << (dofsymmetrical?"true":"false") << "\n");383 384 _print String_(" values:" << "\n");379 _printf_("Element Matrix echo:" << "\n"); 380 _printf_(" nrows: " << this->nrows << "\n"); 381 _printf_(" ncols: " << this->ncols << "\n"); 382 _printf_(" dofsymmetrical: " << (dofsymmetrical?"true":"false") << "\n"); 383 384 _printf_(" values:" << "\n"); 385 385 for(i=0;i<nrows;i++){ 386 _print String_(setw(4) << right << i << ": ");387 for(j=0;j<ncols;j++) _print String_( " " << setw(11) << setprecision (5) << right << values[i*ncols+j]);388 _print String_("" << "\n");389 } 390 391 _print String_(" gglobaldoflist (" << gglobaldoflist << "): ");392 if(gglobaldoflist) for(i=0;i<nrows;i++) _print String_(" " << gglobaldoflist[i] << "\n"); _printString_("" << "\n");393 394 _print String_(" row_fsize: " << row_fsize << "\n");395 _print String_(" row_flocaldoflist (" << row_flocaldoflist << "): ");396 if(row_flocaldoflist) for(i=0;i<row_fsize;i++) _print String_(" " << row_flocaldoflist[i] << "\n"); _printString_(" " << "\n");397 _print String_(" row_fglobaldoflist (" << row_fglobaldoflist << "): ");398 if(row_fglobaldoflist) for(i=0;i<row_fsize;i++) _print String_(" " << row_fglobaldoflist[i] << "\n"); _printString_(" " << "\n");399 400 _print String_(" row_ssize: " << row_ssize << "\n");401 _print String_(" row_slocaldoflist (" << row_slocaldoflist << "): ");402 if(row_slocaldoflist) for(i=0;i<row_ssize;i++) _print String_(" " << row_slocaldoflist[i] << "\n"); _printString_(" " << "\n");403 _print String_(" row_sglobaldoflist (" << row_sglobaldoflist << "): ");404 if(row_sglobaldoflist) for(i=0;i<row_ssize;i++) _print String_(" " << row_sglobaldoflist[i] << "\n"); _printString_(" " << "\n");386 _printf_(setw(4) << right << i << ": "); 387 for(j=0;j<ncols;j++) _printf_( " " << setw(11) << setprecision (5) << right << values[i*ncols+j]); 388 _printf_("" << "\n"); 389 } 390 391 _printf_(" gglobaldoflist (" << gglobaldoflist << "): "); 392 if(gglobaldoflist) for(i=0;i<nrows;i++) _printf_(" " << gglobaldoflist[i] << "\n"); _printf_("" << "\n"); 393 394 _printf_(" row_fsize: " << row_fsize << "\n"); 395 _printf_(" row_flocaldoflist (" << row_flocaldoflist << "): "); 396 if(row_flocaldoflist) for(i=0;i<row_fsize;i++) _printf_(" " << row_flocaldoflist[i] << "\n"); _printf_(" " << "\n"); 397 _printf_(" row_fglobaldoflist (" << row_fglobaldoflist << "): "); 398 if(row_fglobaldoflist) for(i=0;i<row_fsize;i++) _printf_(" " << row_fglobaldoflist[i] << "\n"); _printf_(" " << "\n"); 399 400 _printf_(" row_ssize: " << row_ssize << "\n"); 401 _printf_(" row_slocaldoflist (" << row_slocaldoflist << "): "); 402 if(row_slocaldoflist) for(i=0;i<row_ssize;i++) _printf_(" " << row_slocaldoflist[i] << "\n"); _printf_(" " << "\n"); 403 _printf_(" row_sglobaldoflist (" << row_sglobaldoflist << "): "); 404 if(row_sglobaldoflist) for(i=0;i<row_ssize;i++) _printf_(" " << row_sglobaldoflist[i] << "\n"); _printf_(" " << "\n"); 405 405 406 406 if(!dofsymmetrical){ 407 _print String_(" col_fsize: " << col_fsize << "\n");408 _print String_(" col_flocaldoflist (" << col_flocaldoflist << "): ");409 if(col_flocaldoflist) for(i=0;i<col_fsize;i++) _print String_(" " << col_flocaldoflist[i] << "\n"); _printString_(" " << "\n");410 _print String_(" col_fglobaldoflist (" << col_fglobaldoflist << "): ");411 if(col_fglobaldoflist) for(i=0;i<col_fsize;i++) _print String_(" " << col_fglobaldoflist[i] << "\n"); _printString_(" " << "\n");412 413 _print String_(" col_ssize: " << col_ssize << "\n");414 _print String_(" col_slocaldoflist (" << col_slocaldoflist << "): ");415 if(col_slocaldoflist) for(i=0;i<col_ssize;i++) _print String_(" " << col_slocaldoflist[i] << "\n"); _printString_(" " << "\n");416 _print String_(" col_sglobaldoflist (" << col_sglobaldoflist << "): ");417 if(col_sglobaldoflist) for(i=0;i<col_ssize;i++) _print String_(" " << col_sglobaldoflist[i] << "\n"); _printString_(" " << "\n");407 _printf_(" col_fsize: " << col_fsize << "\n"); 408 _printf_(" col_flocaldoflist (" << col_flocaldoflist << "): "); 409 if(col_flocaldoflist) for(i=0;i<col_fsize;i++) _printf_(" " << col_flocaldoflist[i] << "\n"); _printf_(" " << "\n"); 410 _printf_(" col_fglobaldoflist (" << col_fglobaldoflist << "): "); 411 if(col_fglobaldoflist) for(i=0;i<col_fsize;i++) _printf_(" " << col_fglobaldoflist[i] << "\n"); _printf_(" " << "\n"); 412 413 _printf_(" col_ssize: " << col_ssize << "\n"); 414 _printf_(" col_slocaldoflist (" << col_slocaldoflist << "): "); 415 if(col_slocaldoflist) for(i=0;i<col_ssize;i++) _printf_(" " << col_slocaldoflist[i] << "\n"); _printf_(" " << "\n"); 416 _printf_(" col_sglobaldoflist (" << col_sglobaldoflist << "): "); 417 if(col_sglobaldoflist) for(i=0;i<col_ssize;i++) _printf_(" " << col_sglobaldoflist[i] << "\n"); _printf_(" " << "\n"); 418 418 } 419 419 } -
issm/trunk-jpl/src/c/classes/matrix/ElementVector.cpp
r15099 r15100 219 219 int i; 220 220 221 _print String_("Element Vector echo:" << "\n");222 _print String_(" nrows: " << nrows << "\n");223 _print String_(" values:" << "\n");221 _printf_("Element Vector echo:" << "\n"); 222 _printf_(" nrows: " << nrows << "\n"); 223 _printf_(" values:" << "\n"); 224 224 for(i=0;i<nrows;i++){ 225 _print String_(setw(4) << right << i << ": " << setw(10) << values[i] << "\n");226 } 227 228 _print String_(" gglobaldoflist (" << gglobaldoflist << "): ");229 if(gglobaldoflist) for(i=0;i<nrows;i++) _print String_(" " << gglobaldoflist[i] );230 _print String_(" " << "\n");231 232 _print String_(" fsize: " << fsize << "\n");233 _print String_(" flocaldoflist (" << flocaldoflist << "): ");234 if(flocaldoflist) for(i=0;i<fsize;i++) _print String_(" " << flocaldoflist[i] );235 _print String_(" " << "\n");236 _print String_(" fglobaldoflist (" << fglobaldoflist << "): ");237 if(fglobaldoflist) for(i=0;i<fsize;i++) _print String_(" " << fglobaldoflist[i] );238 _print String_(" " << "\n");225 _printf_(setw(4) << right << i << ": " << setw(10) << values[i] << "\n"); 226 } 227 228 _printf_(" gglobaldoflist (" << gglobaldoflist << "): "); 229 if(gglobaldoflist) for(i=0;i<nrows;i++) _printf_(" " << gglobaldoflist[i] ); 230 _printf_(" " << "\n"); 231 232 _printf_(" fsize: " << fsize << "\n"); 233 _printf_(" flocaldoflist (" << flocaldoflist << "): "); 234 if(flocaldoflist) for(i=0;i<fsize;i++) _printf_(" " << flocaldoflist[i] ); 235 _printf_(" " << "\n"); 236 _printf_(" fglobaldoflist (" << fglobaldoflist << "): "); 237 if(fglobaldoflist) for(i=0;i<fsize;i++) _printf_(" " << fglobaldoflist[i] ); 238 _printf_(" " << "\n"); 239 239 } 240 240 /*}}}*/ -
issm/trunk-jpl/src/c/datastructures/DataSet.cpp
r15099 r15100 130 130 if(this==NULL)_error_("trying to echo a NULL dataset"); 131 131 132 _p printString_("DataSet echo: " << objects.size() << " objects" << "\n");132 _printf0_("DataSet echo: " << objects.size() << " objects" << "\n"); 133 133 134 134 for ( object=objects.begin() ; object < objects.end(); object++ ){ … … 147 147 if(this==NULL)_error_("trying to echo a NULL dataset"); 148 148 149 _p printString_("DataSet echo: " << objects.size() << " objects" << "\n");149 _printf0_("DataSet echo: " << objects.size() << " objects" << "\n"); 150 150 151 151 for ( object=objects.begin() ; object < objects.end(); object++ ){ -
issm/trunk-jpl/src/c/kml/KMLFileReadUtils.cpp
r15099 r15100 133 133 134 134 // if (itag) 135 // _p printString_("tag buffer (length=" << ibuf << "):" << "\n");135 // _printf0_("tag buffer (length=" << ibuf << "):" << "\n"); 136 136 // else if (ifield) 137 // _p printString_("field buffer (length=" << ibuf << "):" << "\n");138 // _p printString_(buffer << "\n");137 // _printf0_("field buffer (length=" << ibuf << "):" << "\n"); 138 // _printf0_(buffer << "\n"); 139 139 140 140 if (!ibuf) … … 199 199 } 200 200 201 // _p printString_("comment buffer (length=" << ibuf << "):" << "\n");202 // _p printString_(buffer << "\n");201 // _printf0_("comment buffer (length=" << ibuf << "):" << "\n"); 202 // _printf0_(buffer << "\n"); 203 203 204 204 if (!ibuf) … … 265 265 266 266 ktokn=strtok(ktagi,"< >"); 267 // _p printString_("KMLFileTagName -- initial token=\"" << ktokn << "\"." << "\n");267 // _printf0_("KMLFileTagName -- initial token=\"" << ktokn << "\"." << "\n"); 268 268 269 269 if (!pname) { … … 275 275 276 276 if (maxlen && (maxlen < strlen(ktokn))) { 277 _p printString_("KMLFileTagName -- string field too short for " << ktag << "." << "\n");278 _p printString_("KMLFileTagName -- \"" << ktokn << "\" truncated to " << maxlen << " characters." << "\n");277 _printf0_("KMLFileTagName -- string field too short for " << ktag << "." << "\n"); 278 _printf0_("KMLFileTagName -- \"" << ktokn << "\" truncated to " << maxlen << " characters." << "\n"); 279 279 strncpy(pname,ktokn,maxlen); 280 280 } … … 311 311 /* return first non blank and move past subsequent blank */ 312 312 ktokn=strtok(ktagi," "); 313 // _p printString_("KMLFileTagAttrib -- initial token=\"" << ktokn << "\"." << "\n");313 // _printf0_("KMLFileTagAttrib -- initial token=\"" << ktokn << "\"." << "\n"); 314 314 315 315 /* return next non " =?/>" and move past subsequent " =?/>" */ … … 318 318 /* return next non quote and move past subsequent quote */ 319 319 ktokv=strtok(NULL,quote); 320 // _p printString_("KMLFileTagAttrib -- attribute " << ktokn << "=\"" << ktokv << "\"." << "\n");320 // _printf0_("KMLFileTagAttrib -- attribute " << ktokn << "=\"" << ktokv << "\"." << "\n"); 321 321 322 322 /* add the attribute to the dataset */ … … 334 334 (!strncmp(&ktag[0],"<" ,1) && !strncmp(&ktag[strlen(ktag)-2],"/>",2))) 335 335 isolo=1; 336 // _p printString_("KMLFileTagAttrib -- isolo=" << isolo << "." << "\n");336 // _printf0_("KMLFileTagAttrib -- isolo=" << isolo << "." << "\n"); 337 337 338 338 return(isolo); … … 368 368 xDelete<char>(kstr); 369 369 370 // _p printString_("KMLFileTokenParse -- " << ktag << "=" << *pival << "." << "\n");370 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pival << "." << "\n"); 371 371 372 372 return(0); … … 402 402 xDelete<char>(kstr); 403 403 404 // _p printString_("KMLFileTokenParse -- " << ktag << "=" << (*pbval ? "true" : "false") << "." << "\n");404 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << (*pbval ? "true" : "false") << "." << "\n"); 405 405 406 406 return(0); … … 439 439 440 440 if (maxlen && (maxlen < strlen(kstr))) { 441 _p printString_("KMLFileTokenParse -- string field too short for " << ktag << "." << "\n");442 _p printString_("KMLFileTokenParse -- \"" << kstr << "\" truncated to " << maxlen << " characters." << "\n");441 _printf0_("KMLFileTokenParse -- string field too short for " << ktag << "." << "\n"); 442 _printf0_("KMLFileTokenParse -- \"" << kstr << "\" truncated to " << maxlen << " characters." << "\n"); 443 443 strncpy(pstr,kstr,maxlen); 444 444 } … … 463 463 xDelete<char>(kstr); 464 464 465 // _p printString_("KMLFileTokenParse -- " << ktag << "=\"" << pstr << "\"." << "\n");465 // _printf0_("KMLFileTokenParse -- " << ktag << "=\"" << pstr << "\"." << "\n"); 466 466 467 467 return(pstr); … … 497 497 xDelete<char>(kstr); 498 498 499 // _p printString_("KMLFileTokenParse -- " << ktag << "=" << *pfval << "." << "\n");499 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pfval << "." << "\n"); 500 500 501 501 return(0); … … 531 531 xDelete<char>(kstr); 532 532 533 // _p printString_("KMLFileTokenParse -- " << ktag << "=" << *pdval << "." << "\n");533 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pdval << "." << "\n"); 534 534 535 535 return(0); … … 595 595 xDelete<char>(kstr); 596 596 597 // _p printString_("KMLFileTokenParse -- " << ktag << "=..." << "\n");597 // _printf0_("KMLFileTokenParse -- " << ktag << "=..." << "\n"); 598 598 // for (j=0; j<=i; j++) 599 // _p printString_(" [" << j << "]: " << (*pdval)[j] << "g" << "\n");599 // _printf0_(" [" << j << "]: " << (*pdval)[j] << "g" << "\n"); 600 600 601 601 return(0); … … 651 651 652 652 if ((i+1) % n) 653 _p printString_("KMLFileTokenParse -- Double [m x n] field for " << ktag << " does not have multiple of n values." << "\n");653 _printf0_("KMLFileTokenParse -- Double [m x n] field for " << ktag << " does not have multiple of n values." << "\n"); 654 654 655 655 /* get additional token and compare to closing tag */ … … 665 665 xDelete<char>(kstr); 666 666 667 // _p printString_("KMLFileTokenParse -- " << ktag << "=..." << "\n");667 // _printf0_("KMLFileTokenParse -- " << ktag << "=..." << "\n"); 668 668 // for (j=0; j<=i; j++) 669 // _p printString_(" [" << j << "]: " << (*pdval)[j] << "g" << "\n");669 // _printf0_(" [" << j << "]: " << (*pdval)[j] << "g" << "\n"); 670 670 671 671 return(0); … … 681 681 opening tag, must find corresponding closing tag */ 682 682 683 _p printString_("KMLFileTagSkip -- input tag " << ktag << "." << "\n");683 _printf0_("KMLFileTagSkip -- input tag " << ktag << "." << "\n"); 684 684 685 685 /* if next token is a closing tag, compare to input */ … … 690 690 (kstr[1] == '/') && 691 691 (!strncmp(&(kstr[2]),&(ktag[1]),(strcspn(ktag," >")-1)/sizeof(char)))) { 692 _p printString_("KMLFileTagSkip -- closing tag " << kstr << "." << "\n");692 _printf0_("KMLFileTagSkip -- closing tag " << kstr << "." << "\n"); 693 693 xDelete<char>(kstr); 694 694 return(0); … … 699 699 else if ((kstr[0] == '<') && 700 700 (kstr[1] != '/')) { 701 _p printString_("KMLFileTagSkip -- opening tag " << kstr << "." << "\n");701 _printf0_("KMLFileTagSkip -- opening tag " << kstr << "." << "\n"); 702 702 KMLFileTagSkip(kstr, 703 703 fid); -
issm/trunk-jpl/src/c/kml/KML_Attribute.cpp
r15099 r15100 40 40 bool flag=true; 41 41 42 if(flag) _p printString_(" ");42 if(flag) _printf0_(" "); 43 43 for (i=0;i<10-strlen(name);i++) 44 if(flag) _p printString_(" ");45 if(flag) _p printString_(name << ": \"" << value << "\"" << "\n");44 if(flag) _printf0_(" "); 45 if(flag) _printf0_(name << ": \"" << value << "\"" << "\n"); 46 46 47 47 return; … … 64 64 bool flag=true; 65 65 66 if(flag) _p printString_(indent << " ");66 if(flag) _printf0_(indent << " "); 67 67 for (i=0;i<10-strlen(name);i++) 68 if(flag) _p printString_(" ");69 if(flag) _p printString_(name << ": \"" << value << "\"" << "\n");68 if(flag) _printf0_(" "); 69 if(flag) _printf0_(name << ": \"" << value << "\"" << "\n"); 70 70 71 71 return; -
issm/trunk-jpl/src/c/kml/KML_ColorStyle.cpp
r15099 r15100 42 42 KML_SubStyle::Echo(); 43 43 44 if(flag) _p printString_(" color: " << color << "\n");45 if(flag) _p printString_(" colormode: " << colormode << "\n");44 if(flag) _printf0_(" color: " << color << "\n"); 45 if(flag) _printf0_(" colormode: " << colormode << "\n"); 46 46 47 47 return; … … 65 65 KML_SubStyle::DeepEcho(indent); 66 66 67 if(flag) _p printString_(indent << " color: " << color << "\n");68 if(flag) _p printString_(indent << " colormode: " << colormode << "\n");67 if(flag) _printf0_(indent << " color: " << color << "\n"); 68 if(flag) _printf0_(indent << " colormode: " << colormode << "\n"); 69 69 } 70 70 /*}}}*/ -
issm/trunk-jpl/src/c/kml/KML_Comment.cpp
r15099 r15100 37 37 bool flag=true; 38 38 39 if(flag) _p printString_(" ");40 if(flag) _p printString_(value << "\n");39 if(flag) _printf0_(" "); 40 if(flag) _printf0_(value << "\n"); 41 41 42 42 return; … … 58 58 bool flag=true; 59 59 60 if(flag) _p printString_(indent << " ");61 if(flag) _p printString_(value << "\n");60 if(flag) _printf0_(indent << " "); 61 if(flag) _printf0_(value << "\n"); 62 62 63 63 return; -
issm/trunk-jpl/src/c/kml/KML_Container.cpp
r15099 r15100 47 47 KML_Feature::Echo(); 48 48 49 if(flag) _p printString_(" feature: (size=" << feature->Size() << ")" << "\n");49 if(flag) _printf0_(" feature: (size=" << feature->Size() << ")" << "\n"); 50 50 51 51 return; … … 78 78 if (feature->Size()) 79 79 for (i=0; i<feature->Size(); i++) { 80 if(flag) _p printString_(indent << " feature: -------- begin [" << i << "] --------" << "\n");80 if(flag) _printf0_(indent << " feature: -------- begin [" << i << "] --------" << "\n"); 81 81 ((KML_Feature *)feature->GetObjectByOffset(i))->DeepEcho(indent2); 82 if(flag) _p printString_(indent << " feature: -------- end [" << i << "] --------" << "\n");82 if(flag) _printf0_(indent << " feature: -------- end [" << i << "] --------" << "\n"); 83 83 } 84 84 else 85 if(flag) _p printString_(indent << " feature: [empty]" << "\n");85 if(flag) _printf0_(indent << " feature: [empty]" << "\n"); 86 86 87 87 return; -
issm/trunk-jpl/src/c/kml/KML_Document.cpp
r15099 r15100 38 38 bool flag=true; 39 39 40 if(flag) _p printString_("KML_Document:" << "\n");40 if(flag) _printf0_("KML_Document:" << "\n"); 41 41 KML_Container::Echo(); 42 42 … … 59 59 bool flag=true; 60 60 61 if(flag) _p printString_(indent << "KML_Document:" << "\n");61 if(flag) _printf0_(indent << "KML_Document:" << "\n"); 62 62 KML_Container::DeepEcho(indent); 63 63 -
issm/trunk-jpl/src/c/kml/KML_Feature.cpp
r15099 r15100 60 60 KML_Object::Echo(); 61 61 62 if(flag) _p printString_(" name: \"" << name << "\"" << "\n");63 if(flag) _p printString_(" visibility: " << (visibility ? "true" : "false") << "\n");64 if(flag) _p printString_(" open: " << (open ? "true" : "false") << "\n");65 if(flag) _p printString_(" snippet: \"" << snippet << "\"" << "\n");66 if(flag) _p printString_(" descript: \"" << descript << "\"" << "\n");67 if(flag) _p printString_(" styleurl: \"" << styleurl << "\"" << "\n");68 if(flag) _p printString_(" style: (size=" << style->Size() << ")" << "\n");62 if(flag) _printf0_(" name: \"" << name << "\"" << "\n"); 63 if(flag) _printf0_(" visibility: " << (visibility ? "true" : "false") << "\n"); 64 if(flag) _printf0_(" open: " << (open ? "true" : "false") << "\n"); 65 if(flag) _printf0_(" snippet: \"" << snippet << "\"" << "\n"); 66 if(flag) _printf0_(" descript: \"" << descript << "\"" << "\n"); 67 if(flag) _printf0_(" styleurl: \"" << styleurl << "\"" << "\n"); 68 if(flag) _printf0_(" style: (size=" << style->Size() << ")" << "\n"); 69 69 70 70 return; … … 90 90 KML_Object::DeepEcho(indent); 91 91 92 if(flag) _p printString_(indent << " name: \"" << name << "\"" << "\n");93 if(flag) _p printString_(indent << " visibility: " << (visibility ? "true" : "false") << "\n");94 if(flag) _p printString_(indent << " open: " << (open ? "true" : "false") << "\n");95 if(flag) _p printString_(indent << " snippet: \"" << snippet << "\"" << "\n");96 if(flag) _p printString_(indent << " descript: \"" << descript << "\"" << "\n");97 if(flag) _p printString_(indent << " styleurl: \"" << styleurl << "\"" << "\n");92 if(flag) _printf0_(indent << " name: \"" << name << "\"" << "\n"); 93 if(flag) _printf0_(indent << " visibility: " << (visibility ? "true" : "false") << "\n"); 94 if(flag) _printf0_(indent << " open: " << (open ? "true" : "false") << "\n"); 95 if(flag) _printf0_(indent << " snippet: \"" << snippet << "\"" << "\n"); 96 if(flag) _printf0_(indent << " descript: \"" << descript << "\"" << "\n"); 97 if(flag) _printf0_(indent << " styleurl: \"" << styleurl << "\"" << "\n"); 98 98 99 99 /* loop over any styles for the feature */ … … 104 104 if (style->Size()) 105 105 for (i=0; i<style->Size(); i++) { 106 if(flag) _p printString_(indent << " style: -------- begin [" << i << "] --------" << "\n");106 if(flag) _printf0_(indent << " style: -------- begin [" << i << "] --------" << "\n"); 107 107 ((KML_Style *)style->GetObjectByOffset(i))->DeepEcho(indent2); 108 if(flag) _p printString_(indent << " style: -------- end [" << i << "] --------" << "\n");108 if(flag) _printf0_(indent << " style: -------- end [" << i << "] --------" << "\n"); 109 109 } 110 110 else 111 if(flag) _p printString_(indent << " style: [empty]" << "\n");111 if(flag) _printf0_(indent << " style: [empty]" << "\n"); 112 112 113 113 return; -
issm/trunk-jpl/src/c/kml/KML_File.cpp
r15099 r15100 39 39 bool flag=true; 40 40 41 if(flag) _p printString_("KML_File:" << "\n");41 if(flag) _printf0_("KML_File:" << "\n"); 42 42 KML_Object::Echo(); 43 43 … … 60 60 bool flag=true; 61 61 62 if(flag) _p printString_(indent << "KML_File:" << "\n");62 if(flag) _printf0_(indent << "KML_File:" << "\n"); 63 63 KML_Object::DeepEcho(indent); 64 64 -
issm/trunk-jpl/src/c/kml/KML_Folder.cpp
r15099 r15100 38 38 bool flag=true; 39 39 40 if(flag) _p printString_("KML_Folder:" << "\n");40 if(flag) _printf0_("KML_Folder:" << "\n"); 41 41 KML_Container::Echo(); 42 42 … … 59 59 bool flag=true; 60 60 61 if(flag) _p printString_(indent << "KML_Folder:" << "\n");61 if(flag) _printf0_(indent << "KML_Folder:" << "\n"); 62 62 KML_Container::DeepEcho(indent); 63 63 -
issm/trunk-jpl/src/c/kml/KML_GroundOverlay.cpp
r15099 r15100 44 44 void KML_GroundOverlay::Echo(){ 45 45 46 _print String_("KML_GroundOverlay:" << "\n");46 _printf_("KML_GroundOverlay:" << "\n"); 47 47 KML_Overlay::Echo(); 48 48 49 _print String_(" altitude: " << altitude << "\n");50 _print String_(" altmode: " << altmode << "\n");51 _print String_(" llbox: " << llbox << "\n");49 _printf_(" altitude: " << altitude << "\n"); 50 _printf_(" altmode: " << altmode << "\n"); 51 _printf_(" llbox: " << llbox << "\n"); 52 52 } 53 53 /*}}}*/ … … 67 67 char indent2[81]; 68 68 69 _print String_(indent << "KML_GroundOverlay:" << "\n");69 _printf_(indent << "KML_GroundOverlay:" << "\n"); 70 70 KML_Overlay::DeepEcho(indent); 71 71 … … 73 73 strcat(indent2," "); 74 74 75 _print String_(indent<<" altitude: " << altitude << "\n");76 _print String_(indent<<" altmode: " << altmode << "\n");75 _printf_(indent<<" altitude: " << altitude << "\n"); 76 _printf_(indent<<" altmode: " << altmode << "\n"); 77 77 if (llbox) 78 78 llbox->DeepEcho(indent2); 79 79 else 80 _print String_(indent<<" llbox: " << llbox << "\n");80 _printf_(indent<<" llbox: " << llbox << "\n"); 81 81 } 82 82 /*}}}*/ -
issm/trunk-jpl/src/c/kml/KML_Icon.cpp
r15099 r15100 45 45 bool flag=true; 46 46 47 if(flag) _p printString_("KML_Icon:" << "\n");47 if(flag) _printf0_("KML_Icon:" << "\n"); 48 48 KML_Object::Echo(); 49 49 50 if(flag) _p printString_(" href: \"" << href << "\"" << "\n");51 if(flag) _p printString_(" refmode: \"" << refmode << "\"" << "\n");52 if(flag) _p printString_(" refint: " << refint << "\n");53 if(flag) _p printString_(" vrefmode: \"" << vrefmode << "\"" << "\n");54 if(flag) _p printString_(" vreftime: " << vreftime << "\n");55 if(flag) _p printString_(" vboundsc: " << vboundsc << "\n");56 if(flag) _p printString_(" vformat: \"" << vformat << "\"" << "\n");57 if(flag) _p printString_(" hquery: \"" << hquery << "\"" << "\n");50 if(flag) _printf0_(" href: \"" << href << "\"" << "\n"); 51 if(flag) _printf0_(" refmode: \"" << refmode << "\"" << "\n"); 52 if(flag) _printf0_(" refint: " << refint << "\n"); 53 if(flag) _printf0_(" vrefmode: \"" << vrefmode << "\"" << "\n"); 54 if(flag) _printf0_(" vreftime: " << vreftime << "\n"); 55 if(flag) _printf0_(" vboundsc: " << vboundsc << "\n"); 56 if(flag) _printf0_(" vformat: \"" << vformat << "\"" << "\n"); 57 if(flag) _printf0_(" hquery: \"" << hquery << "\"" << "\n"); 58 58 59 59 return; … … 75 75 bool flag=true; 76 76 77 if(flag) _p printString_(indent << "KML_Icon:" << "\n");77 if(flag) _printf0_(indent << "KML_Icon:" << "\n"); 78 78 KML_Object::DeepEcho(indent); 79 79 80 if(flag) _p printString_(indent << " href: \"" << href << "\"" << "\n");81 if(flag) _p printString_(indent << " refmode: \"" << refmode << "\"" << "\n");82 if(flag) _p printString_(indent << " refint: " << refint << "\n");83 if(flag) _p printString_(indent << " vrefmode: \"" << vrefmode << "\"" << "\n");84 if(flag) _p printString_(indent << " vreftime: " << vreftime << "\n");85 if(flag) _p printString_(indent << " vboundsc: " << vboundsc << "\n");86 if(flag) _p printString_(indent << " vformat: \"" << vformat << "\"" << "\n");87 if(flag) _p printString_(indent << " hquery: \"" << hquery << "\"" << "\n");80 if(flag) _printf0_(indent << " href: \"" << href << "\"" << "\n"); 81 if(flag) _printf0_(indent << " refmode: \"" << refmode << "\"" << "\n"); 82 if(flag) _printf0_(indent << " refint: " << refint << "\n"); 83 if(flag) _printf0_(indent << " vrefmode: \"" << vrefmode << "\"" << "\n"); 84 if(flag) _printf0_(indent << " vreftime: " << vreftime << "\n"); 85 if(flag) _printf0_(indent << " vboundsc: " << vboundsc << "\n"); 86 if(flag) _printf0_(indent << " vformat: \"" << vformat << "\"" << "\n"); 87 if(flag) _printf0_(indent << " hquery: \"" << hquery << "\"" << "\n"); 88 88 89 89 return; -
issm/trunk-jpl/src/c/kml/KML_LatLonBox.cpp
r15099 r15100 40 40 void KML_LatLonBox::Echo(){ 41 41 42 _print String_("KML_LatLonBox:" << "\n");42 _printf_("KML_LatLonBox:" << "\n"); 43 43 KML_Object::Echo(); 44 44 45 _print String_(" north: " << north << "\n");46 _print String_(" south: " << south << "\n");47 _print String_(" east: " << east << "\n");48 _print String_(" west: " << west << "\n");49 _print String_(" rotation: " << rotation << "\n");45 _printf_(" north: " << north << "\n"); 46 _printf_(" south: " << south << "\n"); 47 _printf_(" east: " << east << "\n"); 48 _printf_(" west: " << west << "\n"); 49 _printf_(" rotation: " << rotation << "\n"); 50 50 } 51 51 /*}}}*/ … … 63 63 void KML_LatLonBox::DeepEcho(const char* indent){ 64 64 65 _print String_(indent << "KML_LatLonBox:" << "\n");65 _printf_(indent << "KML_LatLonBox:" << "\n"); 66 66 KML_Object::DeepEcho(indent); 67 67 68 _print String_(" north: " << north << "\n");69 _print String_(" south: " << south << "\n");70 _print String_(" east: " << east << "\n");71 _print String_(" west: " << west << "\n");72 _print String_(" rotation: " << rotation << "\n");68 _printf_(" north: " << north << "\n"); 69 _printf_(" south: " << south << "\n"); 70 _printf_(" east: " << east << "\n"); 71 _printf_(" west: " << west << "\n"); 72 _printf_(" rotation: " << rotation << "\n"); 73 73 } 74 74 /*}}}*/ -
issm/trunk-jpl/src/c/kml/KML_LineString.cpp
r15099 r15100 46 46 bool flag=true; 47 47 48 if(flag) _p printString_("KML_LineString:" << "\n");48 if(flag) _printf0_("KML_LineString:" << "\n"); 49 49 KML_Geometry::Echo(); 50 50 51 if(flag) _p printString_(" extrude: " << (extrude ? "true" : "false") << "\n");52 if(flag) _p printString_(" tessellate: " << (tessellate ? "true" : "false") << "\n");53 if(flag) _p printString_(" altmode: \"" << altmode << "\"" << "\n");54 if(flag) _p printString_(" coords: (ncoord=" << ncoord << ")" << "\n");51 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 52 if(flag) _printf0_(" tessellate: " << (tessellate ? "true" : "false") << "\n"); 53 if(flag) _printf0_(" altmode: \"" << altmode << "\"" << "\n"); 54 if(flag) _printf0_(" coords: (ncoord=" << ncoord << ")" << "\n"); 55 55 56 56 return; … … 73 73 bool flag=true; 74 74 75 if(flag) _p printString_(indent << "KML_LineString:" << "\n");75 if(flag) _printf0_(indent << "KML_LineString:" << "\n"); 76 76 KML_Geometry::DeepEcho(indent); 77 77 78 if(flag) _p printString_(indent << " extrude: " << (extrude ? "true" : "false") << "\n");79 if(flag) _p printString_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n");80 if(flag) _p printString_(indent << " altmode: \"" << altmode << "\"" << "\n");81 if(flag) _p printString_(indent << " coords: (ncoord=" << ncoord << ")" << "\n");78 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 79 if(flag) _printf0_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n"); 80 if(flag) _printf0_(indent << " altmode: \"" << altmode << "\"" << "\n"); 81 if(flag) _printf0_(indent << " coords: (ncoord=" << ncoord << ")" << "\n"); 82 82 for (i=0; i<ncoord; i++) 83 if(flag) _p printString_(indent << " (" << coords[3*i+0] << "," << coords[3*i+1] << "," << coords[3*i+2] << ")" << "\n");83 if(flag) _printf0_(indent << " (" << coords[3*i+0] << "," << coords[3*i+1] << "," << coords[3*i+2] << ")" << "\n"); 84 84 85 85 return; -
issm/trunk-jpl/src/c/kml/KML_LineStyle.cpp
r15099 r15100 38 38 bool flag=true; 39 39 40 if(flag) _p printString_("KML_LineStyle:" << "\n");40 if(flag) _printf0_("KML_LineStyle:" << "\n"); 41 41 KML_ColorStyle::Echo(); 42 42 43 if(flag) _p printString_(" width: " << width << "\n");43 if(flag) _printf0_(" width: " << width << "\n"); 44 44 45 45 return; … … 61 61 bool flag=true; 62 62 63 if(flag) _p printString_(indent << "KML_LineStyle:" << "\n");63 if(flag) _printf0_(indent << "KML_LineStyle:" << "\n"); 64 64 KML_ColorStyle::DeepEcho(indent); 65 65 66 if(flag) _p printString_(indent << " width: " << width << "\n");66 if(flag) _printf0_(indent << " width: " << width << "\n"); 67 67 68 68 return; -
issm/trunk-jpl/src/c/kml/KML_LinearRing.cpp
r15099 r15100 46 46 bool flag=true; 47 47 48 if(flag) _p printString_("KML_LinearRing:" << "\n");48 if(flag) _printf0_("KML_LinearRing:" << "\n"); 49 49 KML_Geometry::Echo(); 50 50 51 if(flag) _p printString_(" extrude: " << (extrude ? "true" : "false") << "\n");52 if(flag) _p printString_(" tessellate: " << (tessellate ? "true" : "false") << "\n");53 if(flag) _p printString_(" altmode: \"" << altmode << "\"" << "\n");54 if(flag) _p printString_(" coords: (ncoord=" << ncoord << ")" << "\n");51 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 52 if(flag) _printf0_(" tessellate: " << (tessellate ? "true" : "false") << "\n"); 53 if(flag) _printf0_(" altmode: \"" << altmode << "\"" << "\n"); 54 if(flag) _printf0_(" coords: (ncoord=" << ncoord << ")" << "\n"); 55 55 56 56 return; … … 73 73 bool flag=true; 74 74 75 if(flag) _p printString_(indent << "KML_LinearRing:" << "\n");75 if(flag) _printf0_(indent << "KML_LinearRing:" << "\n"); 76 76 KML_Geometry::DeepEcho(indent); 77 77 78 if(flag) _p printString_(indent << " extrude: " << (extrude ? "true" : "false") << "\n");79 if(flag) _p printString_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n");80 if(flag) _p printString_(indent << " altmode: \"" << altmode << "\"" << "\n");81 if(flag) _p printString_(indent << " coords: (ncoord=" << ncoord << ")" << "\n");78 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 79 if(flag) _printf0_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n"); 80 if(flag) _printf0_(indent << " altmode: \"" << altmode << "\"" << "\n"); 81 if(flag) _printf0_(indent << " coords: (ncoord=" << ncoord << ")" << "\n"); 82 82 for (i=0; i<ncoord; i++) 83 if(flag)_print String_(indent << " (" <<coords[3*i+0] << "," <<coords[3*i+1] << "," <<coords[3*i+2] << ")\n" << "\n");83 if(flag)_printf_(indent << " (" <<coords[3*i+0] << "," <<coords[3*i+1] << "," <<coords[3*i+2] << ")\n" << "\n"); 84 84 85 85 return; -
issm/trunk-jpl/src/c/kml/KML_MultiGeometry.cpp
r15099 r15100 46 46 bool flag=true; 47 47 48 if(flag) _p printString_("KML_Multigeometry:" << "\n");48 if(flag) _printf0_("KML_Multigeometry:" << "\n"); 49 49 KML_Geometry::Echo(); 50 50 51 if(flag) _p printString_(" geometry: (size=" << geometry->Size() << ")" << "\n");51 if(flag) _printf0_(" geometry: (size=" << geometry->Size() << ")" << "\n"); 52 52 53 53 return; … … 71 71 bool flag=true; 72 72 73 if(flag) _p printString_(indent << "KML_Multigeometry:" << "\n");73 if(flag) _printf0_(indent << "KML_Multigeometry:" << "\n"); 74 74 KML_Geometry::DeepEcho(indent); 75 75 … … 81 81 if (geometry->Size()) 82 82 for (i=0; i<geometry->Size(); i++) { 83 if(flag) _p printString_(indent << " geometry: -------- begin [" << i << "] --------" << "\n");83 if(flag) _printf0_(indent << " geometry: -------- begin [" << i << "] --------" << "\n"); 84 84 ((KML_Geometry *)geometry->GetObjectByOffset(i))->DeepEcho(indent2); 85 if(flag) _p printString_(indent << " geometry: -------- end [" << i << "] --------" << "\n");85 if(flag) _printf0_(indent << " geometry: -------- end [" << i << "] --------" << "\n"); 86 86 } 87 87 else 88 if(flag) _p printString_(indent << " geometry: [empty]" << "\n");88 if(flag) _printf0_(indent << " geometry: [empty]" << "\n"); 89 89 90 90 return; -
issm/trunk-jpl/src/c/kml/KML_Object.cpp
r15099 r15100 66 66 bool flag=true; 67 67 68 if(flag) _p printString_(" attrib: (size=" << attrib->Size() << ")" << "\n");69 if(flag) _p printString_(" commnt: (size=" << commnt->Size() << ")" << "\n");70 if(flag) _p printString_(" kmlobj: (size=" << kmlobj->Size() << ")" << "\n");68 if(flag) _printf0_(" attrib: (size=" << attrib->Size() << ")" << "\n"); 69 if(flag) _printf0_(" commnt: (size=" << commnt->Size() << ")" << "\n"); 70 if(flag) _printf0_(" kmlobj: (size=" << kmlobj->Size() << ")" << "\n"); 71 71 72 72 return; … … 97 97 } 98 98 else 99 if(flag) _p printString_(indent << " attrib: [empty]" << "\n");99 if(flag) _printf0_(indent << " attrib: [empty]" << "\n"); 100 100 101 101 /* loop over the comments for the object */ … … 106 106 } 107 107 else 108 if(flag) _p printString_(indent << " commnt: [empty]" << "\n");108 if(flag) _printf0_(indent << " commnt: [empty]" << "\n"); 109 109 110 110 /* loop over the unknown objects for the object */ … … 115 115 if (kmlobj->Size()) 116 116 for (i=0; i<kmlobj->Size(); i++) { 117 if(flag) _p printString_(indent << " kmlobj: -------- begin [" << i << "] --------" << "\n");117 if(flag) _printf0_(indent << " kmlobj: -------- begin [" << i << "] --------" << "\n"); 118 118 ((KML_Unknown *)kmlobj->GetObjectByOffset(i))->DeepEcho(indent2); 119 if(flag) _p printString_(indent << " kmlobj: -------- end [" << i << "] --------" << "\n");119 if(flag) _printf0_(indent << " kmlobj: -------- end [" << i << "] --------" << "\n"); 120 120 } 121 121 else 122 if(flag) _p printString_(indent << " kmlobj: [empty]" << "\n");122 if(flag) _printf0_(indent << " kmlobj: [empty]" << "\n"); 123 123 124 124 return; … … 264 264 265 265 else if (!strncmp(kstr,"<",1)) { 266 _p printString_("KML_Object::Read -- Unrecognized opening tag " << kstr << "." << "\n");266 _printf0_("KML_Object::Read -- Unrecognized opening tag " << kstr << "." << "\n"); 267 267 // KMLFileTagSkip(kstr, 268 268 // fid); -
issm/trunk-jpl/src/c/kml/KML_Overlay.cpp
r15099 r15100 45 45 46 46 KML_Feature::Echo(); 47 _p printString_(" color: \"" << color << "\"" << "\n");48 _p printString_(" draword: " << draword << "\n");49 _p printString_(" icon: " << icon << "\n");47 _printf0_(" color: \"" << color << "\"" << "\n"); 48 _printf0_(" draword: " << draword << "\n"); 49 _printf0_(" icon: " << icon << "\n"); 50 50 } 51 51 /*}}}*/ … … 69 69 strcat(indent2," "); 70 70 71 _p printString_(indent << " color: " << color << "\n");72 _p printString_(indent << " draword: " << draword << "\n");71 _printf0_(indent << " color: " << color << "\n"); 72 _printf0_(indent << " draword: " << draword << "\n"); 73 73 if (icon) 74 74 icon->DeepEcho(indent2); 75 75 else 76 _p printString_(indent << " icon: " << icon << "\n");76 _printf0_(indent << " icon: " << icon << "\n"); 77 77 } 78 78 /*}}}*/ -
issm/trunk-jpl/src/c/kml/KML_Placemark.cpp
r15099 r15100 47 47 bool flag=true; 48 48 49 if(flag) _p printString_("KML_Placemark:" << "\n");49 if(flag) _printf0_("KML_Placemark:" << "\n"); 50 50 KML_Feature::Echo(); 51 51 52 if(flag) _p printString_(" geometry: (size=" << geometry->Size() << ")" << "\n");52 if(flag) _printf0_(" geometry: (size=" << geometry->Size() << ")" << "\n"); 53 53 54 54 return; … … 72 72 bool flag=true; 73 73 74 if(flag) _p printString_(indent << "KML_Placemark:" << "\n");74 if(flag) _printf0_(indent << "KML_Placemark:" << "\n"); 75 75 KML_Feature::DeepEcho(indent); 76 76 … … 82 82 if (geometry->Size()) 83 83 for (i=0; i<geometry->Size(); i++) { 84 if(flag) _p printString_(indent << " geometry: -------- begin [" << i << "] --------" << "\n");84 if(flag) _printf0_(indent << " geometry: -------- begin [" << i << "] --------" << "\n"); 85 85 ((KML_Geometry *)geometry->GetObjectByOffset(i))->DeepEcho(indent2); 86 if(flag) _p printString_(indent << " geometry: -------- end [" << i << "] --------" << "\n");86 if(flag) _printf0_(indent << " geometry: -------- end [" << i << "] --------" << "\n"); 87 87 } 88 88 else 89 if(flag) _p printString_(indent << " geometry: [empty]" << "\n");89 if(flag) _printf0_(indent << " geometry: [empty]" << "\n"); 90 90 91 91 return; -
issm/trunk-jpl/src/c/kml/KML_Point.cpp
r15099 r15100 43 43 bool flag=true; 44 44 45 if(flag) _p printString_("KML_Point:" << "\n");45 if(flag) _printf0_("KML_Point:" << "\n"); 46 46 KML_Geometry::Echo(); 47 47 48 if(flag) _p printString_(" extrude: " << (extrude ? "true" : "false") << "\n");49 if(flag) _p printString_(" altmode: \"" << altmode << "\"" << "\n");50 if(flag) _p printString_(" coords: (" << coords[0] << "," << coords[1] << "," << coords[2] << ")" << "\n");48 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 49 if(flag) _printf0_(" altmode: \"" << altmode << "\"" << "\n"); 50 if(flag) _printf0_(" coords: (" << coords[0] << "," << coords[1] << "," << coords[2] << ")" << "\n"); 51 51 52 52 return; … … 68 68 bool flag=true; 69 69 70 if(flag) _p printString_(indent << "KML_Point:" << "\n");70 if(flag) _printf0_(indent << "KML_Point:" << "\n"); 71 71 KML_Geometry::DeepEcho(indent); 72 72 73 if(flag) _p printString_(indent << " extrude: " << (extrude ? "true" : "false") << "\n");74 if(flag) _p printString_(indent << " altmode: \"" << altmode << "\"" << "\n");75 if(flag) _p printString_(indent << " coords: (" << coords[0] << "," << coords[1] << "," << coords[2] << ")" << "\n");73 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 74 if(flag) _printf0_(indent << " altmode: \"" << altmode << "\"" << "\n"); 75 if(flag) _printf0_(indent << " coords: (" << coords[0] << "," << coords[1] << "," << coords[2] << ")" << "\n"); 76 76 77 77 return; -
issm/trunk-jpl/src/c/kml/KML_PolyStyle.cpp
r15099 r15100 41 41 bool flag=true; 42 42 43 if(flag) _p printString_("KML_PolyStyle:" << "\n");43 if(flag) _printf0_("KML_PolyStyle:" << "\n"); 44 44 KML_ColorStyle::Echo(); 45 45 46 if(flag) _p printString_(" fill: " << fill << "\n");47 if(flag) _p printString_(" outline: " << outline << "\n");46 if(flag) _printf0_(" fill: " << fill << "\n"); 47 if(flag) _printf0_(" outline: " << outline << "\n"); 48 48 49 49 return; … … 65 65 bool flag=true; 66 66 67 if(flag) _p printString_(indent << "KML_PolyStyle:" << "\n");67 if(flag) _printf0_(indent << "KML_PolyStyle:" << "\n"); 68 68 KML_ColorStyle::DeepEcho(indent); 69 69 70 if(flag) _p printString_(indent << " fill: " << fill << "\n");71 if(flag) _p printString_(indent << " outline: " << outline << "\n");70 if(flag) _printf0_(indent << " fill: " << fill << "\n"); 71 if(flag) _printf0_(indent << " outline: " << outline << "\n"); 72 72 73 73 return; -
issm/trunk-jpl/src/c/kml/KML_Polygon.cpp
r15099 r15100 52 52 bool flag=true; 53 53 54 if(flag) _p printString_("KML_Polygon:" << "\n");54 if(flag) _printf0_("KML_Polygon:" << "\n"); 55 55 KML_Geometry::Echo(); 56 56 57 if(flag) _p printString_(" extrude: " << (extrude ? "true" : "false") << "\n");58 if(flag) _p printString_(" tessellate: " << (tessellate ? "true" : "false") << "\n");59 if(flag) _p printString_(" altmode: \"" << altmode << "\"" << "\n");60 if(flag) _p printString_(" outer: (size=" << outer->Size() << ")" << "\n");61 if(flag) _p printString_(" inner: (size=" << inner->Size() << ")" << "\n");57 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 58 if(flag) _printf0_(" tessellate: " << (tessellate ? "true" : "false") << "\n"); 59 if(flag) _printf0_(" altmode: \"" << altmode << "\"" << "\n"); 60 if(flag) _printf0_(" outer: (size=" << outer->Size() << ")" << "\n"); 61 if(flag) _printf0_(" inner: (size=" << inner->Size() << ")" << "\n"); 62 62 63 63 return; … … 81 81 bool flag=true; 82 82 83 if(flag) _p printString_(indent << "KML_Polygon:" << "\n");83 if(flag) _printf0_(indent << "KML_Polygon:" << "\n"); 84 84 KML_Geometry::DeepEcho(indent); 85 85 86 if(flag) _p printString_(indent << " extrude: " << (extrude ? "true" : "false") << "\n");87 if(flag) _p printString_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n");88 if(flag) _p printString_(indent << " altmode: \"" << altmode << "\"" << "\n");86 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 87 if(flag) _printf0_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n"); 88 if(flag) _printf0_(indent << " altmode: \"" << altmode << "\"" << "\n"); 89 89 90 90 memcpy(indent2,indent,(strlen(indent)+1)*sizeof(char)); … … 93 93 if (outer->Size()) 94 94 for (i=0; i<outer->Size(); i++) { 95 if(flag) _p printString_(indent << " outer: -------- begin [" << i << "] --------" << "\n");95 if(flag) _printf0_(indent << " outer: -------- begin [" << i << "] --------" << "\n"); 96 96 ((KML_LinearRing *)outer->GetObjectByOffset(i))->DeepEcho(indent2); 97 if(flag) _p printString_(indent << " outer: -------- end [" << i << "] --------" << "\n");97 if(flag) _printf0_(indent << " outer: -------- end [" << i << "] --------" << "\n"); 98 98 } 99 99 else 100 if(flag) _p printString_(indent << " outer: [empty]" << "\n");100 if(flag) _printf0_(indent << " outer: [empty]" << "\n"); 101 101 102 102 if (inner->Size()) 103 103 for (i=0; i<inner->Size(); i++) { 104 if(flag) _p printString_(indent << " inner: -------- begin [" << i << "] --------" << "\n");104 if(flag) _printf0_(indent << " inner: -------- begin [" << i << "] --------" << "\n"); 105 105 ((KML_LinearRing *)inner->GetObjectByOffset(i))->DeepEcho(indent2); 106 if(flag) _p printString_(indent << " inner: -------- end [" << i << "] --------" << "\n");106 if(flag) _printf0_(indent << " inner: -------- end [" << i << "] --------" << "\n"); 107 107 } 108 108 else 109 if(flag) _p printString_(indent << " inner: [empty]" << "\n");109 if(flag) _printf0_(indent << " inner: [empty]" << "\n"); 110 110 111 111 return; -
issm/trunk-jpl/src/c/kml/KML_Style.cpp
r15099 r15100 68 68 bool flag=true; 69 69 70 if(flag) _p printString_("KML_Style:" << "\n");70 if(flag) _printf0_("KML_Style:" << "\n"); 71 71 KML_StyleSelector::Echo(); 72 72 73 if(flag) _p printString_(" icon: " << icon << "\n");74 if(flag) _p printString_(" label: " << label << "\n");75 if(flag) _p printString_(" line: " << line << "\n");76 if(flag) _p printString_(" poly: " << poly << "\n");77 if(flag) _p printString_(" balloon: " << balloon << "\n");78 if(flag) _p printString_(" list: " << list << "\n");73 if(flag) _printf0_(" icon: " << icon << "\n"); 74 if(flag) _printf0_(" label: " << label << "\n"); 75 if(flag) _printf0_(" line: " << line << "\n"); 76 if(flag) _printf0_(" poly: " << poly << "\n"); 77 if(flag) _printf0_(" balloon: " << balloon << "\n"); 78 if(flag) _printf0_(" list: " << list << "\n"); 79 79 80 80 return; … … 97 97 bool flag=true; 98 98 99 if(flag) _p printString_(indent << "KML_Style:" << "\n");99 if(flag) _printf0_(indent << "KML_Style:" << "\n"); 100 100 KML_StyleSelector::DeepEcho(indent); 101 101 … … 106 106 // icon->DeepEcho(indent2); 107 107 // else 108 if(flag) _p printString_(indent << " icon: " << icon << "\n");108 if(flag) _printf0_(indent << " icon: " << icon << "\n"); 109 109 // if (label) 110 110 // label->DeepEcho(indent2); 111 111 // else 112 if(flag) _p printString_(indent << " label: " << label << "\n");112 if(flag) _printf0_(indent << " label: " << label << "\n"); 113 113 if (line) 114 114 line->DeepEcho(indent2); 115 115 else 116 if(flag) _p printString_(indent << " line: " << line << "\n");116 if(flag) _printf0_(indent << " line: " << line << "\n"); 117 117 if (poly) 118 118 poly->DeepEcho(indent2); 119 119 else 120 if(flag) _p printString_(indent << " poly: " << poly << "\n");120 if(flag) _printf0_(indent << " poly: " << poly << "\n"); 121 121 // if (balloon) 122 122 // balloon->DeepEcho(indent2); 123 123 // else 124 if(flag) _p printString_(indent << " balloon: " << balloon << "\n");124 if(flag) _printf0_(indent << " balloon: " << balloon << "\n"); 125 125 // if (list) 126 126 // list->DeepEcho(indent2); 127 127 // else 128 if(flag) _p printString_(indent << " list: " << list << "\n");128 if(flag) _printf0_(indent << " list: " << list << "\n"); 129 129 130 130 return; -
issm/trunk-jpl/src/c/kml/KML_Unknown.cpp
r15099 r15100 40 40 bool flag=true; 41 41 42 if(flag) _p printString_("KML_Unknown " << name << ":" << "\n");42 if(flag) _printf0_("KML_Unknown " << name << ":" << "\n"); 43 43 KML_Object::Echo(); 44 44 45 45 if (value ) 46 if(flag) _p printString_(" value: \"" << value << "\"" << "\n");46 if(flag) _printf0_(" value: \"" << value << "\"" << "\n"); 47 47 else 48 if(flag) _p printString_(" value: [none]" << "\n");48 if(flag) _printf0_(" value: [none]" << "\n"); 49 49 50 50 return; … … 69 69 bool flag=true; 70 70 71 if(flag) _p printString_(indent << "KML_Unknown " << name << ":" << "\n");71 if(flag) _printf0_(indent << "KML_Unknown " << name << ":" << "\n"); 72 72 KML_Object::DeepEcho(indent); 73 73 … … 77 77 78 78 vtoken=strtok(valuei,nl); 79 if(flag) _p printString_(indent << " value: \"" << vtoken);79 if(flag) _printf0_(indent << " value: \"" << vtoken); 80 80 81 81 while (vtoken=strtok(NULL,nl)) 82 if(flag) _p printString_("\n" << indent << " " << vtoken);83 if(flag) _p printString_("\"" << "\n");82 if(flag) _printf0_("\n" << indent << " " << vtoken); 83 if(flag) _printf0_("\"" << "\n"); 84 84 85 85 xDelete<char>(valuei); 86 86 } 87 87 else 88 if(flag) _p printString_(indent << " value: [none]" << "\n");88 if(flag) _printf0_(indent << " value: [none]" << "\n"); 89 89 90 90 return; … … 136 136 name=KMLFileTagName(NULL, 137 137 kstr); 138 // _p printString_("KML_Unknown::Read -- opening name=" << name << "." << "\n");138 // _printf0_("KML_Unknown::Read -- opening name=" << name << "." << "\n"); 139 139 140 140 /* get object attributes and check for solo tag */ … … 148 148 while (kstri=KMLFileToken(fid, 149 149 &ncom,&pcom)) { 150 // _p printString_("KML_Unknown::Read -- kstri=" << kstri << "." << "\n");150 // _printf0_("KML_Unknown::Read -- kstri=" << kstri << "." << "\n"); 151 151 if (!strncmp(&kstri[0],"</", 2) && 152 152 !strncmp(&kstri[2],name,strlen(name))) { 153 // _p printString_("KML_Unknown::Read -- closing name=" << name << "." << "\n");153 // _printf0_("KML_Unknown::Read -- closing name=" << name << "." << "\n"); 154 154 xDelete<char>(kstri); 155 155 break; -
issm/trunk-jpl/src/c/main/kriging.cpp
r15099 r15100 51 51 pfclose(input_fid,binfilename); 52 52 53 _p printString_("call computational core:" << "\n");53 _printf0_("call computational core:" << "\n"); 54 54 pKrigingx(&predictions,&error,x,y,data,nobs,x_interp,y_interp,ninterp,options); 55 55 56 _p printString_("write results to disk:" << "\n");56 _printf0_("write results to disk:" << "\n"); 57 57 Results *results = new Results(); 58 58 if(IssmComm::GetRank()==0){ … … 68 68 69 69 /*Close output and toolkits options file and write lock file if requested*/ 70 _p printString_("write lock file:" << "\n");70 _printf0_("write lock file:" << "\n"); 71 71 WriteLockFile(lockfilename); 72 72 -
issm/trunk-jpl/src/c/modules/Bamgx/Bamgx.cpp
r15099 r15100 40 40 41 41 //Step1: generate geometry Gh 42 if (verbosity>0) _print String_("Construction of a mesh from a given geometry" << "\n");43 if (verbosity>1) _print String_(" Processing geometry..." << "\n");42 if (verbosity>0) _printf_("Construction of a mesh from a given geometry" << "\n"); 43 if (verbosity>1) _printf_(" Processing geometry..." << "\n"); 44 44 Geometry Gh(bamggeom_in,bamgopts); 45 45 … … 49 49 50 50 //build metric using geometry 51 if (verbosity>1) _print String_(" Generating Metric..." << "\n");51 if (verbosity>1) _printf_(" Generating Metric..." << "\n"); 52 52 for(i=0;i<Gh.nbv;i++){ 53 53 Metric M=Gh[i]; … … 59 59 60 60 //generate mesh 61 if (verbosity>1) _print String_(" Generating Mesh..." << "\n");61 if (verbosity>1) _printf_(" Generating Mesh..." << "\n"); 62 62 Mesh Th(maxnbv,Gh,bamgopts); 63 63 … … 72 72 73 73 //Build output 74 if (verbosity>1) _print String_(" Write Mesh..." << "\n");74 if (verbosity>1) _printf_(" Write Mesh..." << "\n"); 75 75 Th.WriteMesh(bamgmesh_out,bamgopts); 76 if (verbosity>1) _print String_(" Write Geometry..." << "\n");76 if (verbosity>1) _printf_(" Write Geometry..." << "\n"); 77 77 Gh.WriteGeometry(bamggeom_out,bamgopts); 78 78 … … 86 86 87 87 // read background mesh 88 if (verbosity>0) _print String_("Anisotropic mesh adaptation" << "\n");89 if (verbosity>1) _print String_(" Processing initial mesh and geometry..." << "\n");88 if (verbosity>0) _printf_("Anisotropic mesh adaptation" << "\n"); 89 if (verbosity>1) _printf_(" Processing initial mesh and geometry..." << "\n"); 90 90 Mesh BTh(bamggeom_in,bamgmesh_in,bamgopts); 91 91 … … 99 99 //Generate initial metric 100 100 if (bamgopts->metric){ 101 if (verbosity>1) _print String_(" Processing Metric..." << "\n");101 if (verbosity>1) _printf_(" Processing Metric..." << "\n"); 102 102 BTh.ReadMetric(bamgopts); 103 103 } 104 104 else { 105 if (verbosity>1) _print String_(" Generating initial Metric..." << "\n");105 if (verbosity>1) _printf_(" Generating initial Metric..." << "\n"); 106 106 Metric Mhmax(bamgopts->hmax); 107 107 for (int iv=0;iv<BTh.nbv;iv++) BTh[iv].m = Mhmax; … … 110 110 //use present fields to generate metric if present 111 111 if (bamgopts->field){ 112 if (verbosity>1) _print String_(" Merge metric with field provided..." << "\n");112 if (verbosity>1) _printf_(" Merge metric with field provided..." << "\n"); 113 113 BTh.AddMetric(bamgopts); 114 114 } … … 116 116 // change using hVertices if provided 117 117 if(bamgopts->hVertices && bamgopts->hVerticesSize[0]==BTh.nbv){ 118 if (verbosity>1) _print String_(" Merging Metric with hVertices..." << "\n");118 if (verbosity>1) _printf_(" Merging Metric with hVertices..." << "\n"); 119 119 for (i=0;i<BTh.nbv;i++){ 120 120 if (!xIsNan<IssmPDouble>(bamgopts->hVertices[i])){ … … 126 126 // change using hminVertices if provided 127 127 if (bamgopts->hminVertices){ 128 if (verbosity>1) _print String_(" Merging Metric with hminVertices..." << "\n");128 if (verbosity>1) _printf_(" Merging Metric with hminVertices..." << "\n"); 129 129 for (i=0;i<BTh.nbv;i++){ 130 130 if (!xIsNan<IssmPDouble>(bamgopts->hminVertices[i])){ … … 139 139 // change using hmaxVertices if provided 140 140 if (bamgopts->hmaxVertices){ 141 if (verbosity>1) _print String_(" Merging Metric with hmaxVertices..." << "\n");141 if (verbosity>1) _printf_(" Merging Metric with hmaxVertices..." << "\n"); 142 142 for (i=0;i<BTh.nbv;i++){ 143 143 if (!xIsNan<IssmPDouble>(bamgopts->hmaxVertices[i])){ … … 163 163 164 164 //Build new mesh 165 if (verbosity>1) _print String_(" Generating Mesh..." << "\n");165 if (verbosity>1) _printf_(" Generating Mesh..." << "\n"); 166 166 Thr=&BTh,Thb=0; 167 167 Mesh & Th( *(0 ? new Mesh(*Thr,&Thr->Gh,Thb,maxnbv) : new Mesh(maxnbv,BTh,bamgopts,bamgopts->KeepVertices))); … … 184 184 if(verbosity>0) { 185 185 if (Th.nbt-Th.nbtout-Th.nbq*2){ 186 _print String_(" new number of triangles = " << (Th.nbt-Th.nbtout-Th.nbq*2) << "\n");186 _printf_(" new number of triangles = " << (Th.nbt-Th.nbtout-Th.nbq*2) << "\n"); 187 187 } 188 188 if (Th.nbq ){ 189 _print String_(" new number of quads = " << Th.nbq << "\n");189 _printf_(" new number of quads = " << Th.nbq << "\n"); 190 190 } 191 191 } 192 192 193 193 //Build output 194 if (verbosity>1) _print String_(" Write Mesh..." << "\n");194 if (verbosity>1) _printf_(" Write Mesh..." << "\n"); 195 195 Th.WriteMesh(bamgmesh_out,bamgopts); 196 if (verbosity>1) _print String_(" Write Geometry..." << "\n");196 if (verbosity>1) _printf_(" Write Geometry..." << "\n"); 197 197 Th.Gh.WriteGeometry(bamggeom_out,bamgopts); 198 if (verbosity>1) _print String_(" Write Metric..." << "\n");198 if (verbosity>1) _printf_(" Write Metric..." << "\n"); 199 199 BTh.WriteMetric(bamgopts); 200 200 … … 206 206 207 207 /*No error return*/ 208 if (verbosity>1) _print String_(" Exiting Bamg." << "\n");208 if (verbosity>1) _printf_(" Exiting Bamg." << "\n"); 209 209 return noerr; 210 210 -
issm/trunk-jpl/src/c/modules/Chacox/Chacox.cpp
r15099 r15100 63 63 64 64 if (DEBUG_TRACE > 0) { 65 _print String_("<Entering main>" << "\n");65 _printf_("<Entering main>" << "\n"); 66 66 } 67 67 68 68 if (PRINT_HEADERS) { 69 _print String_("\n Chaco 2.0" << "\n");70 _print String_(" Sandia National Laboratories\n" << "\n");69 _printf_("\n Chaco 2.0" << "\n"); 70 _printf_(" Sandia National Laboratories\n" << "\n"); 71 71 } 72 72 … … 166 166 167 167 if (DEBUG_MEMORY > 0) { 168 _print String_("" << "\n");168 _printf_("" << "\n"); 169 169 smalloc_stats(); 170 170 } … … 174 174 175 175 if (DEBUG_TRACE > 1) { 176 _print String_("<Leaving main>" << "\n");176 _printf_("<Leaving main>" << "\n"); 177 177 } 178 178 -
issm/trunk-jpl/src/c/modules/Chacox/input_parse.cpp
r15099 r15100 37 37 38 38 if (DEBUG_TRACE > 0) { 39 _print String_("<Entering input_parse>" << "\n");39 _printf_("<Entering input_parse>" << "\n"); 40 40 } 41 41 42 42 if (PROMPT) { 43 _print String_("Parallel machine architecture:" << "\n");44 _print String_(" (0) Hypercube" << "\n");45 _print String_(" (1) One-dimensional mesh" << "\n");46 _print String_(" (2) Two-dimensional mesh" << "\n");47 _print String_(" (3) Three-dimensional mesh" << "\n");43 _printf_("Parallel machine architecture:" << "\n"); 44 _printf_(" (0) Hypercube" << "\n"); 45 _printf_(" (1) One-dimensional mesh" << "\n"); 46 _printf_(" (2) Two-dimensional mesh" << "\n"); 47 _printf_(" (3) Three-dimensional mesh" << "\n"); 48 48 } 49 49 *architecture = (int)options[OPT_ARCH]; … … 55 55 /* Name output assignment file. */ 56 56 if (PROMPT) 57 _print String_("Assignment output file: ");57 _printf_("Assignment output file: "); 58 58 outassignname = NULL; 59 59 60 60 /* Name output results file. */ 61 61 if (PROMPT) 62 _print String_("File name for saving run results: ");62 _printf_("File name for saving run results: "); 63 63 outfilename = NULL; 64 64 … … 73 73 else { 74 74 if (PROMPT) { 75 _print String_("Global partitioning method:" << "\n");76 _print String_(" (1) Multilevel-KL" << "\n");77 _print String_(" (2) Spectral" << "\n");78 _print String_(" (3) Inertial" << "\n");79 _print String_(" (4) Linear" << "\n");80 _print String_(" (5) Random" << "\n");81 _print String_(" (6) Scattered" << "\n");82 _print String_(" (7) Read-from-file" << "\n");75 _printf_("Global partitioning method:" << "\n"); 76 _printf_(" (1) Multilevel-KL" << "\n"); 77 _printf_(" (2) Spectral" << "\n"); 78 _printf_(" (3) Inertial" << "\n"); 79 _printf_(" (4) Linear" << "\n"); 80 _printf_(" (5) Random" << "\n"); 81 _printf_(" (6) Scattered" << "\n"); 82 _printf_(" (7) Read-from-file" << "\n"); 83 83 } 84 84 *global_method = (int)options[OPT_GLOBAL]; … … 91 91 if (*global_method == 7) { /* Name and open input assignment file. */ 92 92 if (PROMPT) 93 _print String_("Assignment input file: ");93 _printf_("Assignment input file: "); 94 94 } 95 95 96 96 else if (*global_method == 3) { 97 97 if (PROMPT) 98 _print String_("Geometry input file name: ");98 _printf_("Geometry input file name: "); 99 99 } 100 100 101 101 else if (*global_method == 2) { 102 102 if (PROMPT) { 103 _print String_("Eigensolver:" << "\n");104 _print String_(" (1) Multilevel RQI/Symmlq" << "\n");105 _print String_(" (2) Lanczos" << "\n");103 _printf_("Eigensolver:" << "\n"); 104 _printf_(" (1) Multilevel RQI/Symmlq" << "\n"); 105 _printf_(" (2) Lanczos" << "\n"); 106 106 } 107 107 eigensolver = (int)options[OPT_RQI]; … … 113 113 if (MATCH_TYPE == 5) { /* geometric matching */ 114 114 if (PROMPT) 115 _print String_("Geometry input file name: ");115 _printf_("Geometry input file name: "); 116 116 } 117 117 *rqi_flag = 1; 118 118 if (PROMPT) 119 _print String_("Number of vertices to coarsen down to: ");119 _printf_("Number of vertices to coarsen down to: "); 120 120 *vmax = (int)options[OPT_VMAX]; 121 121 if (*vmax <= 0) { … … 132 132 if (MATCH_TYPE == 5) { /* geometric matching */ 133 133 if (PROMPT) 134 _print String_("Geometry input file name: ");135 } 136 if (PROMPT) 137 _print String_("Number of vertices to coarsen down to: ");134 _printf_("Geometry input file name: "); 135 } 136 if (PROMPT) 137 _printf_("Number of vertices to coarsen down to: "); 138 138 *vmax = (int)options[OPT_VMAX]; 139 139 if (*vmax <= 0) { … … 162 162 else { 163 163 if (PROMPT) { 164 _print String_("Local refinement method:" << "\n");165 _print String_(" (1) Kernighan-Lin" << "\n");166 _print String_(" (2) None" << "\n");164 _printf_("Local refinement method:" << "\n"); 165 _printf_(" (1) Kernighan-Lin" << "\n"); 166 _printf_(" (2) None" << "\n"); 167 167 } 168 168 *local_method = (int)options[OPT_LOCAL]; … … 178 178 *ndims_tot = 0; 179 179 if (PROMPT) 180 _print String_("Total number of target hypercube dimensions: ");180 _printf_("Total number of target hypercube dimensions: "); 181 181 *ndims_tot = nparts[0]; 182 182 if (*ndims_tot < 1) { 183 _print String_(" Number of divisions must be at least 1" << "\n");183 _printf_(" Number of divisions must be at least 1" << "\n"); 184 184 printf("%s -- Number of divisions %d must be at least 1.\n", 185 185 __FUNCT__,nparts[0]); … … 193 193 if (*architecture == 2) { 194 194 if (PROMPT) 195 _print String_("X and Y extent of of 2-D mesh: ");195 _printf_("X and Y extent of of 2-D mesh: "); 196 196 mesh_dims[0] = nparts[0]; 197 197 mesh_dims[1] = nparts[1]; … … 199 199 else if (*architecture == 3) { 200 200 if (PROMPT) 201 _print String_("X, Y and Z extent of 3-D mesh: ");201 _printf_("X, Y and Z extent of 3-D mesh: "); 202 202 mesh_dims[0] = nparts[0]; 203 203 mesh_dims[1] = nparts[1]; … … 206 206 else { /* Anything else => 1-D mesh */ 207 207 if (PROMPT) 208 _print String_("Size of 1-D mesh: ");208 _printf_("Size of 1-D mesh: "); 209 209 mesh_dims[0] = nparts[0]; 210 210 *architecture = 1; … … 220 220 else if (*nprocs <= 7) { 221 221 if (PROMPT) { 222 _print String_("Partitioning dimension: " << "\n");223 _print String_(" (1) Bisection" << "\n");224 _print String_(" (2) Quadrisection" << "\n");222 _printf_("Partitioning dimension: " << "\n"); 223 _printf_(" (1) Bisection" << "\n"); 224 _printf_(" (2) Quadrisection" << "\n"); 225 225 } 226 226 *ndims = (int)options[OPT_NDIMS]; … … 232 232 else { 233 233 if (PROMPT) { 234 _print String_("Partitioning dimension: " << "\n");235 _print String_(" (1) Bisection" << "\n");236 _print String_(" (2) Quadrisection" << "\n");237 _print String_(" (3) Octasection" << "\n");234 _printf_("Partitioning dimension: " << "\n"); 235 _printf_(" (1) Bisection" << "\n"); 236 _printf_(" (2) Quadrisection" << "\n"); 237 _printf_(" (3) Octasection" << "\n"); 238 238 } 239 239 *ndims = (int)options[OPT_NDIMS]; -
issm/trunk-jpl/src/c/modules/ConfigureObjectsx/ConfigureObjectsx.cpp
r15099 r15100 23 23 parameters->FindParam(&configuration_type,ConfigurationTypeEnum); 24 24 25 if(VerboseMProcessor()) _p printString_(" Configuring elements..." << "\n");25 if(VerboseMProcessor()) _printf0_(" Configuring elements..." << "\n"); 26 26 for (i=0;i<elements->Size();i++){ 27 27 element=dynamic_cast<Element*>(elements->GetObjectByOffset(i)); 28 28 element->Configure(elements,loads,nodes,vertices,materials,parameters); 29 29 } 30 if(VerboseMProcessor()) _p printString_(" Configuring loads..." << "\n");30 if(VerboseMProcessor()) _printf0_(" Configuring loads..." << "\n"); 31 31 for (i=0;i<loads->Size();i++){ 32 32 load=(Load*)loads->GetObjectByOffset(i); … … 35 35 } 36 36 } 37 if(VerboseMProcessor()) _p printString_(" Configuring nodes..." << "\n");37 if(VerboseMProcessor()) _printf0_(" Configuring nodes..." << "\n"); 38 38 for (i=0;i<nodes->Size();i++){ 39 39 node=(Node*)nodes->GetObjectByOffset(i); … … 43 43 } 44 44 45 if(VerboseMProcessor()) _p printString_(" Configuring materials..." << "\n");45 if(VerboseMProcessor()) _printf0_(" Configuring materials..." << "\n"); 46 46 for (i=0;i<materials->Size();i++){ 47 47 material=(Material*)materials->GetObjectByOffset(i); -
issm/trunk-jpl/src/c/modules/ConstraintsStatex/ConstraintsStatex.cpp
r15099 r15100 17 17 18 18 /*Display message*/ 19 if(VerboseModule()) _p printString_(" Constraining penalties" << "\n");19 if(VerboseModule()) _printf0_(" Constraining penalties" << "\n"); 20 20 21 21 /*recover parameters: */ -
issm/trunk-jpl/src/c/modules/ConstraintsStatex/RiftConstraintsState.cpp
r15099 r15100 51 51 } 52 52 else if(num_unstable_constraints<=min_mechanical_constraints){ 53 if(VerboseModule()) _p printString_(" freezing constraints" << "\n");53 if(VerboseModule()) _printf0_(" freezing constraints" << "\n"); 54 54 RiftFreezeConstraints(loads,configuration_type); 55 55 } -
issm/trunk-jpl/src/c/modules/CreateNodalConstraintsx/CreateNodalConstraintsx.cpp
r15099 r15100 17 17 int slocalsize; 18 18 19 if(VerboseModule()) _p printString_(" Create nodal constraints" << "\n");19 if(VerboseModule()) _printf0_(" Create nodal constraints" << "\n"); 20 20 21 21 /*figure out how many dofs we have: */ -
issm/trunk-jpl/src/c/modules/Exp2Kmlx/Exp2Kmlx.cpp
r15099 r15100 47 47 clock0=clock(); 48 48 time0 =time(NULL); 49 _p printString_("\nExp2Kmlx Module -- " << ctime(&time0));49 _printf0_("\nExp2Kmlx Module -- " << ctime(&time0)); 50 50 51 51 /*read exp file */ … … 53 53 if (!ExpRead(&nprof,&pnvert,&pprofx,&pprofy,&closed,filexp)) 54 54 _error_("Error reading exp file."); 55 _p printString_("Exp2Kmlx -- Reading " << nprof << " exp profiles from file \"" << filexp << "\"." << "\n");55 _printf0_("Exp2Kmlx -- Reading " << nprof << " exp profiles from file \"" << filexp << "\"." << "\n"); 56 56 // for (i=0; i<nprof; i++) 57 // _print String_("i=" << i << "; nvert=" << pnvert[i] << ", closed=" << closed[i] << "\n");57 // _printf_("i=" << i << "; nvert=" << pnvert[i] << ", closed=" << closed[i] << "\n"); 58 58 59 59 /* construct kml file */ … … 118 118 119 119 if (holes && nprof && (pnvert[0] <= 1 || pprofx[0][pnvert[0]-1] != pprofx[0][0] || pprofy[0][pnvert[0]-1] != pprofy[0][0])) { 120 _p printString_("Warning -- Outer profile is not closed, so \"holes\" option will be ignored." << "\n");120 _printf0_("Warning -- Outer profile is not closed, so \"holes\" option will be ignored." << "\n"); 121 121 holes=false; 122 122 } … … 150 150 for (i=1; i<nprof; i++) { 151 151 if (pnvert[i] <= 1 || pprofx[i][pnvert[i]-1] != pprofx[i][0] || pprofy[i][pnvert[i]-1] != pprofy[i][0]) { 152 _p printString_("Warning -- Inner profile " << i+1 << " is not closed with \"holes\" specified, so it will be ignored." << "\n");152 _printf0_("Warning -- Inner profile " << i+1 << " is not closed with \"holes\" specified, so it will be ignored." << "\n"); 153 153 continue; 154 154 } … … 272 272 /* write kml file */ 273 273 274 _p printString_("Exp2Kmlx -- Writing kml document to file \"" << filkml << "\"." << "\n");274 _printf0_("Exp2Kmlx -- Writing kml document to file \"" << filkml << "\"." << "\n"); 275 275 fid=fopen(filkml,"w"); 276 276 fprintf(fid,"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n"); … … 287 287 clock1=clock(); 288 288 time1 =time(NULL); 289 _print String_("Exp2Kmlx Module -- " <<((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " <<difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");289 _printf_("Exp2Kmlx Module -- " <<((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " <<difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 290 290 291 291 return(iret); -
issm/trunk-jpl/src/c/modules/GetSolutionFromInputsx/GetSolutionFromInputsx.cpp
r15099 r15100 19 19 Vector<IssmDouble>* solution=NULL; 20 20 21 if(VerboseModule()) _p printString_(" Get solution from inputs" << "\n");21 if(VerboseModule()) _printf0_(" Get solution from inputs" << "\n"); 22 22 23 23 /*retrive parameters: */ -
issm/trunk-jpl/src/c/modules/GroundinglineMigrationx/GroundinglineMigrationx.cpp
r15099 r15100 17 17 Element *element = NULL; 18 18 19 if(VerboseModule()) _p printString_(" Migrating grounding line" << "\n");19 if(VerboseModule()) _printf0_(" Migrating grounding line" << "\n"); 20 20 21 21 /*retrieve parameters: */ … … 162 162 #ifdef _HAVE_MPI_ 163 163 MPI_Allreduce(&local_nflipped,&nflipped,1,MPI_INT,MPI_SUM,IssmComm::GetComm()); 164 if(VerboseConvergence()) _p printString_(" Additional number of vertices allowed to unground: " << nflipped << "\n");164 if(VerboseConvergence()) _printf0_(" Additional number of vertices allowed to unground: " << nflipped << "\n"); 165 165 #else 166 166 nflipped=local_nflipped; -
issm/trunk-jpl/src/c/modules/HoleFillerx/HoleFillerx.cpp
r15099 r15100 69 69 } 70 70 } 71 _print String_( "" << "\n");72 _print String_("Number of zeroes remaining: " << lines*samps-counter);71 _printf_( "" << "\n"); 72 _printf_("Number of zeroes remaining: " << lines*samps-counter); 73 73 fflush( stdout ); 74 74 #endif … … 88 88 } 89 89 // n u m b e r o f z e r o e s r e m a i n i n g : 1 2 3 4 5 6 7 8 9 10 90 _print String_( "\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b" );91 _print String_("Number of zeroes remaining: " << lines*samps-counter);90 _printf_( "\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b" ); 91 _printf_("Number of zeroes remaining: " << lines*samps-counter); 92 92 fflush( stdout ); 93 93 #endif … … 97 97 /***************** FIRST RUN *********************/ 98 98 /* 99 fprintf ( stdout, "First Application: " ); time(&t2); _print String_( ctime(&t2) );99 fprintf ( stdout, "First Application: " ); time(&t2); _printf_( ctime(&t2) ); 100 100 */ 101 101 for ( i = 0; i < lines; i++ ){ … … 268 268 269 269 #ifdef _DEBUG2_ 270 //_print String_(temp << " " << elev << " " << range << " " << "\n");270 //_printf_(temp << " " << elev << " " << range << " " << "\n"); 271 271 #endif 272 272 … … 337 337 338 338 #ifdef _DEBUG2_ 339 _print String_( "\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b" );340 _print String_("Number of zeroes remaining: 0\n" << "\n");339 _printf_( "\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b" ); 340 _printf_("Number of zeroes remaining: 0\n" << "\n"); 341 341 printf ( "\n"); 342 342 #endif -
issm/trunk-jpl/src/c/modules/InputUpdateFromConstantx/InputUpdateFromConstantx.cpp
r15099 r15100 10 10 11 11 int i; 12 if(VerboseModule()) _p printString_(" Input updates from constant" << "\n");12 if(VerboseModule()) _printf0_(" Input updates from constant" << "\n"); 13 13 14 14 /*Elements and loads drive the update: */ … … 31 31 32 32 int i; 33 if(VerboseModule()) _p printString_(" Input updates from constant" << "\n");33 if(VerboseModule()) _printf0_(" Input updates from constant" << "\n"); 34 34 35 35 /*Elements and loads drive the update: */ … … 52 52 53 53 int i; 54 if(VerboseModule()) _p printString_(" Input updates from constant" << "\n");54 if(VerboseModule()) _printf0_(" Input updates from constant" << "\n"); 55 55 56 56 /*Elements and loads drive the update: */ -
issm/trunk-jpl/src/c/modules/InterpFromGridToMeshx/InterpFromGridToMeshx.cpp
r15099 r15100 87 87 /*launch the thread manager with InterpFromGridToMeshxt as a core: */ 88 88 LaunchThread(InterpFromGridToMeshxt,(void*)&gate,num); 89 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");89 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 90 90 91 91 /*Assign output pointers:*/ … … 140 140 141 141 if(debug && my_thread==0) 142 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i-i0)/double(i1-i0)*100<<"%");142 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i-i0)/double(i1-i0)*100<<"%"); 143 143 x_grid=*(x_mesh+i); 144 144 y_grid=*(y_mesh+i); … … 176 176 break; 177 177 default: 178 _print String_("Interpolation " << EnumToStringx(interpenum) << " not supported yet" << "\n");178 _printf_("Interpolation " << EnumToStringx(interpenum) << " not supported yet" << "\n"); 179 179 return NULL; /*WARNING: no error because it would blow up the multithreading!*/ 180 180 } -
issm/trunk-jpl/src/c/modules/InterpFromMesh2dx/InterpFromMesh2dxt.cpp
r15099 r15100 47 47 /*display current iteration*/ 48 48 if (debug && my_thread==0 && fmod((double)i,(double)100)==0) 49 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i-i0)/double(i1-i0)*100<<"%");49 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i-i0)/double(i1-i0)*100<<"%"); 50 50 51 51 /*if there is no point inside the domain, go to next iteration*/ … … 99 99 } 100 100 if(debug && my_thread==0) 101 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");101 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 102 102 return NULL; 103 103 } -
issm/trunk-jpl/src/c/modules/InterpFromMeshToGridx/InterpFromMeshToGridx.cpp
r15099 r15100 88 88 /*display current iteration*/ 89 89 if (debug && fmod((double)n,(double)100)==0) 90 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(n)/double(nels)*100<<"%");90 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(n)/double(nels)*100<<"%"); 91 91 92 92 /*Get extrema coordinates of current elements*/ … … 168 168 } 169 169 if (debug) 170 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");170 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 171 171 172 172 /*Assign output pointers:*/ -
issm/trunk-jpl/src/c/modules/InterpFromMeshToMesh2dx/InterpFromMeshToMesh2dx.cpp
r15099 r15100 68 68 /*Loop over output nodes*/ 69 69 for(i=0;i<N_interp;i++){ 70 //if(i%100==0) _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i)/double(N_interp)*100.<<"%");70 //if(i%100==0) _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i)/double(N_interp)*100.<<"%"); 71 71 72 72 if(isdefault){ … … 142 142 } 143 143 } 144 //if(N_interp>=100) _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");144 //if(N_interp>=100) _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 145 145 146 146 /*clean-up and return*/ -
issm/trunk-jpl/src/c/modules/InterpFromMeshToMesh3dx/InterpFromMeshToMesh3dx.cpp
r15099 r15100 61 61 /*display current iteration*/ 62 62 if (debug && fmod((double)i,(double)100)==0) 63 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i)/double(nels_data)*100<<"%");63 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(i)/double(nels_data)*100<<"%"); 64 64 65 65 /*Get extrema coordinates of current elements*/ … … 132 132 } 133 133 if (debug) 134 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");134 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 135 135 136 136 /*Assign output pointers:*/ -
issm/trunk-jpl/src/c/modules/KMLFileReadx/KMLFileReadx.cpp
r15099 r15100 18 18 clock0=clock(); 19 19 time0 =time(NULL); 20 _p printString_("\nKMLFileReadx Module -- " << ctime(&time0));20 _printf0_("\nKMLFileReadx Module -- " << ctime(&time0)); 21 21 22 22 /* read kml file */ … … 40 40 } 41 41 42 // _p printString_(kstr << "\n");42 // _printf0_(kstr << "\n"); 43 43 xDelete<char>(kstr); 44 44 } 45 45 46 46 if (kxml) { 47 _p printString_("XML declaration:" << "\n");47 _printf0_("XML declaration:" << "\n"); 48 48 kxml->DeepEcho(" "); 49 49 delete kxml; 50 50 } 51 51 if (kdtd) { 52 _p printString_("DTD declaration (not yet implemented):" << "\n");52 _printf0_("DTD declaration (not yet implemented):" << "\n"); 53 53 kdtd->DeepEcho(" "); 54 54 delete kdtd; … … 57 57 clock1=clock(); 58 58 time1 =time(NULL); 59 _print String_("KMLFileReadx Module -- " <<((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " <<difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");59 _printf_("KMLFileReadx Module -- " <<((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " <<difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 60 60 61 61 return(kfil); -
issm/trunk-jpl/src/c/modules/KMLMeshWritex/KMLMeshWritex.cpp
r15099 r15100 26 26 clock0=clock(); 27 27 time0 =time(NULL); 28 _p printString_("\nKMLMeshWritex Module -- " << ctime(&time0));28 _printf0_("\nKMLMeshWritex Module -- " << ctime(&time0)); 29 29 30 30 /* construct kml document */ … … 80 80 81 81 if (cmap) { 82 _p printString_("Writing " << mcmap << " Matlab colors as KML style templates." << "\n");82 _printf0_("Writing " << mcmap << " Matlab colors as KML style templates." << "\n"); 83 83 ipt=0; 84 84 for (i=0; i<mcmap; i++) { … … 115 115 116 116 if (!nodecon) { 117 _p printString_("Creating the node connectivity table." << "\n");117 _printf0_("Creating the node connectivity table." << "\n"); 118 118 nncon=mxepg+1; 119 119 nodecon=xNewZeroInit<int>(mncon*nncon); … … 146 146 147 147 else if (mdata == mncon) { 148 _p printString_("Averaging nodal data to element data." << "\n");148 _printf0_("Averaging nodal data to element data." << "\n"); 149 149 edata=xNewZeroInit<double>(melem*ndata); 150 150 edfree=true; … … 185 185 clock0a=clock(); 186 186 time0a =time(NULL); 187 _print String_(" Constructed kml document -- " << ((double)(clock0a-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time0a,time0) << " elapsed seconds.\n\n" << "\n");187 _printf_(" Constructed kml document -- " << ((double)(clock0a-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time0a,time0) << " elapsed seconds.\n\n" << "\n"); 188 188 189 189 /* write kml file */ 190 190 191 _p printString_("Writing kml document to file." << "\n");191 _printf0_("Writing kml document to file." << "\n"); 192 192 fprintf(fid,"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n"); 193 193 fprintf(fid,"<kml xmlns=\"http://www.opengis.net/kml/2.2\">\n"); … … 196 196 clock0b=clock(); 197 197 time0b =time(NULL); 198 _print String_(" Wrote kml file -- " << ((double)(clock0b-clock0a))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time0b,time0a) << " elapsed seconds.\n\n" << "\n");199 200 _p printString_("Deleting kml document." << "\n");198 _printf_(" Wrote kml file -- " << ((double)(clock0b-clock0a))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time0b,time0a) << " elapsed seconds.\n\n" << "\n"); 199 200 _printf0_("Deleting kml document." << "\n"); 201 201 delete kdoc; 202 202 clock0c=clock(); 203 203 time0c =time(NULL); 204 _print String_(" Deleted kml document -- " << ((double)(clock0c-clock0b))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time0c,time0b) << " elapsed seconds.\n\n" << "\n");204 _printf_(" Deleted kml document -- " << ((double)(clock0c-clock0b))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time0c,time0b) << " elapsed seconds.\n\n" << "\n"); 205 205 206 206 clock1=clock(); 207 207 time1 =time(NULL); 208 _print String_("KMLMeshWritex Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");208 _printf_("KMLMeshWritex Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 209 209 210 210 return; … … 297 297 /* write each element as a polygon placemark */ 298 298 299 _p printString_("Writing " << melem << " tria elements as KML polygons." << "\n");299 _printf0_("Writing " << melem << " tria elements as KML polygons." << "\n"); 300 300 301 301 for (i=0; i<melem; i++) { … … 349 349 350 350 // if (!(int)fmod((double)(i+1),1000)) 351 // _p printString_(" " << (i+1) << " tria elements written." << "\n");351 // _printf0_(" " << (i+1) << " tria elements written." << "\n"); 352 352 } 353 _p printString_(" " << melem << " tria elements written." << "\n");353 _printf0_(" " << melem << " tria elements written." << "\n"); 354 354 355 355 return(kfold); -
issm/trunk-jpl/src/c/modules/KMLOverlayx/KMLOverlayx.cpp
r15099 r15100 26 26 clock0=clock(); 27 27 time0 =time(NULL); 28 _p printString_("\nKMLOverlayx Module -- " << ctime(&time0));28 _printf0_("\nKMLOverlayx Module -- " << ctime(&time0)); 29 29 30 30 /* construct kml file */ … … 79 79 /* write kml file */ 80 80 81 _p printString_("Writing kml document to file." << "\n");81 _printf0_("Writing kml document to file." << "\n"); 82 82 fprintf(fid,"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n"); 83 83 kfile->Write(fid,indent); … … 87 87 clock1=clock(); 88 88 time1 =time(NULL); 89 _print String_("KMLOverlayx Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");89 _printf_("KMLOverlayx Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 90 90 91 91 return; -
issm/trunk-jpl/src/c/modules/Kml2Expx/Kml2Expx.cpp
r15099 r15100 35 35 clock0=clock(); 36 36 time0 =time(NULL); 37 _p printString_("\nKml2Expx Module -- " << ctime(&time0));37 _printf0_("\nKml2Expx Module -- " << ctime(&time0)); 38 38 39 39 /* read kml file */ … … 46 46 /* open exp file */ 47 47 48 _p printString_("Writing exp profiles to file." << "\n");48 _printf0_("Writing exp profiles to file." << "\n"); 49 49 fido=fopen(filexp,"w"); 50 50 … … 61 61 clock1=clock(); 62 62 time1 =time(NULL); 63 _print String_("Kml2Expx Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");63 _printf_("Kml2Expx Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 64 64 65 65 return(iret); -
issm/trunk-jpl/src/c/modules/Krigingx/Krigingx.cpp
r15099 r15100 83 83 observations->ObservationList(&x,&y,&data,&nobs); 84 84 85 _print String_("Generation Delaunay Triangulation" << "\n");85 _printf_("Generation Delaunay Triangulation" << "\n"); 86 86 BamgTriangulatex(&index,&nel,x,y,nobs); 87 87 88 _print String_("Interpolating" << "\n");88 _printf_("Interpolating" << "\n"); 89 89 xDelete<double>(predictions); 90 90 InterpFromMeshToMesh2dx(&predictions,index,x,y,nobs,nel,data,nobs,1,x_interp,y_interp,n_interp,options); … … 110 110 /*launch the thread manager with Krigingxt as a core: */ 111 111 LaunchThread(NearestNeighbort,(void*)&gate,num); 112 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");112 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 113 113 xDelete<int>(gate.numdone); 114 114 } … … 132 132 /*launch the thread manager with Krigingxt as a core: */ 133 133 LaunchThread(idwt,(void*)&gate,num); 134 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");134 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 135 135 xDelete<int>(gate.numdone); 136 136 } … … 154 154 /*launch the thread manager with Krigingxt as a core: */ 155 155 LaunchThread(v4t,(void*)&gate,num); 156 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");156 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 157 157 xDelete<int>(gate.numdone); 158 158 } … … 177 177 /*launch the thread manager with Krigingxt as a core: */ 178 178 LaunchThread(Krigingxt,(void*)&gate,num); 179 _print String_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");179 _printf_("\r interpolation progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 180 180 xDelete<int>(gate.numdone); 181 181 } … … 230 230 int alldone=numdone[0]; 231 231 for(int i=1;i<num_threads;i++) alldone+=numdone[i]; 232 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%");232 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%"); 233 233 } 234 234 … … 277 277 int alldone=numdone[0]; 278 278 for(int i=1;i<num_threads;i++) alldone+=numdone[i]; 279 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%");279 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%"); 280 280 } 281 281 … … 324 324 int alldone=numdone[0]; 325 325 for(int i=1;i<num_threads;i++) alldone+=numdone[i]; 326 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%");326 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%"); 327 327 } 328 328 … … 369 369 int alldone=numdone[0]; 370 370 for(int i=1;i<num_threads;i++) alldone+=numdone[i]; 371 _print String_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%");371 _printf_("\r interpolation progress: "<<setw(6)<<setprecision(2)<<double(alldone)/double(n_interp)*100.<<"%"); 372 372 } 373 373 -
issm/trunk-jpl/src/c/modules/Krigingx/pKrigingx.cpp
r15099 r15100 68 68 /*partition loop across threads: */ 69 69 for(int idx=my_rank;idx<n_interp;idx+=num_procs){ 70 _p printString_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n");70 _printf0_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n"); 71 71 observations->InterpolationKriging(&predictions[idx],&error[idx],x_interp[idx],y_interp[idx],radius,mindata,maxdata,variogram); 72 72 } 73 _p printString_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n");73 _printf0_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n"); 74 74 75 75 #ifdef _HAVE_MPI_ … … 86 86 /*partition loop across threads: */ 87 87 for(int idx=my_rank;idx<n_interp;idx+=num_procs){ 88 _p printString_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n");88 _printf0_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n"); 89 89 observations->InterpolationV4(&predictions[idx],x_interp[idx],y_interp[idx],radius,mindata,maxdata); 90 90 } 91 _p printString_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n");91 _printf0_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n"); 92 92 93 93 #ifdef _HAVE_MPI_ … … 101 101 /*partition loop across threads: */ 102 102 for(int idx=my_rank;idx<n_interp;idx+=num_procs){ 103 _p printString_(" interpolation progress: "<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n");103 _printf0_(" interpolation progress: "<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n"); 104 104 observations->InterpolationNearestNeighbor(&predictions[idx],x_interp[idx],y_interp[idx],radius); 105 105 } 106 _p printString_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n");106 _printf0_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n"); 107 107 108 108 #ifdef _HAVE_MPI_ … … 118 118 /*partition loop across threads: */ 119 119 for(int idx=my_rank;idx<n_interp;idx+=num_procs){ 120 _p printString_(" interpolation progress: "<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n");120 _printf0_(" interpolation progress: "<<setw(6)<<setprecision(4)<<double(idx)/double(n_interp)*100.<<"%" << "\n"); 121 121 observations->InterpolationIDW(&predictions[idx],x_interp[idx],y_interp[idx],radius,mindata,maxdata,power); 122 122 } 123 _p printString_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n");123 _printf0_(" interpolation progress: "<<fixed<<setw(6)<<setprecision(4)<<100.<<"%" << "\n"); 124 124 125 125 #ifdef _HAVE_MPI_ … … 142 142 143 143 MPI_Barrier(MPI_COMM_WORLD); finish=MPI_Wtime( ); 144 _print String_("\n " << setw(34) << left << "Observation fitering elapsed time: " << finish_init-start_init << " seconds \n" << "\n");145 _print String_(" " << setw(34) << left << "Kriging prediction elapsed time: " << finish_core-start_core << " seconds \n" << "\n");146 _print String_("\n " << "Total elapsed time " << int((finish-start)/3600) << " hrs " << int(int(finish-start)%3600/60) << " min " << int(finish-start)%60 << " sec\n\n" << "\n");144 _printf_("\n " << setw(34) << left << "Observation fitering elapsed time: " << finish_init-start_init << " seconds \n" << "\n"); 145 _printf_(" " << setw(34) << left << "Kriging prediction elapsed time: " << finish_core-start_core << " seconds \n" << "\n"); 146 _printf_("\n " << "Total elapsed time " << int((finish-start)/3600) << " hrs " << int(int(finish-start)%3600/60) << " min " << int(finish-start)%60 << " sec\n\n" << "\n"); 147 147 return 1; 148 148 #else -
issm/trunk-jpl/src/c/modules/Mergesolutionfromftogx/Mergesolutionfromftogx.cpp
r15099 r15100 17 17 18 18 /*Display message*/ 19 if(VerboseModule()) _p printString_(" Merging solution vector from fset to gset" << "\n");19 if(VerboseModule()) _printf0_(" Merging solution vector from fset to gset" << "\n"); 20 20 21 21 /*first, get gsize, fsize and ssize: */ -
issm/trunk-jpl/src/c/modules/ModelProcessorx/ModelProcessorx.cpp
r15099 r15100 41 41 SetVerbosityLevel(verbose); 42 42 43 if(VerboseMProcessor()) _p printString_(" starting model processor " << "\n");43 if(VerboseMProcessor()) _printf0_(" starting model processor " << "\n"); 44 44 45 45 for(i=0;i<nummodels;i++){ … … 65 65 if(solution_type==SteadystateSolutionEnum && analysis_type==EnthalpyAnalysisEnum && isenthalpy==false) continue; 66 66 67 if(VerboseMProcessor()) _p printString_(" creating datasets for analysis " << EnumToStringx(analysis_type) << "\n");67 if(VerboseMProcessor()) _printf0_(" creating datasets for analysis " << EnumToStringx(analysis_type) << "\n"); 68 68 CreateDataSets(&elements,&nodes,&vertices,&materials,&constraints,&loads,¶meters,iomodel,rootpath,solution_type,analysis_type,nummodels,i); 69 69 } 70 if(VerboseMProcessor()) _p printString_(" done with model processor " << "\n");70 if(VerboseMProcessor()) _printf0_(" done with model processor " << "\n"); 71 71 72 72 /*Free resources:*/ -
issm/trunk-jpl/src/c/modules/PointCloudFindNeighborsx/PointCloudFindNeighborsxt.cpp
r15099 r15100 49 49 /*display current iteration*/ 50 50 if (my_thread==0 && fmod((double)i,(double)100)==0) 51 _print String_("\r loop progress: "<<setw(6)<<setprecision(2)<<double(i-i0)/double(i1-i0)*100<<"%");51 _printf_("\r loop progress: "<<setw(6)<<setprecision(2)<<double(i-i0)/double(i1-i0)*100<<"%"); 52 52 53 53 distance=mindistance+100; //make sure initialization respects min distance criterion. … … 70 70 } 71 71 if (my_thread==0) 72 _print String_("\r loop progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n");72 _printf_("\r loop progress: "<<fixed<<setw(6)<<setprecision(2)<<100.<<"%" << "\n"); 73 73 74 74 /*Free ressources:*/ -
issm/trunk-jpl/src/c/modules/PositiveDegreeDayx/PositiveDegreeDayx.cpp
r15099 r15100 54 54 55 55 if (itm >= NPDMAX){ 56 _print String_("increase NPDMAX in massBalance.cpp" << "\n");56 _printf_("increase NPDMAX in massBalance.cpp" << "\n"); 57 57 exit (1); 58 58 } … … 80 80 itm = reCast<int,IssmDouble>((PDCUT+2.*siglimc)/DT + 1.5); 81 81 if (itm >= NPDCMAX){ 82 _print String_("'increase NPDCMAX in p35com'" << "\n");82 _printf_("'increase NPDCMAX in p35com'" << "\n"); 83 83 exit (1); 84 84 } -
issm/trunk-jpl/src/c/modules/Reduceloadx/Reduceloadx.cpp
r15099 r15100 22 22 bool oldalloc = false; 23 23 24 if(VerboseModule()) _p printString_(" Dirichlet lifting applied to load vector" << "\n");24 if(VerboseModule()) _printf0_(" Dirichlet lifting applied to load vector" << "\n"); 25 25 26 26 Kfs->GetSize(&global_m,&global_n); -
issm/trunk-jpl/src/c/modules/Reducevectorgtofx/Reducevectorgtofx.cpp
r15099 r15100 17 17 bool oldalloc = false; 18 18 19 if(VerboseModule()) _p printString_(" Reduce vector from g to f set" << "\n");19 if(VerboseModule()) _printf0_(" Reduce vector from g to f set" << "\n"); 20 20 21 21 /*first figure out fsize: */ -
issm/trunk-jpl/src/c/modules/ResetConstraintsx/ResetConstraintsx.cpp
r15099 r15100 14 14 15 15 /*Display message*/ 16 if(VerboseModule()) _p printString_(" Resetting penalties" << "\n");16 if(VerboseModule()) _printf0_(" Resetting penalties" << "\n"); 17 17 18 18 /*recover parameters: */ -
issm/trunk-jpl/src/c/modules/Shp2Expx/Shp2Expx.cpp
r15099 r15100 76 76 clock0=clock(); 77 77 time0 =time(NULL); 78 _p printString_("\nShp2Expx Module -- " << ctime(&time0));78 _printf0_("\nShp2Expx Module -- " << ctime(&time0)); 79 79 80 80 /* note that much of the following code is taken from shpdump.c in shapelib. */ … … 295 295 296 296 if (pnpart[i] > 0) 297 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n");297 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n"); 298 298 if (pnvert[i] > 1) 299 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnvert[i] << " > 1 vertices.\n" << "\n");299 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnvert[i] << " > 1 vertices.\n" << "\n"); 300 300 301 301 kpoint=new KML_Point(); … … 464 464 else { 465 465 if (!kpoly) { 466 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\", part " << j << ", expected to be outer loop (cw).\n" << "\n");466 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\", part " << j << ", expected to be outer loop (cw).\n" << "\n"); 467 467 continue; 468 468 } … … 512 512 513 513 if (pnpart[i] > 0) 514 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n");514 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n"); 515 515 516 516 /* create a multigeometry to hold all the points */ … … 555 555 556 556 else if (pstype[i] == SHPT_MULTIPATCH) { 557 _print String_("Warning -- Shape " << i << " of type \"" <<SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n");557 _printf_("Warning -- Shape " << i << " of type \"" <<SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n"); 558 558 continue; 559 559 } … … 562 562 563 563 else { 564 _print String_(,"Warning -- Shape " << i << " of type \"" <<SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n");564 _printf_(,"Warning -- Shape " << i << " of type \"" <<SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n"); 565 565 } 566 566 } … … 575 575 /* open exp file */ 576 576 577 _p printString_("Writing exp profiles to file." << "\n");577 _printf0_("Writing exp profiles to file." << "\n"); 578 578 fid=fopen(filexp,"w"); 579 579 … … 609 609 clock1=clock(); 610 610 time1 =time(NULL); 611 _print String_("Shp2Expx Module -- " <<((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " <<difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");611 _printf_("Shp2Expx Module -- " <<((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " <<difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 612 612 613 613 return(iret); -
issm/trunk-jpl/src/c/modules/Shp2Kmlx/Shp2Kmlx.cpp
r15099 r15100 64 64 clock0=clock(); 65 65 time0 =time(NULL); 66 _p printString_("\nShp2Kmlx Module -- " << ctime(&time0));66 _printf0_("\nShp2Kmlx Module -- " << ctime(&time0)); 67 67 68 68 /* note that much of the following code is taken from shpdump.c in shapelib. */ … … 283 283 284 284 if (pnpart[i] > 0) 285 _print String_("Warning -- Shape "<< i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n");285 _printf_("Warning -- Shape "<< i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n"); 286 286 if (pnvert[i] > 1) 287 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 1 vertices.\n" << "\n");287 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 1 vertices.\n" << "\n"); 288 288 289 289 kpoint=new KML_Point(); … … 452 452 else { 453 453 if (!kpoly) { 454 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\", part " << j << ", expected to be outer loop (cw).\n" << "\n");454 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\", part " << j << ", expected to be outer loop (cw).\n" << "\n"); 455 455 continue; 456 456 } … … 500 500 501 501 if (pnpart[i] > 0) 502 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n");502 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" should not have " << pnpart[i] << " > 0 parts.\n" << "\n"); 503 503 504 504 /* create a multigeometry to hold all the points */ … … 543 543 544 544 else if (pstype[i] == SHPT_MULTIPATCH) { 545 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n");545 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n"); 546 546 continue; 547 547 } … … 550 550 551 551 else { 552 _print String_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n");552 _printf_("Warning -- Shape " << i << " of type \"" << SHPTypeName( pstype[i] ) << "\" will be ignored.\n" << "\n"); 553 553 } 554 554 } … … 563 563 /* write kml file */ 564 564 565 _p printString_("Writing kml document to file." << "\n");565 _printf0_("Writing kml document to file." << "\n"); 566 566 fid=fopen(filkml,"w"); 567 567 fprintf(fid,"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n"); … … 592 592 clock1=clock(); 593 593 time1 =time(NULL); 594 _print String_("Shp2Kmlx Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n");594 _printf_("Shp2Kmlx Module -- " << ((double)(clock1-clock0))/CLOCKS_PER_SEC << " CPU seconds; " << difftime(time1,time0) << " elapsed seconds.\n\n" << "\n"); 595 595 596 596 return(iret); -
issm/trunk-jpl/src/c/modules/Solverx/Solverx.cpp
r15099 r15100 20 20 Vector<IssmDouble> *uf=NULL; 21 21 22 if(VerboseModule()) _p printString_(" Solving matrix system" << "\n");22 if(VerboseModule()) _printf0_(" Solving matrix system" << "\n"); 23 23 24 24 /*Initialize solver: */ -
issm/trunk-jpl/src/c/shared/Elements/PrintArrays.cpp
r15099 r15100 5 5 6 6 void printarray(IssmPDouble* array,int lines,int cols){ 7 _print String_("" << "\n");7 _printf_("" << "\n"); 8 8 for(int i=0;i<lines;i++){ 9 _print String_(" [ ");10 for(int j=0;j<cols;j++) _print String_( " " << setw(11) << setprecision (5) << array[i*cols+j]);11 _print String_(" ]" << "\n");9 _printf_(" [ "); 10 for(int j=0;j<cols;j++) _printf_( " " << setw(11) << setprecision (5) << array[i*cols+j]); 11 _printf_(" ]" << "\n"); 12 12 } 13 _print String_("" << "\n");13 _printf_("" << "\n"); 14 14 } 15 15 void printsparsity(IssmPDouble* array,int lines,int cols){ 16 16 int count; 17 _print String_("" << "\n");17 _printf_("" << "\n"); 18 18 for(int i=0;i<lines;i++){ 19 _print String_(" [ ");19 _printf_(" [ "); 20 20 count = 0; 21 21 for(int j=0;j<cols;j++){ 22 22 if(array[i*cols+j]!=0.0){ 23 _print String_( " X"); count++;23 _printf_( " X"); count++; 24 24 } 25 25 else 26 _print String_( " .");26 _printf_( " ."); 27 27 } 28 _print String_(" ] "<<i<<" => "<<count << "\n");28 _printf_(" ] "<<i<<" => "<<count << "\n"); 29 29 } 30 _print String_("" << "\n");30 _printf_("" << "\n"); 31 31 } 32 32 void printarray(int* array,int lines,int cols){ 33 _print String_("" << "\n");33 _printf_("" << "\n"); 34 34 for(int i=0;i<lines;i++){ 35 _print String_(" [ ");36 for(int j=0;j<cols;j++) _print String_( " " << setw(11) << setprecision (5) << array[i*cols+j]);37 _print String_(" ]" << "\n");35 _printf_(" [ "); 36 for(int j=0;j<cols;j++) _printf_( " " << setw(11) << setprecision (5) << array[i*cols+j]); 37 _printf_(" ]" << "\n"); 38 38 } 39 _print String_("" << "\n");39 _printf_("" << "\n"); 40 40 } 41 41 void printarray(bool* array,int lines,int cols){ 42 _print String_("" << "\n");42 _printf_("" << "\n"); 43 43 for(int i=0;i<lines;i++){ 44 _print String_(" [ ");44 _printf_(" [ "); 45 45 for(int j=0;j<cols;j++){ 46 if(array[i*cols+j]) _print String_( " 1");47 else _print String_( " 0");46 if(array[i*cols+j]) _printf_( " 1"); 47 else _printf_( " 0"); 48 48 } 49 _print String_(" ]" << "\n");49 _printf_(" ]" << "\n"); 50 50 } 51 _print String_("" << "\n");51 _printf_("" << "\n"); 52 52 } 53 53 void printbinary(int n){ … … 55 55 while (i>0) { 56 56 if (n&i) 57 _print String_("1");57 _printf_("1"); 58 58 else 59 _print String_("0");59 _printf_("0"); 60 60 i>>=1; 61 61 } -
issm/trunk-jpl/src/c/shared/Exceptions/Exceptions.cpp
r15099 r15100 42 42 43 43 if (function_name=="" || file_line==0){ //WINDOWS 44 _print String_("Error message: " << what());44 _printf_("Error message: " << what()); 45 45 } 46 46 else{ 47 47 if(num_procs==1){ 48 _print String_("\n??? Error in ==> " << file_name.c_str() << ":" << file_line << "\n");49 _print String_(function_name.c_str() << " error message: " << what() << "\n" << "\n");48 _printf_("\n??? Error in ==> " << file_name.c_str() << ":" << file_line << "\n"); 49 _printf_(function_name.c_str() << " error message: " << what() << "\n" << "\n"); 50 50 } 51 51 else{ 52 _print String_("\n[" << my_rank<< "] ??? Error using ==> " << file_name.c_str() << ":" << file_line << "\n");53 _print String_( "[" << my_rank << "] " << function_name.c_str() << " error message: " << what() << "\n" << "\n");52 _printf_("\n[" << my_rank<< "] ??? Error using ==> " << file_name.c_str() << ":" << file_line << "\n"); 53 _printf_( "[" << my_rank << "] " << function_name.c_str() << " error message: " << what() << "\n" << "\n"); 54 54 } 55 55 } -
issm/trunk-jpl/src/c/shared/Exceptions/exceptions.h
r15099 r15100 64 64 }\ 65 65 catch (exception& e) {\ 66 _print String_("Standard exception: " << e.what() << "\n" << "\n");\66 _printf_("Standard exception: " << e.what() << "\n" << "\n");\ 67 67 return 0;\ 68 68 }\ 69 69 catch(...){\ 70 _print String_("An unexpected error occurred \n" << "\n");\70 _printf_("An unexpected error occurred \n" << "\n");\ 71 71 return 0;\ 72 72 } -
issm/trunk-jpl/src/c/shared/LatLong/Ll2xyx.cpp
r15099 r15100 114 114 *pdelta= 45; 115 115 *pslat = 70; 116 if(flag) _p printString_("Info: creating coordinates in polar stereographic (Std Latitude: 70N Meridian: 45)." << "\n");116 if(flag) _printf0_("Info: creating coordinates in polar stereographic (Std Latitude: 70N Meridian: 45)." << "\n"); 117 117 } 118 118 else if (sgn == -1) { 119 119 *pdelta= 0; 120 120 *pslat = 71; 121 if(flag) _p printString_("Info: creating coordinates in polar stereographic (Std Latitude: 71S Meridian: 0)." << "\n");121 if(flag) _printf0_("Info: creating coordinates in polar stereographic (Std Latitude: 71S Meridian: 0)." << "\n"); 122 122 } 123 123 else _error_("Sign should be either +1 or -1.\n"); -
issm/trunk-jpl/src/c/shared/LatLong/Xy2llx.cpp
r15099 r15100 122 122 *pdelta= 45; 123 123 *pslat = 70; 124 if(flag) _p printString_("Warning: expecting coordinates in polar stereographic (Std Latitude: 70N Meridian: 45)." << "\n");124 if(flag) _printf0_("Warning: expecting coordinates in polar stereographic (Std Latitude: 70N Meridian: 45)." << "\n"); 125 125 } 126 126 else if (sgn == -1) { 127 127 *pdelta= 0; 128 128 *pslat = 71; 129 if(flag) _p printString_("Warning: expecting coordinates in polar stereographic (Std Latitude: 71S Meridian: 0)." << "\n");129 if(flag) _printf0_("Warning: expecting coordinates in polar stereographic (Std Latitude: 71S Meridian: 0)." << "\n"); 130 130 } 131 131 else _error_("Sign should be either +1 or -1.\n"); -
issm/trunk-jpl/src/c/shared/Matrix/MatrixUtils.cpp
r15099 r15100 205 205 pindx[ipiv]++; 206 206 207 // _print String_("pivot for i=" << i << ": irow=" << irow << ", icol=" << icol << ", pindx[" << ipiv << "]=" << pindx[ipiv] << "\n" << "\n");207 // _printf_("pivot for i=" << i << ": irow=" << irow << ", icol=" << icol << ", pindx[" << ipiv << "]=" << pindx[ipiv] << "\n" << "\n"); 208 208 209 209 /* switch rows to put pivot element on diagonal, noting that the … … 211 211 212 212 if (irow != icol) { 213 // _print String_("row switch for i=" << i << ": irow=" << irow << ", icol=" << icol << "\n" << "\n");213 // _printf_("row switch for i=" << i << ": irow=" << irow << ", icol=" << icol << "\n" << "\n"); 214 214 215 215 ipt=irow*ndim; … … 292 292 icol=pivrc2[j]; 293 293 294 // _print String_("column switch back for j=" << j << ": irow=" << irow << ", icol=" << icol << "\n" << "\n");294 // _printf_("column switch back for j=" << j << ": irow=" << irow << ", icol=" << icol << "\n" << "\n"); 295 295 296 296 ipt=0; -
issm/trunk-jpl/src/c/shared/Numerics/BrentSearch.cpp
r15099 r15100 50 50 if (xIsNan<IssmDouble>(fxmin)) _error_("Function evaluation returned NaN"); 51 51 cout<<setprecision(5); 52 if(VerboseControl()) _p printString_("" << "\n");53 if(VerboseControl()) _p printString_(" Iteration x f(x) Tolerance Procedure" << "\n");54 if(VerboseControl()) _p printString_("" << "\n");55 if(VerboseControl()) _p printString_(" N/A "<<setw(12)<<xmin<<" "<<setw(12)<<fxmin<<" N/A boundary" << "\n");52 if(VerboseControl()) _printf0_("" << "\n"); 53 if(VerboseControl()) _printf0_(" Iteration x f(x) Tolerance Procedure" << "\n"); 54 if(VerboseControl()) _printf0_("" << "\n"); 55 if(VerboseControl()) _printf0_(" N/A "<<setw(12)<<xmin<<" "<<setw(12)<<fxmin<<" N/A boundary" << "\n"); 56 56 fxmax = (*f)(xmax,optargs); 57 57 if (xIsNan<IssmDouble>(fxmax)) _error_("Function evaluation returned NaN"); 58 if(VerboseControl()) _p printString_(" N/A "<<setw(12)<<xmax<<" "<<setw(12)<<fxmax<<" N/A boundary" << "\n");58 if(VerboseControl()) _printf0_(" N/A "<<setw(12)<<xmax<<" "<<setw(12)<<fxmax<<" N/A boundary" << "\n"); 59 59 60 60 /*test if jump option activated and xmin==0*/ … … 93 93 /*4: print result*/ 94 94 if(VerboseControl()) 95 _p printString_(" "<<setw(5)<<iter<<" "<<setw(12)<<xbest<<" "<<setw(12)<<fxbest<<" "<<setw(12)<<pow(pow(xbest-xm,2),0.5)<<" initial" << "\n");95 _printf0_(" "<<setw(5)<<iter<<" "<<setw(12)<<xbest<<" "<<setw(12)<<fxbest<<" "<<setw(12)<<pow(pow(xbest-xm,2),0.5)<<" initial" << "\n"); 96 96 if (!xIsNan<IssmDouble>(cm_jump) && (xmin==0) && ((fxbest/fxmin)<cm_jump)){ 97 if(VerboseControl()) _p printString_(" optimization terminated: current x satisfies criteria 'cm_jump'=" << cm_jump << "\n");97 if(VerboseControl()) _printf0_(" optimization terminated: current x satisfies criteria 'cm_jump'=" << cm_jump << "\n"); 98 98 loop=false; 99 99 } … … 189 189 tol2=2.0*tol1; 190 190 if(VerboseControl()) 191 _p printString_(" "<<setw(5)<<iter<<" "<<setw(12)<<x<<" "<<setw(12)<<fx<<" "<<setw(12)<<pow(pow(xbest-xm,2),0.5)<<191 _printf0_(" "<<setw(5)<<iter<<" "<<setw(12)<<x<<" "<<setw(12)<<fx<<" "<<setw(12)<<pow(pow(xbest-xm,2),0.5)<< 192 192 " "<<(goldenflag?"golden":"parabolic")); 193 193 194 194 /*Stop the optimization?*/ 195 195 if (sqrt(pow(xbest-xm,2)) < (tol2-0.5*(xmax-xmin))){ 196 if(VerboseControl()) _p printString_(" optimization terminated: current x satisfies criteria 'tolx'=" << tolerance << "\n");196 if(VerboseControl()) _printf0_(" optimization terminated: current x satisfies criteria 'tolx'=" << tolerance << "\n"); 197 197 loop=false; 198 198 } 199 199 else if (iter>=maxiter){ 200 if(VerboseControl()) _p printString_(" exiting: Maximum number of iterations has been exceeded ('maxiter'=" << maxiter << ")" << "\n");200 if(VerboseControl()) _printf0_(" exiting: Maximum number of iterations has been exceeded ('maxiter'=" << maxiter << ")" << "\n"); 201 201 loop=false; 202 202 } 203 203 else if (!xIsNan<IssmDouble>(cm_jump) && (xmin==0) && ((fxbest/fxmin)<cm_jump)){ 204 if(VerboseControl()) _p printString_(" optimization terminated: current x satisfies criteria 'cm_jump'=" << cm_jump << "\n");204 if(VerboseControl()) _printf0_(" optimization terminated: current x satisfies criteria 'cm_jump'=" << cm_jump << "\n"); 205 205 loop=false; 206 206 } -
issm/trunk-jpl/src/c/shared/Numerics/GaussPoints.cpp
r15099 r15100 50 50 sizeof(wgt4 )/sizeof(IssmPDouble)}; 51 51 52 // _p printString_("Gauss-Legendre recurrence coefficients ngaus=" << ngaus << "\n");52 // _printf0_("Gauss-Legendre recurrence coefficients ngaus=" << ngaus << "\n"); 53 53 *pxgaus =xNew<IssmPDouble>(ngaus); 54 54 *pxwgt =xNew<IssmPDouble>(ngaus); … … 1138 1138 sizeof(wgt20)/sizeof(IssmPDouble)}; 1139 1139 1140 // _p printString_("GaussLegendreTria: iord=" << iord << "\n");1140 // _printf0_("GaussLegendreTria: iord=" << iord << "\n"); 1141 1141 1142 1142 /* check to see if Gauss points need to be calculated */ … … 1198 1198 } 1199 1199 1200 // _p printString_("GaussLegendreTria - ngaus=" << *pngaus << "\n");1200 // _printf0_("GaussLegendreTria - ngaus=" << *pngaus << "\n"); 1201 1201 // for (i=0; i<*pngaus; i++) 1202 // _p printString_("i=" << i << ": l1gaus=" << (*pl1 )[i] << ",l2gaus=" << (*pl2 )[i] << ",l3gaus=" << (*pl3 )[i]<< ",wgt=" << (*pwgt)[i]<< "\n" << "\n");1202 // _printf0_("i=" << i << ": l1gaus=" << (*pl1 )[i] << ",l2gaus=" << (*pl2 )[i] << ",l3gaus=" << (*pl3 )[i]<< ",wgt=" << (*pwgt)[i]<< "\n" << "\n"); 1203 1203 1204 1204 return; … … 1396 1396 sizeof(wgt6 )/sizeof(IssmPDouble)}; 1397 1397 1398 // _p printString_("GaussLegendreTetra: iord=" << iord << "\n");1398 // _printf0_("GaussLegendreTetra: iord=" << iord << "\n"); 1399 1399 1400 1400 /* check to see if Gauss points need to be calculated */ … … 1519 1519 sizeof(wgt5 )/sizeof(IssmPDouble)}; 1520 1520 1521 // _p printString_("Gauss-Lobatto recurrence coefficients ngaus=" << ngaus << "\n");1521 // _printf0_("Gauss-Lobatto recurrence coefficients ngaus=" << ngaus << "\n"); 1522 1522 *pxgaus =xNew<IssmPDouble>(ngaus); 1523 1523 *pxwgt =xNew<IssmPDouble>(ngaus); -
issm/trunk-jpl/src/c/shared/Numerics/OptimalSearch.cpp
r15099 r15100 47 47 if (xIsNan<IssmDouble>(fx1)) _error_("Function evaluation returned NaN"); 48 48 cout<<setprecision(5); 49 if(VerboseControl()) _p printString_("" << "\n");50 if(VerboseControl()) _p printString_(" Iteration x f(x) Tolerance" << "\n");51 if(VerboseControl()) _p printString_("" << "\n");52 if(VerboseControl()) _p printString_(" N/A "<<setw(12)<<x1<<" "<<setw(12)<<fx1<<" N/A" << "\n");49 if(VerboseControl()) _printf0_("" << "\n"); 50 if(VerboseControl()) _printf0_(" Iteration x f(x) Tolerance" << "\n"); 51 if(VerboseControl()) _printf0_("" << "\n"); 52 if(VerboseControl()) _printf0_(" N/A "<<setw(12)<<x1<<" "<<setw(12)<<fx1<<" N/A" << "\n"); 53 53 54 54 //update tolerances … … 63 63 if (xIsNan<IssmDouble>(fx2)) _error_("Function evaluation returned NaN"); 64 64 if(VerboseControl()) 65 _p printString_(" "<<setw(5)<<iter<<" "<<setw(12)<<x2<<" "<<setw(12)<<fx2<<" "<<(fabs(x2-x1)>fabs(fx2-fx1)?fabs(fx2-fx1):fabs(x2-x1)) << "\n");65 _printf0_(" "<<setw(5)<<iter<<" "<<setw(12)<<x2<<" "<<setw(12)<<fx2<<" "<<(fabs(x2-x1)>fabs(fx2-fx1)?fabs(fx2-fx1):fabs(x2-x1)) << "\n"); 66 66 67 67 //Stop the optimization? 68 68 if ((fabs(x2-x1)+seps)<tolerance || (fabs(fx2-fx1)+seps)<tolerance){ 69 if(VerboseControl()) _p printString_(" " << "optimization terminated: the current x satisfies the termination criteria using 'tolx' of " << tolerance << "\n");69 if(VerboseControl()) _printf0_(" " << "optimization terminated: the current x satisfies the termination criteria using 'tolx' of " << tolerance << "\n"); 70 70 loop=false; 71 71 } 72 72 else if (iter>=maxiter){ 73 if(VerboseControl()) _p printString_(" " << "exiting: Maximum number of iterations has been exceeded - increase 'maxiter'" << "\n");73 if(VerboseControl()) _printf0_(" " << "exiting: Maximum number of iterations has been exceeded - increase 'maxiter'" << "\n"); 74 74 loop=false; 75 75 } -
issm/trunk-jpl/src/c/shared/io/Print/Print.h
r15099 r15100 19 19 using namespace std; 20 20 /*macros:*/ 21 /* _print String_{{{*/22 /* macro to print some string . Only on cpu0*/23 #define _print String_(StreamArgs)\21 /* _printf_{{{*/ 22 /* macro to print some string on all cpus */ 23 #define _printf_(StreamArgs)\ 24 24 do{std::ostringstream aLoNgAnDwEiRdLoCaLnAmeFoRtHiSmAcRoOnLy; \ 25 25 aLoNgAnDwEiRdLoCaLnAmeFoRtHiSmAcRoOnLy << StreamArgs; \ 26 26 PrintfFunctionOnAllCpus(aLoNgAnDwEiRdLoCaLnAmeFoRtHiSmAcRoOnLy.str());}while(0) 27 27 /*}}}*/ 28 /* _p printString_ {{{*/29 /* macro to print some string . Only on cpu0 */30 #define _p printString_(StreamArgs)\28 /* _printf0_ {{{*/ 29 /* macro to print some string only on cpu 0 */ 30 #define _printf0_(StreamArgs)\ 31 31 do{std::ostringstream aLoNgAnDwEiRdLoCaLnAmeFoRtHiSmAcRoOnLy; \ 32 32 aLoNgAnDwEiRdLoCaLnAmeFoRtHiSmAcRoOnLy << StreamArgs; \ -
issm/trunk-jpl/src/c/solutionsequences/convergence.cpp
r15099 r15100 30 30 IssmDouble yts; 31 31 32 if(VerboseModule()) _p printString_(" checking convergence" << "\n");32 if(VerboseModule()) _printf0_(" checking convergence" << "\n"); 33 33 34 34 /*If uf is NULL in input, f-set is nil, model is fully constrained, therefore converged from … … 56 56 nF=pf->Norm(NORM_TWO); 57 57 solver_residue=nKUF/nF; 58 _p printString_("\n" << " solver residue: norm(KU-F)/norm(F)=" << solver_residue << "\n");58 _printf0_("\n" << " solver residue: norm(KU-F)/norm(F)=" << solver_residue << "\n"); 59 59 60 60 //clean up … … 73 73 res=nKUoldF/nF; 74 74 if (xIsNan<IssmDouble>(res)){ 75 _p printString_("norm nf = " << nF << "f and norm kuold = " << nKUoldF << "f" << "\n");75 _printf0_("norm nf = " << nF << "f and norm kuold = " << nKUoldF << "f" << "\n"); 76 76 _error_("mechanical equilibrium convergence criterion is NaN!"); 77 77 } … … 83 83 //print 84 84 if(res<eps_res){ 85 if(VerboseConvergence()) _p printString_(setw(50)<<left<<" mechanical equilibrium convergence criterion"<<res*100<< " < "<<eps_res*100<<" %" << "\n");85 if(VerboseConvergence()) _printf0_(setw(50)<<left<<" mechanical equilibrium convergence criterion"<<res*100<< " < "<<eps_res*100<<" %" << "\n"); 86 86 converged=true; 87 87 } 88 88 else{ 89 if(VerboseConvergence()) _p printString_(setw(50)<<left<<" mechanical equilibrium convergence criterion"<<res*100<<" > "<<eps_res*100<<" %" << "\n");89 if(VerboseConvergence()) _printf0_(setw(50)<<left<<" mechanical equilibrium convergence criterion"<<res*100<<" > "<<eps_res*100<<" %" << "\n"); 90 90 converged=false; 91 91 } … … 106 106 if (!xIsNan<IssmDouble>(eps_rel)){ 107 107 if((ndu/nu)<eps_rel){ 108 if(VerboseConvergence()) _p printString_(setw(50) << left << " Convergence criterion: norm(du)/norm(u)" << ndu/nu*100 << " < " << eps_rel*100 << " %" << "\n");108 if(VerboseConvergence()) _printf0_(setw(50) << left << " Convergence criterion: norm(du)/norm(u)" << ndu/nu*100 << " < " << eps_rel*100 << " %" << "\n"); 109 109 } 110 110 else{ 111 if(VerboseConvergence()) _p printString_(setw(50) << left << " Convergence criterion: norm(du)/norm(u)" << ndu/nu*100 << " > " << eps_rel*100 << " %" << "\n");111 if(VerboseConvergence()) _printf0_(setw(50) << left << " Convergence criterion: norm(du)/norm(u)" << ndu/nu*100 << " > " << eps_rel*100 << " %" << "\n"); 112 112 converged=false; 113 113 } 114 114 } 115 else _p printString_(setw(50) << left << " Convergence criterion: norm(du)/norm(u)" << ndu/nu*100 << " %" << "\n");115 else _printf0_(setw(50) << left << " Convergence criterion: norm(du)/norm(u)" << ndu/nu*100 << " %" << "\n"); 116 116 117 117 } … … 131 131 if (!xIsNan<IssmDouble>(eps_abs)){ 132 132 if ((nduinf*yts)<eps_abs){ 133 if(VerboseConvergence()) _p printString_(setw(50) << left << " Convergence criterion: max(du)" << nduinf*yts << " < " << eps_abs << " m/yr" << "\n");133 if(VerboseConvergence()) _printf0_(setw(50) << left << " Convergence criterion: max(du)" << nduinf*yts << " < " << eps_abs << " m/yr" << "\n"); 134 134 } 135 135 else{ 136 if(VerboseConvergence()) _p printString_(setw(50) << left << " Convergence criterion: max(du)" << nduinf*yts << " > " << eps_abs << " m/yr" << "\n");136 if(VerboseConvergence()) _printf0_(setw(50) << left << " Convergence criterion: max(du)" << nduinf*yts << " > " << eps_abs << " m/yr" << "\n"); 137 137 converged=false; 138 138 } 139 139 } 140 else _p printString_(setw(50) << left << " Convergence criterion: max(du)" << nduinf*yts << " m/yr" << "\n");140 else _printf0_(setw(50) << left << " Convergence criterion: max(du)" << nduinf*yts << " m/yr" << "\n"); 141 141 142 142 } -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_hydro_nonlinear.cpp
r15099 r15100 91 91 92 92 if (!sedconverged){ 93 if(VerboseConvergence()) _p printString_(" #unstable constraints = " << num_unstable_constraints << "\n");93 if(VerboseConvergence()) _printf0_(" #unstable constraints = " << num_unstable_constraints << "\n"); 94 94 if(num_unstable_constraints==0) sedconverged = true; 95 95 if (sedcount>=hydro_maxiter){ … … 131 131 132 132 if (!eplconverged){ 133 if(VerboseConvergence()) _p printString_(" #unstable constraints = " << num_unstable_constraints << "\n");133 if(VerboseConvergence()) _printf0_(" #unstable constraints = " << num_unstable_constraints << "\n"); 134 134 if(num_unstable_constraints==0) eplconverged = true; 135 135 if (eplcount>=hydro_maxiter){ … … 164 164 if (!xIsNan<IssmDouble>(eps_hyd)){ 165 165 if((ndu_sed/nu_sed)<eps_hyd){ 166 if(VerboseConvergence()) _p printString_(setw(50) << left << " Sediment Convergence criterion:" << ndu_sed/nu_sed*100 << " < " << eps_hyd*100 << " %" << "\n");166 if(VerboseConvergence()) _printf0_(setw(50) << left << " Sediment Convergence criterion:" << ndu_sed/nu_sed*100 << " < " << eps_hyd*100 << " %" << "\n"); 167 167 hydroconverged=true; 168 168 } 169 169 else{ 170 if(VerboseConvergence()) _p printString_(setw(50) << left << " Sediment Convergence criterion:" << ndu_sed/nu_sed*100 << " > " << eps_hyd*100 << " %" << "\n");170 if(VerboseConvergence()) _printf0_(setw(50) << left << " Sediment Convergence criterion:" << ndu_sed/nu_sed*100 << " > " << eps_hyd*100 << " %" << "\n"); 171 171 hydroconverged=false; 172 172 } 173 173 if(isefficientlayer){ 174 174 if((ndu_epl/nu_epl)<eps_hyd){ 175 if(VerboseConvergence()) _p printString_(setw(50) << left << " EPL Convergence criterion:" << ndu_epl/nu_epl*100 << " < " << eps_hyd*100 << " %" << "\n");175 if(VerboseConvergence()) _printf0_(setw(50) << left << " EPL Convergence criterion:" << ndu_epl/nu_epl*100 << " < " << eps_hyd*100 << " %" << "\n"); 176 176 } 177 177 else{ 178 if(VerboseConvergence()) _p printString_(setw(50) << left << " EPL Convergence criterion:" << ndu_epl/nu_epl*100 << " > " << eps_hyd*100 << " %" << "\n");178 if(VerboseConvergence()) _printf0_(setw(50) << left << " EPL Convergence criterion:" << ndu_epl/nu_epl*100 << " > " << eps_hyd*100 << " %" << "\n"); 179 179 hydroconverged=false; 180 180 } 181 181 } 182 182 } 183 else _p printString_(setw(50) << left << " Convergence criterion:" << ndu_sed/nu_sed*100 << " %" << "\n");183 else _printf0_(setw(50) << left << " Convergence criterion:" << ndu_sed/nu_sed*100 << " %" << "\n"); 184 184 if (hydrocount>=hydro_maxiter){ 185 185 _error_(" maximum number for hydrological global iterations (" << hydro_maxiter << ") exceeded"); -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_newton.cpp
r15099 r15100 93 93 } 94 94 if(count>=max_nonlinear_iterations){ 95 _p printString_(" maximum number of Newton iterations (" << max_nonlinear_iterations << ") exceeded" << "\n");95 _printf0_(" maximum number of Newton iterations (" << max_nonlinear_iterations << ") exceeded" << "\n"); 96 96 bool max_iteration_state=true; 97 97 int tempStep=1; … … 104 104 } 105 105 106 if(VerboseConvergence()) _p printString_("\n total number of iterations: " << count-1 << "\n");106 if(VerboseConvergence()) _printf0_("\n total number of iterations: " << count-1 << "\n"); 107 107 108 108 /*clean-up*/ -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_nonlinear.cpp
r15099 r15100 70 70 71 71 ConstraintsStatex(&constraints_converged, &num_unstable_constraints, femmodel->elements,femmodel->nodes,femmodel->vertices,femmodel->loads,femmodel->materials,femmodel->parameters); 72 if(VerboseConvergence()) _p printString_(" number of unstable constraints: " << num_unstable_constraints << "\n");72 if(VerboseConvergence()) _printf0_(" number of unstable constraints: " << num_unstable_constraints << "\n"); 73 73 74 74 //rift convergence … … 90 90 } 91 91 if(count>=max_nonlinear_iterations){ 92 _p printString_(" maximum number of nonlinear iterations (" << max_nonlinear_iterations << ") exceeded" << "\n");92 _printf0_(" maximum number of nonlinear iterations (" << max_nonlinear_iterations << ") exceeded" << "\n"); 93 93 converged=true; 94 94 InputUpdateFromConstantx( femmodel->elements,femmodel->nodes, femmodel->vertices, femmodel->loads, femmodel->materials, femmodel->parameters,converged,ConvergedEnum); … … 102 102 } 103 103 104 if(VerboseConvergence()) _p printString_("\n total number of iterations: " << count-1 << "\n");104 if(VerboseConvergence()) _printf0_("\n total number of iterations: " << count-1 << "\n"); 105 105 106 106 /*clean-up*/ -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_stokescoupling_nonlinear.cpp
r15099 r15100 89 89 if(converged==true)break; 90 90 if(count>=max_nonlinear_iterations){ 91 _p printString_(" maximum number of iterations (" << max_nonlinear_iterations << ") exceeded" << "\n");91 _printf0_(" maximum number of iterations (" << max_nonlinear_iterations << ") exceeded" << "\n"); 92 92 break; 93 93 } -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_thermal_nonlinear.cpp
r15099 r15100 59 59 60 60 if (!converged){ 61 if(VerboseConvergence()) _p printString_(" #unstable constraints = " << num_unstable_constraints << "\n");61 if(VerboseConvergence()) _printf0_(" #unstable constraints = " << num_unstable_constraints << "\n"); 62 62 if (num_unstable_constraints <= thermal_penalty_threshold)converged=true; 63 63 if (count>=thermal_maxiter){ 64 64 converged=true; 65 _p printString_(" maximum number of iterations (" << thermal_maxiter << ") exceeded" << "\n");65 _printf0_(" maximum number of iterations (" << thermal_maxiter << ") exceeded" << "\n"); 66 66 } 67 67 } -
issm/trunk-jpl/src/c/toolkits/issm/Bucket.h
r15099 r15100 88 88 /*object virtual functions definitions:*/ 89 89 void Echo(){ /*{{{*/ 90 _print String_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<")" << "\n");91 _print String_("bucket type: " << type << "\n");92 _print String_("num rows: "<<this->m<<" num cols: "<<this->n << "\n");90 _printf_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<")" << "\n"); 91 _printf_("bucket type: " << type << "\n"); 92 _printf_("num rows: "<<this->m<<" num cols: "<<this->n << "\n"); 93 93 } /*}}}*/ 94 94 void DeepEcho(){ /*{{{*/ 95 95 int i,j; 96 96 97 _print String_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<")" << "\n");98 _print String_("bucket type: " << type << "\n");99 _print String_("num rows: "<<this->m<<" num cols: "<<this->n << "\n");97 _printf_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<")" << "\n"); 98 _printf_("bucket type: " << type << "\n"); 99 _printf_("num rows: "<<this->m<<" num cols: "<<this->n << "\n"); 100 100 if(type==MATRIX_BUCKET){ 101 101 for (i=0;i<this->m;i++){ 102 _print String_("row "<<this->idxm[i]<<", column indices: " << "\n");102 _printf_("row "<<this->idxm[i]<<", column indices: " << "\n"); 103 103 for (j=0;j<this->n;j++){ 104 _print String_(" "<<this->idxn[j] << "\n");105 } 106 _print String_("values: " << "\n");104 _printf_(" "<<this->idxn[j] << "\n"); 105 } 106 _printf_("values: " << "\n"); 107 107 for (j=0;j<this->n;j++){ 108 _print String_(" "<<this->values[m*i+j] << "\n");108 _printf_(" "<<this->values[m*i+j] << "\n"); 109 109 } 110 110 } … … 112 112 else if(type==VECTOR_BUCKET){ 113 113 for (i=0;i<this->m;i++){ 114 _print String_("row "<<this->idxm[i]<<", value " << this->values[i] << "\n");114 _printf_("row "<<this->idxm[i]<<", value " << this->values[i] << "\n"); 115 115 } 116 116 } -
issm/trunk-jpl/src/c/toolkits/issm/IssmDenseMat.h
r15099 r15100 115 115 116 116 int i,j; 117 _print String_("IssmDenseMat size " << this->M << "-" << this->N << "\n");117 _printf_("IssmDenseMat size " << this->M << "-" << this->N << "\n"); 118 118 for(i=0;i<M;i++){ 119 119 for(j=0;j<N;j++){ 120 _print String_(this->matrix[N*i+j] << " ");120 _printf_(this->matrix[N*i+j] << " "); 121 121 } 122 _print String_("" << "\n");122 _printf_("" << "\n"); 123 123 } 124 124 } -
issm/trunk-jpl/src/c/toolkits/issm/IssmMpiDenseMat.h
r15099 r15100 144 144 for(i=0;i<IssmComm::GetSize();i++){ 145 145 if (my_rank==i){ 146 _print String_("cpu " << i << " #rows: " << this->m << "\n");146 _printf_("cpu " << i << " #rows: " << this->m << "\n"); 147 147 for (j=0;j<this->m;j++){ 148 _print String_("row " << j << "\n");148 _printf_("row " << j << "\n"); 149 149 for (k=0;k<this->N;k++){ 150 _print String_(this->matrix[j*this->N+k] << " " << "\n");150 _printf_(this->matrix[j*this->N+k] << " " << "\n"); 151 151 } 152 _print String_("" << "\n");152 _printf_("" << "\n"); 153 153 } 154 154 } -
issm/trunk-jpl/src/c/toolkits/issm/IssmMpiVec.h
r15099 r15100 132 132 for(i=0;i<IssmComm::GetSize();i++){ 133 133 if (IssmComm::GetRank()==i){ 134 _print String_("cpu " << i << " #rows: " << this->m << "\n");134 _printf_("cpu " << i << " #rows: " << this->m << "\n"); 135 135 for (j=0;j<this->m;j++){ 136 _print String_("row " << j << " " << this->vector[j] << "\n");136 _printf_("row " << j << " " << this->vector[j] << "\n"); 137 137 } 138 _print String_("" << "\n");138 _printf_("" << "\n"); 139 139 } 140 140 MPI_Barrier(IssmComm::GetComm()); -
issm/trunk-jpl/src/c/toolkits/issm/IssmSeqVec.h
r15099 r15100 91 91 92 92 int i; 93 _print String_("IssmSeqVec size " << this->M << "\n");93 _printf_("IssmSeqVec size " << this->M << "\n"); 94 94 for(i=0;i<M;i++){ 95 _print String_(vector[i] << "\n ");95 _printf_(vector[i] << "\n "); 96 96 } 97 97 } -
issm/trunk-jpl/src/c/toolkits/petsc/objects/PetscMat.cpp
r15099 r15100 93 93 MatInfo info; 94 94 MatGetInfo(this->matrix,MAT_GLOBAL_SUM,&info); 95 _p printString_("=========================== Stiffness matrix allocation info ===========================" << "\n");96 _p printString_("" << "\n");97 _p printString_(" Block size : "<<info.block_size << "\n");98 _p printString_(" nz_allocated: "<<info.nz_allocated << "\n");99 _p printString_(" nz_used : "<<info.nz_used << "\n");100 _p printString_(" nz_unneeded : "<<info.nz_unneeded<<" ("<<double(info.nz_unneeded)/double(info.nz_allocated)*100.<<"%)" << "\n");101 _p printString_("" << "\n");102 _p printString_("========================================================================================" << "\n");95 _printf0_("=========================== Stiffness matrix allocation info ===========================" << "\n"); 96 _printf0_("" << "\n"); 97 _printf0_(" Block size : "<<info.block_size << "\n"); 98 _printf0_(" nz_allocated: "<<info.nz_allocated << "\n"); 99 _printf0_(" nz_used : "<<info.nz_used << "\n"); 100 _printf0_(" nz_unneeded : "<<info.nz_unneeded<<" ("<<double(info.nz_unneeded)/double(info.nz_allocated)*100.<<"%)" << "\n"); 101 _printf0_("" << "\n"); 102 _printf0_("========================================================================================" << "\n"); 103 103 } 104 104 /*}}}*/ -
issm/trunk-jpl/src/wrappers/AverageFilter/AverageFilter.cpp
r15099 r15100 13 13 14 14 void AverageFilterUsage(void){/*{{{*/ 15 _print String_(" AverageFilter usage:" << "\n");16 _print String_(" [image_out]=AverageFilter(image_in,pixels)" << "\n");17 _print String_(" where:" << "\n");18 _print String_(" image_in in double format" << "\n");19 _print String_(" pixels: characteristic size of smoothing" << "\n");20 _print String_(" image_out in double format" << "\n");21 _print String_("" << "\n");15 _printf_(" AverageFilter usage:" << "\n"); 16 _printf_(" [image_out]=AverageFilter(image_in,pixels)" << "\n"); 17 _printf_(" where:" << "\n"); 18 _printf_(" image_in in double format" << "\n"); 19 _printf_(" pixels: characteristic size of smoothing" << "\n"); 20 _printf_(" image_out in double format" << "\n"); 21 _printf_("" << "\n"); 22 22 }/*}}}*/ 23 23 WRAPPER(AverageFilter){ -
issm/trunk-jpl/src/wrappers/BamgConvertMesh/BamgConvertMesh.cpp
r15099 r15100 5 5 6 6 void BamgConvertMeshUsage(void){/*{{{*/ 7 _p printString_("BAMGCONVERTMESH - convert [x y index] to a bamg geom and mesh geom");8 _p printString_("" << "\n");9 _p printString_(" Usage:" << "\n");10 _p printString_(" [bamggeom bamgmesh]=BamgConvertMesh(index,x,y)" << "\n");11 _p printString_(" index: index of the mesh" << "\n");12 _p printString_(" x,y: coordinates of the nodes" << "\n");13 _p printString_("" << "\n");7 _printf0_("BAMGCONVERTMESH - convert [x y index] to a bamg geom and mesh geom"); 8 _printf0_("" << "\n"); 9 _printf0_(" Usage:" << "\n"); 10 _printf0_(" [bamggeom bamgmesh]=BamgConvertMesh(index,x,y)" << "\n"); 11 _printf0_(" index: index of the mesh" << "\n"); 12 _printf0_(" x,y: coordinates of the nodes" << "\n"); 13 _printf0_("" << "\n"); 14 14 }/*}}}*/ 15 15 WRAPPER(BamgConvertMesh){ -
issm/trunk-jpl/src/wrappers/BamgMesher/BamgMesher.cpp
r15099 r15100 5 5 6 6 void BamgMesherUsage(void){/*{{{*/ 7 _p printString_("" << "\n");8 _p printString_(" usage: [bamgmesh,bamggeom]=" << __FUNCT__ << "(bamgmesh,bamggeom,bamgoptions)" << "\n");9 _p printString_("" << "\n");7 _printf0_("" << "\n"); 8 _printf0_(" usage: [bamgmesh,bamggeom]=" << __FUNCT__ << "(bamgmesh,bamggeom,bamgoptions)" << "\n"); 9 _printf0_("" << "\n"); 10 10 }/*}}}*/ 11 11 WRAPPER(BamgMesher){ -
issm/trunk-jpl/src/wrappers/BamgTriangulate/BamgTriangulate.cpp
r15099 r15100 5 5 6 6 void BamgTriangulateUsage(void){/*{{{*/ 7 _p printString_("BAMGTRIANGULATE - Delaunay Triangulation of a list of points");8 _p printString_("" << "\n");9 _p printString_(" Usage:" << "\n");10 _p printString_(" index=BamgTriangulate(x,y);" << "\n");11 _p printString_(" index: index of the triangulation" << "\n");12 _p printString_(" x,y: coordinates of the nodes" << "\n");13 _p printString_("" << "\n");7 _printf0_("BAMGTRIANGULATE - Delaunay Triangulation of a list of points"); 8 _printf0_("" << "\n"); 9 _printf0_(" Usage:" << "\n"); 10 _printf0_(" index=BamgTriangulate(x,y);" << "\n"); 11 _printf0_(" index: index of the triangulation" << "\n"); 12 _printf0_(" x,y: coordinates of the nodes" << "\n"); 13 _printf0_("" << "\n"); 14 14 }/*}}}*/ 15 15 WRAPPER(BamgTriangulate){ … … 36 36 37 37 /*Input datasets: */ 38 if (verbose) _print String_("Fetching inputs" << "\n");38 if (verbose) _printf_("Fetching inputs" << "\n"); 39 39 FetchData(&x,&nods,&x_cols,XHANDLE); 40 40 FetchData(&y,&y_rows,&y_cols,YHANDLE); … … 46 46 47 47 /* Run core computations: */ 48 if (verbose) _print String_("Call core" << "\n");48 if (verbose) _printf_("Call core" << "\n"); 49 49 BamgTriangulatex(&index,&nels,x,y,nods); 50 50 -
issm/trunk-jpl/src/wrappers/Chaco/Chaco.cpp
r15099 r15100 12 12 13 13 void ChacoUsage(void){/*{{{*/ 14 _p printString_("" << "\n");15 _p printString_("Usage: [assgn] = Chaco(A,vwgts,ewgts,x,y,z,options,nparts,goal);" << "\n");16 _p printString_("" << "\n");14 _printf0_("" << "\n"); 15 _printf0_("Usage: [assgn] = Chaco(A,vwgts,ewgts,x,y,z,options,nparts,goal);" << "\n"); 16 _printf0_("" << "\n"); 17 17 }/*}}}*/ 18 18 WRAPPER(Chaco){ … … 86 86 /*Some debugging print: {{{*/ 87 87 #ifdef _DEBUG_ 88 _print String_("nvtxs: " << nvtxs << "\n");89 _print String_("options: [");90 for(i=0;i<10;i++)_print String_(options[i] << "|");91 _print String_("]" << "\n");92 _print String_("start: " << "\n");93 for (i=0; i<nvtxs+1;i++)_print String_(start[i] << " ");94 _print String_("" << "\n");95 _print String_("adjacency: " << "\n");96 for (i=0; i<mxGetNzmax(A_IN);i++)_print String_("" <<adjacency[i]<< " ");i++)97 _print String_("" << "\n");98 _print String_("nedges: " << nedges << " " << ewgts << "\n");99 if(ewgts) for (i = 0; i < nedges; i++)_print String_(ewgts[i] << " ");100 _print String_("" << "\n");101 _print String_("vwgts:" << "\n");102 for (i = 0; i < nvtxs; i++)_print String_(vwgts[i] << " ");103 _print String_("" << "\n");104 _print String_("nparts: " << nparts[0] << "\n");105 _print String_("goal: " << goal << "\n");88 _printf_("nvtxs: " << nvtxs << "\n"); 89 _printf_("options: ["); 90 for(i=0;i<10;i++)_printf_(options[i] << "|"); 91 _printf_("]" << "\n"); 92 _printf_("start: " << "\n"); 93 for (i=0; i<nvtxs+1;i++)_printf_(start[i] << " "); 94 _printf_("" << "\n"); 95 _printf_("adjacency: " << "\n"); 96 for (i=0; i<mxGetNzmax(A_IN);i++)_printf_("" <<adjacency[i]<< " ");i++) 97 _printf_("" << "\n"); 98 _printf_("nedges: " << nedges << " " << ewgts << "\n"); 99 if(ewgts) for (i = 0; i < nedges; i++)_printf_(ewgts[i] << " "); 100 _printf_("" << "\n"); 101 _printf_("vwgts:" << "\n"); 102 for (i = 0; i < nvtxs; i++)_printf_(vwgts[i] << " "); 103 _printf_("" << "\n"); 104 _printf_("nparts: " << nparts[0] << "\n"); 105 _printf_("goal: " << goal << "\n"); 106 106 #endif 107 107 /*}}}*/ -
issm/trunk-jpl/src/wrappers/ContourToMesh/ContourToMesh.cpp
r15099 r15100 7 7 8 8 void ContourToMeshUsage(void){/*{{{*/ 9 _print String_("CONTOURTOMESH - Flag the elements or nodes inside a contour" << "\n");10 _print String_("" << "\n");11 _print String_(" Usage: " << "\n");12 _print String_(" [in_nod,in_elem]=ContourToMesh(index,x,y,contourname,interptype,edgevalue)" << "\n");13 _print String_("" << "\n");14 _print String_(" index,x,y: mesh triangulation." << "\n");15 _print String_(" contourname: name of .exp file containing the contours." << "\n");16 _print String_(" interptype: string definining type of interpolation ('element', or 'node')." << "\n");17 _print String_(" edgevalue: integer (0, 1 or 2) defining the value associated to the nodes on the edges of the polygons." << "\n");18 _print String_(" in_nod: vector of flags (0 or 1), of size nods if interptype is set to 'node' or 'element and node', " << "\n");19 _print String_(" or of size 0 otherwise." << "\n");20 _print String_(" in_elem: vector of flags (0 or 1), of size nel if interptype is set to 'element' or 'element and node', " << "\n");21 _print String_(" or of size 0 otherwise." << "\n");22 _print String_("" << "\n");23 _print String_(" Example: " << "\n");24 _print String_(" in_nod=ContourToMesh(md.elements,md.x,md.y,'Contour.exp','node',1)" << "\n");25 _print String_(" in_elements=ContourToMesh(md.elements,md.x,md.y,'Contour.exp','element',0)" << "\n");26 _print String_(" [in_nodes,in_elements]=ContourToMesh(md.elements,md.x,md.y,'Contour.exp','element and node',0)" << "\n");27 _print String_("" << "\n");9 _printf_("CONTOURTOMESH - Flag the elements or nodes inside a contour" << "\n"); 10 _printf_("" << "\n"); 11 _printf_(" Usage: " << "\n"); 12 _printf_(" [in_nod,in_elem]=ContourToMesh(index,x,y,contourname,interptype,edgevalue)" << "\n"); 13 _printf_("" << "\n"); 14 _printf_(" index,x,y: mesh triangulation." << "\n"); 15 _printf_(" contourname: name of .exp file containing the contours." << "\n"); 16 _printf_(" interptype: string definining type of interpolation ('element', or 'node')." << "\n"); 17 _printf_(" edgevalue: integer (0, 1 or 2) defining the value associated to the nodes on the edges of the polygons." << "\n"); 18 _printf_(" in_nod: vector of flags (0 or 1), of size nods if interptype is set to 'node' or 'element and node', " << "\n"); 19 _printf_(" or of size 0 otherwise." << "\n"); 20 _printf_(" in_elem: vector of flags (0 or 1), of size nel if interptype is set to 'element' or 'element and node', " << "\n"); 21 _printf_(" or of size 0 otherwise." << "\n"); 22 _printf_("" << "\n"); 23 _printf_(" Example: " << "\n"); 24 _printf_(" in_nod=ContourToMesh(md.elements,md.x,md.y,'Contour.exp','node',1)" << "\n"); 25 _printf_(" in_elements=ContourToMesh(md.elements,md.x,md.y,'Contour.exp','element',0)" << "\n"); 26 _printf_(" [in_nodes,in_elements]=ContourToMesh(md.elements,md.x,md.y,'Contour.exp','element and node',0)" << "\n"); 27 _printf_("" << "\n"); 28 28 }/*}}}*/ 29 29 WRAPPER(ContourToMesh){ -
issm/trunk-jpl/src/wrappers/ContourToNodes/ContourToNodes.cpp
r15099 r15100 6 6 7 7 void ContourToNodesUsage(void){/*{{{*/ 8 _print String_(" usage:" << "\n");9 _print String_(" [flags]=ContourToNodes(x,y,contourname,edgevalue);" << "\n");10 _print String_(" where:" << "\n");11 _print String_(" x,y: list of nodes." << "\n");12 _print String_(" contourname: name of .exp file containing the contours, or resulting structure from call to expread." << "\n");13 _print String_(" edgevalue: integer (0, 1 or 2) defining the value associated to the nodes on the edges of the polygons." << "\n");14 _print String_(" flags: vector of flags (0 or 1), of size nods." << "\n");15 _print String_("" << "\n");8 _printf_(" usage:" << "\n"); 9 _printf_(" [flags]=ContourToNodes(x,y,contourname,edgevalue);" << "\n"); 10 _printf_(" where:" << "\n"); 11 _printf_(" x,y: list of nodes." << "\n"); 12 _printf_(" contourname: name of .exp file containing the contours, or resulting structure from call to expread." << "\n"); 13 _printf_(" edgevalue: integer (0, 1 or 2) defining the value associated to the nodes on the edges of the polygons." << "\n"); 14 _printf_(" flags: vector of flags (0 or 1), of size nods." << "\n"); 15 _printf_("" << "\n"); 16 16 }/*}}}*/ 17 17 WRAPPER(ContourToNodes){ -
issm/trunk-jpl/src/wrappers/EdgeDetection/EdgeDetection.cpp
r15099 r15100 6 6 7 7 void EdgeDetectionUsage(void){/*{{{*/ 8 _p printString_("EDGEDETECTION usage- detect edges of a boolean image" << "\n");9 _p printString_("" << "\n");10 _p printString_(" Usage:" << "\n");11 _p printString_(" contours=EdgeDetection(image);" << "\n");12 _p printString_("" << "\n");13 _p printString_(" image: boolean matrix" << "\n");14 _p printString_("" << "\n");15 _p printString_(" Example:" << "\n");16 _p printString_(" load('velocities.mat');" << "\n");17 _p printString_(" md.inversion.vx_obs=EdgeDetection(x_n,y_m,vx,md.mesh.x,md.mesh.y,0);" << "\n");18 _p printString_("" << "\n");8 _printf0_("EDGEDETECTION usage- detect edges of a boolean image" << "\n"); 9 _printf0_("" << "\n"); 10 _printf0_(" Usage:" << "\n"); 11 _printf0_(" contours=EdgeDetection(image);" << "\n"); 12 _printf0_("" << "\n"); 13 _printf0_(" image: boolean matrix" << "\n"); 14 _printf0_("" << "\n"); 15 _printf0_(" Example:" << "\n"); 16 _printf0_(" load('velocities.mat');" << "\n"); 17 _printf0_(" md.inversion.vx_obs=EdgeDetection(x_n,y_m,vx,md.mesh.x,md.mesh.y,0);" << "\n"); 18 _printf0_("" << "\n"); 19 19 }/*}}}*/ 20 20 WRAPPER(EdgeDetection){ -
issm/trunk-jpl/src/wrappers/ElementConnectivity/ElementConnectivity.cpp
r15099 r15100 6 6 7 7 void ElementConnectivityUsage(void) {/*{{{*/ 8 _p printString_("" << "\n");9 _p printString_(" usage: elementconnectivity = " << __FUNCT__ << "(elements, nodeconnectivity);" << "\n");10 _p printString_("" << "\n");8 _printf0_("" << "\n"); 9 _printf0_(" usage: elementconnectivity = " << __FUNCT__ << "(elements, nodeconnectivity);" << "\n"); 10 _printf0_("" << "\n"); 11 11 }/*}}}*/ 12 12 WRAPPER(ElementConnectivity){ -
issm/trunk-jpl/src/wrappers/EnumToString/EnumToString.cpp
r15099 r15100 6 6 7 7 void EnumToStringUsage(void){/*{{{*/ 8 _p printString_("" << "\n");9 _p printString_(" usage: " << __FUNCT__ << "string = EnumToString(enum);" << "\n");10 _p printString_("" << "\n");8 _printf0_("" << "\n"); 9 _printf0_(" usage: " << __FUNCT__ << "string = EnumToString(enum);" << "\n"); 10 _printf0_("" << "\n"); 11 11 }/*}}}*/ 12 12 WRAPPER(EnumToString){ -
issm/trunk-jpl/src/wrappers/Exp2Kml/Exp2Kml.cpp
r15099 r15100 5 5 6 6 void Exp2KmlUsage(void){/*{{{*/ 7 _p printString_("Exp2Kml - exp to kml file conversion module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module converts a file from exp to kml format." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" [ret]=Exp2Kml(filexp,filkml,sgn,'param name',param,...);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" filexp file name of exp file to be read (char)" << "\n");15 _p printString_(" filkml file name of kml file to be written (char)" << "\n");16 _p printString_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n");17 _p printString_("" << "\n");18 _p printString_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n");19 _p printString_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n");20 _p printString_(" holes flag for treatment of multiple profiles (char, optional, 'yes' for holes))" << "\n");21 _p printString_("" << "\n");22 _p printString_(" ret return code (non-zero for warning)" << "\n");23 _p printString_("" << "\n");24 _p printString_(" Examples:" << "\n");25 _p printString_(" [ret]=Exp2Kml('file.exp','file.kml', 1);" << "\n");26 _p printString_(" [ret]=Exp2Kml('file.exp','file.kml', 1,'central_meridian',45,'standard_parallel',70,'holes','yes');" << "\n");27 _p printString_(" [ret]=Exp2Kml('file.exp','file.kml',-1,'central_meridian', 0,'standard_parallel',71,'holes','yes');" << "\n");28 _p printString_("" << "\n");7 _printf0_("Exp2Kml - exp to kml file conversion module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module converts a file from exp to kml format." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" [ret]=Exp2Kml(filexp,filkml,sgn,'param name',param,...);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" filexp file name of exp file to be read (char)" << "\n"); 15 _printf0_(" filkml file name of kml file to be written (char)" << "\n"); 16 _printf0_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n"); 17 _printf0_("" << "\n"); 18 _printf0_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n"); 19 _printf0_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n"); 20 _printf0_(" holes flag for treatment of multiple profiles (char, optional, 'yes' for holes))" << "\n"); 21 _printf0_("" << "\n"); 22 _printf0_(" ret return code (non-zero for warning)" << "\n"); 23 _printf0_("" << "\n"); 24 _printf0_(" Examples:" << "\n"); 25 _printf0_(" [ret]=Exp2Kml('file.exp','file.kml', 1);" << "\n"); 26 _printf0_(" [ret]=Exp2Kml('file.exp','file.kml', 1,'central_meridian',45,'standard_parallel',70,'holes','yes');" << "\n"); 27 _printf0_(" [ret]=Exp2Kml('file.exp','file.kml',-1,'central_meridian', 0,'standard_parallel',71,'holes','yes');" << "\n"); 28 _printf0_("" << "\n"); 29 29 }/*}}}*/ 30 30 WRAPPER(Exp2Kml){ … … 67 67 if (options->GetOption("central_meridian") || options->GetOption("standard_parallel")) { 68 68 options->Get(&cm,"central_meridian"); 69 if (verbose) _print String_(" cm=" << cm << "\n");69 if (verbose) _printf_(" cm=" << cm << "\n"); 70 70 options->Get(&sp,"standard_parallel"); 71 if (verbose) _print String_(" sp=" << sp << "\n");71 if (verbose) _printf_(" sp=" << sp << "\n"); 72 72 } 73 73 -
issm/trunk-jpl/src/wrappers/ExpSimplify/ExpSimplify.cpp
r15099 r15100 5 5 6 6 void ExpSimplifyUsage(void){/*{{{*/ 7 _print String_("ExpSimplify - Simplify Exp contour" << "\n");8 _print String_("" << "\n");9 _print String_(" Recursive Douglas-Peucker Polygon Simplification" << "\n");10 _print String_("" << "\n");11 _print String_(" Usage:" << "\n");12 _print String_(" ExpSimplify(expfile,tol);" << "\n");13 _print String_(" - expfile: name of the exp file" << "\n");14 _print String_(" - tol: tolerance (maximal euclidean distance allowed between the new line and a vertex)" << "\n");15 _print String_(" Additional options:" << "\n");16 _print String_(" - 'min': minimum number of vertices to save contours in exp file (default is 3)" << "\n");17 _print String_("" << "\n");18 _print String_(" Example:" << "\n");19 _print String_(" ExpSimplify('file.exp',100);" << "\n");20 _print String_(" ExpSimplify('file.exp',100,'remove1',false);" << "\n");7 _printf_("ExpSimplify - Simplify Exp contour" << "\n"); 8 _printf_("" << "\n"); 9 _printf_(" Recursive Douglas-Peucker Polygon Simplification" << "\n"); 10 _printf_("" << "\n"); 11 _printf_(" Usage:" << "\n"); 12 _printf_(" ExpSimplify(expfile,tol);" << "\n"); 13 _printf_(" - expfile: name of the exp file" << "\n"); 14 _printf_(" - tol: tolerance (maximal euclidean distance allowed between the new line and a vertex)" << "\n"); 15 _printf_(" Additional options:" << "\n"); 16 _printf_(" - 'min': minimum number of vertices to save contours in exp file (default is 3)" << "\n"); 17 _printf_("" << "\n"); 18 _printf_(" Example:" << "\n"); 19 _printf_(" ExpSimplify('file.exp',100);" << "\n"); 20 _printf_(" ExpSimplify('file.exp',100,'remove1',false);" << "\n"); 21 21 }/*}}}*/ 22 22 void simplify(Contour<double>* contour,bool* flags,int ind0,int ind1,double tolerance){/*{{{*/ … … 145 145 x = contour->x; 146 146 y = contour->y; 147 _print String_(" Initial number of vertices in contour #"<<counter+1<<": "<<nods << "\n");147 _printf_(" Initial number of vertices in contour #"<<counter+1<<": "<<nods << "\n"); 148 148 149 149 /*Allocate flags (1=keep, 0=remove)*/ … … 183 183 /*Do we save new profile?*/ 184 184 if(newnods>=minimumvertices){ 185 _print String_(" Final number of vertices in contour #"<<counter+1<<": "<<newnods << "\n");185 _printf_(" Final number of vertices in contour #"<<counter+1<<": "<<newnods << "\n"); 186 186 newcontour = xNew<Contour<double> >(1); 187 187 newcontour->nods = newnods; … … 202 202 } 203 203 else{ 204 _print String_(" Final number of vertices in contour #"<<counter+1<<": "<<newnods<<" (not saved)" << "\n");204 _printf_(" Final number of vertices in contour #"<<counter+1<<": "<<newnods<<" (not saved)" << "\n"); 205 205 } 206 206 … … 208 208 xDelete<bool>(flags); 209 209 } 210 _print String_(" Initial number of contours: "<<oldcontours->Size() << "\n");211 _print String_(" Final number of contours: "<<newcontours->Size() << "\n");210 _printf_(" Initial number of contours: "<<oldcontours->Size() << "\n"); 211 _printf_(" Final number of contours: "<<newcontours->Size() << "\n"); 212 212 213 213 /*Write data: */ -
issm/trunk-jpl/src/wrappers/HoleFiller/HoleFiller.cpp
r15099 r15100 13 13 14 14 void HoleFillerUsage(void){/*{{{*/ 15 _print String_(" HoleFiller usage:" << "\n");16 _print String_(" [image_out]=HoleFiller(image_in,smooth);" << "\n");17 _print String_(" where:" << "\n");18 _print String_(" image_in in double format" << "\n");19 _print String_(" smooth: 1 to smooth with a box filer, 0 to leave data raw" << "\n");20 _print String_(" image_out in double format" << "\n");21 _print String_("" << "\n");15 _printf_(" HoleFiller usage:" << "\n"); 16 _printf_(" [image_out]=HoleFiller(image_in,smooth);" << "\n"); 17 _printf_(" where:" << "\n"); 18 _printf_(" image_in in double format" << "\n"); 19 _printf_(" smooth: 1 to smooth with a box filer, 0 to leave data raw" << "\n"); 20 _printf_(" image_out in double format" << "\n"); 21 _printf_("" << "\n"); 22 22 }/*}}}*/ 23 23 WRAPPER(HoleFiller){ -
issm/trunk-jpl/src/wrappers/InternalFront/InternalFront.cpp
r15099 r15100 6 6 7 7 void InternalFrontUsage(void) {/*{{{*/ 8 _p printString_("" << "\n");9 _p printString_(" usage: icefront = " << __FUNCT__ << "(md);" << "\n");10 _p printString_("" << "\n");8 _printf0_("" << "\n"); 9 _printf0_(" usage: icefront = " << __FUNCT__ << "(md);" << "\n"); 10 _printf0_("" << "\n"); 11 11 }/*}}}*/ 12 12 WRAPPER(InternalFront){ -
issm/trunk-jpl/src/wrappers/InterpFromGridToMesh/InterpFromGridToMesh.cpp
r15099 r15100 6 6 7 7 void InterpFromGridToMeshUsage(void){/*{{{*/ 8 _p printString_("INTERPFROMGRIDTOMESH - interpolation from a grid onto a list of points" << "\n");9 _p printString_("" << "\n");10 _p printString_(" This function is a multi-threaded mex file that interpolates a field" << "\n");11 _p printString_(" defined on a grid onto a list of points" << "\n");12 _p printString_("" << "\n");13 _p printString_(" Usage:" << "\n");14 _p printString_(" data_mesh=InterpFromGridToMesh(x,y,data,x_mesh,y_mesh,default_value);" << "\n");15 _p printString_("" << "\n");16 _p printString_(" data: matrix holding the data to be interpolated onto the mesh." << "\n");17 _p printString_(" x,y: coordinates of matrix data. (x and y must be in increasing order)" << "\n");18 _p printString_(" x_mesh,y_mesh: coordinates of the points onto which we interpolate." << "\n");19 _p printString_(" default_value: default value if no data is found (holes)." << "\n");20 _p printString_(" data_mesh: vector of mesh interpolated data." << "\n");21 _p printString_("" << "\n");22 _p printString_(" Example:" << "\n");23 _p printString_(" load('velocities.mat');" << "\n");24 _p printString_(" md.inversion.vx_obs=InterpFromGridToMesh(x_n,y_m,vx,md.mesh.x,md.mesh.y,0);" << "\n");25 _p printString_("" << "\n");8 _printf0_("INTERPFROMGRIDTOMESH - interpolation from a grid onto a list of points" << "\n"); 9 _printf0_("" << "\n"); 10 _printf0_(" This function is a multi-threaded mex file that interpolates a field" << "\n"); 11 _printf0_(" defined on a grid onto a list of points" << "\n"); 12 _printf0_("" << "\n"); 13 _printf0_(" Usage:" << "\n"); 14 _printf0_(" data_mesh=InterpFromGridToMesh(x,y,data,x_mesh,y_mesh,default_value);" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" data: matrix holding the data to be interpolated onto the mesh." << "\n"); 17 _printf0_(" x,y: coordinates of matrix data. (x and y must be in increasing order)" << "\n"); 18 _printf0_(" x_mesh,y_mesh: coordinates of the points onto which we interpolate." << "\n"); 19 _printf0_(" default_value: default value if no data is found (holes)." << "\n"); 20 _printf0_(" data_mesh: vector of mesh interpolated data." << "\n"); 21 _printf0_("" << "\n"); 22 _printf0_(" Example:" << "\n"); 23 _printf0_(" load('velocities.mat');" << "\n"); 24 _printf0_(" md.inversion.vx_obs=InterpFromGridToMesh(x_n,y_m,vx,md.mesh.x,md.mesh.y,0);" << "\n"); 25 _printf0_("" << "\n"); 26 26 }/*}}}*/ 27 27 WRAPPER(InterpFromGridToMesh){ -
issm/trunk-jpl/src/wrappers/InterpFromMesh2d/InterpFromMesh2d.cpp
r15099 r15100 6 6 7 7 void InterpFromMesh2dUsage(void){/*{{{*/ 8 _p printString_(" usage:" << "\n");9 _p printString_(" data_prime=InterpFromMesh2d(index,x,y,data,x_prime,y_prime);" << "\n");10 _p printString_(" or data_prime=InterpFromMesh2d(index,x,y,data,x_prime,y_prime,default_value);" << "\n");11 _p printString_(" or data_prime=InterpFromMesh2d(index,x,y,data,x_prime,y_prime,default_value,contourname);" << "\n");12 _p printString_(" where:" << "\n");13 _p printString_(" x,y: coordinates of the nodes where data is defined" << "\n");14 _p printString_(" index: index of the mesh where data is defined" << "\n");15 _p printString_(" data - vector holding the data to be interpolated onto the points." << "\n");16 _p printString_(" x_prime,y_prime: coordinates of the mesh vertices onto which we interpolate." << "\n");17 _p printString_(" default_value: a scalar or vector of size length(x_prime)." << "\n");18 _p printString_(" contourname: linear interpolation will happen on all x_interp,y_interp inside the contour, default value will be adopted on the rest of the mesh." << "\n");19 _p printString_(" data_prime: vector of prime interpolated data." << "\n");20 _p printString_("" << "\n");8 _printf0_(" usage:" << "\n"); 9 _printf0_(" data_prime=InterpFromMesh2d(index,x,y,data,x_prime,y_prime);" << "\n"); 10 _printf0_(" or data_prime=InterpFromMesh2d(index,x,y,data,x_prime,y_prime,default_value);" << "\n"); 11 _printf0_(" or data_prime=InterpFromMesh2d(index,x,y,data,x_prime,y_prime,default_value,contourname);" << "\n"); 12 _printf0_(" where:" << "\n"); 13 _printf0_(" x,y: coordinates of the nodes where data is defined" << "\n"); 14 _printf0_(" index: index of the mesh where data is defined" << "\n"); 15 _printf0_(" data - vector holding the data to be interpolated onto the points." << "\n"); 16 _printf0_(" x_prime,y_prime: coordinates of the mesh vertices onto which we interpolate." << "\n"); 17 _printf0_(" default_value: a scalar or vector of size length(x_prime)." << "\n"); 18 _printf0_(" contourname: linear interpolation will happen on all x_interp,y_interp inside the contour, default value will be adopted on the rest of the mesh." << "\n"); 19 _printf0_(" data_prime: vector of prime interpolated data." << "\n"); 20 _printf0_("" << "\n"); 21 21 }/*}}}*/ 22 22 WRAPPER(InterpFromMesh2d){ … … 113 113 /* Debugging of contours :{{{1*/ 114 114 /*for(i=0;i<numcontours;i++){ 115 _print String_("\nContour echo: contour number " << i+1 << " / " << numcontours << "\n");115 _printf_("\nContour echo: contour number " << i+1 << " / " << numcontours << "\n"); 116 116 contouri=*(contours+i); 117 _print String_(" Number of vertices " << contouri->nods << "\n");117 _printf_(" Number of vertices " << contouri->nods << "\n"); 118 118 for (j=0;j<contouri->nods;j++){ 119 _print String_(" " << *(contouri->x+j) << "f " << *(contouri->y+j) << "f" << "\n");119 _printf_(" " << *(contouri->x+j) << "f " << *(contouri->y+j) << "f" << "\n"); 120 120 } 121 121 }*/ -
issm/trunk-jpl/src/wrappers/InterpFromMeshToGrid/InterpFromMeshToGrid.cpp
r15099 r15100 6 6 7 7 void InterpFromMeshToGridUsage(void){/*{{{*/ 8 _p printString_("INTERPFROMMESHTOGRID - interpolation of a data defined on a mesh onto a grid" << "\n");9 _p printString_("" << "\n");10 _p printString_(" This function is a multi-threaded mex file that interpolates a field" << "\n");11 _p printString_(" defined on a triangular mesh onto a regular grid" << "\n");12 _p printString_("" << "\n");13 _p printString_(" Usage:" << "\n");14 _p printString_(" [x_m,y_m,griddata]=InterpFromMeshToGrid(index,x,y,data,xmin,ymax,xposting,yposting,nlines,ncols,default_value)" << "\n");15 _p printString_("" << "\n");16 _p printString_(" index,x,y: delaunay triangulation defining the mesh." << "\n");17 _p printString_(" meshdata: vertex values of data to be interpolated." << "\n");18 _p printString_(" xmin,ymax,posting,nlines,ncols: parameters that define the grid" << "\n");19 _p printString_(" default_value: value of points located out of the mesh." << "\n");20 _p printString_("" << "\n");8 _printf0_("INTERPFROMMESHTOGRID - interpolation of a data defined on a mesh onto a grid" << "\n"); 9 _printf0_("" << "\n"); 10 _printf0_(" This function is a multi-threaded mex file that interpolates a field" << "\n"); 11 _printf0_(" defined on a triangular mesh onto a regular grid" << "\n"); 12 _printf0_("" << "\n"); 13 _printf0_(" Usage:" << "\n"); 14 _printf0_(" [x_m,y_m,griddata]=InterpFromMeshToGrid(index,x,y,data,xmin,ymax,xposting,yposting,nlines,ncols,default_value)" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" index,x,y: delaunay triangulation defining the mesh." << "\n"); 17 _printf0_(" meshdata: vertex values of data to be interpolated." << "\n"); 18 _printf0_(" xmin,ymax,posting,nlines,ncols: parameters that define the grid" << "\n"); 19 _printf0_(" default_value: value of points located out of the mesh." << "\n"); 20 _printf0_("" << "\n"); 21 21 }/*}}}*/ 22 22 WRAPPER(InterpFromMeshToGrid){ -
issm/trunk-jpl/src/wrappers/InterpFromMeshToMesh2d/InterpFromMeshToMesh2d.cpp
r15099 r15100 5 5 6 6 void InterpFromMeshToMesh2dUsage(void){/*{{{*/ 7 _p printString_("INTERFROMMESHTOMESH2D - interpolation from a 2d triangular mesh onto a list of point" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This function is a multi-threaded mex file that interpolates a field" << "\n");10 _p printString_(" defined on a Delaunay triangulation onto a list of point" << "\n");11 _p printString_("" << "\n");12 _p printString_(" Usage:" << "\n");13 _p printString_(" data_interp=InterpFromMeshToMesh2d(index,x,y,data,x_interp,y_interp);" << "\n");14 _p printString_(" or data_interp=InterpFromMeshToMesh2d(index,x,y,data,x_interp,y_interp,OPTIONS);" << "\n");15 _p printString_("" << "\n");16 _p printString_(" index : index of the mesh where data is defined" << "\n");17 _p printString_(" x,y : coordinates of the nodes where data is defined" << "\n");18 _p printString_(" data : matrix holding the data to be interpolated onto the mesh. (one column per field)" << "\n");19 _p printString_(" x_interp,y_interp : coordinates of the points onto which we interpolate." << "\n");20 _p printString_(" data_interp : vector of mesh interpolated data." << "\n");21 _p printString_(" Available options :" << "\n");22 _p printString_(" - 'default' : default value if point is outsite of triangulation (instead of linear interolation)" << "\n");23 _p printString_("" << "\n");24 _p printString_(" Example:" << "\n");25 _p printString_(" load('temperature.mat');" << "\n");26 _p printString_(" md.initialization.temperature=InterpFromMeshToMesh2d(index,x,y,temperature,md.mesh.x,md.mesh.y);" << "\n");27 _p printString_(" md.initialization.temperature=InterpFromMeshToMesh2d(index,x,y,temperature,md.mesh.x,md.mesh.y,'default',253);" << "\n");28 _p printString_("" << "\n");7 _printf0_("INTERFROMMESHTOMESH2D - interpolation from a 2d triangular mesh onto a list of point" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This function is a multi-threaded mex file that interpolates a field" << "\n"); 10 _printf0_(" defined on a Delaunay triangulation onto a list of point" << "\n"); 11 _printf0_("" << "\n"); 12 _printf0_(" Usage:" << "\n"); 13 _printf0_(" data_interp=InterpFromMeshToMesh2d(index,x,y,data,x_interp,y_interp);" << "\n"); 14 _printf0_(" or data_interp=InterpFromMeshToMesh2d(index,x,y,data,x_interp,y_interp,OPTIONS);" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" index : index of the mesh where data is defined" << "\n"); 17 _printf0_(" x,y : coordinates of the nodes where data is defined" << "\n"); 18 _printf0_(" data : matrix holding the data to be interpolated onto the mesh. (one column per field)" << "\n"); 19 _printf0_(" x_interp,y_interp : coordinates of the points onto which we interpolate." << "\n"); 20 _printf0_(" data_interp : vector of mesh interpolated data." << "\n"); 21 _printf0_(" Available options :" << "\n"); 22 _printf0_(" - 'default' : default value if point is outsite of triangulation (instead of linear interolation)" << "\n"); 23 _printf0_("" << "\n"); 24 _printf0_(" Example:" << "\n"); 25 _printf0_(" load('temperature.mat');" << "\n"); 26 _printf0_(" md.initialization.temperature=InterpFromMeshToMesh2d(index,x,y,temperature,md.mesh.x,md.mesh.y);" << "\n"); 27 _printf0_(" md.initialization.temperature=InterpFromMeshToMesh2d(index,x,y,temperature,md.mesh.x,md.mesh.y,'default',253);" << "\n"); 28 _printf0_("" << "\n"); 29 29 }/*}}}*/ 30 30 WRAPPER(InterpFromMeshToMesh2d){ -
issm/trunk-jpl/src/wrappers/InterpFromMeshToMesh3d/InterpFromMeshToMesh3d.cpp
r15099 r15100 6 6 7 7 void InterpFromMeshToMesh3dUsage(void){/*{{{*/ 8 _p printString_("INTERPFROMMESHTOMESH3D - interpolation from a 3d hexahedron mesh onto a list of point" << "\n");9 _p printString_("" << "\n");10 _p printString_(" This function is a multi-threaded mex file that interpolates a field" << "\n");11 _p printString_(" defined on a triangular mesh onto a list of point" << "\n");12 _p printString_("" << "\n");13 _p printString_(" Usage:" << "\n");14 _p printString_(" data_prime=InterpFromMeshToMesh3d(index,x,y,z,data,x_prime,y_prime,z_prime,default_value);" << "\n");15 _p printString_("" << "\n");16 _p printString_(" index: index of the mesh where data is defined" << "\n");17 _p printString_(" x,y,z: coordinates of the nodes where data is defined" << "\n");18 _p printString_(" data: matrix holding the data to be interpolated onto the mesh." << "\n");19 _p printString_(" x_prime,y_prime,z_prime: coordinates of the points onto which we interpolate." << "\n");20 _p printString_(" default_value: default value if no data is found (holes)." << "\n");21 _p printString_(" data_prime: vector of mesh interpolated data." << "\n");22 _p printString_("" << "\n");23 _p printString_(" Example:" << "\n");24 _p printString_(" load('temperature.mat');" << "\n");25 _p printString_(" md.initialization.temperature=InterpFromMeshToMesh3d(index,x,y,z,temperature,md.mesh.x,md.mesh.y,md.mesh.z,253);" << "\n");26 _p printString_("" << "\n");8 _printf0_("INTERPFROMMESHTOMESH3D - interpolation from a 3d hexahedron mesh onto a list of point" << "\n"); 9 _printf0_("" << "\n"); 10 _printf0_(" This function is a multi-threaded mex file that interpolates a field" << "\n"); 11 _printf0_(" defined on a triangular mesh onto a list of point" << "\n"); 12 _printf0_("" << "\n"); 13 _printf0_(" Usage:" << "\n"); 14 _printf0_(" data_prime=InterpFromMeshToMesh3d(index,x,y,z,data,x_prime,y_prime,z_prime,default_value);" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" index: index of the mesh where data is defined" << "\n"); 17 _printf0_(" x,y,z: coordinates of the nodes where data is defined" << "\n"); 18 _printf0_(" data: matrix holding the data to be interpolated onto the mesh." << "\n"); 19 _printf0_(" x_prime,y_prime,z_prime: coordinates of the points onto which we interpolate." << "\n"); 20 _printf0_(" default_value: default value if no data is found (holes)." << "\n"); 21 _printf0_(" data_prime: vector of mesh interpolated data." << "\n"); 22 _printf0_("" << "\n"); 23 _printf0_(" Example:" << "\n"); 24 _printf0_(" load('temperature.mat');" << "\n"); 25 _printf0_(" md.initialization.temperature=InterpFromMeshToMesh3d(index,x,y,z,temperature,md.mesh.x,md.mesh.y,md.mesh.z,253);" << "\n"); 26 _printf0_("" << "\n"); 27 27 }/*}}}*/ 28 28 WRAPPER(InterpFromMeshToMesh3d){ -
issm/trunk-jpl/src/wrappers/KMLFileRead/KMLFileRead.cpp
r15099 r15100 5 5 6 6 void KMLFileReadUsage(void){/*{{{*/ 7 _p printString_("KMLFileRead - KML file reader module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module reads a KML file." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" [ierror]=KMLFileRead(kmlfile,'param name',param,...);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" kmlfile file name of kml file to be read (char)" << "\n");15 _p printString_("" << "\n");16 _p printString_(" echo echo command (char, optional, 'off'/'on')" << "\n");17 _p printString_(" deepecho deep echo command (char, optional, 'off'/'on')" << "\n");18 _p printString_(" write write command (char, optional, 'off'/'stdout'/kmlfile)" << "\n");19 _p printString_("" << "\n");20 _p printString_(" ierror return code (non-zero for error)" << "\n");21 _p printString_("" << "\n");22 _p printString_(" Examples:" << "\n");23 _p printString_(" [ierror]=KMLFileRead('file.kml','deepecho','on');" << "\n");24 _p printString_(" [ierror]=KMLFileRead('filin.kml','echo','on','write','filout.kml');" << "\n");25 _p printString_("" << "\n");7 _printf0_("KMLFileRead - KML file reader module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module reads a KML file." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" [ierror]=KMLFileRead(kmlfile,'param name',param,...);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" kmlfile file name of kml file to be read (char)" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" echo echo command (char, optional, 'off'/'on')" << "\n"); 17 _printf0_(" deepecho deep echo command (char, optional, 'off'/'on')" << "\n"); 18 _printf0_(" write write command (char, optional, 'off'/'stdout'/kmlfile)" << "\n"); 19 _printf0_("" << "\n"); 20 _printf0_(" ierror return code (non-zero for error)" << "\n"); 21 _printf0_("" << "\n"); 22 _printf0_(" Examples:" << "\n"); 23 _printf0_(" [ierror]=KMLFileRead('file.kml','deepecho','on');" << "\n"); 24 _printf0_(" [ierror]=KMLFileRead('filin.kml','echo','on','write','filout.kml');" << "\n"); 25 _printf0_("" << "\n"); 26 26 }/*}}}*/ 27 27 WRAPPER(KMLFileRead){ … … 84 84 if (!strlen(filnam)) strcpy(filnam,"stdout"); 85 85 86 if (verbose) _print String_("Opening file \"" << filnam << "\"." << "\n");86 if (verbose) _printf_("Opening file \"" << filnam << "\"." << "\n"); 87 87 fidi=fopen(filnam,"r"); 88 88 89 89 /* Run core computations: */ 90 if (verbose) _print String_("Calling core:" << "\n");90 if (verbose) _printf_("Calling core:" << "\n"); 91 91 kobj=KMLFileReadx(fidi); 92 92 93 if (verbose) _print String_("Closing file \"" << filnam << "\"." << "\n");93 if (verbose) _printf_("Closing file \"" << filnam << "\"." << "\n"); 94 94 fclose(fidi); 95 95 … … 104 104 } 105 105 else { 106 if (verbose) _print String_("Opening file \"" << write << "\"." << "\n");106 if (verbose) _printf_("Opening file \"" << write << "\"." << "\n"); 107 107 fido=fopen(write,"w"); 108 108 kobj->Write(fido,""); 109 if (verbose) _print String_("Closing file \"" << write << "\"." << "\n");109 if (verbose) _printf_("Closing file \"" << write << "\"." << "\n"); 110 110 ierror=fclose(fido); 111 111 } -
issm/trunk-jpl/src/wrappers/KMLMeshWrite/KMLMeshWrite.cpp
r15099 r15100 5 5 6 6 void KMLMeshWriteUsage(void){/*{{{*/ 7 _p printString_("KMLMeshWrite - KML mesh writer module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module writes the mesh of a model as KML polygons into the specified KML file." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" ierror=KMLMeshWrite(name,notes,elem,nodecon,lat,long,part,data,cmap,kmlfile);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" name model name (string, may be empty)" << "\n");15 _p printString_(" notes model notes (string or cell array of strings, may be empty)" << "\n");16 _p printString_(" elem elements (double array)" << "\n");17 _p printString_(" nodecon nodal connectivity array (double array, may be empty)" << "\n");18 _p printString_(" lat nodal latititudes (double vector)" << "\n");19 _p printString_(" long nodal longitudes (double vector)" << "\n");20 _p printString_(" part nodal partitions (double vector, may be empty)" << "\n");21 _p printString_(" data nodal or element data (double vector, may be empty)" << "\n");22 _p printString_(" cmap color map (double nx3 array, may be empty)" << "\n");23 _p printString_(" kmlfile KML file name (string)" << "\n");24 _p printString_("" << "\n");25 _p printString_(" ierror error flag (double, non-zero for error)" << "\n");26 _p printString_("" << "\n");27 _p printString_(" Example:" << "\n");28 _p printString_(" KMLMeshWrite(md.name,md.notes,md.elements,md.nodeconnectivity,md.lat,md.long,md.part,md.fm_criterion,options.cmap,filekml);" << "\n");29 _p printString_("" << "\n");7 _printf0_("KMLMeshWrite - KML mesh writer module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module writes the mesh of a model as KML polygons into the specified KML file." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" ierror=KMLMeshWrite(name,notes,elem,nodecon,lat,long,part,data,cmap,kmlfile);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" name model name (string, may be empty)" << "\n"); 15 _printf0_(" notes model notes (string or cell array of strings, may be empty)" << "\n"); 16 _printf0_(" elem elements (double array)" << "\n"); 17 _printf0_(" nodecon nodal connectivity array (double array, may be empty)" << "\n"); 18 _printf0_(" lat nodal latititudes (double vector)" << "\n"); 19 _printf0_(" long nodal longitudes (double vector)" << "\n"); 20 _printf0_(" part nodal partitions (double vector, may be empty)" << "\n"); 21 _printf0_(" data nodal or element data (double vector, may be empty)" << "\n"); 22 _printf0_(" cmap color map (double nx3 array, may be empty)" << "\n"); 23 _printf0_(" kmlfile KML file name (string)" << "\n"); 24 _printf0_("" << "\n"); 25 _printf0_(" ierror error flag (double, non-zero for error)" << "\n"); 26 _printf0_("" << "\n"); 27 _printf0_(" Example:" << "\n"); 28 _printf0_(" KMLMeshWrite(md.name,md.notes,md.elements,md.nodeconnectivity,md.lat,md.long,md.part,md.fm_criterion,options.cmap,filekml);" << "\n"); 29 _printf0_("" << "\n"); 30 30 }/*}}}*/ 31 31 WRAPPER(KMLMeshWrite){ -
issm/trunk-jpl/src/wrappers/KMLOverlay/KMLOverlay.cpp
r15099 r15100 5 5 6 6 void KMLOverlayUsage(void){/*{{{*/ 7 _p printString_("KMLOverlay - KML file overlay module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module reads a list of image files and writes a KML or KMZ overlay file." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" ierror=KMLOverlay(kmlfile,'param name',param,...);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" kmlfile KML or KMZ file name (string)" << "\n");15 _p printString_("" << "\n");16 _p printString_(" lataxis latitude axis (double vector [south north], required)" << "\n");17 _p printString_(" longaxis longitude axis (double vector [west east], required)" << "\n");18 _p printString_(" images relative or http image file names (string or array of strings or cell array of strings, required)" << "\n");19 _p printString_(" zip flag to zip the doc.kml and image files into kmzfile (double, non-zero for kmz)" << "\n");20 _p printString_("" << "\n");21 _p printString_(" ierror error flag (double, non-zero for error)" << "\n");22 _p printString_("" << "\n");23 _p printString_(" Example:" << "\n");24 _p printString_(" KMLOverlay(kmlfile,'lataxis',[south north],'longaxis',[west east],'images',{'file1.png','http://issm/file2.png'},'zip',1);" << "\n");25 _p printString_("" << "\n");7 _printf0_("KMLOverlay - KML file overlay module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module reads a list of image files and writes a KML or KMZ overlay file." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" ierror=KMLOverlay(kmlfile,'param name',param,...);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" kmlfile KML or KMZ file name (string)" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" lataxis latitude axis (double vector [south north], required)" << "\n"); 17 _printf0_(" longaxis longitude axis (double vector [west east], required)" << "\n"); 18 _printf0_(" images relative or http image file names (string or array of strings or cell array of strings, required)" << "\n"); 19 _printf0_(" zip flag to zip the doc.kml and image files into kmzfile (double, non-zero for kmz)" << "\n"); 20 _printf0_("" << "\n"); 21 _printf0_(" ierror error flag (double, non-zero for error)" << "\n"); 22 _printf0_("" << "\n"); 23 _printf0_(" Example:" << "\n"); 24 _printf0_(" KMLOverlay(kmlfile,'lataxis',[south north],'longaxis',[west east],'images',{'file1.png','http://issm/file2.png'},'zip',1);" << "\n"); 25 _printf0_("" << "\n"); 26 26 }/*}}}*/ 27 27 WRAPPER(KMLOverlay){ … … 63 63 64 64 options->Get(&lataxis ,&nlat ,(char*)"lataxis"); 65 if (verbose && lataxis) for (i=0; i<nlat; i++) _print String_(" lataxis [" << i << "]=" << lataxis[i] << "\n");65 if (verbose && lataxis) for (i=0; i<nlat; i++) _printf_(" lataxis [" << i << "]=" << lataxis[i] << "\n"); 66 66 options->Get(&longaxis,&nlong,(char*)"longaxis"); 67 if (verbose && longaxis) for (i=0; i<nlong; i++) _print String_(" longaxis[" << i << "]=" << longaxis[i] << "\n");67 if (verbose && longaxis) for (i=0; i<nlong; i++) _printf_(" longaxis[" << i << "]=" << longaxis[i] << "\n"); 68 68 options->Get(&pimages,&nimages,(char*)"images"); 69 if (verbose && pimages) for (i=0; i<nimages; i++) _print String_(" pimages[" << i << "]=\"" << pimages[i] << "\"" << "\n");69 if (verbose && pimages) for (i=0; i<nimages; i++) _printf_(" pimages[" << i << "]=\"" << pimages[i] << "\"" << "\n"); 70 70 options->Get(&dzip,(char*)"zip",0.); 71 if (verbose) _print String_(" dzip=" << dzip << "\n");71 if (verbose) _printf_(" dzip=" << dzip << "\n"); 72 72 73 73 /*some checks*/ … … 84 84 if(!strlen(filkml)) strcpy(filkml,"stdout"); 85 85 86 if(verbose) _print String_("Opening kml overlay file \"" << filkml << "\"." << "\n");86 if(verbose) _printf_("Opening kml overlay file \"" << filkml << "\"." << "\n"); 87 87 fid=fopen(filkml,"w"); 88 88 89 89 /* Run core computations: */ 90 if (verbose) _print String_("Calling core:" << "\n");90 if (verbose) _printf_("Calling core:" << "\n"); 91 91 KMLOverlayx(&ierror,lataxis,longaxis,nimages,pimages,fid); 92 92 93 if (verbose) _print String_("Closing file \"" << filkml << "\"." << "\n");93 if (verbose) _printf_("Closing file \"" << filkml << "\"." << "\n"); 94 94 fclose(fid); 95 95 … … 108 108 strcat(czip,pimages[i]); 109 109 } 110 if (verbose) _print String_("Zipping file \"" << filkmz << "\"." << "\n");111 if (verbose) _print String_(czip << "\n");110 if (verbose) _printf_("Zipping file \"" << filkmz << "\"." << "\n"); 111 if (verbose) _printf_(czip << "\n"); 112 112 113 113 if (mexEvalString(czip)) _error_("Error zipping file \"" << filkmz << "\"."); -
issm/trunk-jpl/src/wrappers/Kml2Exp/Kml2Exp.cpp
r15099 r15100 5 5 6 6 void Kml2ExpUsage(void){/*{{{*/ 7 _p printString_("Kml2Exp - kml to exp file conversion module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module converts a file from kml to exp format." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" [ret]=Kml2Exp(filexp,filkml,sgn,'param name',param,...);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" filkml file name of kml file to be read (char)" << "\n");15 _p printString_(" filexp file name of exp file to be written (char)" << "\n");16 _p printString_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n");17 _p printString_("" << "\n");18 _p printString_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n");19 _p printString_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n");20 _p printString_("" << "\n");21 _p printString_(" ret return code (non-zero for warning)" << "\n");22 _p printString_("" << "\n");23 _p printString_(" Examples:" << "\n");24 _p printString_(" [ret]=Kml2Exp('file.kml','file.exp', 1);" << "\n");25 _p printString_(" [ret]=Kml2Exp('file.kml','file.exp', 1,'central_meridian',45,'standard_parallel',70);" << "\n");26 _p printString_(" [ret]=Kml2Exp('file.kml','file.exp',-1,'central_meridian', 0,'standard_parallel',71);" << "\n");27 _p printString_("" << "\n");7 _printf0_("Kml2Exp - kml to exp file conversion module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module converts a file from kml to exp format." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" [ret]=Kml2Exp(filexp,filkml,sgn,'param name',param,...);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" filkml file name of kml file to be read (char)" << "\n"); 15 _printf0_(" filexp file name of exp file to be written (char)" << "\n"); 16 _printf0_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n"); 17 _printf0_("" << "\n"); 18 _printf0_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n"); 19 _printf0_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n"); 20 _printf0_("" << "\n"); 21 _printf0_(" ret return code (non-zero for warning)" << "\n"); 22 _printf0_("" << "\n"); 23 _printf0_(" Examples:" << "\n"); 24 _printf0_(" [ret]=Kml2Exp('file.kml','file.exp', 1);" << "\n"); 25 _printf0_(" [ret]=Kml2Exp('file.kml','file.exp', 1,'central_meridian',45,'standard_parallel',70);" << "\n"); 26 _printf0_(" [ret]=Kml2Exp('file.kml','file.exp',-1,'central_meridian', 0,'standard_parallel',71);" << "\n"); 27 _printf0_("" << "\n"); 28 28 }/*}}}*/ 29 29 WRAPPER(Kml2Exp){ … … 60 60 if (options->GetOption("central_meridian") || options->GetOption("standard_parallel")) { 61 61 options->Get(&cm,"central_meridian"); 62 if (verbose) _print String_(" cm=" << cm << "\n");62 if (verbose) _printf_(" cm=" << cm << "\n"); 63 63 options->Get(&sp,"standard_parallel"); 64 if (verbose) _print String_(" sp=" << sp << "\n");64 if (verbose) _printf_(" sp=" << sp << "\n"); 65 65 } 66 66 -
issm/trunk-jpl/src/wrappers/Kriging/Kriging.cpp
r15099 r15100 9 9 num=_NUMTHREADS_; 10 10 #endif 11 _p printString_("" << "\n");12 _p printString_(" usage: predictions=" << __FUNCT__ << "(x,y,observations,x_interp,y_interp,'options');" << "\n");13 _p printString_(" available options:" << "\n");14 _p printString_(" -'model': Available variogram models 'gaussian' (default),'spherical','power','exponential'" << "\n");15 _p printString_(" -'nugget': nugget effect (default 0.2)" << "\n");16 _p printString_(" -'range': for gaussian, spherical and exponential models (default sqrt(3))" << "\n");17 _p printString_(" -'sill': for gaussian, spherical and exponential models (default 1)" << "\n");18 _p printString_(" -'slope': for power model (default 1)" << "\n");19 _p printString_(" -'power': for power model (default 1)" << "\n");20 _p printString_(" -'searchradius': search radius for each prediction (default is observations span)" << "\n");21 _p printString_(" -'boxlength': minimum length of quadtree boxes (useful to decrease the number of observations)" << "\n");22 _p printString_(" -'maxdata': minimum number of observations for a prediction (default is 50)" << "\n");23 _p printString_(" -'mindata': maximum number of observations for a prediction (default is 1)" << "\n");24 _p printString_(" -'maxtrimming': maximum trimming value (default is -1.e+21)" << "\n");25 _p printString_(" -'mintrimming': minimum trimming value (default is +1.e+21)" << "\n");26 _p printString_(" -'minspacing': minimum distance between observation (default is 0.01)" << "\n");27 _p printString_(" -'numthreads': number of threads, default is "<<num << "\n");28 _p printString_("" << "\n");11 _printf0_("" << "\n"); 12 _printf0_(" usage: predictions=" << __FUNCT__ << "(x,y,observations,x_interp,y_interp,'options');" << "\n"); 13 _printf0_(" available options:" << "\n"); 14 _printf0_(" -'model': Available variogram models 'gaussian' (default),'spherical','power','exponential'" << "\n"); 15 _printf0_(" -'nugget': nugget effect (default 0.2)" << "\n"); 16 _printf0_(" -'range': for gaussian, spherical and exponential models (default sqrt(3))" << "\n"); 17 _printf0_(" -'sill': for gaussian, spherical and exponential models (default 1)" << "\n"); 18 _printf0_(" -'slope': for power model (default 1)" << "\n"); 19 _printf0_(" -'power': for power model (default 1)" << "\n"); 20 _printf0_(" -'searchradius': search radius for each prediction (default is observations span)" << "\n"); 21 _printf0_(" -'boxlength': minimum length of quadtree boxes (useful to decrease the number of observations)" << "\n"); 22 _printf0_(" -'maxdata': minimum number of observations for a prediction (default is 50)" << "\n"); 23 _printf0_(" -'mindata': maximum number of observations for a prediction (default is 1)" << "\n"); 24 _printf0_(" -'maxtrimming': maximum trimming value (default is -1.e+21)" << "\n"); 25 _printf0_(" -'mintrimming': minimum trimming value (default is +1.e+21)" << "\n"); 26 _printf0_(" -'minspacing': minimum distance between observation (default is 0.01)" << "\n"); 27 _printf0_(" -'numthreads': number of threads, default is "<<num << "\n"); 28 _printf0_("" << "\n"); 29 29 }/*}}}*/ 30 30 WRAPPER(Kriging){ -
issm/trunk-jpl/src/wrappers/Ll2xy/Ll2xy.cpp
r15099 r15100 5 5 6 6 void Ll2xyUsage(void){/*{{{*/ 7 _p printString_("Ll2xy - lat/long to x/y coordinate transformation module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module transforms lat/long to x/y coordinates." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" [x,y]=Ll2xy(lat,lon,sgn,'param name',param,...);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" lat latitude coordinates (double vector)" << "\n");15 _p printString_(" lon longitude coordinates (double vector)" << "\n");16 _p printString_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n");17 _p printString_("" << "\n");18 _p printString_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n");19 _p printString_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n");20 _p printString_("" << "\n");21 _p printString_(" x x coordinates (double vector)" << "\n");22 _p printString_(" y y coordinates (double vector)" << "\n");23 _p printString_("" << "\n");24 _p printString_(" Examples:" << "\n");25 _p printString_(" [x,y]=Ll2xy(lat,lon, 1);" << "\n");26 _p printString_(" [x,y]=Ll2xy(lat,lon, 1,'central_meridian',45,'standard_parallel',70);" << "\n");27 _p printString_(" [x,y]=Ll2xy(lat,lon,-1,'central_meridian', 0,'standard_parallel',71);" << "\n");28 _p printString_("" << "\n");7 _printf0_("Ll2xy - lat/long to x/y coordinate transformation module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module transforms lat/long to x/y coordinates." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" [x,y]=Ll2xy(lat,lon,sgn,'param name',param,...);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" lat latitude coordinates (double vector)" << "\n"); 15 _printf0_(" lon longitude coordinates (double vector)" << "\n"); 16 _printf0_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n"); 17 _printf0_("" << "\n"); 18 _printf0_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n"); 19 _printf0_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n"); 20 _printf0_("" << "\n"); 21 _printf0_(" x x coordinates (double vector)" << "\n"); 22 _printf0_(" y y coordinates (double vector)" << "\n"); 23 _printf0_("" << "\n"); 24 _printf0_(" Examples:" << "\n"); 25 _printf0_(" [x,y]=Ll2xy(lat,lon, 1);" << "\n"); 26 _printf0_(" [x,y]=Ll2xy(lat,lon, 1,'central_meridian',45,'standard_parallel',70);" << "\n"); 27 _printf0_(" [x,y]=Ll2xy(lat,lon,-1,'central_meridian', 0,'standard_parallel',71);" << "\n"); 28 _printf0_("" << "\n"); 29 29 }/*}}}*/ 30 30 WRAPPER(Ll2xy){ … … 64 64 if(options->GetOption("central_meridian") || options->GetOption("standard_parallel")){ 65 65 options->Get(&cm,"central_meridian"); 66 if (verbose) _print String_(" cm=" << cm << "\n");66 if (verbose) _printf_(" cm=" << cm << "\n"); 67 67 options->Get(&sp,"standard_parallel"); 68 if (verbose) _print String_(" sp=" << sp << "\n");68 if (verbose) _printf_(" sp=" << sp << "\n"); 69 69 } 70 70 71 71 /*some checks*/ 72 if (verbose) _print String_("Checking inputs:" << "\n");72 if (verbose) _printf_("Checking inputs:" << "\n"); 73 73 if (nlat != nlon){_error_("Must have same number of lat[" << nlat << "] and lon[" << nlon << "] coordinates.");} 74 74 else ncoord=nlat; -
issm/trunk-jpl/src/wrappers/MeshPartition/MeshPartition.cpp
r15099 r15100 6 6 7 7 void MeshPartitionUsage(void){/*{{{*/ 8 _print String_(" usage:" << "\n");9 _print String_(" [element_partitioning,node_partitioning]=MeshPartition(md.mesh,numpartitions)");10 _print String_(" where:" << "\n");11 _print String_(" element_partitioning is a vector of partitioning area numbers, for every element." << "\n");12 _print String_(" node_partitioning is a vector of partitioning area numbers, for every node." << "\n");13 _print String_("" << "\n");8 _printf_(" usage:" << "\n"); 9 _printf_(" [element_partitioning,node_partitioning]=MeshPartition(md.mesh,numpartitions)"); 10 _printf_(" where:" << "\n"); 11 _printf_(" element_partitioning is a vector of partitioning area numbers, for every element." << "\n"); 12 _printf_(" node_partitioning is a vector of partitioning area numbers, for every node." << "\n"); 13 _printf_("" << "\n"); 14 14 }/*}}}*/ 15 15 WRAPPER(MeshPartition){ -
issm/trunk-jpl/src/wrappers/MeshProfileIntersection/MeshProfileIntersection.cpp
r15099 r15100 19 19 20 20 void MeshProfileIntersectionUsage(void){/*{{{*/ 21 _print String_(" usage:" << "\n");22 _print String_(" [segments]=MeshProfileIntersection(index,x,y,filename);" << "\n");23 _print String_(" where:" << "\n");24 _print String_(" input:" << "\n");25 _print String_(" index,x,y is a triangulation" << "\n");26 _print String_(" filename: name of Argus style .exp file containing the segments (can be groups of disconnected segments)" << "\n");27 _print String_(" output:" << "\n");28 _print String_(" segments: array made of x1,y1,x2,y2,element_id lines (x1,y1) and (x2,y2) are segment extremities for a segment " << "\n");29 _print String_(" belonging to the elemnt_id element. there are as many lines in segments as there are segments intersecting the " << "\n");30 _print String_(" mesh." << "\n");21 _printf_(" usage:" << "\n"); 22 _printf_(" [segments]=MeshProfileIntersection(index,x,y,filename);" << "\n"); 23 _printf_(" where:" << "\n"); 24 _printf_(" input:" << "\n"); 25 _printf_(" index,x,y is a triangulation" << "\n"); 26 _printf_(" filename: name of Argus style .exp file containing the segments (can be groups of disconnected segments)" << "\n"); 27 _printf_(" output:" << "\n"); 28 _printf_(" segments: array made of x1,y1,x2,y2,element_id lines (x1,y1) and (x2,y2) are segment extremities for a segment " << "\n"); 29 _printf_(" belonging to the elemnt_id element. there are as many lines in segments as there are segments intersecting the " << "\n"); 30 _printf_(" mesh." << "\n"); 31 31 }/*}}}*/ 32 32 WRAPPER(MeshProfileIntersection){ -
issm/trunk-jpl/src/wrappers/NodeConnectivity/NodeConnectivity.cpp
r15099 r15100 6 6 7 7 void NodeConnectivityUsage(void){/*{{{*/ 8 _p printString_("" << "\n");9 _p printString_(" usage: connectivity = " << __FUNCT__ << "(elements, numnodes);" << "\n");10 _p printString_("" << "\n");8 _printf0_("" << "\n"); 9 _printf0_(" usage: connectivity = " << __FUNCT__ << "(elements, numnodes);" << "\n"); 10 _printf0_("" << "\n"); 11 11 }/*}}}*/ 12 12 WRAPPER(NodeConnectivity){ -
issm/trunk-jpl/src/wrappers/PointCloudFindNeighbors/PointCloudFindNeighbors.cpp
r15099 r15100 6 6 7 7 void PointCloudFindNeighborsUsage(void){/*{{{*/ 8 _print String_(" usage:" << "\n");9 _print String_(" [flags]=PointCloudFindNeighbors(x,y,mindistance,multithread);" << "\n");10 _print String_(" where:" << "\n");11 _print String_(" x,y: list of points." << "\n");12 _print String_(" mindistance: minimum distance that should exist between points in the cloud." << "\n");13 _print String_(" multithread: run multithreaded or not. with multithreads, flags can get 1 and 2 values in duplicates." << "\n");14 _print String_(" flags: array of flags (flag==1 means point is within mindistance of another point)" << "\n");15 _print String_("" << "\n");8 _printf_(" usage:" << "\n"); 9 _printf_(" [flags]=PointCloudFindNeighbors(x,y,mindistance,multithread);" << "\n"); 10 _printf_(" where:" << "\n"); 11 _printf_(" x,y: list of points." << "\n"); 12 _printf_(" mindistance: minimum distance that should exist between points in the cloud." << "\n"); 13 _printf_(" multithread: run multithreaded or not. with multithreads, flags can get 1 and 2 values in duplicates." << "\n"); 14 _printf_(" flags: array of flags (flag==1 means point is within mindistance of another point)" << "\n"); 15 _printf_("" << "\n"); 16 16 }/*}}}*/ 17 17 WRAPPER(PointCloudFindNeighbors){ -
issm/trunk-jpl/src/wrappers/PropagateFlagsFromConnectivity/PropagateFlagsFromConnectivity.cpp
r15099 r15100 6 6 7 7 void PropagateFlagsFromConnectivityUsage(void) {/*{{{*/ 8 _print String_("" << "\n");9 _print String_(" usage: [pool] = " << __FUNCT__ << "(connectivity,pool,index,flags);" << "\n");;10 _print String_("" << "\n");8 _printf_("" << "\n"); 9 _printf_(" usage: [pool] = " << __FUNCT__ << "(connectivity,pool,index,flags);" << "\n");; 10 _printf_("" << "\n"); 11 11 }/*}}}*/ 12 12 WRAPPER(PropagateFlagsFromConnectivity){ -
issm/trunk-jpl/src/wrappers/Shp2Exp/Shp2Exp.cpp
r15099 r15100 12 12 13 13 void Shp2ExpUsage(void){/*{{{*/ 14 _p printString_("Shp2Exp - shp to exp file conversion module:" << "\n");15 _p printString_("" << "\n");16 _p printString_(" This module converts a file from shp to exp format." << "\n");17 _p printString_("" << "\n");18 _p printString_(" Usage:" << "\n");19 _p printString_(" [ret]=Shp2Exp(filshp,filexp,sgn,'param name',param,...);" << "\n");20 _p printString_("" << "\n");21 _p printString_(" filshp file name of shp file to be read (char, extension optional)" << "\n");22 _p printString_(" filexp file name of exp file to be written (char)" << "\n");23 _p printString_("" << "\n");24 _p printString_(" ret return code (non-zero for warning)" << "\n");25 _p printString_("" << "\n");26 _p printString_(" Examples:" << "\n");27 _p printString_(" [ret]=Shp2Exp('file.shp','file.exp');" << "\n");28 _p printString_("" << "\n");14 _printf0_("Shp2Exp - shp to exp file conversion module:" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" This module converts a file from shp to exp format." << "\n"); 17 _printf0_("" << "\n"); 18 _printf0_(" Usage:" << "\n"); 19 _printf0_(" [ret]=Shp2Exp(filshp,filexp,sgn,'param name',param,...);" << "\n"); 20 _printf0_("" << "\n"); 21 _printf0_(" filshp file name of shp file to be read (char, extension optional)" << "\n"); 22 _printf0_(" filexp file name of exp file to be written (char)" << "\n"); 23 _printf0_("" << "\n"); 24 _printf0_(" ret return code (non-zero for warning)" << "\n"); 25 _printf0_("" << "\n"); 26 _printf0_(" Examples:" << "\n"); 27 _printf0_(" [ret]=Shp2Exp('file.shp','file.exp');" << "\n"); 28 _printf0_("" << "\n"); 29 29 }/*}}}*/ 30 30 WRAPPER(Shp2Exp){ -
issm/trunk-jpl/src/wrappers/Shp2Kml/Shp2Kml.cpp
r15099 r15100 12 12 13 13 void Shp2KmlUsage(void){/*{{{*/ 14 _p printString_("Shp2Kml - shp to kml file conversion module:" << "\n");15 _p printString_("" << "\n");16 _p printString_(" This module converts a file from shp to kml format." << "\n");17 _p printString_("" << "\n");18 _p printString_(" Usage:" << "\n");19 _p printString_(" [ret]=Shp2Kml(filshp,filkml,sgn,'param name',param,...);" << "\n");20 _p printString_("" << "\n");21 _p printString_(" filshp file name of shp file to be read (char, extension optional)" << "\n");22 _p printString_(" filkml file name of kml file to be written (char)" << "\n");23 _p printString_(" sgn sign for hemisphere (double, +1 (north) -1 (south) or 0 (no translation))" << "\n");24 _p printString_("" << "\n");25 _p printString_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n");26 _p printString_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n");27 _p printString_("" << "\n");28 _p printString_(" ret return code (non-zero for warning)" << "\n");29 _p printString_("" << "\n");30 _p printString_(" Examples:" << "\n");31 _p printString_(" [ret]=Shp2Kml('file.shp','file.kml', 0);" << "\n");32 _p printString_(" [ret]=Shp2Kml('file.shp','file.kml', 1,'central_meridian',45,'standard_parallel',70);" << "\n");33 _p printString_(" [ret]=Shp2Kml('file.shp','file.kml',-1,'central_meridian', 0,'standard_parallel',71);" << "\n");34 _p printString_("" << "\n");14 _printf0_("Shp2Kml - shp to kml file conversion module:" << "\n"); 15 _printf0_("" << "\n"); 16 _printf0_(" This module converts a file from shp to kml format." << "\n"); 17 _printf0_("" << "\n"); 18 _printf0_(" Usage:" << "\n"); 19 _printf0_(" [ret]=Shp2Kml(filshp,filkml,sgn,'param name',param,...);" << "\n"); 20 _printf0_("" << "\n"); 21 _printf0_(" filshp file name of shp file to be read (char, extension optional)" << "\n"); 22 _printf0_(" filkml file name of kml file to be written (char)" << "\n"); 23 _printf0_(" sgn sign for hemisphere (double, +1 (north) -1 (south) or 0 (no translation))" << "\n"); 24 _printf0_("" << "\n"); 25 _printf0_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n"); 26 _printf0_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n"); 27 _printf0_("" << "\n"); 28 _printf0_(" ret return code (non-zero for warning)" << "\n"); 29 _printf0_("" << "\n"); 30 _printf0_(" Examples:" << "\n"); 31 _printf0_(" [ret]=Shp2Kml('file.shp','file.kml', 0);" << "\n"); 32 _printf0_(" [ret]=Shp2Kml('file.shp','file.kml', 1,'central_meridian',45,'standard_parallel',70);" << "\n"); 33 _printf0_(" [ret]=Shp2Kml('file.shp','file.kml',-1,'central_meridian', 0,'standard_parallel',71);" << "\n"); 34 _printf0_("" << "\n"); 35 35 }/*}}}*/ 36 36 WRAPPER(Shp2Kml){ … … 71 71 if (options->GetOption("central_meridian") || options->GetOption("standard_parallel")) { 72 72 options->Get(&cm,"central_meridian"); 73 if (verbose) _print String_(" cm=" << cm << "\n");73 if (verbose) _printf_(" cm=" << cm << "\n"); 74 74 options->Get(&sp,"standard_parallel"); 75 if (verbose) _print String_(" sp=" << sp << "\n");75 if (verbose) _printf_(" sp=" << sp << "\n"); 76 76 } 77 77 -
issm/trunk-jpl/src/wrappers/StringToEnum/StringToEnum.cpp
r15099 r15100 6 6 7 7 void StringToEnumUsage(void){/*{{{*/ 8 _p printString_("" << "\n");9 _p printString_(" usage: " << __FUNCT__ << "enum = StringToEnum(string);" << "\n");10 _p printString_("" << "\n");8 _printf0_("" << "\n"); 9 _printf0_(" usage: " << __FUNCT__ << "enum = StringToEnum(string);" << "\n"); 10 _printf0_("" << "\n"); 11 11 }/*}}}*/ 12 12 WRAPPER(StringToEnum){ -
issm/trunk-jpl/src/wrappers/TriMesh/TriMesh.cpp
r15099 r15100 6 6 7 7 void TriMeshUsage(void){/*{{{*/ 8 _print String_("" << "\n");9 _print String_(" usage: [index,x,y,segments,segmentmarkers]=TriMesh(domainoutlinefilename,rifts,area) " << "\n");10 _print String_(" where: index,x,y defines a triangulation, segments is an array made " << "\n");11 _print String_(" of exterior segments to the mesh domain outline, segmentmarkers is an array flagging each segment, " << "\n");12 _print String_(" outlinefilename an Argus domain outline file, " << "\n");13 _print String_(" area is the maximum area desired for any element of the resulting mesh, " << "\n");14 _print String_("" << "\n");8 _printf_("" << "\n"); 9 _printf_(" usage: [index,x,y,segments,segmentmarkers]=TriMesh(domainoutlinefilename,rifts,area) " << "\n"); 10 _printf_(" where: index,x,y defines a triangulation, segments is an array made " << "\n"); 11 _printf_(" of exterior segments to the mesh domain outline, segmentmarkers is an array flagging each segment, " << "\n"); 12 _printf_(" outlinefilename an Argus domain outline file, " << "\n"); 13 _printf_(" area is the maximum area desired for any element of the resulting mesh, " << "\n"); 14 _printf_("" << "\n"); 15 15 }/*}}}*/ 16 16 WRAPPER(TriMesh){ -
issm/trunk-jpl/src/wrappers/TriMeshProcessRifts/TriMeshProcessRifts.cpp
r15099 r15100 6 6 7 7 void TriMeshProcessRiftsUsage(void){/*{{{*/ 8 _print String_("" << "\n");9 _print String_(" usage: [index2,x2,y2,segments2,segmentmarkers2,rifts2]=TriMeshProcessrifts(index1,x1,y1,segments1,segmentmarkers1) " << "\n");10 _print String_(" where: (index1,x1,y1,segments1,segmentmarkers1) is an initial triangulation." << "\n");11 _print String_(" index2,x2,y2,segments2,segmentmarkers2,rifts2 is the resulting triangulation where rifts have been processed." << "\n");8 _printf_("" << "\n"); 9 _printf_(" usage: [index2,x2,y2,segments2,segmentmarkers2,rifts2]=TriMeshProcessrifts(index1,x1,y1,segments1,segmentmarkers1) " << "\n"); 10 _printf_(" where: (index1,x1,y1,segments1,segmentmarkers1) is an initial triangulation." << "\n"); 11 _printf_(" index2,x2,y2,segments2,segmentmarkers2,rifts2 is the resulting triangulation where rifts have been processed." << "\n"); 12 12 }/*}}}*/ 13 13 WRAPPER(TriMeshProcessRifts){ -
issm/trunk-jpl/src/wrappers/TriaSearch/TriaSearch.cpp
r15099 r15100 5 5 6 6 void TriaSearchUsage(void){/*{{{*/ 7 _p printString_("TriaSearch- find triangle holding a point (x0,y0) in a mesh" << "\n");8 _p printString_("" << "\n");9 _p printString_(" Usage:" << "\n");10 _p printString_(" tria=TriaSearch(index,x,y,x0,y0);" << "\n");11 _p printString_(" index,x,y: mesh triangulatrion" << "\n");12 _p printString_(" x0,y0: coordinates of the point for which we are trying to find a triangle" << "\n");13 _p printString_(" x0,y0 can be an array of points" << "\n");14 _p printString_("" << "\n");7 _printf0_("TriaSearch- find triangle holding a point (x0,y0) in a mesh" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" Usage:" << "\n"); 10 _printf0_(" tria=TriaSearch(index,x,y,x0,y0);" << "\n"); 11 _printf0_(" index,x,y: mesh triangulatrion" << "\n"); 12 _printf0_(" x0,y0: coordinates of the point for which we are trying to find a triangle" << "\n"); 13 _printf0_(" x0,y0 can be an array of points" << "\n"); 14 _printf0_("" << "\n"); 15 15 }/*}}}*/ 16 16 WRAPPER(TriaSearch){ -
issm/trunk-jpl/src/wrappers/Xy2ll/Xy2ll.cpp
r15099 r15100 5 5 6 6 void Xy2llUsage(void){/*{{{*/ 7 _p printString_("Xy2ll - x/y to lat/long coordinate transformation module:" << "\n");8 _p printString_("" << "\n");9 _p printString_(" This module transforms x/y to lat/long coordinates." << "\n");10 _p printString_("" << "\n");11 _p printString_(" Usage:" << "\n");12 _p printString_(" [lat,lon]=Xy2ll(x,y,sgn,'param name',param,...);" << "\n");13 _p printString_("" << "\n");14 _p printString_(" x x coordinates (double vector)" << "\n");15 _p printString_(" y y coordinates (double vector)" << "\n");16 _p printString_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n");17 _p printString_("" << "\n");18 _p printString_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n");19 _p printString_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n");20 _p printString_("" << "\n");21 _p printString_(" lat latitude coordinates (double vector)" << "\n");22 _p printString_(" lon longitude coordinates (double vector)" << "\n");23 _p printString_("" << "\n");24 _p printString_(" Examples:" << "\n");25 _p printString_(" [lat,lon]=Xy2ll(x,y, 1);" << "\n");26 _p printString_(" [lat,lon]=Xy2ll(x,y, 1,'central_meridian',45,'standard_parallel',70);" << "\n");27 _p printString_(" [lat,lon]=Xy2ll(x,y,-1,'central_meridian', 0,'standard_parallel',71);" << "\n");28 _p printString_("" << "\n");7 _printf0_("Xy2ll - x/y to lat/long coordinate transformation module:" << "\n"); 8 _printf0_("" << "\n"); 9 _printf0_(" This module transforms x/y to lat/long coordinates." << "\n"); 10 _printf0_("" << "\n"); 11 _printf0_(" Usage:" << "\n"); 12 _printf0_(" [lat,lon]=Xy2ll(x,y,sgn,'param name',param,...);" << "\n"); 13 _printf0_("" << "\n"); 14 _printf0_(" x x coordinates (double vector)" << "\n"); 15 _printf0_(" y y coordinates (double vector)" << "\n"); 16 _printf0_(" sgn sign for hemisphere (double, +1 (north) or -1 (south))" << "\n"); 17 _printf0_("" << "\n"); 18 _printf0_(" central_meridian central meridian (double, optional, but must specify with sp)" << "\n"); 19 _printf0_(" standard_parallel standard parallel (double, optional, but must specify with cm)" << "\n"); 20 _printf0_("" << "\n"); 21 _printf0_(" lat latitude coordinates (double vector)" << "\n"); 22 _printf0_(" lon longitude coordinates (double vector)" << "\n"); 23 _printf0_("" << "\n"); 24 _printf0_(" Examples:" << "\n"); 25 _printf0_(" [lat,lon]=Xy2ll(x,y, 1);" << "\n"); 26 _printf0_(" [lat,lon]=Xy2ll(x,y, 1,'central_meridian',45,'standard_parallel',70);" << "\n"); 27 _printf0_(" [lat,lon]=Xy2ll(x,y,-1,'central_meridian', 0,'standard_parallel',71);" << "\n"); 28 _printf0_("" << "\n"); 29 29 }/*}}}*/ 30 30 WRAPPER(Xy2ll){ … … 63 63 if (options->GetOption("central_meridian") || options->GetOption("standard_parallel")) { 64 64 options->Get(&cm,"central_meridian"); 65 if (verbose) _print String_(" cm=" << cm << "\n");65 if (verbose) _printf_(" cm=" << cm << "\n"); 66 66 options->Get(&sp,"standard_parallel"); 67 if (verbose) _print String_(" sp=" << sp << "\n");67 if (verbose) _printf_(" sp=" << sp << "\n"); 68 68 } 69 69 … … 79 79 80 80 /* Run core computations: */ 81 if (verbose) _print String_("Calling core:" << "\n");81 if (verbose) _printf_("Calling core:" << "\n"); 82 82 if (options->GetOption("central_meridian") && options->GetOption("standard_parallel")) 83 83 iret=Xy2llx(lat,lon,x,y,ncoord,sgn,cm,sp); -
issm/trunk-jpl/src/wrappers/matlab/io/FetchMatlabData.cpp
r15099 r15100 38 38 else{ 39 39 if(!mxIsClass(dataref,"double") && !mxIsClass(dataref,"single")){ 40 _print String_("Warning: converting matlab data from '" << mxGetClassName(dataref) << "' to 'double'" << "\n");40 _printf_("Warning: converting matlab data from '" << mxGetClassName(dataref) << "' to 'double'" << "\n"); 41 41 } 42 42 /*Convert matlab matrix to double* matrix: */ … … 85 85 else{ 86 86 if(!mxIsClass(dataref,"double") && !mxIsClass(dataref,"single")){ 87 _print String_("Warning: converting matlab data from '" << mxGetClassName(dataref) << "' to 'double'" << "\n");87 _printf_("Warning: converting matlab data from '" << mxGetClassName(dataref) << "' to 'double'" << "\n"); 88 88 } 89 89 /*Convert matlab n-dim array to double* matrix: */ … … 132 132 else{ 133 133 if(!mxIsClass(dataref,"double") && !mxIsClass(dataref,"single")){ 134 _print String_("Warning: converting matlab data from '" << mxGetClassName(dataref) << "' to 'double'" << "\n");134 _printf_("Warning: converting matlab data from '" << mxGetClassName(dataref) << "' to 'double'" << "\n"); 135 135 } 136 136 /*Convert matlab matrix to double* matrix: */ -
issm/trunk-jpl/src/wrappers/matlab/io/OptionParse.cpp
r15099 r15100 190 190 option=(Option*)OptionCellParse(name,prhs); 191 191 else { 192 _p printString_(" Converting value of option \"" << name << "\" from unrecognized class \"" << mxGetClassName(prhs[0]) << "\" to class \"" << "struct" << "\"." << "\n");192 _printf0_(" Converting value of option \"" << name << "\" from unrecognized class \"" << mxGetClassName(prhs[0]) << "\" to class \"" << "struct" << "\"." << "\n"); 193 193 if (!mexCallMATLAB(1,lhs,1,(mxArray**)prhs,"struct")) { 194 194 option=(Option*)OptionStructParse(name,(const mxArray**)lhs); -
issm/trunk-jpl/src/wrappers/python/io/FetchPythonData.cpp
r15099 r15100 728 728 if(i+1 == nrhs) _error_("Argument " << i+2 << " must exist and be value of option \"" << name << "\"."); 729 729 730 _p printString_("FetchData for Options not implemented yet, ignoring option \"" << name << "\"!" << "\n");730 _printf0_("FetchData for Options not implemented yet, ignoring option \"" << name << "\"!" << "\n"); 731 731 732 732 // option=(Option*)OptionParse(name,&PyTuple_GetItem(py_tuple,(Py_ssize_t)(i+1)));
Note:
See TracChangeset
for help on using the changeset viewer.