Skip to content
Snippets Groups Projects
Commit a1e447ef authored by Wuttke, Joachim's avatar Wuttke, Joachim
Browse files

Trying C++ range-based for loop.

Improved table header for 'dz'.
parent c2fe6ba0
No related branches found
No related tags found
No related merge requests found
......@@ -89,21 +89,19 @@ void NEdif::showSpectra()
NOlm::IterateO fiter;
while( POlo f = fiter() ) {
cout << "file " << fiter.k() << ":\n";
printf(" ");
POlc fc = P2C( f );
POld fd = P2D( f );
for ( int iz=0; iz<f->nZ(); iz++ ) {
printf(" %12s", f->ZCo[iz].str_compact().c_str());
}
printf( "%8s %38s\n", "#pts.", "x" );
printf( "%3s ", "j" );
for ( auto zco: f->ZCo )
printf(" %12.12s", zco.str_compact().c_str());
printf( " %12s (%4s) %12s\n", "x_inf", "#pts", "x_sup" );
if( fd ) {
for ( int j=0; j<f->nJ(); j++ ) {
printf( "%3u%c", j,
f->V[j]->frozen ? '/' : ' ' );
for ( int iz=0; iz<f->nZ(); iz++ ) {
printf( " %12.6g", f->V[j]->z[iz] );
}
printf( "%12.6g (%4u) %12.6g\n",
for ( auto z: f->V[j]->z )
printf( " %12.6g", z );
printf( " %12.6g (%4u) %12.6g\n",
fd->VS(j)->x[0], fd->nPts(j),
fd->VS(j)->x[fd->nPts(j)-1] );
}
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment