Changeset 15104
- Timestamp:
- 05/24/13 19:11:47 (12 years ago)
- Location:
- issm/trunk-jpl/src/c
- Files:
-
- 170 edited
Legend:
- Unmodified
- Added
- Removed
-
issm/trunk-jpl/src/c/analyses/DakotaSpawnCore.cpp
r15100 r15104 71 71 72 72 /*Determine solution sequence: */ 73 if(VerboseQmu()) _printf0_("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()) _printf0_("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
r15100 r15104 13 13 Nodes *nodes = NULL; 14 14 15 if(VerboseSolution()) _printf0_(" 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
r15100 r15104 49 49 if(!(num_dependents*num_independents)) return; 50 50 51 if(VerboseAutodiff())_printf0_(" 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 _printf0_(" ADOLC statistics: " << "\n");288 _printf0_(" ADOLC statistics: \n"); 289 289 _printf0_(" "<<setw(45)<<left<<"Number of independents: " <<tape_stats[0] << "\n"); 290 290 _printf0_(" "<<setw(45)<<left<<"Number of dependents: " <<tape_stats[1] << "\n"); … … 294 294 _printf0_(" "<<setw(45)<<left<<"Total number of operations recorded: " <<tape_stats[5] << "\n"); 295 295 } 296 if(VerboseAutodiff())_printf0_(" end AD core " << "\n");296 if(VerboseAutodiff())_printf0_(" end AD core\n"); 297 297 298 298 /*Free resources: */ -
issm/trunk-jpl/src/c/analyses/adjointbalancethickness_core.cpp
r15100 r15104 19 19 20 20 /*compute thickness */ 21 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 22 22 23 23 /*Compute velocities*/ 24 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 21 21 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 22 22 23 if(VerboseSolution()) _printf0_("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()) _printf0_(" 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
r15100 r15104 18 18 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 19 19 20 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 66 66 67 67 /*Launch once a complete solution to set up all inputs*/ 68 if(VerboseControl()) _printf0_(" preparing initial solution " << "\n");68 if(VerboseControl()) _printf0_(" preparing initial solution\n"); 69 69 if(isstokes) solutioncore(femmodel); 70 70 … … 88 88 if(solution_type==SteadystateSolutionEnum) solutioncore(femmodel); 89 89 90 if(VerboseControl()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" preparing final solution " << "\n");110 if(VerboseControl()) _printf0_(" preparing final solution\n"); 111 111 femmodel->parameters->SetParam(true,SaveResultsEnum); 112 112 solutioncore(femmodel); -
issm/trunk-jpl/src/c/analyses/controltao_core.cpp
r15100 r15104 54 54 /*Initialize TAO*/ 55 55 TaoCreate(IssmComm::GetComm(),&tao); 56 if(VerboseControl()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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) _printf0_("Iter Function Residual | List of contributions " << "\n");169 if(its==0) _printf0_("-----------------------------------+----------------------- " << "\n");168 if(its==0) _printf0_("Iter Function Residual | List of contributions\n"); 169 if(its==0) _printf0_("-----------------------------------+-----------------------\n"); 170 170 _printf0_(setw(4)<<its<<" "<<setw(12)<<setprecision(7)<<f<<" "<<setw(12)<<setprecision(7)<<gnorm<<" | "); 171 171 user->J[its]=f; … … 176 176 _printf0_(" "<<setw(12)<<setprecision(7)<<f); 177 177 } 178 _printf0_(" " << "\n");178 _printf0_("\n"); 179 179 180 180 /*Clean-up and return*/ -
issm/trunk-jpl/src/c/analyses/diagnostic_core.cpp
r15100 r15104 58 58 if(ishutter){ 59 59 60 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 18 18 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 19 19 20 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 26 26 femmodel->parameters->FindParam(&configuration_type,ConfigurationTypeEnum); 27 27 28 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 20 20 21 21 /*Compute gradient*/ 22 if(VerboseControl()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 58 58 59 59 if (hydrology_model==HydrologyshreveEnum){ 60 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" computing water transfer " << "\n");84 if(VerboseSolution()) _printf0_(" computing water transfer\n"); 85 85 86 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 32 32 33 33 if(issmbgradients){ 34 if(VerboseSolution)_printf_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 63 63 #endif 64 64 65 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_("\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()) _printf0_("\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()) _printf0_(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()) _printf0_(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
r15100 r15104 18 18 femmodel->parameters->FindParam(&save_results,SaveResultsEnum); 19 19 20 if(VerboseSolution()) _printf0_("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()) _printf0_("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
r15100 r15104 25 25 } 26 26 27 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 85 85 femmodel->parameters->SetParam(step,StepEnum); 86 86 87 if(VerboseSolution()) _printf0_("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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" computing new thickness " << "\n");118 if(VerboseSolution()) _printf0_(" computing new thickness\n"); 119 119 prognostic_core(femmodel); 120 if(VerboseSolution()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 15 15 void BamgVertex::Echo(void){ 16 16 17 _printf_("Vertex: " << "\n");17 _printf_("Vertex:\n"); 18 18 _printf_(" integer coordinates i.x: " << i.x << ", i.y: " << i.y << "\n"); 19 19 _printf_(" Euclidean coordinates r.x: " << r.x << ", r.y: " << r.y << "\n"); -
issm/trunk-jpl/src/c/bamg/Edge.cpp
r15100 r15104 27 27 /*FUNCTION Edge::Echo {{{*/ 28 28 void Edge::Echo(void){ 29 _printf_("Edge: " << "\n");29 _printf_("Edge:\n"); 30 30 _printf_(" pointers towards two vertices: " << v[0] << " " << v[1] << "\n"); 31 31 _printf_(" ReferenceNumber = " << ReferenceNumber << "\n"); -
issm/trunk-jpl/src/c/bamg/EigenMetric.cpp
r15100 r15104 114 114 void EigenMetric::Echo(void){ 115 115 116 _printf_("EigenMetric: " << "\n");116 _printf_("EigenMetric:\n"); 117 117 _printf_(" lambda1: " << lambda1 << "\n"); 118 118 _printf_(" lambda2: " << lambda2 << "\n"); -
issm/trunk-jpl/src/c/bamg/Geometry.cpp
r15100 r15104 80 80 //Vertices 81 81 if (bamggeom->Vertices){ 82 if(verbose>5) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" processing MaxCornerAngle " << "\n");200 if(verbose>5) _printf_(" processing MaxCornerAngle\n"); 201 201 MaxCornerAngle=bamgopts->MaxCornerAngle*Pi/180; 202 202 } … … 237 237 //RequiredVertices 238 238 if(bamggeom->RequiredVertices){ 239 if(verbose>5) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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 _printf_("Geometry: " << "\n");404 _printf_("Geometry:\n"); 405 405 _printf_(" nbv (number of vertices) : " << nbv << "\n"); 406 406 _printf_(" nbe (number of edges) : " << nbe << "\n"); … … 412 412 _printf_(" subdomains: " << subdomains << "\n"); 413 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");414 _printf_(" pmin (x,y): (" << pmin.x << " " << pmin.y << ")\n"); 415 _printf_(" pmax (x,y): (" << pmax.x << " " << pmax.y << ")\n"); 416 416 _printf_(" coefIcoor: " << coefIcoor << "\n"); 417 417 _printf_(" MaxCornerAngle: " << MaxCornerAngle << "\n"); … … 526 526 _printf_("reference numbers: " << v->ReferenceNumber << " " << vertices[i].ReferenceNumber << "\n"); 527 527 _printf_("Id: " << i+1 << "\n"); 528 _printf_("Coords: ["<<v->r.x<<" "<<v->r.y<<"] ["<<vertices[i].r.x<<" "<<vertices[i].r.y<<"] " << "\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 _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");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 _printf_("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 _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");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/Mesh.cpp
r15100 r15104 31 31 if(bamggeom->Edges==NULL) { 32 32 /*Recreate geometry if needed*/ 33 _printf_("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(); … … 281 281 282 282 //Vertices 283 if (verbose) _printf_("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) _printf_("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) _printf_("Building Geometry " << "\n");313 if (verbose) _printf_("Building Geometry\n"); 314 314 BuildGeometryFromMesh(); 315 if (verbose) _printf_("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 _printf_("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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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()); … … 1315 1315 1316 1316 //display info 1317 if (verbose>1) _printf_(" 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 _printf_("The edge (" << GetId(triangles[i][VerticesOfTriangularEdge[j][0]]) << "," << GetId(triangles[i][VerticesOfTriangularEdge[j][1]]) << ") belongs to more than 2 triangles (" << k << ") " << "\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 1378 _printf_("Edge " << j << " of triangle " << i << "\n"); 1379 1379 _printf_("Edge " << (-st[k]+2)%3 << " of triangle " << (-st[k]+2)/3 << "\n"); … … 1390 1390 //display info 1391 1391 if(verbose>5) { 1392 _printf_(" info on Mesh: " << "\n");1392 _printf_(" info on Mesh:\n"); 1393 1393 _printf_(" - number of vertices = " << nbv << "\n"); 1394 1394 _printf_(" - number of triangles = " << nbt << "\n"); … … 1452 1452 edges[add].ReferenceNumber=edgessave[i].ReferenceNumber; 1453 1453 edges[add].GeomEdgeHook=edgessave[i].GeomEdgeHook; // HACK to get required edges 1454 _printf_("oh no... " << "\n");1454 _printf_("oh no...\n"); 1455 1455 } 1456 1456 else … … 1791 1791 //display infos 1792 1792 if(verbose>1) { 1793 _printf_(" 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 … … 1867 1867 //skip constant field 1868 1868 if (sdelta < 1.0e-10*Max(absmax,1e-20)){ 1869 _printf_(" 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 _printf_(" 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 … … 2080 2080 //skip constant field 2081 2081 if (sdelta < 1.0e-10*Max(absmax,1e-20) ){ 2082 if (verbose>2) _printf_(" Solution " << nusol << " is constant, skipping... " << "\n");2082 if (verbose>2) _printf_(" Solution " << nusol << " is constant, skipping...\n"); 2083 2083 continue; 2084 2084 } … … 2375 2375 } 2376 2376 } 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");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 _printf_("Mesh Echo: " << "\n");2401 _printf_("Mesh Echo:\n"); 2402 2402 _printf_(" nbv = " << nbv << "\n"); 2403 2403 _printf_(" nbt = " << nbt << "\n"); 2404 2404 _printf_(" nbe = " << nbe << "\n"); 2405 2405 _printf_(" nbq = " << nbq << "\n"); 2406 _printf_(" index: " << "\n");2406 _printf_(" index:\n"); 2407 2407 for (i=0;i<nbt;i++){ 2408 2408 _printf_(" " << setw(4) << i+1 << ": [" … … 2411 2411 << setw(4) << (((BamgVertex *)triangles[i](0))?GetId(triangles[i][2])+1:0) << "]"); 2412 2412 } 2413 _printf_(" coordinates: " << "\n");2413 _printf_(" coordinates:\n"); 2414 2414 for (i=0;i<nbv;i++){ 2415 _printf_(" " << 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 … … 2468 2468 2469 2469 if (verbose >2){ 2470 if (OutSide) _printf_(" Find all external sub-domain " << "\n");2471 else _printf_(" 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]; … … 2692 2692 2693 2693 if (inew < nbsubdomains) { 2694 if (verbose>5) _printf_("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) _printf_(" 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) _printf_(" 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++) { … … 2952 2952 2953 2953 //display info if required 2954 if (verbose>5) _printf_(" 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 … … 3055 3055 if (!e[i]){ 3056 3056 kk++; 3057 if(kk<10) _printf_("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 } … … 3072 3072 3073 3073 if (costheta >1) { 3074 if (verbose>5) _printf_(" do nothing: costheta > 1 " << "\n");3074 if (verbose>5) _printf_(" do nothing: costheta > 1\n"); 3075 3075 } 3076 3076 … … 3223 3223 /*First, insert old points if requested*/ 3224 3224 if (KeepVertices && (&Bh != this) && (nbv+Bh.nbv< maxnbv)){ 3225 if (verbose>5) _printf_(" 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) _printf_(" 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) _printf_(" 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 _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");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 3536 _printf_(" - number of all edges = " << edge4->nb() << "\n"); 3537 3537 _printf_(" - Euler number 1 - nb of holes = " << nbt-edge4->nb()+nbv << "\n"); … … 3555 3555 } 3556 3556 else if (k==10){ 3557 _printf_("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 _printf_("ReconstructExistingMesh error message: problem with the edge number " << i+1 << ": [" << GetId(edges[i][0])+1 << " " << GetId(edges[i][1])+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 3746 _printf_("This edge is on geometrical edge number " << Gh.GetId(edges[i].GeomEdgeHook)+1 << "\n"); 3747 3747 if (edges[i][j].GeomEdgeHook->OnGeomVertex()) … … 3752 3752 _printf_("Its pointer is " << edges[i][j].GeomEdgeHook << "\n"); 3753 3753 3754 _printf_("This edge is on geometry and has no adjacent edge (open curve) and one of the tip is not required " << "\n");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 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_(" Adaptmesh info: " << "\n");4024 _printf_(" Adaptmesh info:\n"); 4025 4025 _printf_(" number of triangles = " << nt << "\n"); 4026 4026 _printf_(" hmin = " << hmin << ", hmax=" << hmax << "\n"); … … 4062 4062 } 4063 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");4064 _printf_(" length of edge in | %% of edge | Nb of edges \n"); 4065 _printf_(" --------------------+-------------+-------------\n"); 4066 4066 for (i=0;i<=kmax;i++){ 4067 4067 if (i==0) _printf_( " " << setw(10) << 0.); … … 4069 4069 if (i==kmax) _printf_(" +inf "); 4070 4070 else _printf_( " " << setw(10) << exp(lmin+(i+1)/delta)); 4071 _printf_("| " << setw(10) << (long((10000. * histo[i])/ nbedges)/100.) << " | " << "\n");4071 _printf_("| " << setw(10) << (long((10000. * histo[i])/ nbedges)/100.) << " |\n"); 4072 4072 _printf_(" " << histo[i] << "\n"); 4073 4073 } 4074 _printf_(" --------------------+-------------+------------- " << "\n");4074 _printf_(" --------------------+-------------+-------------\n"); 4075 4075 } 4076 4076 /*}}}*/ … … 4748 4748 Triangle *tcvi = TriangleFindFromCoord(vi.i,det3); 4749 4749 if (tcvi && !tcvi->link) { 4750 _printf_("problem inserting point in SplitInternalEdgeWithBorderVertices (tcvj && !tcvj->link) " << "\n");4750 _printf_("problem inserting point in SplitInternalEdgeWithBorderVertices (tcvj && !tcvj->link)\n"); 4751 4751 } 4752 4752 … … 4765 4765 } 4766 4766 } 4767 if (NbSplitEdge>nbv-nbvold) _printf_("WARNING: not enough vertices to split all internal edges, we lost " << NbSplitEdge - ( nbv-nbvold) << " edges... " << "\n");4767 if (NbSplitEdge>nbv-nbvold) _printf_("WARNING: not enough vertices to split all internal edges, we lost " << NbSplitEdge - ( nbv-nbvold) << " edges...\n"); 4768 4768 if (verbose>2) _printf_("SplitInternalEdgeWithBorderVertices: Number of splited edge " << NbSplitEdge << "\n"); 4769 4769 … … 4936 4936 4937 4937 //Vertices 4938 if(verbose) _printf_("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]; … … 5249 5249 //Insert points inside existing triangles 5250 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");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) _printf_(" Forcing boundaries " << "\n");5256 if (verbose>3) _printf_(" Forcing boundaries\n"); 5257 5257 ForceBoundary(); 5258 5258 5259 5259 //Extract SubDomains 5260 if (verbose>3) _printf_(" Extracting subdomains " << "\n");5260 if (verbose>3) _printf_(" Extracting subdomains\n"); 5261 5261 FindSubDomain(); 5262 5262 5263 if (verbose>3) _printf_(" Inserting internal points " << "\n");5263 if (verbose>3) _printf_(" Inserting internal points\n"); 5264 5264 NewPoints(*this,bamgopts,0) ; 5265 5265 if (verbose>4) _printf_(" -- current number of vertices = " << nbv << "\n"); … … 5367 5367 5368 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");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 // _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");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 … … 5578 5578 //Insert points inside existing triangles 5579 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");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) _printf_(" Forcing boundaries " << "\n");5585 if (verbose>3) _printf_(" Forcing boundaries\n"); 5586 5586 ForceBoundary(); 5587 5587 5588 5588 //Extract SubDomains 5589 if (verbose>3) _printf_(" Extracting subdomains " << "\n");5589 if (verbose>3) _printf_(" Extracting subdomains\n"); 5590 5590 FindSubDomain(); 5591 5591 5592 if (verbose>3) _printf_(" Inserting internal points " << "\n");5592 if (verbose>3) _printf_(" Inserting internal points\n"); 5593 5593 NewPoints(BTh,bamgopts,KeepVertices) ; 5594 5594 if (verbose>4) _printf_(" -- current number of vertices = " << nbv << "\n"); -
issm/trunk-jpl/src/c/bamg/Metric.cpp
r15100 r15104 71 71 void Metric::Echo(void){ 72 72 73 _printf_("Metric: " << "\n");74 _printf_(" [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; -
issm/trunk-jpl/src/c/bamg/Triangle.cpp
r15100 r15104 109 109 int i; 110 110 111 _printf_("Triangle: " << "\n");112 _printf_(" vertices pointer towards three vertices " << "\n");111 _printf_("Triangle:\n"); 112 _printf_(" vertices pointer towards three vertices\n"); 113 113 _printf_(" vertices[0] vertices[1] vertices[2] = " << vertices[0] << " " << vertices[1] << " " << vertices[2] << "\n"); 114 _printf_(" adj pointer towards three adjacent triangles " << "\n");114 _printf_(" adj pointer towards three adjacent triangles\n"); 115 115 _printf_(" adj[0] adj[1] adj[2] = " << adj[0] << " " << adj[1] << " " << adj[2] << "\n"); 116 116 _printf_(" det (integer triangle determinant) = " << det << "\n"); … … 122 122 } 123 123 124 _printf_("\nThree vertices: " << "\n");124 _printf_("\nThree vertices:\n"); 125 125 for(i=0;i<3;i++){ 126 126 if (vertices[i]){ … … 128 128 } 129 129 else{ 130 _printf_(" 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
r15100 r15104 42 42 void SpcDynamic::Echo(void){ 43 43 44 _printf_("SpcDynamic: " << "\n");44 _printf_("SpcDynamic:\n"); 45 45 _printf_(" sid: " << sid << "\n"); 46 46 _printf_(" nodeid: " << nodeid << "\n"); -
issm/trunk-jpl/src/c/classes/Constraints/SpcStatic.cpp
r15100 r15104 41 41 void SpcStatic::Echo(void){ 42 42 43 _printf_("SpcStatic: " << "\n");43 _printf_("SpcStatic:\n"); 44 44 _printf_(" sid: " << sid << "\n"); 45 45 _printf_(" nodeid: " << nodeid << "\n"); … … 53 53 void SpcStatic::DeepEcho(void){ 54 54 55 _printf_("SpcStatic: " << "\n");55 _printf_("SpcStatic:\n"); 56 56 _printf_(" sid: " << sid << "\n"); 57 57 _printf_(" nodeid: " << nodeid << "\n"); -
issm/trunk-jpl/src/c/classes/Constraints/SpcTransient.cpp
r15100 r15104 56 56 57 57 int i; 58 _printf_("SpcTransient: " << "\n");58 _printf_("SpcTransient:\n"); 59 59 _printf_(" sid: " << sid << "\n"); 60 60 _printf_(" nodeid: " << nodeid << "\n"); … … 62 62 _printf_(" nsteps: " << nsteps << "\n"); 63 63 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 64 _printf_(" steps|times|values " << "\n");64 _printf_(" steps|times|values\n"); 65 65 for(i=0;i<nsteps;i++){ 66 66 _printf_(i << "-" << times[i] << ":" << values[i] << "\n"); -
issm/trunk-jpl/src/c/classes/Contour.h
r15100 r15104 61 61 _printf_(" closed: " << (closed?"true":"false") << "\n"); 62 62 if(nods){ 63 _printf_(" x , y: " << "\n");63 _printf_(" x , y:\n"); 64 64 for(int i=0;i<nods;i++){ 65 65 _printf_(i << ": " << x[i] << " | " << y[i] << "\n"); -
issm/trunk-jpl/src/c/classes/DependentObject.cpp
r15100 r15104 40 40 void DependentObject::Echo(void){ 41 41 42 _printf_("DependentObject: " << "\n");42 _printf_("DependentObject:\n"); 43 43 _printf_(" name: " << EnumToStringx(this->name) << "\n"); 44 44 if(this->type==0) 45 _printf_(" type: scalar " << "\n");45 _printf_(" type: scalar\n"); 46 46 else if(this->type==1) 47 _printf_(" type: vertex " << "\n");47 _printf_(" type: vertex\n"); 48 48 else 49 49 _error_(" unknown type: " << this->type); -
issm/trunk-jpl/src/c/classes/DofIndexing.cpp
r15100 r15104 163 163 void DofIndexing::Echo(void){ 164 164 165 _printf_("DofIndexing: " << "\n");165 _printf_("DofIndexing:\n"); 166 166 _printf_(" gsize: " << gsize << "\n"); 167 167 _printf_(" clone: " << clone << "\n"); … … 173 173 int i; 174 174 175 _printf_("DofIndexing: " << "\n");175 _printf_("DofIndexing:\n"); 176 176 _printf_(" gsize: " << gsize << "\n"); 177 177 _printf_(" fsize: " << fsize << "\n"); … … 179 179 _printf_(" clone: " << clone << "\n"); 180 180 181 _printf_(" set membership: f,s sets " << "\n");181 _printf_(" set membership: f,s sets \n"); 182 182 for(i=0;i<gsize;i++){ 183 183 _printf_(" dof " << i << ": " <<(f_set[i]?"true":"false")<< " " <<(s_set[i]?"true":"false") << "\n"); … … 188 188 if(this->s_set[i])_printf_(" " << svalues[i] << " |"); 189 189 } 190 _printf_(" " << "\n");190 _printf_("\n"); 191 191 192 192 if(doftype){ … … 195 195 _printf_(" " << doftype[i] << " |"); 196 196 } 197 _printf_(" " << "\n");198 } 199 else _printf_(" doftype: NULL " << "\n");197 _printf_("\n"); 198 } 199 else _printf_(" doftype: NULL\n"); 200 200 201 201 _printf_(" g_doflist (" << this->gsize << "): |"); … … 203 203 _printf_(" " << gdoflist[i] << " |"); 204 204 } 205 _printf_(" " << "\n");205 _printf_("\n"); 206 206 207 207 _printf_(" f_doflist (" << this->fsize << "): |"); … … 209 209 _printf_(" " << fdoflist[i] << " |"); 210 210 } 211 _printf_(" " << "\n");211 _printf_("\n"); 212 212 213 213 _printf_(" s_doflist (" << this->ssize << "): |"); … … 215 215 _printf_(" " << sdoflist[i] << " |"); 216 216 } 217 _printf_(" " << "\n");217 _printf_("\n"); 218 218 } 219 219 /*}}}*/ -
issm/trunk-jpl/src/c/classes/ElementResults/BoolElementResult.cpp
r15100 r15104 42 42 void BoolElementResult::DeepEcho(void){ 43 43 44 _printf_("BoolElementResult: " << "\n");45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");44 _printf_("BoolElementResult:\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 46 46 _printf_(" value: "<<(this->value?"true":"false") << "\n"); 47 47 _printf_(" step: " << this->step << "\n"); -
issm/trunk-jpl/src/c/classes/ElementResults/DoubleElementResult.cpp
r15100 r15104 42 42 void DoubleElementResult::DeepEcho(void){ 43 43 44 _printf_("DoubleElementResult: " << "\n");45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");44 _printf_("DoubleElementResult:\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 46 46 _printf_(" value: " << this->value << "\n"); 47 47 _printf_(" step: " << this->step << "\n"); -
issm/trunk-jpl/src/c/classes/ElementResults/PentaP1ElementResult.cpp
r15100 r15104 44 44 void PentaP1ElementResult::DeepEcho(void){ 45 45 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");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 49 _printf_(" step: " << this->step << "\n"); 50 50 _printf_(" time: " << this->time << "\n"); -
issm/trunk-jpl/src/c/classes/ElementResults/TriaP1ElementResult.cpp
r15100 r15104 44 44 void TriaP1ElementResult::DeepEcho(void){ 45 45 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");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 49 _printf_(" step: " << this->step << "\n"); 50 50 _printf_(" time: " << this->time << "\n"); -
issm/trunk-jpl/src/c/classes/Elements/Penta.cpp
r15100 r15104 668 668 void Penta::DeepEcho(void){ 669 669 670 _printf_("Penta: " << "\n");670 _printf_("Penta:\n"); 671 671 _printf_(" id: " << id << "\n"); 672 672 nodes[0]->DeepEcho(); … … 679 679 matpar->DeepEcho(); 680 680 _printf_(" neighbor ids: " << verticalneighbors[0]->Id() << "-" << verticalneighbors[1]->Id() << "\n"); 681 _printf_(" parameters " << "\n");681 _printf_(" parameters\n"); 682 682 parameters->DeepEcho(); 683 _printf_(" inputs " << "\n");683 _printf_(" inputs\n"); 684 684 inputs->DeepEcho(); 685 _printf_(" results " << "\n");685 _printf_(" results\n"); 686 686 results->DeepEcho(); 687 _printf_("neighboor sids: " << "\n");687 _printf_("neighboor sids: \n"); 688 688 _printf_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n"); 689 689 } … … 1335 1335 } 1336 1336 else{ 1337 _printf_("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) _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");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
r15100 r15104 935 935 void Tria::DeepEcho(void){ 936 936 937 _printf_("Tria: " << "\n");937 _printf_("Tria:\n"); 938 938 _printf_(" id: " << id << "\n"); 939 939 if(nodes){ … … 942 942 nodes[2]->DeepEcho(); 943 943 } 944 else _printf_("nodes = NULL " << "\n");944 else _printf_("nodes = NULL\n"); 945 945 946 946 if (material) material->DeepEcho(); 947 else _printf_("material = NULL " << "\n");947 else _printf_("material = NULL\n"); 948 948 949 949 if (matpar) matpar->DeepEcho(); 950 else _printf_("matpar = NULL " << "\n");951 952 _printf_(" parameters " << "\n");950 else _printf_("matpar = NULL\n"); 951 952 _printf_(" parameters\n"); 953 953 if (parameters) parameters->DeepEcho(); 954 else _printf_("parameters = NULL " << "\n");955 956 _printf_(" inputs " << "\n");954 else _printf_("parameters = NULL\n"); 955 956 _printf_(" inputs\n"); 957 957 if (inputs) inputs->DeepEcho(); 958 else _printf_("inputs=NULL " << "\n");958 else _printf_("inputs=NULL\n"); 959 959 960 960 if (results) results->DeepEcho(); 961 else _printf_("results=NULL " << "\n");962 963 _printf_("neighboor sids: " << "\n");961 else _printf_("results=NULL\n"); 962 963 _printf_("neighboor sids: \n"); 964 964 _printf_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n"); 965 965 … … 1047 1047 /*FUNCTION Tria::Echo{{{*/ 1048 1048 void Tria::Echo(void){ 1049 _printf_("Tria: " << "\n");1049 _printf_("Tria:\n"); 1050 1050 _printf_(" id: " << id << "\n"); 1051 1051 if(nodes){ … … 1054 1054 nodes[2]->Echo(); 1055 1055 } 1056 else _printf_("nodes = NULL " << "\n");1056 else _printf_("nodes = NULL\n"); 1057 1057 1058 1058 if (material) material->Echo(); 1059 else _printf_("material = NULL " << "\n");1059 else _printf_("material = NULL\n"); 1060 1060 1061 1061 if (matpar) matpar->Echo(); 1062 else _printf_("matpar = NULL " << "\n");1063 1064 _printf_(" parameters " << "\n");1062 else _printf_("matpar = NULL\n"); 1063 1064 _printf_(" parameters\n"); 1065 1065 if (parameters) parameters->Echo(); 1066 else _printf_("parameters = NULL " << "\n");1067 1068 _printf_(" inputs " << "\n");1066 else _printf_("parameters = NULL\n"); 1067 1068 _printf_(" inputs\n"); 1069 1069 if (inputs) inputs->Echo(); 1070 else _printf_("inputs=NULL " << "\n");1070 else _printf_("inputs=NULL\n"); 1071 1071 1072 1072 if (results) results->Echo(); 1073 else _printf_("results=NULL " << "\n");1074 1075 _printf_("neighboor sids: " << "\n");1073 else _printf_("results=NULL\n"); 1074 1075 _printf_("neighboor sids: \n"); 1076 1076 _printf_(" " << horizontalneighborsids[0] << " " << horizontalneighborsids[1] << " " << horizontalneighborsids[2] << "\n"); 1077 1077 } … … 1559 1559 } 1560 1560 else{ 1561 _printf_("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
r15100 r15104 34 34 void GenericEcho(void){/*{{{*/ 35 35 _printf_(" id: " << this->id << "\n"); 36 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");36 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 37 37 _printf_(" step: " << this->step << "\n"); 38 38 _printf_(" time: " << this->time << "\n"); … … 143 143 template <> inline void GenericExternalResult<bool>::DeepEcho(void){ /*{{{*/ 144 144 145 _printf_("GenericExternalResult<bool>: " << "\n");145 _printf_("GenericExternalResult<bool>:\n"); 146 146 this->GenericEcho(); 147 147 _printf_(" value: " <<(this->value?"true":"false") << "\n"); … … 155 155 template <> inline void GenericExternalResult<int>::DeepEcho(void){ /*{{{*/ 156 156 157 _printf_("GenericExternalResult<int>: " << "\n");157 _printf_("GenericExternalResult<int>:\n"); 158 158 this->GenericEcho(); 159 159 _printf_(" value: " << this->value << "\n"); … … 167 167 template <> inline void GenericExternalResult<double>::DeepEcho(void){ /*{{{*/ 168 168 169 _printf_("GenericExternalResult<double>: " << "\n");169 _printf_("GenericExternalResult<double>:\n"); 170 170 this->GenericEcho(); 171 171 _printf_(" value: " << this->value << "\n"); … … 192 192 template <> inline void GenericExternalResult<char*>::DeepEcho(void){ /*{{{*/ 193 193 194 _printf_("GenericExternalResult<char*>: " << "\n");194 _printf_("GenericExternalResult<char*>:\n"); 195 195 this->GenericEcho(); 196 196 _printf_(" value: " << this->value << "\n"); … … 252 252 template <> inline void GenericExternalResult<IssmPDouble*>::Echo(void){ /*{{{*/ 253 253 254 _printf_("GenericExternalResult<IssmPDouble*>: " << "\n");254 _printf_("GenericExternalResult<IssmPDouble*>:\n"); 255 255 this->GenericEcho(); 256 256 _printf_(" matrix size: " << this->M << "-" << this->N << "\n"); … … 261 261 int i,j; 262 262 263 _printf_("GenericExternalResult<IssmPDouble*>: " << "\n");263 _printf_("GenericExternalResult<IssmPDouble*>:\n"); 264 264 this->GenericEcho(); 265 265 … … 270 270 _printf_( " " << setw(11) << setprecision (5) << this->value[i*this->N+j]); 271 271 } 272 _printf_(" ] " << "\n");272 _printf_(" ]\n"); 273 273 } 274 274 -
issm/trunk-jpl/src/c/classes/FemModel.cpp
r15100 r15104 118 118 this->parameters->FindParam(&lockfilename,LockFileNameEnum); 119 119 if (waitonlock>0){ 120 _printf0_("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 _printf0_(" " << "\n");139 _printf0_("\n"); 140 140 _printf0_(" "<<setw(40)<<left<<"FemModel initialization elapsed time:"<<profiler->DeltaTime(StartInit,FinishInit) << "\n"); 141 141 _printf0_(" "<<setw(40)<<left<<"Core solution elapsed time:"<<profiler->DeltaTime(StartCore,FinishCore) << "\n"); 142 _printf0_(" " << "\n");142 _printf0_("\n"); 143 143 _printf0_(" Total elapsed time:" 144 144 <<profiler->DeltaTimeModHour(Start,Finish)<<" hrs " … … 146 146 <<profiler->DeltaTimeModSec(Start,Finish)<<" sec" 147 147 ); 148 _printf0_(" " << "\n");148 _printf0_("\n"); 149 149 150 150 /*Now delete: */ … … 153 153 /*Finalize PETSC for this model: */ 154 154 #ifdef _HAVE_PETSC_ 155 _printf0_("closing Petsc " << "\n");155 _printf0_("closing Petsc\n"); 156 156 PetscFinalize(); 157 157 #endif … … 164 164 void FemModel::Echo(void){ 165 165 166 _printf_("FemModel echo: " << "\n");166 _printf_("FemModel echo: \n"); 167 167 _printf_(" number of fem models: " << nummodels << "\n"); 168 _printf_(" analysis_type_list: " << "\n");168 _printf_(" analysis_type_list: \n"); 169 169 for(int i=0;i<nummodels;i++)_printf_(" " << i << ": " << EnumToStringx(analysis_type_list[i]) << "\n"); 170 _printf_(" current analysis_type: " << "\n");170 _printf_(" current analysis_type: \n"); 171 171 _printf_(" " << analysis_counter << ": " << EnumToStringx(analysis_type_list[analysis_counter]) << "\n"); 172 172 … … 208 208 for(i=0;i<nummodels;i++){ 209 209 210 if(VerboseMProcessor()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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 _printf0_("write results to disk: " << "\n");249 _printf0_("write results to disk:\n"); 250 250 251 251 /*Just call the OutputResultsx module: */ … … 317 317 void (*solutioncore)(FemModel*)=NULL; //core solution function pointer 318 318 319 _printf0_("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 _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");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: */ … … 829 829 830 830 /*Display message*/ 831 if(VerboseModule()) _printf0_(" Generating matrices " << "\n");831 if(VerboseModule()) _printf0_(" Generating matrices\n"); 832 832 833 833 /*retrive parameters: */ … … 1551 1551 for(i=0;i<d_numresponses-1;i++)_printf_(d_responses[i] << "|"); 1552 1552 _printf_(d_responses[d_numresponses-1]); 1553 _printf_(" " << "\n");1553 _printf_("\n"); 1554 1554 } 1555 1555 /*}}}*/ -
issm/trunk-jpl/src/c/classes/Hook.cpp
r15100 r15104 66 66 int i; 67 67 if (num){ 68 _printf_(" Hook: " << "\n");68 _printf_(" Hook: \n"); 69 69 _printf_(" num=" << this->num << "\n"); 70 70 _printf_(" ids: "); 71 71 for (i=0;i<this->num;i++) _printf_(this->ids[i] << " "); 72 _printf_(" " << "\n");72 _printf_("\n"); 73 73 _printf_(" offsets: "); 74 74 for (i=0;i<this->num;i++) _printf_(this->offsets[i] << " "); 75 _printf_(" " << "\n");75 _printf_("\n"); 76 76 } 77 77 else{ 78 _printf_(" Hook: num=0 " << "\n");78 _printf_(" Hook: num=0 \n"); 79 79 } 80 80 } … … 85 85 int i; 86 86 if (num){ 87 _printf_(" Hook: " << "\n");87 _printf_(" Hook: \n"); 88 88 _printf_(" num=" << this->num << "\n"); 89 89 _printf_(" ids: "); 90 90 for (i=0;i<this->num;i++) _printf_(this->ids[i] << " "); 91 _printf_(" " << "\n");91 _printf_("\n"); 92 92 _printf_(" offsets: "); 93 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");94 _printf_("\n"); 95 if (!objects) _printf_(" warning: object not hooked yet\n"); 96 96 else{ 97 97 _printf_(" objects:\n "); … … 99 99 _printf_(" object " << i << "\n"); 100 100 if(objects[i]) objects[i]->DeepEcho(); 101 else _printf_(" 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 _printf_(" Hook: num=0 " << "\n");106 _printf_(" Hook: num=0 \n"); 107 107 } 108 108 } -
issm/trunk-jpl/src/c/classes/IndependentObject.cpp
r15100 r15104 41 41 void IndependentObject::Echo(void){ 42 42 43 _printf_("IndependentObject: " << "\n");43 _printf_("IndependentObject:\n"); 44 44 _printf_(" name: " << EnumToStringx(this->name) << "\n"); 45 45 if(this->type==0) 46 _printf_(" type: scalar " << "\n");46 _printf_(" type: scalar\n"); 47 47 else if(this->type==1) 48 _printf_(" type: vertex " << "\n");48 _printf_(" type: vertex\n"); 49 49 else 50 50 _error_(" unknown type: " << this->type); -
issm/trunk-jpl/src/c/classes/Inputs/BoolInput.cpp
r15100 r15104 40 40 void BoolInput::DeepEcho(void){ 41 41 42 _printf_("BoolInput: " << "\n");43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");42 _printf_("BoolInput:\n"); 43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 44 44 _printf_(" value: " <<(value?"true":"false") << "\n"); 45 45 } -
issm/trunk-jpl/src/c/classes/Inputs/ControlInput.cpp
r15100 r15104 67 67 void ControlInput::DeepEcho(void){ 68 68 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();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
r15100 r15104 42 42 void DatasetInput::DeepEcho(void){ 43 43 44 _printf_("DatasetInput: " << "\n");45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");46 _printf_("---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
r15100 r15104 40 40 void DoubleInput::DeepEcho(void){ 41 41 42 _printf_("DoubleInput: " << "\n");43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");42 _printf_("DoubleInput:\n"); 43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 44 44 _printf_(" value: " << this->value << "\n"); 45 45 } -
issm/trunk-jpl/src/c/classes/Inputs/IntInput.cpp
r15100 r15104 35 35 void IntInput::DeepEcho(void){ 36 36 37 _printf_("IntInput: " << "\n");38 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");37 _printf_("IntInput:\n"); 38 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 39 39 _printf_(" value: " << (int)this->value << "\n"); 40 40 } -
issm/trunk-jpl/src/c/classes/Inputs/PentaP1Input.cpp
r15100 r15104 51 51 void PentaP1Input::DeepEcho(void){ 52 52 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");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
r15100 r15104 61 61 int i; 62 62 63 _printf_("TransientInput: " << "\n");64 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");63 _printf_("TransientInput:\n"); 64 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 65 65 _printf_(" numtimesteps: " << this->numtimesteps << "\n"); 66 _printf_("---inputs: " << "\n");66 _printf_("---inputs: \n"); 67 67 for(i=0;i<this->numtimesteps;i++){ 68 _printf_(" 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
r15100 r15104 51 51 void TriaP1Input::DeepEcho(void){ 52 52 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");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
r15100 r15104 84 84 for(int i=0;i<MaximumNumberOfEnums;i++){ 85 85 if(this->data[i]){ 86 _printf0_("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 _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");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
r15100 r15104 43 43 /*FUNCTION Friction::Echo {{{*/ 44 44 void Friction::Echo(void){ 45 _printf_("Friction: " << "\n");45 _printf_("Friction:\n"); 46 46 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 47 47 _printf_(" element_type: " << this->element_type << "\n"); -
issm/trunk-jpl/src/c/classes/Loads/Icefront.cpp
r15100 r15104 134 134 /*FUNCTION Icefront::Echo {{{*/ 135 135 void Icefront::Echo(void){ 136 _printf_("Icefront: " << "\n");136 _printf_("Icefront:\n"); 137 137 _printf_(" id: " << id << "\n"); 138 138 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 150 150 void Icefront::DeepEcho(void){ 151 151 152 _printf_("Icefront: " << "\n");152 _printf_("Icefront:\n"); 153 153 _printf_(" id: " << id << "\n"); 154 154 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); -
issm/trunk-jpl/src/c/classes/Loads/Numericalflux.cpp
r15100 r15104 155 155 /*FUNCTION Numericalflux::Echo {{{*/ 156 156 void Numericalflux::Echo(void){ 157 _printf_("Numericalflux: " << "\n");157 _printf_("Numericalflux:\n"); 158 158 _printf_(" id: " << id << "\n"); 159 159 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 168 168 void Numericalflux::DeepEcho(void){ 169 169 170 _printf_("Numericalflux: " << "\n");170 _printf_("Numericalflux:\n"); 171 171 _printf_(" id: " << id << "\n"); 172 172 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 174 174 hvertices->DeepEcho(); 175 175 helement->DeepEcho(); 176 _printf_(" parameters " << "\n");176 _printf_(" parameters\n"); 177 177 if(parameters) 178 178 parameters->DeepEcho(); 179 179 else 180 _printf_(" NULL " << "\n");181 _printf_(" 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
r15100 r15104 103 103 void Pengrid::DeepEcho(void){ 104 104 105 _printf_("Pengrid: " << "\n");105 _printf_("Pengrid:\n"); 106 106 _printf_(" id: " << id << "\n"); 107 107 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 111 111 _printf_(" active " << this->active << "\n"); 112 112 _printf_(" zigzag_counter " << this->zigzag_counter << "\n"); 113 _printf_(" parameters " << "\n");113 _printf_(" parameters\n"); 114 114 parameters->DeepEcho(); 115 _printf_(" inputs " << "\n");115 _printf_(" inputs\n"); 116 116 inputs->DeepEcho(); 117 117 } -
issm/trunk-jpl/src/c/classes/Loads/Penpair.cpp
r15100 r15104 51 51 void Penpair::Echo(void){ 52 52 53 _printf_("Penpair: " << "\n");53 _printf_("Penpair:\n"); 54 54 _printf_(" id: " << id << "\n"); 55 55 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 62 62 void Penpair::DeepEcho(void){ 63 63 64 _printf_("Penpair: " << "\n");64 _printf_("Penpair:\n"); 65 65 _printf_(" id: " << id << "\n"); 66 66 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); -
issm/trunk-jpl/src/c/classes/Loads/Riftfront.cpp
r15100 r15104 138 138 input=(Input*)this->inputs->GetInput(FractionIncrementEnum); input->GetInputValue(&fractionincrement); 139 139 140 _printf_("Riftfront: " << "\n");140 _printf_("Riftfront:\n"); 141 141 _printf_(" id: " << id << "\n"); 142 142 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 146 146 _printf_(" parameters: " << parameters << "\n"); 147 147 _printf_(" inputs: " << inputs << "\n"); 148 _printf_(" internal parameters: " << "\n");148 _printf_(" internal parameters: \n"); 149 149 _printf_(" normal: " << normal[0] << "|" << normal[1] << "\n"); 150 150 _printf_(" length: " << length << "\n"); … … 166 166 void Riftfront::DeepEcho(void){ 167 167 168 _printf_("Riftfront: " << "\n");168 _printf_("Riftfront:\n"); 169 169 _printf_(" id: " << id << "\n"); 170 170 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); … … 172 172 helements->DeepEcho(); 173 173 hmatpar->DeepEcho(); 174 _printf_(" parameters " << "\n");174 _printf_(" parameters\n"); 175 175 if(parameters)parameters->DeepEcho(); 176 _printf_(" inputs " << "\n");176 _printf_(" inputs\n"); 177 177 if(inputs)inputs->DeepEcho(); 178 178 } … … 702 702 this->active=activate; 703 703 704 //if ((penetration>0) && (this->active==1))_printf_("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
r15100 r15104 55 55 void Matdamageice::Echo(void){ 56 56 57 _printf_("Matdamageice: " << "\n");57 _printf_("Matdamageice:\n"); 58 58 _printf_(" mid: " << mid << "\n"); 59 _printf_(" inputs: " << "\n");59 _printf_(" inputs:\n"); 60 60 inputs->Echo(); 61 _printf_(" element: " << "\n");61 _printf_(" element:\n"); 62 62 helement->Echo(); 63 63 } … … 66 66 void Matdamageice::DeepEcho(void){ 67 67 68 _printf_("Matdamageice: " << "\n");68 _printf_("Matdamageice:\n"); 69 69 _printf_(" mid: " << mid << "\n"); 70 _printf_(" inputs: " << "\n");70 _printf_(" inputs:\n"); 71 71 inputs->DeepEcho(); 72 _printf_(" element: " << "\n");72 _printf_(" element:\n"); 73 73 helement->Echo(); 74 74 } -
issm/trunk-jpl/src/c/classes/Materials/Matice.cpp
r15100 r15104 69 69 void Matice::Echo(void){ 70 70 71 _printf_("Matice: " << "\n");71 _printf_("Matice:\n"); 72 72 _printf_(" mid: " << mid << "\n"); 73 _printf_(" inputs: " << "\n");73 _printf_(" inputs:\n"); 74 74 inputs->Echo(); 75 _printf_(" element: " << "\n");75 _printf_(" element:\n"); 76 76 helement->Echo(); 77 77 } … … 80 80 void Matice::DeepEcho(void){ 81 81 82 _printf_("Matice: " << "\n");82 _printf_("Matice:\n"); 83 83 _printf_(" mid: " << mid << "\n"); 84 _printf_(" inputs: " << "\n");84 _printf_(" inputs:\n"); 85 85 inputs->DeepEcho(); 86 _printf_(" element: " << "\n");86 _printf_(" element:\n"); 87 87 helement->Echo(); 88 88 } -
issm/trunk-jpl/src/c/classes/Materials/Matpar.cpp
r15100 r15104 95 95 void Matpar::Echo(void){ 96 96 97 _printf_("Matpar: " << "\n");97 _printf_("Matpar:\n"); 98 98 _printf_(" mid: " << mid << "\n"); 99 99 _printf_(" rho_ice: " << rho_ice << "\n"); -
issm/trunk-jpl/src/c/classes/Node.cpp
r15100 r15104 155 155 void Node::Echo(void){ 156 156 157 _printf_("Node: " << "\n");157 _printf_("Node:\n"); 158 158 _printf_(" id: " << id << "\n"); 159 159 _printf_(" sid: " << sid << "\n"); 160 160 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 161 161 indexing.Echo(); 162 _printf_(" hvertex: not displayed " << "\n");162 _printf_(" hvertex: not displayed\n"); 163 163 _printf_(" inputs: " << inputs << "\n"); 164 164 … … 168 168 void Node::DeepEcho(void){ 169 169 170 _printf_("Node: " << "\n");170 _printf_("Node:\n"); 171 171 _printf_(" id: " << id << "\n"); 172 172 _printf_(" sid: " << sid << "\n"); 173 173 _printf_(" analysis_type: " << EnumToStringx(analysis_type) << "\n"); 174 174 indexing.DeepEcho(); 175 _printf_("Vertex: " << "\n");175 _printf_("Vertex:\n"); 176 176 hvertex->DeepEcho(); 177 _printf_(" inputs " << "\n");177 _printf_(" inputs\n"); 178 178 179 179 } -
issm/trunk-jpl/src/c/classes/Options/GenericOption.h
r15100 r15104 64 64 bool flag=true; 65 65 66 if(flag) _printf0_(indent << " name: \"" << name << "\" " << "\n");66 if(flag) _printf0_(indent << " name: \"" << name << "\"\n"); 67 67 if(flag) _printf0_(indent << " numel: " << numel << "\n"); 68 68 if(flag) _printf0_(indent << " ndims: " << ndims << "\n"); … … 71 71 if(flag) _printf0_(indent << " size: " << cstr << "\n"); 72 72 } 73 else if(flag) _printf0_(indent << " size: [empty] " << "\n");73 else if(flag) _printf0_(indent << " size: [empty]\n"); 74 74 _printf_(indent << " value: " << value << "\n");; 75 75 } /*}}}*/ -
issm/trunk-jpl/src/c/classes/Options/Options.h
r15100 r15104 64 64 } 65 65 else{ 66 if(GetOption(name)) _printf_("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
r15100 r15104 43 43 void BoolParam::DeepEcho(void){ 44 44 45 _printf_("BoolParam: " << "\n");46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");45 _printf_("BoolParam:\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 47 47 _printf_(" value: " <<(this->value?"true":"false") << "\n"); 48 48 } -
issm/trunk-jpl/src/c/classes/Params/DataSetParam.cpp
r15100 r15104 44 44 void DataSetParam::DeepEcho(void){ 45 45 46 _printf_("DataSetParam: " << "\n");47 _printf_(" 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
r15100 r15104 82 82 void DoubleMatArrayParam::Echo(void){ 83 83 84 _printf_("DoubleMatArrayParam: " << "\n");85 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");84 _printf_("DoubleMatArrayParam:\n"); 85 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 86 86 _printf_(" array size: " << this->M << "\n"); 87 87 _printf_(" array pointer: " << this->array << "\n"); … … 96 96 IssmDouble* matrix=NULL; 97 97 98 _printf_("DoubleMatArrayParam: " << "\n");99 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");98 _printf_("DoubleMatArrayParam:\n"); 99 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 100 100 _printf_(" array size: " << this->M << "\n"); 101 101 for(i=0;i<M;i++){ 102 _printf_(" array " << i << " (" << mdim_array[i] << "x" << ndim_array[i] << "): " << "\n");102 _printf_(" array " << i << " (" << mdim_array[i] << "x" << ndim_array[i] << "):\n"); 103 103 matrix=array[i]; 104 104 m=mdim_array[i]; … … 108 108 _printf_(" "); 109 109 for(k=0;k<n;k++)_printf_(*(matrix+n*j+k) << " "); 110 _printf_(" " << "\n");110 _printf_("\n"); 111 111 } 112 112 } -
issm/trunk-jpl/src/c/classes/Params/DoubleMatParam.cpp
r15100 r15104 43 43 void DoubleMatParam::Echo(void){ 44 44 45 _printf_("DoubleMatParam: " << "\n");46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");45 _printf_("DoubleMatParam:\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 47 47 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 48 48 … … 54 54 int i,j; 55 55 56 _printf_("DoubleMatParam: " << "\n");57 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");56 _printf_("DoubleMatParam:\n"); 57 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 58 58 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 59 59 for(i=0;i<this->M;i++){ -
issm/trunk-jpl/src/c/classes/Params/DoubleParam.cpp
r15100 r15104 40 40 void DoubleParam::DeepEcho(void){ 41 41 42 _printf_("DoubleParam: " << "\n");43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");42 _printf_("DoubleParam:\n"); 43 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 44 44 _printf_(" value: " << this->value << "\n"); 45 45 } -
issm/trunk-jpl/src/c/classes/Params/DoubleVecParam.cpp
r15100 r15104 42 42 void DoubleVecParam::Echo(void){ 43 43 44 _printf_("DoubleVecParam: " << "\n");45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");44 _printf_("DoubleVecParam:\n"); 45 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 46 46 _printf_(" vector size: " << this->M << "\n"); 47 47 … … 53 53 int i; 54 54 55 _printf_("DoubleVecParam: " << "\n");56 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");55 _printf_("DoubleVecParam:\n"); 56 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 57 57 _printf_(" vector size: " << this->M << "\n"); 58 58 for(i=0;i<this->M;i++){ -
issm/trunk-jpl/src/c/classes/Params/FileParam.cpp
r15100 r15104 43 43 void FileParam::DeepEcho(void){ 44 44 45 _printf_("FileParam: " << "\n");46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");45 _printf_("FileParam:\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 47 47 _printf_(" value: " << this->value << "\n"); 48 48 } -
issm/trunk-jpl/src/c/classes/Params/GenericParam.h
r15100 r15104 39 39 // that any structured P must provide the friend << operator 40 40 void DeepEcho() { 41 _printf_("GenericParam: " << "\n");42 _printf_(" enum: " << myEnumVal << " (" << EnumToStringx(myEnumVal) << ") " << "\n");41 _printf_("GenericParam:\n"); 42 _printf_(" enum: " << myEnumVal << " (" << EnumToStringx(myEnumVal) << ")\n"); 43 43 _printf_(" value: " << myP << "\n");; 44 44 } -
issm/trunk-jpl/src/c/classes/Params/IntMatParam.cpp
r15100 r15104 43 43 void IntMatParam::Echo(void){ 44 44 45 _printf_("IntMatParam: " << "\n");46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");45 _printf_("IntMatParam:\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 47 47 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 48 48 … … 54 54 int i,j; 55 55 56 _printf_("IntMatParam: " << "\n");57 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");56 _printf_("IntMatParam:\n"); 57 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 58 58 _printf_(" matrix size: " << this->M << "x" << this->N << "\n"); 59 59 for(i=0;i<this->M;i++){ -
issm/trunk-jpl/src/c/classes/Params/IntParam.cpp
r15100 r15104 43 43 void IntParam::DeepEcho(void){ 44 44 45 _printf_("IntParam: " << "\n");46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");45 _printf_("IntParam:\n"); 46 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 47 47 _printf_(" value: " << this->value << "\n"); 48 48 } -
issm/trunk-jpl/src/c/classes/Params/IntVecParam.cpp
r15100 r15104 58 58 void IntVecParam::Echo(void){ 59 59 60 _printf_("IntVecParam: " << "\n");61 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");60 _printf_("IntVecParam:\n"); 61 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 62 62 _printf_(" vector size: " << this->M << "\n"); 63 63 … … 69 69 int i; 70 70 71 _printf_("IntVecParam: " << "\n");72 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");71 _printf_("IntVecParam:\n"); 72 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 73 73 _printf_(" vector size: " << this->M << "\n"); 74 74 for(i=0;i<this->M;i++){ -
issm/trunk-jpl/src/c/classes/Params/MatrixParam.cpp
r15100 r15104 42 42 void MatrixParam::Echo(void){ 43 43 44 _printf_("MatrixParam: " << "\n");45 _printf_(" 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 _printf_("MatrixParam: " << "\n");53 _printf_(" 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
r15100 r15104 70 70 char* string=NULL; 71 71 72 _printf_("StringArrayParam: " << "\n");73 _printf_(" 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]; -
issm/trunk-jpl/src/c/classes/Params/StringParam.cpp
r15100 r15104 44 44 /*FUNCTION StringParam::DeepEcho{{{*/ 45 45 void StringParam::DeepEcho(void){ 46 _printf_("StringParam: " << "\n");47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");46 _printf_("StringParam:\n"); 47 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 48 48 _printf_(" value: " << this->value << "\n"); 49 49 } -
issm/trunk-jpl/src/c/classes/Params/TransientParam.cpp
r15100 r15104 47 47 void TransientParam::Echo(void){ 48 48 49 _printf_("TransientParam: " << "\n");50 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");49 _printf_("TransientParam:\n"); 50 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 51 51 _printf_(" size: " << this->N << "\n"); 52 52 … … 56 56 void TransientParam::DeepEcho(void){ 57 57 58 _printf_("TransientParam: " << "\n");59 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ") " << "\n");58 _printf_("TransientParam:\n"); 59 _printf_(" enum: " << this->enum_type << " (" << EnumToStringx(this->enum_type) << ")\n"); 60 60 _printf_(" size: " << this->N << "\n"); 61 61 for(int i=0;i<this->N;i++){ -
issm/trunk-jpl/src/c/classes/Params/VectorParam.cpp
r15100 r15104 44 44 void VectorParam::Echo(void){ 45 45 46 _printf_("VectorParam: " << "\n");47 _printf_(" 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 _printf_("VectorParam: " << "\n");55 _printf_(" 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
r15100 r15104 36 36 void Profiler::Echo(void){ 37 37 38 _printf_("Profiler: " << "\n");39 _printf_(" 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 _printf_("Profiler: " << "\n");48 _printf_(" 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
r15100 r15104 52 52 void Echo(void){ 53 53 54 _printf_("Segment: " << "\n");54 _printf_("Segment:\n"); 55 55 _printf_(" eid: " << eid << "\n"); 56 56 _printf_(" node 1: " << this->x1 << "|" << this->y1 << "\n"); -
issm/trunk-jpl/src/c/classes/Vertex.cpp
r15100 r15104 62 62 void Vertex::Echo(void){ 63 63 64 _printf_("Vertex: " << "\n");64 _printf_("Vertex:\n"); 65 65 _printf_(" id: " << id << "\n"); 66 66 _printf_(" sid: " << sid << "\n"); -
issm/trunk-jpl/src/c/classes/gauss/GaussPenta.cpp
r15100 r15104 251 251 void GaussPenta::Echo(void){ 252 252 253 _printf_("GaussPenta: " << "\n");253 _printf_("GaussPenta:\n"); 254 254 _printf_(" numgauss: " << numgauss << "\n"); 255 255 … … 257 257 _printf_(" weights = ["); 258 258 for(int i=0;i<numgauss;i++) _printf_(" " << weights[i] << "\n"); 259 _printf_("] " << "\n");260 } 261 else _printf_("weights = NULL " << "\n");259 _printf_("]\n"); 260 } 261 else _printf_("weights = NULL\n"); 262 262 if (coords1){ 263 263 _printf_(" coords1 = ["); 264 264 for(int i=0;i<numgauss;i++) _printf_(" " << coords1[i] << "\n"); 265 _printf_("] " << "\n");266 } 267 else _printf_("coords1 = NULL " << "\n");265 _printf_("]\n"); 266 } 267 else _printf_("coords1 = NULL\n"); 268 268 if (coords2){ 269 269 _printf_(" coords2 = ["); 270 270 for(int i=0;i<numgauss;i++) _printf_(" " << coords2[i] << "\n"); 271 _printf_("] " << "\n");272 } 273 else _printf_("coords2 = NULL " << "\n");271 _printf_("]\n"); 272 } 273 else _printf_("coords2 = NULL\n"); 274 274 if (coords3){ 275 275 _printf_(" coords3 = ["); 276 276 for(int i=0;i<numgauss;i++) _printf_(" " << coords3[i] << "\n"); 277 _printf_("] " << "\n");278 } 279 else _printf_("coords3 = NULL " << "\n");277 _printf_("]\n"); 278 } 279 else _printf_("coords3 = NULL\n"); 280 280 if (coords4){ 281 281 _printf_(" coords4 = ["); 282 282 for(int i=0;i<numgauss;i++) _printf_(" " << coords4[i] << "\n"); 283 _printf_("] " << "\n");284 } 285 else _printf_("coords4 = NULL " << "\n");283 _printf_("]\n"); 284 } 285 else _printf_("coords4 = NULL\n"); 286 286 287 287 _printf_(" weight = " << weight << "\n"); -
issm/trunk-jpl/src/c/classes/gauss/GaussTria.cpp
r15100 r15104 263 263 void GaussTria::Echo(void){ 264 264 265 _printf_("GaussTria: " << "\n");265 _printf_("GaussTria:\n"); 266 266 _printf_(" numgauss: " << numgauss << "\n"); 267 267 … … 269 269 _printf_(" weights = ["); 270 270 for(int i=0;i<numgauss;i++) _printf_(" " << weights[i] << "\n"); 271 _printf_("] " << "\n");272 } 273 else _printf_("weights = NULL " << "\n");271 _printf_("]\n"); 272 } 273 else _printf_("weights = NULL\n"); 274 274 if (coords1){ 275 275 _printf_(" coords1 = ["); 276 276 for(int i=0;i<numgauss;i++) _printf_(" " << coords1[i] << "\n"); 277 _printf_("] " << "\n");278 } 279 else _printf_("coords1 = NULL " << "\n");277 _printf_("]\n"); 278 } 279 else _printf_("coords1 = NULL\n"); 280 280 if (coords2){ 281 281 _printf_(" coords2 = ["); 282 282 for(int i=0;i<numgauss;i++) _printf_(" " << coords2[i] << "\n"); 283 _printf_("] " << "\n");284 } 285 else _printf_("coords2 = NULL " << "\n");283 _printf_("]\n"); 284 } 285 else _printf_("coords2 = NULL\n"); 286 286 if (coords3){ 287 287 _printf_(" coords3 = ["); 288 288 for(int i=0;i<numgauss;i++) _printf_(" " << coords3[i] << "\n"); 289 _printf_("] " << "\n");290 } 291 else _printf_("coords3 = NULL " << "\n");289 _printf_("]\n"); 290 } 291 else _printf_("coords3 = NULL\n"); 292 292 293 293 _printf_(" weight = " << weight << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/ExponentialVariogram.cpp
r15100 r15104 47 47 /*FUNCTION ExponentialVariogram::Echo {{{*/ 48 48 void ExponentialVariogram::Echo(void){ 49 _printf_("ExponentialVariogram " << "\n");49 _printf_("ExponentialVariogram\n"); 50 50 _printf_(" nugget: " << this->nugget << "\n"); 51 51 _printf_(" sill : " << this->sill << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/GaussianVariogram.cpp
r15100 r15104 47 47 /*FUNCTION GaussianVariogram::Echo {{{*/ 48 48 void GaussianVariogram::Echo(void){ 49 _printf_("GaussianVariogram " << "\n");49 _printf_("GaussianVariogram\n"); 50 50 _printf_(" nugget: " << this->nugget << "\n"); 51 51 _printf_(" sill : " << this->sill << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/Observation.cpp
r15100 r15104 35 35 void Observation::Echo(void){ 36 36 37 _printf_("Observation " << "\n");37 _printf_("Observation\n"); 38 38 _printf_(" index : " << this->index << "\n"); 39 39 _printf_(" x : " << this->x << "\n"); 40 40 _printf_(" y : " << this->y << "\n"); 41 _printf_(" xi : " << "\n"); printbinary(this->xi); _printf_("\n");42 _printf_(" yi : " << "\n"); printbinary(this->yi); _printf_("\n");41 _printf_(" xi : \n"); printbinary(this->xi); _printf_("\n"); 42 _printf_(" yi : \n"); printbinary(this->yi); _printf_("\n"); 43 43 _printf_(" weight: " << this->weight << "\n"); 44 44 _printf_(" value : " << this->value << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/Observations.cpp
r15100 r15104 107 107 } 108 108 } 109 _printf0_("done " << "\n");109 _printf0_("done\n"); 110 110 _printf0_("Initial number of observations: " << n << "\n"); 111 111 _printf0_(" Final number of observations: " << this->quadtree->NbObs << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/PowerVariogram.cpp
r15100 r15104 48 48 /*FUNCTION PowerVariogram::Echo {{{*/ 49 49 void PowerVariogram::Echo(void){ 50 _printf_("PowerVariogram " << "\n");50 _printf_("PowerVariogram\n"); 51 51 _printf_(" nugget: " << this->nugget << "\n"); 52 52 _printf_(" slope : " << this->slope << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/Quadtree.cpp
r15100 r15104 297 297 void Quadtree::Echo(void){ 298 298 299 _printf_("Quadtree: " << "\n");299 _printf_("Quadtree:\n"); 300 300 _printf_(" MaxDepth = " << this->MaxDepth << "\n"); 301 301 _printf_(" NbQuadtreeBox = " << this->NbQuadtreeBox << "\n"); … … 307 307 void Quadtree::DeepEcho(void){ 308 308 309 _printf_("Quadtree: " << "\n");309 _printf_("Quadtree:\n"); 310 310 _printf_(" MaxDepth = " << this->MaxDepth << "\n"); 311 311 _printf_(" NbQuadtreeBox = " << this->NbQuadtreeBox << "\n"); … … 512 512 void Quadtree::QuadtreeBox::Echo(void){ 513 513 514 _printf_("QuadtreeBox: " << "\n");514 _printf_("QuadtreeBox:\n"); 515 515 _printf_(" nbitems = " << this->nbitems << "\n"); 516 516 _printf_(" xcenter = " << this->xcenter << "\n"); -
issm/trunk-jpl/src/c/classes/kriging/SphericalVariogram.cpp
r15100 r15104 47 47 /*FUNCTION SphericalVariogram::Echo {{{*/ 48 48 void SphericalVariogram::Echo(void){ 49 _printf_("SphericalVariogram " << "\n");49 _printf_("SphericalVariogram\n"); 50 50 _printf_(" nugget: " << this->nugget << "\n"); 51 51 _printf_(" sill : " << this->sill << "\n"); -
issm/trunk-jpl/src/c/classes/matrix/ElementMatrix.cpp
r15100 r15104 377 377 378 378 int i,j; 379 _printf_("Element Matrix echo: " << "\n");379 _printf_("Element Matrix echo:\n"); 380 380 _printf_(" nrows: " << this->nrows << "\n"); 381 381 _printf_(" ncols: " << this->ncols << "\n"); 382 382 _printf_(" dofsymmetrical: " << (dofsymmetrical?"true":"false") << "\n"); 383 383 384 _printf_(" values: " << "\n");384 _printf_(" values:\n"); 385 385 for(i=0;i<nrows;i++){ 386 386 _printf_(setw(4) << right << i << ": "); 387 387 for(j=0;j<ncols;j++) _printf_( " " << setw(11) << setprecision (5) << right << values[i*ncols+j]); 388 _printf_(" " << "\n");388 _printf_("\n"); 389 389 } 390 390 391 391 _printf_(" gglobaldoflist (" << gglobaldoflist << "): "); 392 if(gglobaldoflist) for(i=0;i<nrows;i++) _printf_(" " << gglobaldoflist[i] << "\n"); _printf_(" " << "\n");392 if(gglobaldoflist) for(i=0;i<nrows;i++) _printf_(" " << gglobaldoflist[i] << "\n"); _printf_("\n"); 393 393 394 394 _printf_(" row_fsize: " << row_fsize << "\n"); 395 395 _printf_(" row_flocaldoflist (" << row_flocaldoflist << "): "); 396 if(row_flocaldoflist) for(i=0;i<row_fsize;i++) _printf_(" " << row_flocaldoflist[i] << "\n"); _printf_(" " << "\n");396 if(row_flocaldoflist) for(i=0;i<row_fsize;i++) _printf_(" " << row_flocaldoflist[i] << "\n"); _printf_(" \n"); 397 397 _printf_(" row_fglobaldoflist (" << row_fglobaldoflist << "): "); 398 if(row_fglobaldoflist) for(i=0;i<row_fsize;i++) _printf_(" " << row_fglobaldoflist[i] << "\n"); _printf_(" " << "\n");398 if(row_fglobaldoflist) for(i=0;i<row_fsize;i++) _printf_(" " << row_fglobaldoflist[i] << "\n"); _printf_(" \n"); 399 399 400 400 _printf_(" row_ssize: " << row_ssize << "\n"); 401 401 _printf_(" row_slocaldoflist (" << row_slocaldoflist << "): "); 402 if(row_slocaldoflist) for(i=0;i<row_ssize;i++) _printf_(" " << row_slocaldoflist[i] << "\n"); _printf_(" " << "\n");402 if(row_slocaldoflist) for(i=0;i<row_ssize;i++) _printf_(" " << row_slocaldoflist[i] << "\n"); _printf_(" \n"); 403 403 _printf_(" row_sglobaldoflist (" << row_sglobaldoflist << "): "); 404 if(row_sglobaldoflist) for(i=0;i<row_ssize;i++) _printf_(" " << row_sglobaldoflist[i] << "\n"); _printf_(" " << "\n");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 407 _printf_(" col_fsize: " << col_fsize << "\n"); 408 408 _printf_(" col_flocaldoflist (" << col_flocaldoflist << "): "); 409 if(col_flocaldoflist) for(i=0;i<col_fsize;i++) _printf_(" " << col_flocaldoflist[i] << "\n"); _printf_(" " << "\n");409 if(col_flocaldoflist) for(i=0;i<col_fsize;i++) _printf_(" " << col_flocaldoflist[i] << "\n"); _printf_(" \n"); 410 410 _printf_(" col_fglobaldoflist (" << col_fglobaldoflist << "): "); 411 if(col_fglobaldoflist) for(i=0;i<col_fsize;i++) _printf_(" " << col_fglobaldoflist[i] << "\n"); _printf_(" " << "\n");411 if(col_fglobaldoflist) for(i=0;i<col_fsize;i++) _printf_(" " << col_fglobaldoflist[i] << "\n"); _printf_(" \n"); 412 412 413 413 _printf_(" col_ssize: " << col_ssize << "\n"); 414 414 _printf_(" col_slocaldoflist (" << col_slocaldoflist << "): "); 415 if(col_slocaldoflist) for(i=0;i<col_ssize;i++) _printf_(" " << col_slocaldoflist[i] << "\n"); _printf_(" " << "\n");415 if(col_slocaldoflist) for(i=0;i<col_ssize;i++) _printf_(" " << col_slocaldoflist[i] << "\n"); _printf_(" \n"); 416 416 _printf_(" col_sglobaldoflist (" << col_sglobaldoflist << "): "); 417 if(col_sglobaldoflist) for(i=0;i<col_ssize;i++) _printf_(" " << col_sglobaldoflist[i] << "\n"); _printf_(" " << "\n");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
r15100 r15104 219 219 int i; 220 220 221 _printf_("Element Vector echo: " << "\n");221 _printf_("Element Vector echo:\n"); 222 222 _printf_(" nrows: " << nrows << "\n"); 223 _printf_(" values: " << "\n");223 _printf_(" values:\n"); 224 224 for(i=0;i<nrows;i++){ 225 225 _printf_(setw(4) << right << i << ": " << setw(10) << values[i] << "\n"); … … 228 228 _printf_(" gglobaldoflist (" << gglobaldoflist << "): "); 229 229 if(gglobaldoflist) for(i=0;i<nrows;i++) _printf_(" " << gglobaldoflist[i] ); 230 _printf_(" " << "\n");230 _printf_(" \n"); 231 231 232 232 _printf_(" fsize: " << fsize << "\n"); 233 233 _printf_(" flocaldoflist (" << flocaldoflist << "): "); 234 234 if(flocaldoflist) for(i=0;i<fsize;i++) _printf_(" " << flocaldoflist[i] ); 235 _printf_(" " << "\n");235 _printf_(" \n"); 236 236 _printf_(" fglobaldoflist (" << fglobaldoflist << "): "); 237 237 if(fglobaldoflist) for(i=0;i<fsize;i++) _printf_(" " << fglobaldoflist[i] ); 238 _printf_(" " << "\n");238 _printf_(" \n"); 239 239 } 240 240 /*}}}*/ -
issm/trunk-jpl/src/c/datastructures/DataSet.cpp
r15100 r15104 130 130 if(this==NULL)_error_("trying to echo a NULL dataset"); 131 131 132 _printf0_("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 _printf0_("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
r15100 r15104 133 133 134 134 // if (itag) 135 // _printf0_("tag buffer (length=" << ibuf << "): " << "\n");135 // _printf0_("tag buffer (length=" << ibuf << "):\n"); 136 136 // else if (ifield) 137 // _printf0_("field buffer (length=" << ibuf << "): " << "\n");137 // _printf0_("field buffer (length=" << ibuf << "):\n"); 138 138 // _printf0_(buffer << "\n"); 139 139 … … 199 199 } 200 200 201 // _printf0_("comment buffer (length=" << ibuf << "): " << "\n");201 // _printf0_("comment buffer (length=" << ibuf << "):\n"); 202 202 // _printf0_(buffer << "\n"); 203 203 … … 265 265 266 266 ktokn=strtok(ktagi,"< >"); 267 // _printf0_("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 _printf0_("KMLFileTagName -- string field too short for " << ktag << ". " << "\n");278 _printf0_("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 // _printf0_("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 // _printf0_("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 // _printf0_("KMLFileTagAttrib -- isolo=" << isolo << ". " << "\n");336 // _printf0_("KMLFileTagAttrib -- isolo=" << isolo << ".\n"); 337 337 338 338 return(isolo); … … 368 368 xDelete<char>(kstr); 369 369 370 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pival << ". " << "\n");370 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pival << ".\n"); 371 371 372 372 return(0); … … 402 402 xDelete<char>(kstr); 403 403 404 // _printf0_("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 _printf0_("KMLFileTokenParse -- string field too short for " << ktag << ". " << "\n");442 _printf0_("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 // _printf0_("KMLFileTokenParse -- " << ktag << "=\"" << pstr << "\". " << "\n");465 // _printf0_("KMLFileTokenParse -- " << ktag << "=\"" << pstr << "\".\n"); 466 466 467 467 return(pstr); … … 497 497 xDelete<char>(kstr); 498 498 499 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pfval << ". " << "\n");499 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pfval << ".\n"); 500 500 501 501 return(0); … … 531 531 xDelete<char>(kstr); 532 532 533 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pdval << ". " << "\n");533 // _printf0_("KMLFileTokenParse -- " << ktag << "=" << *pdval << ".\n"); 534 534 535 535 return(0); … … 595 595 xDelete<char>(kstr); 596 596 597 // _printf0_("KMLFileTokenParse -- " << ktag << "=... " << "\n");597 // _printf0_("KMLFileTokenParse -- " << ktag << "=...\n"); 598 598 // for (j=0; j<=i; j++) 599 // _printf0_(" [" << 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 _printf0_("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 // _printf0_("KMLFileTokenParse -- " << ktag << "=... " << "\n");667 // _printf0_("KMLFileTokenParse -- " << ktag << "=...\n"); 668 668 // for (j=0; j<=i; j++) 669 // _printf0_(" [" << 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 _printf0_("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 _printf0_("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 _printf0_("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
r15100 r15104 43 43 for (i=0;i<10-strlen(name);i++) 44 44 if(flag) _printf0_(" "); 45 if(flag) _printf0_(name << ": \"" << value << "\" " << "\n");45 if(flag) _printf0_(name << ": \"" << value << "\"\n"); 46 46 47 47 return; … … 67 67 for (i=0;i<10-strlen(name);i++) 68 68 if(flag) _printf0_(" "); 69 if(flag) _printf0_(name << ": \"" << value << "\" " << "\n");69 if(flag) _printf0_(name << ": \"" << value << "\"\n"); 70 70 71 71 return; -
issm/trunk-jpl/src/c/kml/KML_Container.cpp
r15100 r15104 47 47 KML_Feature::Echo(); 48 48 49 if(flag) _printf0_(" 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) _printf0_(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) _printf0_(indent << " feature: -------- end [" << i << "] -------- " << "\n");82 if(flag) _printf0_(indent << " feature: -------- end [" << i << "] --------\n"); 83 83 } 84 84 else 85 if(flag) _printf0_(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
r15100 r15104 38 38 bool flag=true; 39 39 40 if(flag) _printf0_("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) _printf0_(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
r15100 r15104 60 60 KML_Object::Echo(); 61 61 62 if(flag) _printf0_(" name: \"" << name << "\" " << "\n");62 if(flag) _printf0_(" name: \"" << name << "\"\n"); 63 63 if(flag) _printf0_(" visibility: " << (visibility ? "true" : "false") << "\n"); 64 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");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) _printf0_(indent << " name: \"" << name << "\" " << "\n");92 if(flag) _printf0_(indent << " name: \"" << name << "\"\n"); 93 93 if(flag) _printf0_(indent << " visibility: " << (visibility ? "true" : "false") << "\n"); 94 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");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) _printf0_(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) _printf0_(indent << " style: -------- end [" << i << "] -------- " << "\n");108 if(flag) _printf0_(indent << " style: -------- end [" << i << "] --------\n"); 109 109 } 110 110 else 111 if(flag) _printf0_(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
r15100 r15104 39 39 bool flag=true; 40 40 41 if(flag) _printf0_("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) _printf0_(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
r15100 r15104 38 38 bool flag=true; 39 39 40 if(flag) _printf0_("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) _printf0_(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
r15100 r15104 44 44 void KML_GroundOverlay::Echo(){ 45 45 46 _printf_("KML_GroundOverlay: " << "\n");46 _printf_("KML_GroundOverlay:\n"); 47 47 KML_Overlay::Echo(); 48 48 … … 67 67 char indent2[81]; 68 68 69 _printf_(indent << "KML_GroundOverlay: " << "\n");69 _printf_(indent << "KML_GroundOverlay:\n"); 70 70 KML_Overlay::DeepEcho(indent); 71 71 -
issm/trunk-jpl/src/c/kml/KML_Icon.cpp
r15100 r15104 45 45 bool flag=true; 46 46 47 if(flag) _printf0_("KML_Icon: " << "\n");47 if(flag) _printf0_("KML_Icon:\n"); 48 48 KML_Object::Echo(); 49 49 50 if(flag) _printf0_(" href: \"" << href << "\" " << "\n");51 if(flag) _printf0_(" refmode: \"" << refmode << "\" " << "\n");50 if(flag) _printf0_(" href: \"" << href << "\"\n"); 51 if(flag) _printf0_(" refmode: \"" << refmode << "\"\n"); 52 52 if(flag) _printf0_(" refint: " << refint << "\n"); 53 if(flag) _printf0_(" vrefmode: \"" << vrefmode << "\" " << "\n");53 if(flag) _printf0_(" vrefmode: \"" << vrefmode << "\"\n"); 54 54 if(flag) _printf0_(" vreftime: " << vreftime << "\n"); 55 55 if(flag) _printf0_(" vboundsc: " << vboundsc << "\n"); 56 if(flag) _printf0_(" vformat: \"" << vformat << "\" " << "\n");57 if(flag) _printf0_(" hquery: \"" << hquery << "\" " << "\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) _printf0_(indent << "KML_Icon: " << "\n");77 if(flag) _printf0_(indent << "KML_Icon:\n"); 78 78 KML_Object::DeepEcho(indent); 79 79 80 if(flag) _printf0_(indent << " href: \"" << href << "\" " << "\n");81 if(flag) _printf0_(indent << " refmode: \"" << refmode << "\" " << "\n");80 if(flag) _printf0_(indent << " href: \"" << href << "\"\n"); 81 if(flag) _printf0_(indent << " refmode: \"" << refmode << "\"\n"); 82 82 if(flag) _printf0_(indent << " refint: " << refint << "\n"); 83 if(flag) _printf0_(indent << " vrefmode: \"" << vrefmode << "\" " << "\n");83 if(flag) _printf0_(indent << " vrefmode: \"" << vrefmode << "\"\n"); 84 84 if(flag) _printf0_(indent << " vreftime: " << vreftime << "\n"); 85 85 if(flag) _printf0_(indent << " vboundsc: " << vboundsc << "\n"); 86 if(flag) _printf0_(indent << " vformat: \"" << vformat << "\" " << "\n");87 if(flag) _printf0_(indent << " hquery: \"" << hquery << "\" " << "\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
r15100 r15104 40 40 void KML_LatLonBox::Echo(){ 41 41 42 _printf_("KML_LatLonBox: " << "\n");42 _printf_("KML_LatLonBox:\n"); 43 43 KML_Object::Echo(); 44 44 … … 63 63 void KML_LatLonBox::DeepEcho(const char* indent){ 64 64 65 _printf_(indent << "KML_LatLonBox: " << "\n");65 _printf_(indent << "KML_LatLonBox:\n"); 66 66 KML_Object::DeepEcho(indent); 67 67 -
issm/trunk-jpl/src/c/kml/KML_LineString.cpp
r15100 r15104 46 46 bool flag=true; 47 47 48 if(flag) _printf0_("KML_LineString: " << "\n");48 if(flag) _printf0_("KML_LineString:\n"); 49 49 KML_Geometry::Echo(); 50 50 51 51 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 52 52 if(flag) _printf0_(" tessellate: " << (tessellate ? "true" : "false") << "\n"); 53 if(flag) _printf0_(" altmode: \"" << altmode << "\" " << "\n");54 if(flag) _printf0_(" coords: (ncoord=" << ncoord << ") " << "\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) _printf0_(indent << "KML_LineString: " << "\n");75 if(flag) _printf0_(indent << "KML_LineString:\n"); 76 76 KML_Geometry::DeepEcho(indent); 77 77 78 78 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 79 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");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) _printf0_(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
r15100 r15104 38 38 bool flag=true; 39 39 40 if(flag) _printf0_("KML_LineStyle: " << "\n");40 if(flag) _printf0_("KML_LineStyle:\n"); 41 41 KML_ColorStyle::Echo(); 42 42 … … 61 61 bool flag=true; 62 62 63 if(flag) _printf0_(indent << "KML_LineStyle: " << "\n");63 if(flag) _printf0_(indent << "KML_LineStyle:\n"); 64 64 KML_ColorStyle::DeepEcho(indent); 65 65 -
issm/trunk-jpl/src/c/kml/KML_LinearRing.cpp
r15100 r15104 46 46 bool flag=true; 47 47 48 if(flag) _printf0_("KML_LinearRing: " << "\n");48 if(flag) _printf0_("KML_LinearRing:\n"); 49 49 KML_Geometry::Echo(); 50 50 51 51 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 52 52 if(flag) _printf0_(" tessellate: " << (tessellate ? "true" : "false") << "\n"); 53 if(flag) _printf0_(" altmode: \"" << altmode << "\" " << "\n");54 if(flag) _printf0_(" coords: (ncoord=" << ncoord << ") " << "\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) _printf0_(indent << "KML_LinearRing: " << "\n");75 if(flag) _printf0_(indent << "KML_LinearRing:\n"); 76 76 KML_Geometry::DeepEcho(indent); 77 77 78 78 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 79 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");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)_printf_(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
r15100 r15104 46 46 bool flag=true; 47 47 48 if(flag) _printf0_("KML_Multigeometry: " << "\n");48 if(flag) _printf0_("KML_Multigeometry:\n"); 49 49 KML_Geometry::Echo(); 50 50 51 if(flag) _printf0_(" 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) _printf0_(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) _printf0_(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) _printf0_(indent << " geometry: -------- end [" << i << "] -------- " << "\n");85 if(flag) _printf0_(indent << " geometry: -------- end [" << i << "] --------\n"); 86 86 } 87 87 else 88 if(flag) _printf0_(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
r15100 r15104 66 66 bool flag=true; 67 67 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");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) _printf0_(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) _printf0_(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) _printf0_(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) _printf0_(indent << " kmlobj: -------- end [" << i << "] -------- " << "\n");119 if(flag) _printf0_(indent << " kmlobj: -------- end [" << i << "] --------\n"); 120 120 } 121 121 else 122 if(flag) _printf0_(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 _printf0_("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
r15100 r15104 45 45 46 46 KML_Feature::Echo(); 47 _printf0_(" color: \"" << color << "\" " << "\n");47 _printf0_(" color: \"" << color << "\"\n"); 48 48 _printf0_(" draword: " << draword << "\n"); 49 49 _printf0_(" icon: " << icon << "\n"); -
issm/trunk-jpl/src/c/kml/KML_Placemark.cpp
r15100 r15104 47 47 bool flag=true; 48 48 49 if(flag) _printf0_("KML_Placemark: " << "\n");49 if(flag) _printf0_("KML_Placemark:\n"); 50 50 KML_Feature::Echo(); 51 51 52 if(flag) _printf0_(" 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) _printf0_(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) _printf0_(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) _printf0_(indent << " geometry: -------- end [" << i << "] -------- " << "\n");86 if(flag) _printf0_(indent << " geometry: -------- end [" << i << "] --------\n"); 87 87 } 88 88 else 89 if(flag) _printf0_(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
r15100 r15104 43 43 bool flag=true; 44 44 45 if(flag) _printf0_("KML_Point: " << "\n");45 if(flag) _printf0_("KML_Point:\n"); 46 46 KML_Geometry::Echo(); 47 47 48 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");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) _printf0_(indent << "KML_Point: " << "\n");70 if(flag) _printf0_(indent << "KML_Point:\n"); 71 71 KML_Geometry::DeepEcho(indent); 72 72 73 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");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
r15100 r15104 41 41 bool flag=true; 42 42 43 if(flag) _printf0_("KML_PolyStyle: " << "\n");43 if(flag) _printf0_("KML_PolyStyle:\n"); 44 44 KML_ColorStyle::Echo(); 45 45 … … 65 65 bool flag=true; 66 66 67 if(flag) _printf0_(indent << "KML_PolyStyle: " << "\n");67 if(flag) _printf0_(indent << "KML_PolyStyle:\n"); 68 68 KML_ColorStyle::DeepEcho(indent); 69 69 -
issm/trunk-jpl/src/c/kml/KML_Polygon.cpp
r15100 r15104 52 52 bool flag=true; 53 53 54 if(flag) _printf0_("KML_Polygon: " << "\n");54 if(flag) _printf0_("KML_Polygon:\n"); 55 55 KML_Geometry::Echo(); 56 56 57 57 if(flag) _printf0_(" extrude: " << (extrude ? "true" : "false") << "\n"); 58 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");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) _printf0_(indent << "KML_Polygon: " << "\n");83 if(flag) _printf0_(indent << "KML_Polygon:\n"); 84 84 KML_Geometry::DeepEcho(indent); 85 85 86 86 if(flag) _printf0_(indent << " extrude: " << (extrude ? "true" : "false") << "\n"); 87 87 if(flag) _printf0_(indent << " tessellate: " << (tessellate ? "true" : "false") << "\n"); 88 if(flag) _printf0_(indent << " altmode: \"" << altmode << "\" " << "\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) _printf0_(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) _printf0_(indent << " outer: -------- end [" << i << "] -------- " << "\n");97 if(flag) _printf0_(indent << " outer: -------- end [" << i << "] --------\n"); 98 98 } 99 99 else 100 if(flag) _printf0_(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) _printf0_(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) _printf0_(indent << " inner: -------- end [" << i << "] -------- " << "\n");106 if(flag) _printf0_(indent << " inner: -------- end [" << i << "] --------\n"); 107 107 } 108 108 else 109 if(flag) _printf0_(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
r15100 r15104 68 68 bool flag=true; 69 69 70 if(flag) _printf0_("KML_Style: " << "\n");70 if(flag) _printf0_("KML_Style:\n"); 71 71 KML_StyleSelector::Echo(); 72 72 … … 97 97 bool flag=true; 98 98 99 if(flag) _printf0_(indent << "KML_Style: " << "\n");99 if(flag) _printf0_(indent << "KML_Style:\n"); 100 100 KML_StyleSelector::DeepEcho(indent); 101 101 -
issm/trunk-jpl/src/c/kml/KML_Unknown.cpp
r15100 r15104 40 40 bool flag=true; 41 41 42 if(flag) _printf0_("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) _printf0_(" value: \"" << value << "\" " << "\n");46 if(flag) _printf0_(" value: \"" << value << "\"\n"); 47 47 else 48 if(flag) _printf0_(" 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) _printf0_(indent << "KML_Unknown " << name << ": " << "\n");71 if(flag) _printf0_(indent << "KML_Unknown " << name << ":\n"); 72 72 KML_Object::DeepEcho(indent); 73 73 … … 81 81 while (vtoken=strtok(NULL,nl)) 82 82 if(flag) _printf0_("\n" << indent << " " << vtoken); 83 if(flag) _printf0_("\" " << "\n");83 if(flag) _printf0_("\"\n"); 84 84 85 85 xDelete<char>(valuei); 86 86 } 87 87 else 88 if(flag) _printf0_(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 // _printf0_("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 // _printf0_("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 // _printf0_("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
r15100 r15104 51 51 pfclose(input_fid,binfilename); 52 52 53 _printf0_("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 _printf0_("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 _printf0_("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
r15100 r15104 40 40 41 41 //Step1: generate geometry Gh 42 if (verbosity>0) _printf_("Construction of a mesh from a given geometry " << "\n");43 if (verbosity>1) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" Write Mesh... " << "\n");74 if (verbosity>1) _printf_(" Write Mesh...\n"); 75 75 Th.WriteMesh(bamgmesh_out,bamgopts); 76 if (verbosity>1) _printf_(" 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) _printf_("Anisotropic mesh adaptation " << "\n");89 if (verbosity>1) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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) _printf_(" 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))); … … 192 192 193 193 //Build output 194 if (verbosity>1) _printf_(" Write Mesh... " << "\n");194 if (verbosity>1) _printf_(" Write Mesh...\n"); 195 195 Th.WriteMesh(bamgmesh_out,bamgopts); 196 if (verbosity>1) _printf_(" Write Geometry... " << "\n");196 if (verbosity>1) _printf_(" Write Geometry...\n"); 197 197 Th.Gh.WriteGeometry(bamggeom_out,bamgopts); 198 if (verbosity>1) _printf_(" 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) _printf_(" 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
r15100 r15104 63 63 64 64 if (DEBUG_TRACE > 0) { 65 _printf_("<Entering main> " << "\n");65 _printf_("<Entering main>\n"); 66 66 } 67 67 68 68 if (PRINT_HEADERS) { 69 _printf_("\n Chaco 2.0 " << "\n");70 _printf_(" 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 _printf_(" " << "\n");168 _printf_("\n"); 169 169 smalloc_stats(); 170 170 } … … 174 174 175 175 if (DEBUG_TRACE > 1) { 176 _printf_("<Leaving main> " << "\n");176 _printf_("<Leaving main>\n"); 177 177 } 178 178 -
issm/trunk-jpl/src/c/modules/Chacox/input_parse.cpp
r15100 r15104 37 37 38 38 if (DEBUG_TRACE > 0) { 39 _printf_("<Entering input_parse> " << "\n");39 _printf_("<Entering input_parse>\n"); 40 40 } 41 41 42 42 if (PROMPT) { 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");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]; … … 73 73 else { 74 74 if (PROMPT) { 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");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]; … … 101 101 else if (*global_method == 2) { 102 102 if (PROMPT) { 103 _printf_("Eigensolver: " << "\n");104 _printf_(" (1) Multilevel RQI/Symmlq " << "\n");105 _printf_(" (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]; … … 162 162 else { 163 163 if (PROMPT) { 164 _printf_("Local refinement method: " << "\n");165 _printf_(" (1) Kernighan-Lin " << "\n");166 _printf_(" (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]; … … 181 181 *ndims_tot = nparts[0]; 182 182 if (*ndims_tot < 1) { 183 _printf_(" 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]); … … 220 220 else if (*nprocs <= 7) { 221 221 if (PROMPT) { 222 _printf_("Partitioning dimension: " << "\n");223 _printf_(" (1) Bisection " << "\n");224 _printf_(" (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 _printf_("Partitioning dimension: " << "\n");235 _printf_(" (1) Bisection " << "\n");236 _printf_(" (2) Quadrisection " << "\n");237 _printf_(" (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
r15100 r15104 23 23 parameters->FindParam(&configuration_type,ConfigurationTypeEnum); 24 24 25 if(VerboseMProcessor()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 17 17 18 18 /*Display message*/ 19 if(VerboseModule()) _printf0_(" 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
r15100 r15104 51 51 } 52 52 else if(num_unstable_constraints<=min_mechanical_constraints){ 53 if(VerboseModule()) _printf0_(" 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
r15100 r15104 17 17 int slocalsize; 18 18 19 if(VerboseModule()) _printf0_(" 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
r15100 r15104 53 53 if (!ExpRead(&nprof,&pnvert,&pprofx,&pprofy,&closed,filexp)) 54 54 _error_("Error reading exp file."); 55 _printf0_("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 57 // _printf_("i=" << i << "; nvert=" << pnvert[i] << ", closed=" << closed[i] << "\n"); … … 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 _printf0_("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 _printf0_("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 _printf0_("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 _printf_("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
r15100 r15104 19 19 Vector<IssmDouble>* solution=NULL; 20 20 21 if(VerboseModule()) _printf0_(" 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
r15100 r15104 17 17 Element *element = NULL; 18 18 19 if(VerboseModule()) _printf0_(" Migrating grounding line " << "\n");19 if(VerboseModule()) _printf0_(" Migrating grounding line\n"); 20 20 21 21 /*retrieve parameters: */ -
issm/trunk-jpl/src/c/modules/HoleFillerx/HoleFillerx.cpp
r15100 r15104 268 268 269 269 #ifdef _DEBUG2_ 270 //_printf_(temp << " " << elev << " " << range << " " << "\n");270 //_printf_(temp << " " << elev << " " << range << " \n"); 271 271 #endif 272 272 … … 338 338 #ifdef _DEBUG2_ 339 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");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
r15100 r15104 10 10 11 11 int i; 12 if(VerboseModule()) _printf0_(" 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()) _printf0_(" 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()) _printf0_(" 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
r15100 r15104 87 87 /*launch the thread manager with InterpFromGridToMeshxt as a core: */ 88 88 LaunchThread(InterpFromGridToMeshxt,(void*)&gate,num); 89 _printf_("\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:*/ … … 176 176 break; 177 177 default: 178 _printf_("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
r15100 r15104 99 99 } 100 100 if(debug && my_thread==0) 101 _printf_("\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
r15100 r15104 168 168 } 169 169 if (debug) 170 _printf_("\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
r15100 r15104 142 142 } 143 143 } 144 //if(N_interp>=100) _printf_("\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
r15100 r15104 132 132 } 133 133 if (debug) 134 _printf_("\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
r15100 r15104 45 45 46 46 if (kxml) { 47 _printf0_("XML declaration: " << "\n");47 _printf0_("XML declaration:\n"); 48 48 kxml->DeepEcho(" "); 49 49 delete kxml; 50 50 } 51 51 if (kdtd) { 52 _printf0_("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 _printf_("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
r15100 r15104 80 80 81 81 if (cmap) { 82 _printf0_("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 _printf0_("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 _printf0_("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 _printf_(" 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 _printf0_("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 _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");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 _printf_(" 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 _printf_("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 _printf0_("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 // _printf0_(" " << (i+1) << " tria elements written. " << "\n");351 // _printf0_(" " << (i+1) << " tria elements written.\n"); 352 352 } 353 _printf0_(" " << 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
r15100 r15104 79 79 /* write kml file */ 80 80 81 _printf0_("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 _printf_("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
r15100 r15104 46 46 /* open exp file */ 47 47 48 _printf0_("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 _printf_("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
r15100 r15104 83 83 observations->ObservationList(&x,&y,&data,&nobs); 84 84 85 _printf_("Generation Delaunay Triangulation " << "\n");85 _printf_("Generation Delaunay Triangulation\n"); 86 86 BamgTriangulatex(&index,&nel,x,y,nobs); 87 87 88 _printf_("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 _printf_("\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 _printf_("\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 _printf_("\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 _printf_("\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 } -
issm/trunk-jpl/src/c/modules/Krigingx/pKrigingx.cpp
r15100 r15104 68 68 /*partition loop across threads: */ 69 69 for(int idx=my_rank;idx<n_interp;idx+=num_procs){ 70 _printf0_(" 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 _printf0_(" 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 _printf0_(" 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 _printf0_(" 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 _printf0_(" 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 _printf0_(" 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 _printf0_(" 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 _printf0_(" 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 _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");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
r15100 r15104 17 17 18 18 /*Display message*/ 19 if(VerboseModule()) _printf0_(" 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
r15100 r15104 41 41 SetVerbosityLevel(verbose); 42 42 43 if(VerboseMProcessor()) _printf0_(" starting model processor " << "\n");43 if(VerboseMProcessor()) _printf0_(" starting model processor \n"); 44 44 45 45 for(i=0;i<nummodels;i++){ … … 68 68 CreateDataSets(&elements,&nodes,&vertices,&materials,&constraints,&loads,¶meters,iomodel,rootpath,solution_type,analysis_type,nummodels,i); 69 69 } 70 if(VerboseMProcessor()) _printf0_(" 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
r15100 r15104 70 70 } 71 71 if (my_thread==0) 72 _printf_("\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
r15100 r15104 54 54 55 55 if (itm >= NPDMAX){ 56 _printf_("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 _printf_("'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
r15100 r15104 22 22 bool oldalloc = false; 23 23 24 if(VerboseModule()) _printf0_(" 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
r15100 r15104 17 17 bool oldalloc = false; 18 18 19 if(VerboseModule()) _printf0_(" 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
r15100 r15104 14 14 15 15 /*Display message*/ 16 if(VerboseModule()) _printf0_(" 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
r15100 r15104 295 295 296 296 if (pnpart[i] > 0) 297 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_(,"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 _printf0_("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 _printf_("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
r15100 r15104 283 283 284 284 if (pnpart[i] > 0) 285 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf_("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 _printf0_("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 _printf_("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
r15100 r15104 20 20 Vector<IssmDouble> *uf=NULL; 21 21 22 if(VerboseModule()) _printf0_(" 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
r15100 r15104 5 5 6 6 void printarray(IssmPDouble* array,int lines,int cols){ 7 _printf_(" " << "\n");7 _printf_("\n"); 8 8 for(int i=0;i<lines;i++){ 9 9 _printf_(" [ "); 10 10 for(int j=0;j<cols;j++) _printf_( " " << setw(11) << setprecision (5) << array[i*cols+j]); 11 _printf_(" ] " << "\n");11 _printf_(" ]\n"); 12 12 } 13 _printf_(" " << "\n");13 _printf_("\n"); 14 14 } 15 15 void printsparsity(IssmPDouble* array,int lines,int cols){ 16 16 int count; 17 _printf_(" " << "\n");17 _printf_("\n"); 18 18 for(int i=0;i<lines;i++){ 19 19 _printf_(" [ "); … … 28 28 _printf_(" ] "<<i<<" => "<<count << "\n"); 29 29 } 30 _printf_(" " << "\n");30 _printf_("\n"); 31 31 } 32 32 void printarray(int* array,int lines,int cols){ 33 _printf_(" " << "\n");33 _printf_("\n"); 34 34 for(int i=0;i<lines;i++){ 35 35 _printf_(" [ "); 36 36 for(int j=0;j<cols;j++) _printf_( " " << setw(11) << setprecision (5) << array[i*cols+j]); 37 _printf_(" ] " << "\n");37 _printf_(" ]\n"); 38 38 } 39 _printf_(" " << "\n");39 _printf_("\n"); 40 40 } 41 41 void printarray(bool* array,int lines,int cols){ 42 _printf_(" " << "\n");42 _printf_("\n"); 43 43 for(int i=0;i<lines;i++){ 44 44 _printf_(" [ "); … … 47 47 else _printf_( " 0"); 48 48 } 49 _printf_(" ] " << "\n");49 _printf_(" ]\n"); 50 50 } 51 _printf_(" " << "\n");51 _printf_("\n"); 52 52 } 53 53 void printbinary(int n){ -
issm/trunk-jpl/src/c/shared/Exceptions/Exceptions.cpp
r15100 r15104 47 47 if(num_procs==1){ 48 48 _printf_("\n??? Error in ==> " << file_name.c_str() << ":" << file_line << "\n"); 49 _printf_(function_name.c_str() << " error message: " << what() << "\n " << "\n");49 _printf_(function_name.c_str() << " error message: " << what() << "\n\n"); 50 50 } 51 51 else{ 52 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");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
r15100 r15104 64 64 }\ 65 65 catch (exception& e) {\ 66 _printf_("Standard exception: " << e.what() << "\n " << "\n");\66 _printf_("Standard exception: " << e.what() << "\n\n");\ 67 67 return 0;\ 68 68 }\ 69 69 catch(...){\ 70 _printf_("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
r15100 r15104 114 114 *pdelta= 45; 115 115 *pslat = 70; 116 if(flag) _printf0_("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) _printf0_("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
r15100 r15104 122 122 *pdelta= 45; 123 123 *pslat = 70; 124 if(flag) _printf0_("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) _printf0_("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
r15100 r15104 205 205 pindx[ipiv]++; 206 206 207 // _printf_("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 // _printf_("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 // _printf_("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
r15100 r15104 50 50 if (xIsNan<IssmDouble>(fxmin)) _error_("Function evaluation returned NaN"); 51 51 cout<<setprecision(5); 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");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()) _printf0_(" 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 _printf0_(" "<<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 97 if(VerboseControl()) _printf0_(" optimization terminated: current x satisfies criteria 'cm_jump'=" << cm_jump << "\n"); … … 198 198 } 199 199 else if (iter>=maxiter){ 200 if(VerboseControl()) _printf0_(" 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 } -
issm/trunk-jpl/src/c/shared/Numerics/GaussPoints.cpp
r15100 r15104 1200 1200 // _printf0_("GaussLegendreTria - ngaus=" << *pngaus << "\n"); 1201 1201 // for (i=0; i<*pngaus; i++) 1202 // _printf0_("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; -
issm/trunk-jpl/src/c/shared/Numerics/OptimalSearch.cpp
r15100 r15104 47 47 if (xIsNan<IssmDouble>(fx1)) _error_("Function evaluation returned NaN"); 48 48 cout<<setprecision(5); 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");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 … … 71 71 } 72 72 else if (iter>=maxiter){ 73 if(VerboseControl()) _printf0_(" " << "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/solutionsequences/convergence.cpp
r15100 r15104 30 30 IssmDouble yts; 31 31 32 if(VerboseModule()) _printf0_(" 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 … … 73 73 res=nKUoldF/nF; 74 74 if (xIsNan<IssmDouble>(res)){ 75 _printf0_("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()) _printf0_(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()) _printf0_(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()) _printf0_(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()) _printf0_(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 _printf0_(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()) _printf0_(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()) _printf0_(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 _printf0_(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
r15100 r15104 164 164 if (!xIsNan<IssmDouble>(eps_hyd)){ 165 165 if((ndu_sed/nu_sed)<eps_hyd){ 166 if(VerboseConvergence()) _printf0_(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()) _printf0_(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()) _printf0_(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()) _printf0_(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 _printf0_(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
r15100 r15104 93 93 } 94 94 if(count>=max_nonlinear_iterations){ 95 _printf0_(" 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; -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_nonlinear.cpp
r15100 r15104 90 90 } 91 91 if(count>=max_nonlinear_iterations){ 92 _printf0_(" 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); -
issm/trunk-jpl/src/c/solutionsequences/solutionsequence_stokescoupling_nonlinear.cpp
r15100 r15104 89 89 if(converged==true)break; 90 90 if(count>=max_nonlinear_iterations){ 91 _printf0_(" 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
r15100 r15104 63 63 if (count>=thermal_maxiter){ 64 64 converged=true; 65 _printf0_(" 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
r15100 r15104 88 88 /*object virtual functions definitions:*/ 89 89 void Echo(){ /*{{{*/ 90 _printf_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<") " << "\n");90 _printf_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<")\n"); 91 91 _printf_("bucket type: " << type << "\n"); 92 92 _printf_("num rows: "<<this->m<<" num cols: "<<this->n << "\n"); … … 95 95 int i,j; 96 96 97 _printf_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<") " << "\n");97 _printf_("Bucket echo (cpu #: "<<IssmComm::GetRank()<<")\n"); 98 98 _printf_("bucket type: " << type << "\n"); 99 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 _printf_("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 104 _printf_(" "<<this->idxn[j] << "\n"); 105 105 } 106 _printf_("values: " << "\n");106 _printf_("values: \n"); 107 107 for (j=0;j<this->n;j++){ 108 108 _printf_(" "<<this->values[m*i+j] << "\n"); -
issm/trunk-jpl/src/c/toolkits/issm/IssmDenseMat.h
r15100 r15104 120 120 _printf_(this->matrix[N*i+j] << " "); 121 121 } 122 _printf_(" " << "\n");122 _printf_("\n"); 123 123 } 124 124 } -
issm/trunk-jpl/src/c/toolkits/issm/IssmMpiDenseMat.h
r15100 r15104 148 148 _printf_("row " << j << "\n"); 149 149 for (k=0;k<this->N;k++){ 150 _printf_(this->matrix[j*this->N+k] << " " << "\n");150 _printf_(this->matrix[j*this->N+k] << " \n"); 151 151 } 152 _printf_(" " << "\n");152 _printf_("\n"); 153 153 } 154 154 } -
issm/trunk-jpl/src/c/toolkits/issm/IssmMpiVec.h
r15100 r15104 136 136 _printf_("row " << j << " " << this->vector[j] << "\n"); 137 137 } 138 _printf_(" " << "\n");138 _printf_("\n"); 139 139 } 140 140 MPI_Barrier(IssmComm::GetComm()); -
issm/trunk-jpl/src/c/toolkits/petsc/objects/PetscMat.cpp
r15100 r15104 93 93 MatInfo info; 94 94 MatGetInfo(this->matrix,MAT_GLOBAL_SUM,&info); 95 _printf0_("=========================== Stiffness matrix allocation info =========================== " << "\n");96 _printf0_(" " << "\n");95 _printf0_("=========================== Stiffness matrix allocation info ===========================\n"); 96 _printf0_("\n"); 97 97 _printf0_(" Block size : "<<info.block_size << "\n"); 98 98 _printf0_(" nz_allocated: "<<info.nz_allocated << "\n"); 99 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");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 /*}}}*/
Note:
See TracChangeset
for help on using the changeset viewer.