, dof_handler(triangulation)
, mapping(mapping_degree)
{
- std::cout << "Using mapping with degree " << mapping_degree << ":"
+ std::cout << "Using mapping with degree " << mapping_degree << ':'
<< std::endl
<< "============================" << std::endl;
}
void AdvectionProblem<dim>::output_results(const unsigned int cycle) const
{
const std::string filename = "solution-" + std::to_string(cycle) + ".vtk";
- std::cout << " Writing solution to <" << filename << ">" << std::endl;
+ std::cout << " Writing solution to <" << filename << '>' << std::endl;
std::ofstream output(filename);
DataOut<dim> data_out;
// First write the grid in eps format.
{
const std::string filename = "grid-" + std::to_string(cycle) + ".eps";
- deallog << "Writing grid to <" << filename << ">" << std::endl;
+ deallog << "Writing grid to <" << filename << '>' << std::endl;
std::ofstream eps_output(filename);
GridOut grid_out;
// Then output the solution in gnuplot format.
{
const std::string filename = "sol-" + std::to_string(cycle) + ".gnuplot";
- deallog << "Writing solution to <" << filename << ">" << std::endl;
+ deallog << "Writing solution to <" << filename << '>' << std::endl;
std::ofstream gnuplot_output(filename);
DataOut<dim> data_out;
// iteration. Note that the <code>std::flush</code> is needed to have
// the text actually appear on the screen, rather than only in some
// buffer that is only flushed the next time we issue an end-line.
- std::cout << step << " " << std::flush;
+ std::cout << step << ' ' << std::flush;
// Now solve the problem on the present grid, and run the evaluators
// on it. The long type name of iterators into the list is a little
pcout << (p == 0 ? ' ' : '+')
<< (DoFTools::count_dofs_with_subdomain_association(dof_handler,
p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
assemble_system();
const unsigned int n_iterations = solve();
pcout << (p == 0 ? ' ' : '+')
<< (GridTools::count_cells_with_subdomain_association(
triangulation, p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
setup_system();
pcout << (p == 0 ? ' ' : '+')
<< (DoFTools::count_dofs_with_subdomain_association(dof_handler,
p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
solve_timestep();
}
detector_data << time;
for (unsigned int i = 0; i < detector_locations.size(); ++i)
- detector_data << " "
+ detector_data << ' '
<< VectorTools::point_value(dof_handler,
solution_p,
detector_locations[i])
- << " ";
+ << ' ';
detector_data << std::endl;
old_solution_p = solution_p;
++iteration;
}
while ((error > parameters.convergence_tolerance) && (iteration < 500));
- convergence_table_stream << cycle << " " << energy_groups[0]->n_dofs()
- << " " << energy_groups[1]->n_dofs() << " "
- << k_eff << " "
+ convergence_table_stream << cycle << ' ' << energy_groups[0]->n_dofs()
+ << ' ' << energy_groups[1]->n_dofs() << ' '
+ << k_eff << ' '
<< energy_groups[0]->solution.linfty_norm() /
energy_groups[1]->solution.linfty_norm()
<< '\n';
double,
<< " The time step " << arg1 << " is out of range."
<< std::endl
- << " The permitted range is (0," << arg2 << "]");
+ << " The permitted range is (0," << arg2 << ']');
void create_triangulation_and_dofs(const unsigned int n_refines);
max_spurious_eigenvalue = std::max(max_spurious_eigenvalue, ev);
}
- std::cout << " Spurious eigenvalues are all in the interval "
- << "[" << min_spurious_eigenvalue << ","
- << max_spurious_eigenvalue << "]" << std::endl;
+ std::cout << " Spurious eigenvalues are all in the interval " << '['
+ << min_spurious_eigenvalue << ',' << max_spurious_eigenvalue
+ << ']' << std::endl;
}
constraints.close();
setup_time += time.wall_time();
time_details << "Distribute DoFs & B.C. (CPU/wall) " << time.cpu_time()
- << "s/" << time.wall_time() << "s" << std::endl;
+ << "s/" << time.wall_time() << 's' << std::endl;
time.restart();
{
setup_time += time.wall_time();
time_details << "Setup matrix-free system (CPU/wall) " << time.cpu_time()
- << "s/" << time.wall_time() << "s" << std::endl;
+ << "s/" << time.wall_time() << 's' << std::endl;
time.restart();
// Next, initialize the matrices for the multigrid method on all the
}
setup_time += time.wall_time();
time_details << "Setup matrix-free levels (CPU/wall) " << time.cpu_time()
- << "s/" << time.wall_time() << "s" << std::endl;
+ << "s/" << time.wall_time() << 's' << std::endl;
}
setup_time += time.wall_time();
time_details << "Assemble right hand side (CPU/wall) " << time.cpu_time()
- << "s/" << time.wall_time() << "s" << std::endl;
+ << "s/" << time.wall_time() << 's' << std::endl;
}
pcout << "Vectorization over " << n_vect_doubles
<< " doubles = " << n_vect_bits << " bits ("
- << Utilities::System::get_current_vectorization_level() << ")"
+ << Utilities::System::get_current_vectorization_level() << ')'
<< std::endl;
}
hy = 1.0 / (ny - 1);
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
- std::cout << "Read obstacle from file <" << name << ">" << std::endl
+ std::cout << "Read obstacle from file <" << name << '>' << std::endl
<< "Resolution of the scanned obstacle picture: " << nx
<< " x " << ny << std::endl;
}
!transfer_solution)
constitutive_law.set_sigma_0(correct_sigma);
- pcout << " " << std::endl;
+ pcout << ' ' << std::endl;
pcout << " Newton iteration " << newton_step << std::endl;
pcout << " Updating active set..." << std::endl;
Utilities::System::MemoryStats stats;
Utilities::System::get_memory_stats(stats);
pcout << "Peak virtual memory used, resident in kB: " << stats.VmSize
- << " " << stats.VmRSS << std::endl;
+ << ' ' << stats.VmRSS << std::endl;
if (base_mesh == "box")
output_contact_force();
{
std::cout << std::endl
<< "Timestep " << time.get_timestep() << " @ " << time.current()
- << "s" << std::endl;
+ << 's' << std::endl;
BlockVector<double> newton_update(dofs_per_block);
unsigned int newton_iteration = 0;
for (; newton_iteration < parameters.max_iterations_NR; ++newton_iteration)
{
- std::cout << " " << std::setw(2) << newton_iteration << " "
+ std::cout << ' ' << std::setw(2) << newton_iteration << ' '
<< std::flush;
// We construct the linear system, but hold off on solving it
static const unsigned int l_width = 150;
for (unsigned int i = 0; i < l_width; ++i)
- std::cout << "_";
+ std::cout << '_';
std::cout << std::endl;
std::cout << " SOLVER STEP "
<< " NU_U NU_P NU_J " << std::endl;
for (unsigned int i = 0; i < l_width; ++i)
- std::cout << "_";
+ std::cout << '_';
std::cout << std::endl;
}
static const unsigned int l_width = 150;
for (unsigned int i = 0; i < l_width; ++i)
- std::cout << "_";
+ std::cout << '_';
std::cout << std::endl;
const std::pair<double, double> error_dil = get_error_dilation();
const unsigned int n_vect_bits = 8 * sizeof(double) * n_vect_doubles;
pcout << "Vectorization over " << n_vect_doubles
<< " doubles = " << n_vect_bits << " bits ("
- << Utilities::System::get_current_vectorization_level() << ")"
+ << Utilities::System::get_current_vectorization_level() << ')'
<< std::endl
<< std::endl;
}
<< " Performed " << timestep_number << " time steps." << std::endl;
pcout << " Average wallclock time per time step: "
- << wtime / timestep_number << "s" << std::endl;
+ << wtime / timestep_number << 's' << std::endl;
pcout << " Spent " << output_time << "s on output and " << wtime
<< "s on computations." << std::endl;
for (const std::pair<const types::boundary_id, unsigned int> &pair :
boundary_count)
{
- std::cout << pair.first << "(" << pair.second << " times) ";
+ std::cout << pair.first << '(' << pair.second << " times) ";
}
std::cout << std::endl;
}
f << p(dim - 1);
for (int j = 0; j < dim; ++j)
- f << " " << tmp_vector(j);
+ f << ' ' << tmp_vector(j);
f << std::endl;
}
}
timer.stop();
- pcout << "Time for setup+solve (CPU/Wall) " << timer.cpu_time() << "/"
+ pcout << "Time for setup+solve (CPU/Wall) " << timer.cpu_time() << '/'
<< timer.wall_time() << " s" << std::endl;
pcout << std::endl;
pcout << "Running with "
<< Utilities::MPI::n_mpi_processes(MPI_COMM_WORLD)
<< " MPI processes" << std::endl;
- pcout << "Vectorization over " << n_vect_number << " "
+ pcout << "Vectorization over " << n_vect_number << ' '
<< (std::is_same<Number, double>::value ? "doubles" : "floats")
<< " = " << n_vect_bits << " bits ("
- << Utilities::System::get_current_vectorization_level() << ")"
+ << Utilities::System::get_current_vectorization_level() << ')'
<< std::endl;
}
"interpolated-particles" :
"analytical-particles");
- pcout << "Writing particle output file: " << file_name << "-" << it
+ pcout << "Writing particle output file: " << file_name << '-' << it
<< std::endl;
particle_output.write_vtu_with_pvtu_record(
const std::string output_folder(par.output_directory);
const std::string file_name("background");
- pcout << "Writing background field file: " << file_name << "-" << it
+ pcout << "Writing background field file: " << file_name << '-' << it
<< std::endl;
data_out.write_vtu_with_pvtu_record(
typename MainLoop<dim>::vector_type
MainLoop<dim>::interpolate_initial_values(const double t)
{
- pcout << "MainLoop<dim>::interpolate_initial_values(t = " << t << ")"
+ pcout << "MainLoop<dim>::interpolate_initial_values(t = " << t << ')'
<< std::endl;
TimerOutput::Scope scope(computing_timer,
"main_loop - setup scratch space");
const double t,
const unsigned int cycle)
{
- pcout << "MainLoop<dim>::output(t = " << t << ")" << std::endl;
+ pcout << "MainLoop<dim>::output(t = " << t << ')' << std::endl;
// If the asynchronous writeback option is set we launch a background
// thread performing all the slow IO to disc. In that case we have to
pcout << " Frequencies of poly. degrees:";
for (unsigned int i = 0; i < fe_collection.size(); ++i)
if (n_fe_indices[i] > 0)
- pcout << ' ' << fe_collection[i].degree << ":" << n_fe_indices[i];
+ pcout << ' ' << fe_collection[i].degree << ':' << n_fe_indices[i];
pcout << std::endl;
}
}
pcout << "Running with "
<< Utilities::MPI::n_mpi_processes(MPI_COMM_WORLD)
<< " MPI processes" << std::endl;
- pcout << "Vectorization over " << n_vect_number << " "
+ pcout << "Vectorization over " << n_vect_number << ' '
<< (std::is_same<Number, double>::value ? "doubles" : "floats")
<< " = " << n_vect_bits << " bits ("
- << Utilities::System::get_current_vectorization_level() << ")"
+ << Utilities::System::get_current_vectorization_level() << ')'
<< std::endl;
}
if (is_right_handed_cell)
{
/* Write one side at z = 0. */
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << -1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << -1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(0)[0] << " "
- << cell->vertex(0)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(0)[0] << ' '
+ << cell->vertex(0)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << 0.000000e+00 << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << -1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << -1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(3)[0] << " "
- << cell->vertex(3)[1] << " " << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(3)[0] << ' '
+ << cell->vertex(3)[1] << ' ' << 0.000000e+00 << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
/* Write one side at z = height. */
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << 1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << 1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(0)[0] << " "
- << cell->vertex(0)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << height << '\n';
+ stlfile << " vertex " << cell->vertex(0)[0] << ' '
+ << cell->vertex(0)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << height << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << 1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << 1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(3)[0] << " "
- << cell->vertex(3)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << height << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(3)[0] << ' '
+ << cell->vertex(3)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << height << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
}
else /* The cell has a left-handed set up */
{
/* Write one side at z = 0. */
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << -1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << -1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(0)[0] << " "
- << cell->vertex(0)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(0)[0] << ' '
+ << cell->vertex(0)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << 0.000000e+00 << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << -1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << -1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(3)[0] << " "
- << cell->vertex(3)[1] << " " << 0.000000e+00 << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(3)[0] << ' '
+ << cell->vertex(3)[1] << ' ' << 0.000000e+00 << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << 0.000000e+00 << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
/* Write one side at z = height. */
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << 1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << 1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(0)[0] << " "
- << cell->vertex(0)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << height << '\n';
+ stlfile << " vertex " << cell->vertex(0)[0] << ' '
+ << cell->vertex(0)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << height << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
- stlfile << " facet normal " << 0.000000e+00 << " "
- << 0.000000e+00 << " " << 1.000000e+00 << '\n';
+ stlfile << " facet normal " << 0.000000e+00 << ' '
+ << 0.000000e+00 << ' ' << 1.000000e+00 << '\n';
stlfile << " outer loop\n";
- stlfile << " vertex " << cell->vertex(1)[0] << " "
- << cell->vertex(1)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(2)[0] << " "
- << cell->vertex(2)[1] << " " << height << '\n';
- stlfile << " vertex " << cell->vertex(3)[0] << " "
- << cell->vertex(3)[1] << " " << height << '\n';
+ stlfile << " vertex " << cell->vertex(1)[0] << ' '
+ << cell->vertex(1)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(2)[0] << ' '
+ << cell->vertex(2)[1] << ' ' << height << '\n';
+ stlfile << " vertex " << cell->vertex(3)[0] << ' '
+ << cell->vertex(3)[1] << ' ' << height << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
}
0)
{
stlfile << " facet normal "
- << normal_vector[0] / normal_norm << " "
- << normal_vector[1] / normal_norm << " "
+ << normal_vector[0] / normal_norm << ' '
+ << normal_vector[1] / normal_norm << ' '
<< 0.000000e+00 << '\n';
stlfile << " outer loop\n";
stlfile << " vertex " << face->vertex(0)[0]
- << " " << face->vertex(0)[1] << " "
+ << ' ' << face->vertex(0)[1] << ' '
<< 0.000000e+00 << '\n';
stlfile << " vertex " << face->vertex(0)[0]
- << " " << face->vertex(0)[1] << " " << height
+ << ' ' << face->vertex(0)[1] << ' ' << height
<< '\n';
stlfile << " vertex " << face->vertex(1)[0]
- << " " << face->vertex(1)[1] << " "
+ << ' ' << face->vertex(1)[1] << ' '
<< 0.000000e+00 << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
stlfile << " facet normal "
- << normal_vector[0] / normal_norm << " "
- << normal_vector[1] / normal_norm << " "
+ << normal_vector[0] / normal_norm << ' '
+ << normal_vector[1] / normal_norm << ' '
<< 0.000000e+00 << '\n';
stlfile << " outer loop\n";
stlfile << " vertex " << face->vertex(0)[0]
- << " " << face->vertex(0)[1] << " " << height
+ << ' ' << face->vertex(0)[1] << ' ' << height
<< '\n';
stlfile << " vertex " << face->vertex(1)[0]
- << " " << face->vertex(1)[1] << " " << height
+ << ' ' << face->vertex(1)[1] << ' ' << height
<< '\n';
stlfile << " vertex " << face->vertex(1)[0]
- << " " << face->vertex(1)[1] << " "
+ << ' ' << face->vertex(1)[1] << ' '
<< 0.000000e+00 << '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
else
{
stlfile << " facet normal "
- << normal_vector[0] / normal_norm << " "
- << normal_vector[1] / normal_norm << " "
+ << normal_vector[0] / normal_norm << ' '
+ << normal_vector[1] / normal_norm << ' '
<< 0.000000e+00 << '\n';
stlfile << " outer loop\n";
stlfile << " vertex " << face->vertex(0)[0]
- << " " << face->vertex(0)[1] << " "
+ << ' ' << face->vertex(0)[1] << ' '
<< 0.000000e+00 << '\n';
stlfile << " vertex " << face->vertex(1)[0]
- << " " << face->vertex(1)[1] << " "
+ << ' ' << face->vertex(1)[1] << ' '
<< 0.000000e+00 << '\n';
stlfile << " vertex " << face->vertex(0)[0]
- << " " << face->vertex(0)[1] << " " << height
+ << ' ' << face->vertex(0)[1] << ' ' << height
<< '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
stlfile << " facet normal "
- << normal_vector[0] / normal_norm << " "
- << normal_vector[1] / normal_norm << " "
+ << normal_vector[0] / normal_norm << ' '
+ << normal_vector[1] / normal_norm << ' '
<< 0.000000e+00 << '\n';
stlfile << " outer loop\n";
stlfile << " vertex " << face->vertex(0)[0]
- << " " << face->vertex(0)[1] << " " << height
+ << ' ' << face->vertex(0)[1] << ' ' << height
<< '\n';
stlfile << " vertex " << face->vertex(1)[0]
- << " " << face->vertex(1)[1] << " "
+ << ' ' << face->vertex(1)[1] << ' '
<< 0.000000e+00 << '\n';
stlfile << " vertex " << face->vertex(1)[0]
- << " " << face->vertex(1)[1] << " " << height
+ << ' ' << face->vertex(1)[1] << ' ' << height
<< '\n';
stlfile << " endloop\n";
stlfile << " endfacet\n";
int,
int,
<< "You are trying to execute functionality that is "
- << "impossible in dimensions <" << arg1 << "," << arg2
+ << "impossible in dimensions <" << arg1 << ',' << arg2
<< "> or simply does not make any sense.");
std::size_t,
std::size_t,
std::size_t,
- << "Index " << arg1 << " is not in the half-open range [" << arg2 << ","
+ << "Index " << arg1 << " is not in the half-open range [" << arg2 << ','
<< arg3 << ")."
<< (arg2 == arg3 ?
" In the current case, this half-open range is in fact empty, "
T,
T,
T,
- << "Index " << arg1 << " is not in the half-open range [" << arg2 << ","
+ << "Index " << arg1 << " is not in the half-open range [" << arg2 << ','
<< arg3 << ")."
<< (arg2 == arg3 ?
" In the current case, this half-open range is in fact empty, "
double,
<< "Spline function can not be evaluated outside of the interpolation range: "
<< std::endl
- << arg1 << " is not in [" << arg2 << ";" << arg3 << "].");
+ << arg1 << " is not in [" << arg2 << ';' << arg3 << "].");
/**
* The cubic spline function using GNU Scientific Library.
* const double c = vector_function.value(point, 1);
*
* // Output the evaluated function
- * deallog << "Function '" << expressions[0] << "," << expressions[1] << "'"
+ * deallog << "Function '" << expressions[0] << ',' << expressions[1] << "'"
* << " at " << point
* << " is " << result << std::endl;
* @endcode
IndexSet::print(StreamType &out) const
{
compress();
- out << "{";
+ out << '{';
std::vector<Range>::const_iterator p;
for (p = ranges.begin(); p != ranges.end(); ++p)
{
if (p->end - p->begin == 1)
out << p->begin;
else
- out << "[" << p->begin << "," << p->end - 1 << "]";
+ out << '[' << p->begin << ',' << p->end - 1 << ']';
if (p != --ranges.end())
out << ", ";
}
- out << "}" << std::endl;
+ out << '}' << std::endl;
}
const std::array<unsigned int, dim> ix = compute_index(i);
out << i << "\t";
for (unsigned int d = 0; d < dim; ++d)
- out << ix[d] << " ";
+ out << ix[d] << ' ';
out << std::endl;
}
}
size_type,
size_type,
<< "Index " << N - P + 1 << "has a value of " << arg1
- << " but needs to be in the range [" << arg2 << "," << arg3
+ << " but needs to be in the range [" << arg2 << ',' << arg3
<< "[.");
private:
*/
DeclException1(ExcUndefinedTexFormat,
std::string,
- << "<" << arg1 << "> is not a tex column format. Use "
+ << '<' << arg1 << "> is not a tex column format. Use "
<< "'l', 'c', or 'r' to indicate left, centered, or "
<< "right aligned text.");
//@}
* << " @ " << point
* << " is: "
* << std::endl
- * << result[0][0] << " " << result[0][1] << std::endl
- * << result[1][0] << " " << result[1][1]
+ * << result[0][0] << ' ' << result[0][1] << std::endl
+ * << result[1][0] << ' ' << result[1][1]
* << std::endl;
* @endcode
*
* << "'-' with labels point pt 2 offset 1,1"
* << std::endl;
* GridOut().write_gnuplot (triangulation, out);
- * out << "e" << std::endl;
+ * out << 'e' << std::endl;
*
* std::map<types::global_dof_index, Point<dim> > support_points;
* DoFTools::map_dofs_to_support_points (MappingQ1<dim>(),
* support_points);
* DoFTools::write_gnuplot_dof_support_point_info(out,
* support_points);
- * out << "e" << std::endl;
+ * out << 'e' << std::endl;
* @endcode
* and from within gnuplot execute the following command:
* @code
* << "'-' with labels point pt 2 offset 1,1 notitle"
* << std::endl;
* GridOut().write_gnuplot (triangulation, out);
- * out << "e" << std::endl;
+ * out << 'e' << std::endl;
*
* std::map<types::global_dof_index, Point<dim> > support_points;
* DoFTools::map_dofs_to_support_points (MappingQ1<dim>(),
* support_points);
* DoFTools::write_gnuplot_dof_support_point_info(out,
* support_points);
- * out << "e" << std::endl;
+ * out << 'e' << std::endl;
* @endcode
*/
template <int spacedim>
DeclException2(ExcWrongInterfaceMatrixSize,
int,
int,
- << "The interface matrix has a size of " << arg1 << "x" << arg2
+ << "The interface matrix has a size of " << arg1 << 'x' << arg2
<< ", which is not reasonable for the current element "
"in the present dimension.");
/**
FE_DGVector<PolynomialType, dim, spacedim>::get_name() const
{
std::ostringstream namebuf;
- namebuf << "FE_DGVector_" << this->poly_space->name() << "<" << dim << ">("
- << this->degree - 1 << ")";
+ namebuf << "FE_DGVector_" << this->poly_space->name() << '<' << dim << ">("
+ << this->degree - 1 << ')';
return namebuf.str();
}
int,
int,
int,
- << "This is a " << arg1 << "x" << arg2 << " matrix, "
- << "but should be a " << arg3 << "x" << arg4 << " matrix.");
+ << "This is a " << arg1 << 'x' << arg2 << " matrix, "
+ << "but should be a " << arg3 << 'x' << arg4 << " matrix.");
/**
* Exception thrown if an embedding matrix was computed inaccurately.
virtual void
print_info(std::ostream &out) const override
{
- out << "[";
+ out << '[';
const unsigned int n_vertices = entity_type.n_vertices();
{
out << vertices_0[i];
if (i + 1 != n_vertices)
- out << ",";
+ out << ',';
}
out << "] is not a permutation of [";
{
out << vertices_1[i];
if (i + 1 != n_vertices)
- out << ",";
+ out << ',';
}
out << "]." << std::endl;
if (line.entries.size() > 0)
{
for (const std::pair<size_type, number> &entry : line.entries)
- out << " " << line.index << " " << entry.first << ": "
+ out << " " << line.index << ' ' << entry.first << ": "
<< entry.second << '\n';
// print out inhomogeneity.
else
out << " " << lines[i].index << '\n';
}
- out << "}" << std::endl;
+ out << '}' << std::endl;
}
for (unsigned int col = 0; col < n_block_cols(); ++col)
{
if (!alternative_output)
- out << "Block (" << row << ", " << col << ")" << std::endl;
+ out << "Block (" << row << ", " << col << ')' << std::endl;
block(row, col).print(out, alternative_output);
}
for (size_type r = 0; r < this->n_block_rows(); ++r)
for (size_type c = 0; c < this->n_block_cols(); ++c)
{
- out << "Component (" << r << "," << c << ")" << std::endl;
+ out << "Component (" << r << ',' << c << ')' << std::endl;
this->block(r, c).print_formatted(
out, precision, scientific, width, zero_string, denominator);
}
if (across)
out << ' ' << i << ',' << cols[j] << ':' << val[j];
else
- out << "(" << i << "," << cols[j] << ") " << val[j] << std::endl;
+ out << '(' << i << ',' << cols[j] << ") " << val[j] << std::endl;
}
}
if (across)
<< "You tried to access element " << arg1
<< " of a distributed vector, but this element is not "
<< "stored on the current processor. Note: The range of "
- << "locally owned elements is [" << arg2 << "," << arg3
+ << "locally owned elements is [" << arg2 << ',' << arg3
<< "], and there are " << arg4 << " ghost elements "
<< "that this vector can access."
<< "\n\n"
out << '(' << partitioner->ghost_indices().nth_index_in_set(i)
<< '/'
<< stored_elements[partitioner->locally_owned_size() + i]
- << ")" << std::endl;
+ << ')' << std::endl;
out << std::endl;
}
out << std::flush;
int,
<< "You tried to access element " << arg1
<< " of a distributed vector, but only elements in range [" << arg2
- << "," << arg3 << "] are stored locally and can be accessed."
+ << ',' << arg3 << "] are stored locally and can be accessed."
<< "\n\n"
<< "A common source for this kind of problem is that you "
<< "are passing a 'fully distributed' vector into a function "
out << std::endl;
unsigned int i = 0;
for (const auto idx : this->stored_elements)
- out << "[" << idx << "]: " << values[i++] << '\n';
+ out << '[' << idx << "]: " << values[i++] << '\n';
out << std::flush;
AssertThrow(out, ExcIO());
if (across)
out << ' ' << i << ',' << cols->colnums[j] << ':' << val[j];
else
- out << "(" << i << "," << cols->colnums[j] << ") " << val[j]
+ out << '(' << i << ',' << cols->colnums[j] << ") " << val[j]
<< std::endl;
}
}
DeclException2(ExcDecompositionNotStable,
int,
double,
- << "The diagonal element (" << arg1 << "," << arg1 << ") is "
+ << "The diagonal element (" << arg1 << ',' << arg1 << ") is "
<< arg2 << ", but must be positive");
//@}
size_type,
size_type,
size_type,
- << "You tried to access element (" << arg1 << "/" << arg2
- << ")"
+ << "You tried to access element (" << arg1 << '/' << arg2
+ << ')'
<< " of a distributed matrix, but only rows in range ["
- << arg3 << "," << arg4
+ << arg3 << ',' << arg4
<< "] are stored locally and can be accessed.");
/**
DeclException2(ExcAccessToNonPresentElement,
size_type,
size_type,
- << "You tried to access element (" << arg1 << "/" << arg2
- << ")"
- << " of a sparse matrix, but it appears to not"
+ << "You tried to access element (" << arg1 << '/' << arg2
+ << ')' << " of a sparse matrix, but it appears to not"
<< " exist in the Trilinos sparsity pattern.");
//@}
size_type,
size_type,
size_type,
- << "You tried to access element (" << arg1 << "/" << arg2
- << ")"
+ << "You tried to access element (" << arg1 << '/' << arg2
+ << ')'
<< " of a distributed matrix, but only rows in range ["
- << arg3 << "," << arg4
+ << arg3 << ',' << arg4
<< "] are stored locally and can be accessed.");
/**
DeclException2(ExcAccessToNonPresentElement,
size_type,
size_type,
- << "You tried to access element (" << arg1 << "/" << arg2
- << ")"
- << " of a sparse matrix, but it appears to not"
+ << "You tried to access element (" << arg1 << '/' << arg2
+ << ')' << " of a sparse matrix, but it appears to not"
<< " exist in the Trilinos sparsity pattern.");
//@}
private:
<< " of a distributed vector, but this element is not stored "
<< "on the current processor. Note: There are " << arg2
<< " elements stored "
- << "on the current processor from within the range [" << arg3 << ","
+ << "on the current processor from within the range [" << arg3 << ','
<< arg4 << "] but Trilinos vectors need not store contiguous "
<< "ranges on each processor, and not every element in "
<< "this range may in fact be stored locally."
for (unsigned int j = 0; j < con_it->first; ++j, ++index)
{
Assert(glob_indices + index != end_row, ExcInternalError());
- out << glob_indices[index] << " ";
+ out << glob_indices[index] << ' ';
}
out << "[ ";
k++, index++)
{
Assert(glob_indices + index != end_row, ExcInternalError());
- out << glob_indices[index] << "/" << constraint_pool_data[k]
- << " ";
+ out << glob_indices[index] << '/' << constraint_pool_data[k]
+ << ' ';
}
out << "] ";
}
glob_indices += index;
for (; glob_indices != end_row; ++glob_indices)
- out << *glob_indices << " ";
+ out << *glob_indices << ' ';
out << std::endl;
}
}
os << "M: " << M1.size() << " face " << M2.size() << std::endl;
for (unsigned int i = 0; i < M1.size(); ++i)
{
- os << " " << M1[i].row << "," << M1[i].column << " "
+ os << " " << M1[i].row << ',' << M1[i].column << ' '
<< M1[i].matrix.m() << 'x' << M1[i].matrix.n();
if (i < M2.size())
- os << " face " << M2[i].row << "," << M2[i].column << " "
+ os << " face " << M2[i].row << ',' << M2[i].column << ' '
<< M2[i].matrix.m() << 'x' << M2[i].matrix.n();
os << std::endl;
}
#ifdef DEBUG_OUTPUT
ierr = MPI_Barrier(MPI_COMM_WORLD);
AssertThrowMPI(ierr);
- std::cout << "copy_to_mg dst " << level << " " << dst_level.l2_norm()
+ std::cout << "copy_to_mg dst " << level << ' ' << dst_level.l2_norm()
<< std::endl;
#endif
}
#ifdef DEBUG_OUTPUT
int ierr = MPI_Barrier(MPI_COMM_WORLD);
AssertThrowMPI(ierr);
- std::cout << "copy_from_mg src " << level << " " << src[level].l2_norm()
+ std::cout << "copy_from_mg src " << level << ' ' << src[level].l2_norm()
<< std::endl;
ierr = MPI_Barrier(MPI_COMM_WORLD);
AssertThrowMPI(ierr);
dst.compress(VectorOperation::insert);
ierr = MPI_Barrier(MPI_COMM_WORLD);
AssertThrowMPI(ierr);
- std::cout << "copy_from_mg level=" << level << " " << dst.l2_norm()
+ std::cout << "copy_from_mg level=" << level << ' ' << dst.l2_norm()
<< std::endl;
}
#endif
if (debug_output)
deallog << "Bracketing phase: " << i << std::endl
- << ai << " " << fi << " " << gi << " " << w1(ai, fi) << " "
- << w2(gi) << " " << f_min << std::endl;
+ << ai << ' ' << fi << ' ' << gi << ' ' << w1(ai, fi) << ' '
+ << w2(gi) << ' ' << f_min << std::endl;
// first check if we can stop bracketing or the whole line search:
if (fi <= f_min || ai == a_max)
if (debug_output)
deallog << "Sectioning phase: " << i << std::endl
- << a_lo << " " << f_lo << " " << g_lo << " " << w1(a_lo, f_lo)
- << " " << w2(g_lo) << std::endl
- << a_hi << " " << f_hi << " " << g_hi << " " << w1(a_hi, f_hi)
- << " " << w2(g_hi) << std::endl
- << ai << " " << fi << " " << gi << " " << w1(ai, fi) << " "
+ << a_lo << ' ' << f_lo << ' ' << g_lo << ' ' << w1(a_lo, f_lo)
+ << ' ' << w2(g_lo) << std::endl
+ << a_hi << ' ' << f_hi << ' ' << g_hi << ' ' << w1(a_hi, f_hi)
+ << ' ' << w2(g_hi) << std::endl
+ << ai << ' ' << fi << ' ' << gi << ' ' << w1(ai, fi) << ' '
<< w2(gi) << std::endl;
if (!w1(ai, fi) || fi >= f_lo)
int,
int,
<< "The number of rows in the input matrix is " << arg1
- << ", but needs to be either " << arg2 << "," << arg3
+ << ", but needs to be either " << arg2 << ',' << arg3
<< ", or " << arg4 << '.');
int,
int,
<< "The number of columns in the input matrix is " << arg1
- << ", but needs to be either " << arg2 << "," << arg3
+ << ", but needs to be either " << arg2 << ',' << arg3
<< ", or " << arg4 << '.');
{
std::cout << std::endl
<< "Timestep " << time.get_timestep() << " @ " << time.current()
- << "s" << std::endl;
+ << 's' << std::endl;
BlockVector<double> newton_update(dofs_per_block);
error_residual.reset();
error_residual_0.reset();
unsigned int newton_iteration = 0;
for (; newton_iteration < parameters.max_iterations_NR; ++newton_iteration)
{
- std::cout << " " << std::setw(2) << newton_iteration << " "
+ std::cout << ' ' << std::setw(2) << newton_iteration << ' '
<< std::flush;
tangent_matrix = 0.0;
system_rhs = 0.0;
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- std::cout << "_";
+ std::cout << '_';
std::cout << std::endl;
std::cout << " SOLVER STEP "
<< " | LIN_IT LIN_RES RES_NORM "
<< " RES_U RES_P RES_J NU_NORM "
<< " NU_U NU_P NU_J " << std::endl;
for (unsigned int i = 0; i < l_width; ++i)
- std::cout << "_";
+ std::cout << '_';
std::cout << std::endl;
}
template <int dim>
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- std::cout << "_";
+ std::cout << '_';
std::cout << std::endl;
const std::pair<double, double> error_dil = get_error_dilation();
std::cout << "Relative errors:" << std::endl
deallog << std::setw(width) << std::setprecision(precision)
<< A(i, j);
else
- deallog << std::setw(width) << std::setprecision(precision) << "~";
+ deallog << std::setw(width) << std::setprecision(precision) << '~';
deallog << ' ';
};
deallog << std::endl;
GridOutFlags::EpsFlagsBase::width, 300, .01, false, 5, false);
grid_out.set_flags(eps2);
std::ostringstream filename;
- filename << "grid_" << type << "_" << cycle << ".eps";
+ filename << "grid_" << type << '_' << cycle << ".eps";
std::ofstream outfile(filename.str().c_str());
grid_out.write_eps(tria, outfile);
}
VEC a(4);
deallog << "Constructor: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a[2] = 1;
deallog << "Insertion: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a.resize(4);
deallog << "Shrinking: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a.reserve(100);
deallog << "Reserve: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a = b;
deallog << "Assignment: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
// check setting elements for large vectors
{
for (unsigned int i = 0; i < v.size(); ++i)
{
- deallog << "[";
+ deallog << '[';
for (unsigned int j = 0; j < v[i].size(); ++j)
- deallog << v[i][j] << " ";
- deallog << "]";
+ deallog << v[i][j] << ' ';
+ deallog << ']';
}
deallog << std::endl;
}
VEC a(4);
deallog << "Constructor: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a[2] = true;
deallog << "Insertion: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a.resize(4);
deallog << "Shrinking: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a.reserve(100);
deallog << "Reserve: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a = b;
deallog << "Assignment: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
// check setting elements for large vectors
AlignedVector<foo> vec;
vec.push_back(foo(3));
vec.resize(2, foo(6));
- deallog << vec[0].element() << " " << vec[1].element() << std::endl;
+ deallog << vec[0].element() << ' ' << vec[1].element() << std::endl;
vec[1] = foo(13);
- deallog << vec[0].element() << " " << vec[1].element() << std::endl;
+ deallog << vec[0].element() << ' ' << vec[1].element() << std::endl;
vec.reserve(3);
- deallog << vec[0].element() << " " << vec[1].element() << std::endl;
+ deallog << vec[0].element() << ' ' << vec[1].element() << std::endl;
}
deallog << "Contents of new VEC: ";
for (unsigned int i = 0; i < b.size(); ++i)
- deallog << b[i] << " ";
+ deallog << b[i] << ' ';
deallog << std::endl;
a.resize(6, 42);
deallog << "Contents of new VEC: ";
for (unsigned int i = 0; i < a.size(); ++i)
- deallog << a[i] << " ";
+ deallog << a[i] << ' ';
deallog << std::endl;
a = std::move(b);
deallog << std::endl;
for (unsigned int j = 0; j <= M; ++j)
{
- deallog << 1. * i / N << " " << 1. * j / M << " ";
+ deallog << 1. * i / N << ' ' << 1. * j / M << ' ';
for (unsigned int k = 0; k < aniso.n(); ++k)
deallog << aniso.compute_value(k, Point<2>(1. * i / N, 1. * j / M))
- << " ";
+ << ' ';
deallog << std::endl;
for (unsigned int k = 0; k < aniso.n(); ++k)
deallog << aniso.compute_grad(k, Point<2>(1. * i / N, 1. * j / M))
- << " ";
+ << ' ';
deallog << std::endl;
}
}
deallog << std::endl;
for (unsigned int k = 0; k <= P; ++k)
{
- deallog << 1. * i / N << " " << 1. * j / M << " " << 1. * k / P;
+ deallog << 1. * i / N << ' ' << 1. * j / M << ' ' << 1. * k / P;
for (unsigned int k = 0; k < aniso.n(); ++k)
deallog << aniso.compute_value(
k, Point<3>(1. * i / N, 1. * j / M, 1. * k / P))
- << " ";
+ << ' ';
deallog << std::endl;
for (unsigned int k = 0; k < aniso.n(); ++k)
deallog << aniso.compute_grad(
k, Point<3>(1. * i / N, 1. * j / M, 1. * k / P))
- << " ";
+ << ' ';
deallog << std::endl;
}
}
deallog << b.get_boundary_points().second << std::endl;
deallog << "Boundary points are inside: " << b.point_inside(boundaries.first)
- << " " << b.point_inside(boundaries.second) << std::endl;
+ << ' ' << b.point_inside(boundaries.second) << std::endl;
std::vector<Point<spacedim>> test_points;
Point<3> p3(0, 0, 1.0);
deallog << "Checking if all vertices are inside: "
- << b.point_inside(boundaries.first) << " "
+ << b.point_inside(boundaries.first) << ' '
<< b.point_inside(boundaries.second) << std::endl;
- deallog << b.point_inside(p1) << " " << b.point_inside(p2) << " "
- << b.point_inside(p3) << " " << b.point_inside(p1 + p2) << " "
- << b.point_inside(p2 + p3) << " " << b.point_inside(p1 + p3) << " "
+ deallog << b.point_inside(p1) << ' ' << b.point_inside(p2) << ' '
+ << b.point_inside(p3) << ' ' << b.point_inside(p1 + p2) << ' '
+ << b.point_inside(p2 + p3) << ' ' << b.point_inside(p1 + p3) << ' '
<< std::endl;
double eps = std::numeric_limits<double>::epsilon();
for (unsigned int d = 0; d < dim; ++d)
{
if (d > 0)
- deallog << "x";
- deallog << "[" << box.lower_bound(d) << ", " << box.upper_bound(d) << "]";
+ deallog << 'x';
+ deallog << '[' << box.lower_bound(d) << ", " << box.upper_bound(d) << ']';
}
deallog << std::endl;
}
const BoundingBox<dim> box(lower_upper_corners);
for (unsigned int d = 0; d < dim; ++d)
- deallog << box.side_length(d) << " ";
+ deallog << box.side_length(d) << ' ';
deallog << std::endl;
}
.run();
for (const auto &i : sources)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
// output the determinants of these objects
- deallog << "det(dF): " << dF.determinant().real() << " "
+ deallog << "det(dF): " << dF.determinant().real() << ' '
<< dF.determinant().imag() << std::endl;
}
Vector<double> v(2);
fun2.vector_value(p, v);
- deallog << v(0) << " " << v(1) << std::endl;
+ deallog << v(0) << ' ' << v(1) << std::endl;
deallog << fun3.gradient(p) << std::endl;
function,
constants);
- deallog << "Function "
- << "[" << function[0] << "]"
- << " @point "
- << "[" << point << "]"
- << " is "
- << "[" << fp.value(point) << "]" << std::endl;
+ deallog << "Function " << '[' << function[0] << ']' << " @point " << '['
+ << point << ']' << " is " << '[' << fp.value(point) << ']'
+ << std::endl;
// now initialize with a function
// that's a string, not vector of
function[0],
constants);
- deallog << "Function "
- << "[" << function[0] << "]"
- << " @point "
- << "[" << point << "]"
- << " is "
- << "[" << fp4.value(point) << "]" << std::endl;
+ deallog << "Function " << '[' << function[0] << ']' << " @point " << '['
+ << point << ']' << " is " << '[' << fp4.value(point) << ']'
+ << std::endl;
// now initialize a function without
// units to check backwards
fp2.initialize(FunctionParser<2>::default_variable_names(),
function,
constants);
- deallog << "Function "
- << "[" << function[0] << "]"
- << " @point "
- << "[" << point << "]"
- << " is "
- << "[" << fp2.value(point) << "]" << std::endl;
+ deallog << "Function " << '[' << function[0] << ']' << " @point " << '['
+ << point << ']' << " is " << '[' << fp2.value(point) << ']'
+ << std::endl;
function[0],
constants);
- deallog << "Function "
- << "[" << function[0] << "]"
- << " @point "
- << "[" << point << "]"
- << " is "
- << "[" << fp3.value(point) << "]" << std::endl;
+ deallog << "Function " << '[' << function[0] << ']' << " @point " << '['
+ << point << ']' << " is " << '[' << fp3.value(point) << ']'
+ << std::endl;
}
double c = vector_function.value(point, 1);
// Output the evaluated function
- deallog << "Function '" << expressions[0] << "," << expressions[1] << "'"
+ deallog << "Function '" << expressions[0] << ',' << expressions[1] << "'"
<< " @ " << point << " is " << std::flush;
result.print(deallog.get_file_stream(), 4, false);
deallog.get_file_stream() << "DEAL::" << std::endl;
Assert(c == result[1], ExcInternalError());
// Output the evaluated function
- deallog << "Function '" << expressions[0] << "," << expressions[1] << "'"
+ deallog << "Function '" << expressions[0] << ',' << expressions[1] << "'"
<< " @ " << point << " is " << result << std::endl;
}
<< " )"
<< " comp "
<< k
- // << " norms " << d1.norm() << " " << d2.norm()
+ // << " norms " << d1.norm() << ' ' << d2.norm()
<< std::endl;
for (unsigned int d = 0; d < dim; ++d)
- deallog << " " << gradients[k][i][d] << " "
+ deallog << ' ' << gradients[k][i][d] << ' '
<< gradients1[i][k][d] << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
div += gradients[d][k][d];
if (std::fabs(div) > 1.e-13)
- deallog << "Divergence " << k << " " << div << std::endl;
+ deallog << "Divergence " << k << ' ' << div << std::endl;
}
deallog << "tested" << std::endl;
for (int i = 0; i < dim; ++i)
{
PrintTensor<rank - 1, dim>::print_tensor(tensor[i]);
- deallog << " ";
+ deallog << ' ';
}
}
};
print_tensor(const Tensor<1, dim> &tensor)
{
for (int i = 0; i < dim; ++i)
- deallog << tensor[i] << " ";
+ deallog << tensor[i] << ' ';
}
};
{
deallog << coeffs[i];
for (unsigned int d = 0; d < dim; ++d)
- deallog << " x" << d << "^" << exponents[i][d];
+ deallog << " x" << d << '^' << exponents[i][d];
if (i < n_mon - 1)
deallog << " + ";
}
deallog << std::endl;
deallog << "Point: ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << p[d] << " ";
+ deallog << p[d] << ' ';
deallog << std::endl;
deallog << "Value: " << poly.value(p) << std::endl;
for (double xi = x[0]; xi <= x.back(); xi += 0.01)
{
const double yi = gsl_spline_eval(spline, xi, acc);
- // deallog << xi << " " << yi << std::endl;
+ // deallog << xi << ' ' << yi << std::endl;
y_native.push_back(yi);
}
gsl_spline_free(spline);
for (double xi = x[0]; xi <= x.back(); xi += 0.01)
{
const double yi = cspline.value(Point<dim>(xi));
- // deallog << xi << " " << yi << std::endl;
+ // deallog << xi << ' ' << yi << std::endl;
y_dealii.push_back(yi);
}
}
func.set_time(el.first);
func.vector_value(point, v1);
v1.print(deallog.get_file_stream());
- deallog << "-" << std::endl;
+ deallog << '-' << std::endl;
func.set_time(el.first - el.second);
func.vector_value(point, v2);
v2.print(deallog.get_file_stream());
- deallog << "=" << std::endl;
+ deallog << '=' << std::endl;
inc.set_time(el.first);
inc.set_decrement(el.second);
func.set_time(el.first);
func.vector_value(point, v1);
v1.print(deallog.get_file_stream());
- deallog << "-" << std::endl;
+ deallog << '-' << std::endl;
func.set_time(el.first - el.second);
func.vector_value(point, v2);
v2.print(deallog.get_file_stream());
- deallog << "=" << std::endl;
+ deallog << '=' << std::endl;
inc.set_time(el.first);
inc.set_decrement(el.second);
<< " )"
<< " comp "
<< k
- // << " norms " << d1.norm() << " " << d2.norm()
+ // << " norms " << d1.norm() << ' ' << d2.norm()
<< std::endl;
for (unsigned int d = 0; d < dim; ++d)
- deallog << " " << gradients[k][i][d] << " "
+ deallog << ' ' << gradients[k][i][d] << ' '
<< gradients1[i][k][d] << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
div += gradients[d][k][d];
if (std::fabs(div) > 1.e-13)
- deallog << "Divergence " << k << " " << div << std::endl;
+ deallog << "Divergence " << k << ' ' << div << std::endl;
}
deallog << "tested" << std::endl;
for (unsigned int n = 2; n < 20; ++n)
{
- deallog << "QGaussLobatto(" << n << ")" << std::endl;
+ deallog << "QGaussLobatto(" << n << ')' << std::endl;
QGaussLobatto<1> q(n);
for (unsigned int i = 0; i < q.size(); ++i)
{
deallog << std::endl << "Point 1: ";
for (unsigned int i = 0; i < dim; ++i)
- deallog << point1[i] << " ";
+ deallog << point1[i] << ' ';
deallog << std::endl << "Point 2: ";
for (unsigned int i = 0; i < dim; ++i)
- deallog << point2[i] << " ";
+ deallog << point2[i] << ' ';
deallog << std::endl;
}
for (const unsigned int f : GeometryInfo<dim>::face_indices())
deallog << "face normal" << f << ' '
<< (GeometryInfo<dim>::unit_normal_orientation[f] > 0. ? '+' : '-')
- << "x" << GeometryInfo<dim>::unit_normal_direction[f] << std::endl;
+ << 'x' << GeometryInfo<dim>::unit_normal_direction[f] << std::endl;
for (const unsigned int f : GeometryInfo<dim>::face_indices())
{
void
test()
{
- deallog << "Checking in " << dim << "d" << std::endl;
+ deallog << "Checking in " << dim << 'd' << std::endl;
for (const unsigned int f : GeometryInfo<dim>::face_indices())
for (unsigned int v = 0; v < GeometryInfo<dim>::vertices_per_face; ++v)
void
test()
{
- deallog << "Checking in " << dim << "d" << std::endl;
+ deallog << "Checking in " << dim << 'd' << std::endl;
// check phi_i(v_j) = delta_{ij}
for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
void
test()
{
- deallog << "Checking in " << dim << "d" << std::endl;
+ deallog << "Checking in " << dim << 'd' << std::endl;
// check phi_i(v_j) = delta_{ij}
for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
void
test()
{
- deallog << "Checking in " << dim << "d" << std::endl;
+ deallog << "Checking in " << dim << 'd' << std::endl;
// check the determinant of the
// transformation for the reference
void
test()
{
- deallog << "Checking in " << dim << "d" << std::endl;
+ deallog << "Checking in " << dim << 'd' << std::endl;
// check the determinant of the
// transformation for the reference
for (const unsigned int i : GeometryInfo<dim>::face_indices())
{
- deallog << "face " << i << ":" << std::endl;
+ deallog << "face " << i << ':' << std::endl;
for (unsigned int o = 0; o < 8; ++o)
{
const std::bitset<3> orientation = o;
deallog << "orientation " << orientation[0] << ", flip "
- << orientation[1] << ", rotation " << orientation[2] << ":"
+ << orientation[1] << ", rotation " << orientation[2] << ':'
<< std::endl
<< " ";
for (const unsigned int i : GeometryInfo<dim>::face_indices())
{
- deallog << "face " << i << ":" << std::endl;
+ deallog << "face " << i << ':' << std::endl;
for (unsigned int o = 0; o < 8; ++o)
{
const std::bitset<3> orientation = o;
deallog << "orientation " << orientation[0] << ", flip "
- << orientation[1] << ", rotation " << orientation[2] << ":"
+ << orientation[1] << ", rotation " << orientation[2] << ':'
<< std::endl
<< " ";
deallog << "Color: " << color << std::endl;
for (unsigned int i = 0; i < coloring[color].size(); ++i)
for (unsigned int j = 0; j < dim; ++j)
- deallog << coloring[color][i]->center()[j] << " ";
+ deallog << coloring[color][i]->center()[j] << ' ';
deallog << std::endl;
}
}
deallog << "Color: " << color << std::endl;
for (unsigned int i = 0; i < coloring[color].size(); ++i)
for (unsigned int j = 0; j < dim; ++j)
- deallog << coloring[color][i]->center()[j] << " ";
+ deallog << coloring[color][i]->center()[j] << ' ';
deallog << std::endl;
}
}
deallog << "Color: " << color << std::endl;
for (unsigned int i = 0; i < coloring[color].size(); ++i)
for (unsigned int j = 0; j < dim; ++j)
- deallog << coloring[color][i]->center()[j] << " ";
+ deallog << coloring[color][i]->center()[j] << ' ';
deallog << std::endl;
}
}
type_name = std::string("unsigned int");
}
- deallog << "Write tests for " << container_name << "<" << type_name << ">"
+ deallog << "Write tests for " << container_name << '<' << type_name << '>'
<< " datasets" << std::endl;
auto group = root_group.create_group(container_name + "<" + type_name + ">");
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
auto data = initialize_container<Container, Number>(dataset_dimensions);
assign_data(data);
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
{
dataset.template write_none<Number>();
}
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
std::vector<hsize_t> coordinates_a = {0,
0, // first point
{
dataset.template write_none<Number>();
}
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): "
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): "
<< container_sum(data_a) + container_sum(data_b) +
container_sum(data_c)
<< std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
auto data = initialize_container<Container, double>(dataset_dimensions);
assign_data(data);
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
{
dataset.template write_none<Number>();
}
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
}
else if (std::is_same<Number, double>::value)
{
{
dataset.template write_none<Number>();
}
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
const std::vector<hsize_t> hyperslab_dimensions_a = {2, 5};
const std::vector<hsize_t> hyperslab_offset_a = {0, 0};
auto hyperslab_data_a =
dataset.template write_none<Number>();
}
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): "
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): "
<< container_sum(hyperslab_data_a) +
container_sum(hyperslab_data_b) +
container_sum(hyperslab_data_c)
<< std::endl;
- deallog << "Hyperslab_a sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
+ deallog << "Hyperslab_a sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>'
<< " (Write): " << container_sum(hyperslab_data_a) << std::endl;
- deallog << "Hyperslab_b sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
+ deallog << "Hyperslab_b sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>'
<< " (Write): " << container_sum(hyperslab_data_b) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
type_name = std::string("unsigned int");
}
- deallog << "Read tests for " << container_name << "<" << type_name << ">"
+ deallog << "Read tests for " << container_name << '<' << type_name << '>'
<< " datasets" << std::endl;
auto group = root_group.open_group(container_name + "<" + type_name + ">");
std::string dataset_name("dataset_1");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_2");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
{
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
12}; // fourth point
auto data_a =
dataset.template read_selection<std::vector<Number>>(coordinates_a);
- deallog << "Selection " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << data_a[0] << ", " << data_a[1] << ", "
- << data_a[2] << ", " << data_a[3] << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Selection " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << data_a[0] << ", "
+ << data_a[1] << ", " << data_a[2] << ", " << data_a[3]
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_3");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_4");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
{
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto data_a =
dataset.read_hyperslab<Container<Number>>(hyperslab_offset_a,
hyperslab_count_a);
- deallog << "Hyperslab_a sum " + dataset_name << " " << container_name
- << "<" << type_name << ">"
- << " (Read): " << container_sum(data_a) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Hyperslab_a sum " + dataset_name << ' ' << container_name
+ << '<' << type_name << '>' << " (Read): " << container_sum(data_a)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.read_none<Number>();
}
}
- deallog << "Hyperslab_b sum " + dataset_name << " " << container_name
- << "<" << type_name << ">"
- << " (Read): " << container_sum(data_b) << std::endl;
- pcout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Hyperslab_b sum " + dataset_name << ' ' << container_name
+ << '<' << type_name << '>' << " (Read): " << container_sum(data_b)
+ << std::endl;
+ pcout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ pcout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
type_name = std::string("unsigned int");
}
- deallog << "Write tests for " << container_name << "<" << type_name << ">"
+ deallog << "Write tests for " << container_name << '<' << type_name << '>'
<< " datasets" << std::endl;
auto group = root_group.create_group(container_name + "<" + type_name + ">");
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
auto data = initialize_container<Container, Number>(dataset_dimensions);
assign_data(data);
dataset.write(data);
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
std::vector<hsize_t> coordinates_a = {0,
0, // first point
dataset.write_selection(data_a, coordinates_a);
dataset.write_selection(data_b, coordinates_b);
dataset.write_selection(data_c, coordinates_c);
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): "
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): "
<< container_sum(data_a) + container_sum(data_b) +
container_sum(data_c)
<< std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
auto data = initialize_container<Container, double>(dataset_dimensions);
assign_data(data);
dataset.write(data);
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
}
else if (std::is_same<Number, double>::value)
{
auto data = initialize_container<Container, float>(dataset_dimensions);
assign_data(data);
dataset.write(data);
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_rank()
+ << std::endl;
const std::vector<hsize_t> hyperslab_dimensions_a = {2, 5};
const std::vector<hsize_t> hyperslab_offset_a = {0, 0};
auto hyperslab_data_a =
hyperslab_count_c,
hyperslab_block_c);
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): "
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): "
<< container_sum(hyperslab_data_a) +
container_sum(hyperslab_data_b) +
container_sum(hyperslab_data_c)
<< std::endl;
- deallog << "Hyperslab_a sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
+ deallog << "Hyperslab_a sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>'
<< " (Write): " << container_sum(hyperslab_data_a) << std::endl;
- deallog << "Hyperslab_b sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
+ deallog << "Hyperslab_b sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>'
<< " (Write): " << container_sum(hyperslab_data_b) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto data = initialize_container<Container, Number>(dataset_dimensions);
assign_data(data);
group.write_dataset(dataset_name, data);
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Write): " << container_sum(data) << std::endl;
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Write): " << container_sum(data)
+ << std::endl;
}
}
type_name = std::string("unsigned int");
}
- deallog << "Read tests for " << container_name << "<" << type_name << ">"
+ deallog << "Read tests for " << container_name << '<' << type_name << '>'
<< " datasets" << std::endl;
auto group = root_group.open_group(container_name + "<" + type_name + ">");
std::string dataset_name("dataset_1");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_2");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
{
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
12}; // fourth point
auto data_a =
dataset.template read_selection<std::vector<Number>>(coordinates_a);
- deallog << "Selection " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << data_a[0] << ", " << data_a[1] << ", "
- << data_a[2] << ", " << data_a[3] << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Selection " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << data_a[0] << ", "
+ << data_a[1] << ", " << data_a[2] << ", " << data_a[3]
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_3");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_4");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
{
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto data_a =
dataset.read_hyperslab<Container<Number>>(hyperslab_offset_a,
hyperslab_count_a);
- deallog << "Hyperslab_a sum " + dataset_name << " " << container_name
- << "<" << type_name << ">"
- << " (Read): " << container_sum(data_a) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Hyperslab_a sum " + dataset_name << ' ' << container_name
+ << '<' << type_name << '>' << " (Read): " << container_sum(data_a)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
Container<Number> data_b;
data_b = dataset.read_hyperslab<Container<Number>>(hyperslab_offset_b,
hyperslab_count_b);
- deallog << "Hyperslab_b sum " + dataset_name << " " << container_name
- << "<" << type_name << ">"
- << " (Read): " << container_sum(data_b) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Hyperslab_b sum " + dataset_name << ' ' << container_name
+ << '<' << type_name << '>' << " (Read): " << container_sum(data_b)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
std::string dataset_name("dataset_5");
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_rank() << std::endl;
+ deallog << "Dimensions " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_dimensions()
+ << std::endl;
+ deallog << "Size " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_size()
+ << std::endl;
+ deallog << "Rank " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_rank()
+ << std::endl;
Container<Number> data = dataset.read<Container<Number>>();
- deallog << "Sum " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << container_sum(data) << std::endl;
- std::cout << "IO mode " + dataset_name << " " << container_name << "<"
- << type_name << ">"
- << " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ deallog << "Sum " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << container_sum(data)
+ << std::endl;
+ std::cout << "IO mode " + dataset_name << ' ' << container_name << '<'
+ << type_name << '>' << " (Read): " << dataset.get_io_mode()
+ << std::endl;
+ std::cout << "Local no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << " "
- << container_name << "<" << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << ' '
+ << container_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
auto data = initialize_container<std::vector, Number>(dataset_dimensions);
assign_data(data);
{
dataset.template write_none<Number>();
}
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Write): " << container_to_string(data) << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
auto data = initialize_container<std::vector, Number>(dataset_dimensions);
assign_data(data);
{
dataset.template write_none<Number>();
}
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Write): " << container_to_string(data) << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
const std::vector<hsize_t> hyperslab_count = {1, 5, 3};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
const std::vector<hsize_t> hyperslab_count = {1, 5, 3};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
else
{
dataset.template write_none<Number>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
const std::vector<hsize_t> hyperslab_count = {3, 1, 4};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
const std::vector<hsize_t> hyperslab_count = {3, 1, 4};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
else
{
dataset.template write_none<Number>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
dataset.write_selection(data, coordinates);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
else
{
dataset.template write_none<Number>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
dataset.write_hyperslab(
data, data_dimensions, offset, stride, count, block);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_hyperslab(
data, data_dimensions, offset, stride, count, block);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
else
{
dataset.template write_none<Number>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
dataset.write_selection(data, coordinates);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
else
{
dataset.template write_none<Number>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ pcout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<FullMatrix<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Column vector" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Column vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Column vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Row vector" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Row vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Row vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Sub-matrix" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Column vector" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Column vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Column vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Row vector" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Row vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Row vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Sub-matrix" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
pcout << "Sub-matrix" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
data_dimensions, offset, stride, count, block);
pcout << "Sub-matrix" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
auto data = dataset.read_selection<std::vector<Number>>(coordinates);
pcout << "Sub-matrix" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Selection std::vector " + dataset_name << "<" << type_name
- << ">"
- << " (Read): " << container_to_string(data) << std::endl;
+ deallog << "Selection std::vector " + dataset_name << '<' << type_name
+ << '>' << " (Read): " << container_to_string(data) << std::endl;
}
{
auto data = dataset.read_selection<Vector<Number>>(coordinates);
pcout << "Sub-matrix" << std::endl;
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Selection Vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Selection Vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<FullMatrix<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- pcout << "IO mode " + dataset_name << "<" << type_name << ">"
+ pcout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- pcout << "Local no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_local_no_collective_cause()
+ pcout << "Local no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- pcout << "Global no collective cause " << dataset_name << "<" << type_name
- << ">"
- << " (Read): " << dataset.get_global_no_collective_cause()
+ pcout << "Global no collective cause " << dataset_name << '<' << type_name
+ << '>' << " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
auto data = initialize_container<std::vector, Number>(dataset_dimensions);
assign_data(data);
dataset.write(data);
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Write): " << container_to_string(data) << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ std::cout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
auto data = initialize_container<std::vector, Number>(dataset_dimensions);
assign_data(data);
dataset.write(data);
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Write): " << container_to_string(data) << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<" << type_name
- << ">"
- << " (Write): " << dataset.get_local_no_collective_cause()
+ std::cout << "Local no collective cause " + dataset_name << '<' << type_name
+ << '>' << " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
{
const std::vector<hsize_t> hyperslab_count = {1, 5, 3};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
const std::vector<hsize_t> hyperslab_count = {1, 5, 3};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
{
const std::vector<hsize_t> hyperslab_count = {3, 1, 4};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
const std::vector<hsize_t> hyperslab_count = {3, 1, 4};
dataset.write_hyperslab(data, hyperslab_offset, hyperslab_count);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
{
dataset.write_selection(data, coordinates);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
{
dataset.write_hyperslab(
data, data_dimensions, offset, stride, count, block);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_hyperslab(
data, data_dimensions, offset, stride, count, block);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset =
group.create_dataset<Number>(dataset_name, dataset_dimensions);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " << dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " << dataset_name << "<" << type_name << ">"
+ deallog << "Size " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_size() << std::endl;
- deallog << "Rank " << dataset_name << "<" << type_name << ">"
+ deallog << "Rank " << dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_rank() << std::endl;
{
dataset.write_selection(data, coordinates);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
dataset.write_selection(data, coordinates);
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Write): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " + dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " + dataset_name << '<'
+ << type_name << '>'
<< " (Write): " << dataset.get_global_no_collective_cause()
<< std::endl;
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<FullMatrix<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Column vector" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Column vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Column vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Row vector" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Row vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Row vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Sub-matrix" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Column vector" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Column vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Column vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Row vector" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Row vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Row vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Sub-matrix" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
hyperslab_count);
std::cout << "Sub-matrix" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
data_dimensions, offset, stride, count, block);
std::cout << "Sub-matrix" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Sub-matrix " + dataset_name << "<" << type_name << ">"
+ deallog << "Sub-matrix " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
auto data = dataset.read_selection<std::vector<Number>>(coordinates);
std::cout << "Sub-matrix" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Selection std::vector " + dataset_name << "<" << type_name
- << ">"
- << " (Read): " << container_to_string(data) << std::endl;
+ deallog << "Selection std::vector " + dataset_name << '<' << type_name
+ << '>' << " (Read): " << container_to_string(data) << std::endl;
}
{
auto data = dataset.read_selection<Vector<Number>>(coordinates);
std::cout << "Sub-matrix" << std::endl;
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Selection Vector " + dataset_name << "<" << type_name << ">"
+ deallog << "Selection Vector " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<FullMatrix<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
auto dataset = group.open_dataset(dataset_name);
dataset.set_query_io_mode(true);
- deallog << "Dimensions " + dataset_name << "<" << type_name << ">"
+ deallog << "Dimensions " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_dimensions() << std::endl;
- deallog << "Size " + dataset_name << "<" << type_name << ">"
+ deallog << "Size " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_size() << std::endl;
- deallog << "Rank " + dataset_name << "<" << type_name << ">"
+ deallog << "Rank " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_rank() << std::endl;
{
auto data = dataset.read<std::vector<Number>>();
- std::cout << "IO mode " + dataset_name << "<" << type_name << ">"
+ std::cout << "IO mode " + dataset_name << '<' << type_name << '>'
<< " (Read): " << dataset.get_io_mode() << std::endl;
- std::cout << "Local no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Local no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_local_no_collective_cause()
<< std::endl;
- std::cout << "Global no collective cause " << dataset_name << "<"
- << type_name << ">"
+ std::cout << "Global no collective cause " << dataset_name << '<'
+ << type_name << '>'
<< " (Read): " << dataset.get_global_no_collective_cause()
<< std::endl;
- deallog << "Data " + dataset_name << "<" << type_name << ">"
+ deallog << "Data " + dataset_name << '<' << type_name << '>'
<< " (Read): " << container_to_string(data) << std::endl;
}
}
for (unsigned int i = 0; i <= div; ++i)
{
const double x = 1. * i / div;
- deallog << x << " ";
+ deallog << x << ' ';
for (unsigned int j = 0; j < p.size(); ++j)
- deallog << p[j].value(x) << " ";
+ deallog << p[j].value(x) << ' ';
deallog << std::endl;
}
}
++it)
{
if (it->n_elements() == 1)
- deallog << *(it->begin()) << " ";
+ deallog << *(it->begin()) << ' ';
else
- deallog << "[" << *(it->begin()) << "," << it->last() << "] ";
+ deallog << '[' << *(it->begin()) << ',' << it->last() << "] ";
}
deallog << std::endl;
for (IndexSet::ElementIterator it = index_set.begin();
it != index_set.end();
++it)
- deallog << *it << " ";
+ deallog << *it << ' ';
deallog << std::endl;
}
Assert(is1 == is2, ExcInternalError());
- deallog << is1.is_element(4) << " " << is2.is_element(4) << std::endl;
+ deallog << is1.is_element(4) << ' ' << is2.is_element(4) << std::endl;
deallog << "OK" << std::endl;
deallog << "Total size=" << size << std::endl;
for (unsigned int p = 0; p < vec.size(); ++p)
{
- deallog << "p=" << p << ":" << std::endl;
+ deallog << "p=" << p << ':' << std::endl;
vec[p].print(deallog.get_file_stream());
}
}
deallog << "Total size=" << size << std::endl;
for (unsigned int p = 0; p < vec.size(); ++p)
{
- deallog << "p=" << p << ":" << std::endl;
+ deallog << "p=" << p << ':' << std::endl;
vec[p].print(deallog.get_file_stream());
}
}
ArrayView<double>(dst.data(), dst.size()));
for (size_t i = 0; i < src.size(); ++i)
- deallog << static_cast<int>(src[i]) << " ";
+ deallog << static_cast<int>(src[i]) << ' ';
deallog << std::endl;
for (size_t i = 0; i < dst.size(); ++i)
- deallog << static_cast<int>(dst[i]) << " ";
+ deallog << static_cast<int>(dst[i]) << ' ';
deallog << std::endl;
}
ArrayView<double>(dst.data(), dst.size()));
for (size_t i = 0; i < src.size(); ++i)
- deallog << static_cast<int>(src[i]) << " ";
+ deallog << static_cast<int>(src[i]) << ' ';
deallog << std::endl;
for (size_t i = 0; i < dst.size(); ++i)
- deallog << static_cast<int>(dst[i]) << " ";
+ deallog << static_cast<int>(dst[i]) << ' ';
deallog << std::endl << std::endl;
ArrayView<double>(dst.data(), dst.size()));
for (size_t i = 0; i < src.size(); ++i)
- deallog << static_cast<int>(src[i]) << " ";
+ deallog << static_cast<int>(src[i]) << ' ';
deallog << std::endl;
for (size_t i = 0; i < dst.size(); ++i)
- deallog << static_cast<int>(dst[i]) << " ";
+ deallog << static_cast<int>(dst[i]) << ' ';
deallog << std::endl;
}
std::vector<unsigned int> shared_procs(shared_procs_set.begin(),
shared_procs_set.end());
- deallog << "Proc " << my_proc << "/" << n_procs << ": sharing with "
+ deallog << "Proc " << my_proc << '/' << n_procs << ": sharing with "
<< Patterns::Tools::to_string(shared_procs_set) << std::endl;
for (unsigned int i = 0; i < n_local_particles * shared_fraction; ++i)
shared_particles[shared_procs[random_index(shared_procs.size())]]
for (unsigned int i = 0; i < p.size(); ++i)
{
- deallog << "N0(P" << i << ")"
- << " = " << p[i].value(0.) << std::endl;
+ deallog << "N0(P" << i << ')' << " = " << p[i].value(0.) << std::endl;
}
for (unsigned int i = 0; i < p.size(); ++i)
{
- deallog << "N1(P" << i << ")"
- << " = " << p[i].value(1.) << std::endl;
+ deallog << "N1(P" << i << ')' << " = " << p[i].value(1.) << std::endl;
}
std::vector<double> values(p.size());
for (unsigned int i = 0; i < p.size(); ++i)
{
p[i].value(.5, values);
- deallog << "N" << j << "(P" << i << ")"
- << " = " << values[j] * factor << std::endl;
+ deallog << 'N' << j << "(P" << i << ')' << " = " << values[j] * factor
+ << std::endl;
}
}
}
for (int beta = 0; beta < 3; ++beta)
for (unsigned int degree = 0; degree < 40; ++degree)
{
- deallog << "Jacobi_" << degree << "^(" << alpha << "," << beta
+ deallog << "Jacobi_" << degree << "^(" << alpha << ',' << beta
<< ") at 0.3: "
<< jacobi_polynomial_value(degree, alpha, beta, 0.3)
<< std::endl;
Assert(roots.size() == 0 || roots.back() < 1., ExcInternalError());
for (unsigned int i = 0; i < roots.size(); ++i)
- deallog << roots[i] << " ";
+ deallog << roots[i] << ' ';
deallog << std::endl << std::endl;
}
}
for (unsigned int degree = 1; degree < 40; degree += 3)
{
const int beta = alpha;
- deallog << "Jacobi_" << degree << "^(" << alpha << "," << beta << ")"
+ deallog << "Jacobi_" << degree << "^(" << alpha << ',' << beta << ')'
<< std::endl;
std::vector<double> roots =
for (unsigned int degree = 1; degree < 40; degree += 3)
{
const int beta = alpha;
- deallog << "Jacobi_" << degree << "^(" << alpha << "," << beta << ")"
+ deallog << "Jacobi_" << degree << "^(" << alpha << ',' << beta << ')'
<< std::endl;
std::vector<long double> roots =
deallog << "Adini<" << dim << "> point " << i << " (" << points[i][0];
for (unsigned int d = 1; d < dim; ++d)
deallog << ", " << points[i][d];
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
poly.evaluate(points[i], values, grads, grads2, thirds, fourths);
deallog << "BR1<" << dim << "> point " << i << " (" << points[i][0];
for (unsigned int d = 1; d < dim; ++d)
deallog << ", " << points[i][d];
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
poly.evaluate(points[i], values, grads, grads2, thirds, fourths);
<< points[i][0];
for (unsigned int d = 1; d < dim; ++d)
deallog << ", " << points[i][d];
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
poly.evaluate(points[i], values, grads, grads2, thirds, fourths);
AssertThrow(q_basis[0].size() == q_points.size(), ExcInternalError());
for (unsigned int q = 0; q < quadrature.size(); ++q)
{
- std::cout << q_points[q] << " " << q_basis[0].get_points()[q]
+ std::cout << q_points[q] << ' ' << q_basis[0].get_points()[q]
<< std::endl;
AssertThrow(std::abs(
(q_points[q] - q_basis[0].get_points()[q]).norm()) <
void
check_quadrature_move(Args &&...args)
{
- deallog << check_q_move<Quad<1>>(std::forward<Args>(args)...) << 1 << " "
- << check_q_move<Quad<2>>(std::forward<Args>(args)...) << 2 << " "
+ deallog << check_q_move<Quad<1>>(std::forward<Args>(args)...) << 1 << ' '
+ << check_q_move<Quad<2>>(std::forward<Args>(args)...) << 2 << ' '
<< check_q_move<Quad<3>>(std::forward<Args>(args)...) << 3
<< std::endl;
}
check_quadrature_assign_move(Args &&...args)
{
deallog << check_q_assign_move<Quad, 1>(std::forward<Args>(args)...) << 1
- <<
" " << check_q_assign_move<Quad, 2>(std::forward<Args>(args)...)
- << 2 << " "
+ <<
' ' << check_q_assign_move<Quad, 2>(std::forward<Args>(args)...)
+ << 2 << ' '
<< check_q_assign_move<Quad, 3>(std::forward<Args>(args)...) << 3
<< std::endl;
}
for (unsigned int q = 0; q < quad.size(); ++q)
{
- deallog << quad.point(q) << " ";
- deallog << quad.weight(q) << " ";
+ deallog << quad.point(q) << ' ';
+ deallog << quad.weight(q) << ' ';
deallog << std::endl;
}
deallog << std::endl;
}
while (err < 1e-14);
// Uncomment here for testing
- // deallog << " (Int " << quadrature_int << ',' << exact_int << ")";
+ // deallog << " (Int " << quadrature_int << ',' << exact_int << ')';
deallog << " is exact for polynomials of degree " << i - 1 << std::endl;
}
}
while (err < (dim == 3 ? 8 : 1) * 2e-14);
// Uncomment here for testing
// deallog << " (Int " << quadrature_int << '-' << exact_int << '='
- // << err << ")";
+ // << err << ')';
deallog << " is exact for polynomials of degree " << i - 1 << std::endl;
}
deallog.pop();
}
while (err < 1e-14);
// Uncomment here for testing
- // deallog << " (Int " << quadrature_int << ',' << exact_int << ")";
+ // deallog << " (Int " << quadrature_int << ',' << exact_int << ')';
deallog << " is exact for polynomials of degree " << i - 1 << std::endl;
if (dim == 1)
while (err < (dim == 3 ? 8 : 1) * 2e-14);
// Uncomment here for testing
// deallog << " (Int " << quadrature_int << '-' << exact_int << '='
- // << err << ")";
+ // << err << ')';
deallog << " is exact for polynomials of degree " << i - 1 << std::endl;
}
deallog.pop();
AssertThrow(&*(Td[i].begin() + j) == &Td(i, j), ExcInternalError());
AssertThrow(&*(Ti[i].begin() + j) == &Ti(i, j), ExcInternalError());
- deallog << i << " " << j << " " << Td[i][j] << " ok" << std::endl;
+ deallog << i << ' ' << j << ' ' << Td[i][j] << " ok" << std::endl;
};
};
AssertThrow(&*(Td[i].begin() + j) == &Td(i, j), ExcInternalError());
AssertThrow(&*(Ti[i].begin() + j) == &Ti(i, j), ExcInternalError());
- deallog << i << " " << j << " " << Td[i][j] << " ok" << std::endl;
+ deallog << i << ' ' << j << ' ' << Td[i][j] << " ok" << std::endl;
};
for (unsigned int i = 0; i < 4; ++i)
AssertThrow(Ti[i] == Ti(i), ExcInternalError());
AssertThrow(Ti[i] == Td(i), ExcInternalError());
- deallog << i << " " << Td[i] << " ok" << std::endl;
+ deallog << i << ' ' << Td[i] << " ok" << std::endl;
};
};
AssertThrow(&*(Ti[i][j].begin() + k) == &Ti(i, j, k),
ExcInternalError());
- deallog << i << " " << j << " " << k << " " << Td[i][j][k]
+ deallog << i << ' ' << j << ' ' << k << ' ' << Td[i][j][k]
<< " ok" << std::endl;
};
AssertThrow(&*(Ti[i][j][k].begin() + l) == &Ti(i, j, k, l),
ExcInternalError());
- deallog << i << " " << j << " " << k << " " << l << " "
+ deallog << i << ' ' << j << ' ' << k << ' ' << l << ' '
<< Td[i][j][k][l] << " ok" << std::endl;
};
&Ti(i, j, k, l, m),
ExcInternalError());
- deallog << i << " " << j << " " << k << " " << l << " " << m
- << " " << Td[i][j][k][l][m] << " ok" << std::endl;
+ deallog << i << ' ' << j << ' ' << k << ' ' << l << ' ' << m
+ << ' ' << Td[i][j][k][l][m] << " ok" << std::endl;
};
for (unsigned int i = 0; i < I; ++i)
&Ti(i, j, k, l, m, n),
ExcInternalError());
- deallog << i << " " << j << " " << k << " " << l << " " << m
- << " " << n << " " << Td[i][j][k][l][m][n] << " ok"
+ deallog << i << ' ' << j << ' ' << k << ' ' << l << ' ' << m
+ << ' ' << n << ' ' << Td[i][j][k][l][m][n] << " ok"
<< std::endl;
};
void
print_bounds(const std::pair<double, double> &bounds)
{
- deallog << "[" << bounds.first << ", " << bounds.second << "]" << std::endl;
+ deallog << '[' << bounds.first << ", " << bounds.second << ']' << std::endl;
}
void
run_test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
const TestFunction<dim> function;
const BoundingBox<dim> box = create_box<dim>();
auto exponentiated_array = Utilities::fixed_power<3>(array);
for (unsigned int i = 0; i < VectorizedArrayType::size(); ++i)
- deallog << exponentiated_array[i] << " ";
+ deallog << exponentiated_array[i] << ' ';
deallog << std::endl;
exponentiated_array = Utilities::fixed_power<-3>(array);
for (unsigned int i = 0; i < VectorizedArrayType::size(); ++i)
- deallog << exponentiated_array[i] << " ";
+ deallog << exponentiated_array[i] << ' ';
deallog << std::endl;
}
const auto res = Utilities::inverse_Hilbert_space_filling_curve(points, 4);
for (const auto &p : res)
- deallog << p[0] << " " << p[1] << std::endl;
+ deallog << p[0] << ' ' << p[1] << std::endl;
}
// https://github.com/aditi137/Hilbert/blob/master/Hilbert/test.py
const auto res = Utilities::inverse_Hilbert_space_filling_curve<3>(points, 5);
for (const auto &p : res)
- deallog << p[0] << " " << p[1] << " " << p[2] << std::endl;
+ deallog << p[0] << ' ' << p[1] << ' ' << p[2] << std::endl;
}
Utilities::inverse_Hilbert_space_filling_curve(points, bit_depth);
for (const auto &p : res)
- deallog << p[0] << " " << p[1] << " "
+ deallog << p[0] << ' ' << p[1] << ' '
<< Utilities::pack_integers<2>(p, bit_depth) << std::endl;
}
Utilities::inverse_Hilbert_space_filling_curve(points_degenerate,
bit_depth);
- deallog << plane << ":" << std::endl;
+ deallog << plane << ':' << std::endl;
for (const auto &p : res)
{
AssertThrow(p[0] == 0, ExcInternalError());
- deallog << p[1] << " " << p[2] << " "
+ deallog << p[1] << ' ' << p[2] << ' '
<< Utilities::pack_integers<3>(p, bit_depth) << std::endl;
}
deallog << std::endl;
res[b].end());
});
- deallog << plane << ":" << std::endl;
+ deallog << plane << ':' << std::endl;
for (const auto ind : index)
{
AssertThrow(res[ind][0] == 0, ExcInternalError());
for (unsigned int i = 0; i < res.size(); ++i)
{
for (unsigned int d = 0; d < dim; ++d)
- deallog << " " << res[i][d];
+ deallog << ' ' << res[i][d];
deallog << std::endl;
}
{
const std::vector<char> buffer = Utilities::pack(object);
if (buffer.size() != sizeof(object))
- deallog << buffer.size() << " should be " << sizeof(object) << "!"
+ deallog << buffer.size() << " should be " << sizeof(object) << '!'
<< std::endl;
else
deallog << "same size!" << std::endl;
for (unsigned int i = 0; i < n_numbers; ++i)
{
for (unsigned int j = 0; j < n_vectors; ++j)
- deallog << arr[i][j] << " ";
+ deallog << arr[i][j] << ' ';
deallog << std::endl;
}
for (unsigned int i = 0; i < n_vectors; ++i)
{
for (unsigned int j = 0; j < n_numbers; ++j)
- deallog << other[i * n_numbers + j] << " ";
+ deallog << other[i * n_numbers + j] << ' ';
deallog << std::endl;
}
for (unsigned int i = 0; i < n_vectors; ++i)
{
for (unsigned int j = 0; j < n_numbers; ++j)
- deallog << other[i * n_numbers + j] << " ";
+ deallog << other[i * n_numbers + j] << ' ';
deallog << std::endl;
}
}
if (n_errors > 0)
{
for (unsigned int i = 0; i < vec.size(); ++i)
- deallog << vec[i] << " ";
+ deallog << vec[i] << ' ';
deallog << std::endl;
}
}
deallog << "Point norm: " << p.norm()[0] << std::endl;
SymmetricTensor<2, 3, VectorizedArray<double>> st2;
SymmetricTensor<4, 2, VectorizedArray<double>> st4;
- deallog << "Symmetric tensor norm: " << st2.norm()[0] << " " << st4.norm()[0]
+ deallog << "Symmetric tensor norm: " << st2.norm()[0] << ' ' << st4.norm()[0]
<< std::endl;
}
for (unsigned int i = 0; i < n_numbers; ++i)
{
for (unsigned int j = 0; j < n_vectors; ++j)
- deallog << arr[i][j] << " ";
+ deallog << arr[i][j] << ' ';
deallog << std::endl;
}
}
for (unsigned int i = 0; i < n_vectors; ++i)
{
for (unsigned int j = 0; j < n_numbers; ++j)
- deallog << other[i * n_numbers + j] << " ";
+ deallog << other[i * n_numbers + j] << ' ';
deallog << std::endl;
}
}
for (unsigned int i = 0; i < n_vectors; ++i)
{
for (unsigned int j = 0; j < n_numbers; ++j)
- deallog << other[i * n_numbers + j] << " ";
+ deallog << other[i * n_numbers + j] << ' ';
deallog << std::endl;
}
}
std::stringstream reference_stream;
for (unsigned int i = 0; i < n - 1; ++i)
{
- reference_stream << Number(i + 1) << " ";
+ reference_stream << Number(i + 1) << ' ';
}
reference_stream << Number(n);
auto exponentiated_array = std::pow(array, number);
for (unsigned int i = 0; i < VectorizedArrayType::size(); ++i)
- deallog << exponentiated_array[i] << " ";
+ deallog << exponentiated_array[i] << ' ';
deallog << std::endl;
}
auto exponentiated_array = std::pow(array, number);
for (unsigned int i = 0; i < VectorizedArrayType::size(); ++i)
- deallog << exponentiated_array[i] << " ";
+ deallog << exponentiated_array[i] << ' ';
deallog << std::endl;
}
for (unsigned int i = 0; i < n_numbers; ++i)
{
for (unsigned int j = 0; j < n_vectors; ++j)
- deallog << arr[i][j] << " ";
+ deallog << arr[i][j] << ' ';
deallog << std::endl;
}
}
for (unsigned int i = 0; i < n_vectors; ++i)
{
for (unsigned int j = 0; j < n_numbers; ++j)
- deallog << other[i * n_numbers + j] << " ";
+ deallog << other[i * n_numbers + j] << ' ';
deallog << std::endl;
}
}
for (unsigned int i = 0; i < n_vectors; ++i)
{
for (unsigned int j = 0; j < n_numbers; ++j)
- deallog << other[i * n_numbers + j] << " ";
+ deallog << other[i * n_numbers + j] << ' ';
deallog << std::endl;
}
}
component_mask);
for (unsigned int i = 0; i < dof_handler.n_dofs(); ++i)
if (fixed_dofs[i] == true)
- deallog << i << " " << dirichlet_dofs[i] << std::endl;
+ deallog << i << ' ' << dirichlet_dofs[i] << std::endl;
}
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
it != m.end(i);
++it)
{
- deallog << "[" << it->column() << "," << std::setprecision(2)
+ deallog << '[' << it->column() << ',' << std::setprecision(2)
<< std::fixed << std::setw(4) << it->value() << "] ";
}
deallog << std::endl;
it != m.end(i);
++it)
{
- deallog << "[" << it->column() << "," << std::setprecision(2)
+ deallog << '[' << it->column() << ',' << std::setprecision(2)
<< std::fixed << std::setw(4) << it->value() << "] ";
}
deallog << std::endl;
it != m.end(i);
++it)
{
- deallog << "[" << it->column() << "," << std::setprecision(2)
+ deallog << '[' << it->column() << ',' << std::setprecision(2)
<< std::fixed << std::setw(4) << it->value() << "] ";
}
deallog << std::endl;
switch (testcase)
{
case 1:
- deallog << "Pinched cell in " << dim << "d" << std::endl;
+ deallog << "Pinched cell in " << dim << 'd' << std::endl;
vertices[0] = vertices[1];
break;
case 2:
- deallog << "Twisted cell in " << dim << "d" << std::endl;
+ deallog << "Twisted cell in " << dim << 'd' << std::endl;
std::swap(vertices[0], vertices[1]);
break;
default:
switch (testcase)
{
case 2:
- deallog << "Twisted cell in " << dim << "d" << std::endl;
+ deallog << "Twisted cell in " << dim << 'd' << std::endl;
std::swap(vertices[1], vertices[0]);
break;
default:
ff.laplacian_list(vec, values_c);
fef.laplacian_list(vec, values_a);
deallog << "Value of the laplacian in 0.5*e1 and 0.25 * e1:" << std::endl;
- deallog << " correct values: " << values_c[0] << " " << values_c[1]
- << ", approximations: " << values_a[0] << " " << values_a[1]
+ deallog << " correct values: " << values_c[0] << ' ' << values_c[1]
+ << ", approximations: " << values_a[0] << ' ' << values_a[1]
<< std::endl;
}
const std::vector<unsigned int> n =
FETools::lexicographic_to_hierarchic_numbering<dim>(fe.degree);
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << n[i] << " ";
+ deallog << n[i] << ' ';
deallog << std::endl;
}
const std::vector<unsigned int> n =
FETools::hierarchic_to_lexicographic_numbering<dim>(fe.degree);
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << n[i] << " ";
+ deallog << n[i] << ' ';
deallog << std::endl;
}
Assert(n1[n2[i]] == i, ExcInternalError());
Assert(n2[n1[i]] == i, ExcInternalError());
- deallog << n1[n2[i]] << " ";
+ deallog << n1[n2[i]] << ' ';
}
deallog << std::endl;
}
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<2>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
Assert(p.distance(cell->center()) < cell->diameter() / 2, ExcInternalError());
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
Assert(p.distance(cell->center()) < cell->diameter() / 2, ExcInternalError());
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
Assert(p.distance(cell->center()) < cell->diameter() / 2, ExcInternalError());
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
// Transform back and forth
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
// Transform back and forth
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<2>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
AssertThrow(p.distance(cell->center()) < cell->diameter() / 2,
deallog << cell << std::endl;
for (const unsigned int v : GeometryInfo<2>::vertex_indices())
- deallog << "<" << cell->vertex(v) << "> ";
+ deallog << '<' << cell->vertex(v) << "> ";
deallog << std::endl;
AssertThrow(p.distance(cell->center()) < cell->diameter() / 2,
deallog << cell.first << std::endl;
for (const unsigned int v : GeometryInfo<2>::vertex_indices())
- deallog << "<" << cell.first->vertex(v) << "> ";
+ deallog << '<' << cell.first->vertex(v) << "> ";
deallog << "[ " << cell.second << "] ";
deallog << std::endl;
deallog << cell.first << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell.first->vertex(v) << "> " << std::endl;
+ deallog << '<' << cell.first->vertex(v) << "> " << std::endl;
deallog << "[ " << cell.second << "] ";
deallog << std::endl << std::endl;
deallog << cell.first << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell.first->vertex(v) << "> ";
+ deallog << '<' << cell.first->vertex(v) << "> ";
deallog << "[ " << cell.second << "] ";
deallog << std::endl;
deallog << cell.first << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell.first->vertex(v) << "> ";
+ deallog << '<' << cell.first->vertex(v) << "> ";
deallog << "[ " << cell.second << "] ";
deallog << std::endl;
deallog << cell.first << std::endl;
for (const unsigned int v : GeometryInfo<3>::vertex_indices())
- deallog << "<" << cell.first->vertex(v) << "> ";
+ deallog << '<' << cell.first->vertex(v) << "> ";
deallog << "[ " << cell.second << "] ";
deallog << std::endl;
deallog << "Vertex <" << v[i] << "> found in cell ";
for (const unsigned int v : GeometryInfo<2>::vertex_indices())
- deallog << "<" << cell.first->vertex(v) << "> ";
- deallog << " [local: " << cell.second << "]" << std::endl;
+ deallog << '<' << cell.first->vertex(v) << "> ";
+ deallog << " [local: " << cell.second << ']' << std::endl;
}
}
for (unsigned c = 0; c < cells.size(); ++c)
{
for (const unsigned int v : GeometryInfo<2>::vertex_indices())
- deallog << "<" << cells[c]->vertex(v) << "> ";
+ deallog << '<' << cells[c]->vertex(v) << "> ";
deallog << std::endl;
}
}
{
const std::vector<Point<3>> &v = tria.get_vertices();
for (unsigned i = 0; i < v.size(); ++i)
- deallog << "["
+ deallog << '['
<< GridTools::find_closest_vertex(tria,
v[i] +
Point<3>(0.01, -0.01, 0.01))
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
const Point<dim> p2 =
{
// both maps should contain the same
Assert(hp_map[i] == map[i], ExcInternalError());
- deallog << hp_map[i] << " ";
+ deallog << hp_map[i] << ' ';
}
deallog << std::endl;
}
(std::next(dof_handler.begin(0)))->face(1),
cm);
- deallog << "dim " << std::to_string(dim) << ":" << std::endl;
+ deallog << "dim " << std::to_string(dim) << ':' << std::endl;
cm.print(deallog.get_file_stream());
}
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
// create a 2x1 (or 2x1x1) mesh and refine the leftmost cell
Triangulation<dim> triangulation;
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
// create a 2x1 (or 2x1x1) mesh and refine the leftmost cell twice
Triangulation<dim> triangulation;
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
// create a 2x1 (or 2x1x1) mesh and refine the leftmost cell twice
Triangulation<dim> triangulation;
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
// create a 2x1 (or 2x1x1) mesh and refine the leftmost cell
Triangulation<dim> triangulation;
check(tria);
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
check(tria);
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
check(tria);
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
check(x);
}
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
check(x);
}
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
for (unsigned int child = 0; child < cell->n_children(); ++child)
AssertThrow(cell->child(child)->parent() == cell, ExcInternalError());
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
for (unsigned int child = 0; child < cell->n_children(); ++child)
AssertThrow(cell->child(child)->parent() == cell, ExcInternalError());
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
for (unsigned int child = 0; child < cell->n_children(); ++child)
AssertThrow(cell->child(child)->parent() == cell, ExcInternalError());
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
, dof_handler(triangulation)
, mapping(mapping_degree)
{
- deallog << "Using mapping with degree " << mapping_degree << ":" << std::endl
+ deallog << "Using mapping with degree " << mapping_degree << ':' << std::endl
<< "============================" << std::endl;
}
// data_out.build_patches ();
// std::ostringstream filename;
- // filename << output_name_base << "-"
+ // filename << output_name_base << '-'
// << this->refinement_cycle
// << data_out.default_suffix (output_format)
// << std::ends;
for (unsigned int step = 0; true; ++step)
{
- deallog << step << " " << std::flush;
+ deallog << step << ' ' << std::flush;
solver.solve_problem();
const Vector<double> & /*solution*/) const
{
std::ostringstream filename;
- filename << output_name_base << "-" << this->refinement_cycle << ".eps"
+ filename << output_name_base << '-' << this->refinement_cycle << ".eps"
<< std::ends;
GridOut().write_eps(dof_handler.get_triangulation(),
{
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
if (fe.system_to_component_index(i).first == comp)
- deallog << i << " " << fe.unit_support_point(i) << std::endl;
+ deallog << i << ' ' << fe.unit_support_point(i) << std::endl;
deallog << "dim=" << dim << ", cell=ok" << std::endl;
}
{
for (unsigned int i = 0; i < fe.dofs_per_face; ++i)
if (fe.face_system_to_component_index(i).first == comp)
- deallog << i << " " << fe.unit_face_support_point(i) << std::endl;
+ deallog << i << ' ' << fe.unit_face_support_point(i) << std::endl;
deallog << "dim=" << dim << ", face=ok" << std::endl;
}
const auto p2 = p.second;
str << p1 << std::endl
- << p2[0] << " " << p1[1] << std::endl
+ << p2[0] << ' ' << p1[1] << std::endl
<< p2 << std::endl
- << p1[0] << " " << p2[1] << std::endl
+ << p1[0] << ' ' << p2[1] << std::endl
<< p1 << std::endl;
return str.str();
}
test(std::string filename)
{
deallog.get_file_stream()
- << " Tria<" << dim << "," << spacedim << ">: " << std::endl;
+ << " Tria<" << dim << ',' << spacedim << ">: " << std::endl;
Triangulation<dim, spacedim> tria;
GridIn<dim, spacedim> gi;
gi.attach_triangulation(tria);
for (const unsigned int face : GeometryInfo<dim>::face_indices())
{
deallog << " face = " << face
- << " (neighbor = " << cell->neighbor(face) << ")"
+ << " (neighbor = " << cell->neighbor(face) << ')'
<< std::endl;
if (cell->face(face)->has_children())
for (const unsigned int face : GeometryInfo<dim>::face_indices())
{
deallog << " face = " << face
- << " (neighbor = " << cell->neighbor(face) << ")"
+ << " (neighbor = " << cell->neighbor(face) << ')'
<< std::endl;
if (cell->face(face)->has_children())
deallog
<< "Calculation of the integral of ln(x-a)*f(x) on the interval [a,b] = ["
- << a << ", " << b << "]" << std::endl;
+ << a << ", " << b << ']' << std::endl;
for (unsigned int j = 0; j < 13; ++j)
{
exact_integral = 0;
if (std::abs(sum_1 - sum_2) < tol)
deallog << "Test passed" << std::endl;
else
- deallog << sum_1 << " " << sum_2 << std::endl;
+ deallog << sum_1 << ' ' << sum_2 << std::endl;
deallog << std::endl;
}
void
display_matrix(FullMatrix<number> M)
{
- deallog << M.m() << "x" << M.n() << " matrix" << std::endl;
+ deallog << M.m() << 'x' << M.n() << " matrix" << std::endl;
for (unsigned int i = 0; i < M.m(); ++i)
{
for (unsigned int j = 0; j < M.n(); ++j)
- deallog << M(i, j) << " ";
+ deallog << M(i, j) << ' ';
deallog << std::endl;
}
}
void
display_tensor_2(Tensor<2, b> &T)
{
- deallog << b << "x" << b << " tensor" << std::endl;
+ deallog << b << 'x' << b << " tensor" << std::endl;
for (unsigned int i = 0; i < b; ++i)
{
for (unsigned int j = 0; j < b; ++j)
- deallog << T[i][j] << " ";
+ deallog << T[i][j] << ' ';
deallog << std::endl;
}
}
Assert(false, ExcInternalError());
}
log << "==============================\n"
- << dim << spacedim << "-" << flags.compression_level << ".vtu"
+ << dim << spacedim << '-' << flags.compression_level << ".vtu"
<< "\n==============================\n";
check<dim, spacedim>(flags, log);
}
cell->get_dof_indices(local_dof_indices);
for (unsigned int i = 0; i < dofs_per_cell; ++i)
- deallog << local_dof_indices[i] << " ";
+ deallog << local_dof_indices[i] << ' ';
deallog << std::endl;
}
}
for (const auto i : tria.get_boundary_ids())
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
[&](const cell_iterator &cell) {
DT value = map[cell->id()];
std::ostringstream oss;
- oss << "pack " << cell->id() << " " << value;
+ oss << "pack " << cell->id() << ' ' << value;
input.insert(oss.str());
return value;
},
[&](const cell_iterator &cell, const DT &data) {
std::ostringstream oss;
- oss << "unpack " << cell->id() << " " << data << " from "
+ oss << "unpack " << cell->id() << ' ' << data << " from "
<< cell->subdomain_id();
output.insert(oss.str());
[&](const cell_iterator &cell) {
DT value = map[cell->id()];
std::ostringstream oss;
- oss << "pack " << cell->id() << " " << value;
+ oss << "pack " << cell->id() << ' ' << value;
input.insert(oss.str());
return value;
},
[&](const cell_iterator &cell, const DT &data) {
std::ostringstream oss;
- oss << "unpack " << cell->id() << " " << data << " from "
+ oss << "unpack " << cell->id() << ' ' << data << " from "
<< cell->subdomain_id();
output.insert(oss.str());
[&](const cell_iterator &cell) {
DT value = map[cell->id()];
std::ostringstream oss;
- oss << "pack " << cell->id() << " " << value;
+ oss << "pack " << cell->id() << ' ' << value;
input.insert(oss.str());
return value;
},
[&](const cell_iterator &cell, const DT &data) {
std::ostringstream oss;
- oss << "unpack " << cell->id() << " " << data << " from "
+ oss << "unpack " << cell->id() << ' ' << data << " from "
<< cell->subdomain_id();
output.insert(oss.str());
{
DT value = counter;
- oss << "pack " << cell->id() << " " << value;
+ oss << "pack " << cell->id() << ' ' << value;
input[cell->id()] = oss.str();
return value;
}
},
[&](const cell_iterator &cell, const DT &data) {
std::ostringstream oss;
- oss << "unpack " << cell->id() << " " << data << " from "
+ oss << "unpack " << cell->id() << ' ' << data << " from "
<< cell->subdomain_id();
output.insert(oss.str());
cell->get_dof_indices(local_dof_indices);
for (unsigned int i = 0; i < dofs_per_cell; ++i)
- deallog << local_dof_indices[i] << " ";
+ deallog << local_dof_indices[i] << ' ';
deallog << std::endl;
}
deallog << "#dofs:" << dofh.n_dofs() << std::endl;
- deallog << "norm: " << interpolated_solution1.l2_norm() << " "
- << interpolated_solution2.l2_norm() << " "
+ deallog << "norm: " << interpolated_solution1.l2_norm() << ' '
+ << interpolated_solution2.l2_norm() << ' '
<< interpolated_solution.l2_norm() << std::endl;
}
for (; cell != endc; ++cell)
{
- deallog << cell->level_subdomain_id() << " ";
+ deallog << cell->level_subdomain_id() << ' ';
try
{
deallog << cell->subdomain_id();
print_patches(bl);
deallog.push("inv vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("inv vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("inv vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("inv vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("inv vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
bl, dof, level, true, true, true, true, false);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
bl, dof, level, true, true, false, false, false);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
bl, dof, level, true, false, false, false, false);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
bl, dof, level, false, true, true, true, false);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
bl, dof, level, false, false, false, false, false);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
print_patches(bl);
deallog.push("vertex mapping");
for (unsigned int i = 0; i < vm.size(); ++i)
- deallog << " " << vm[i];
+ deallog << ' ' << vm[i];
deallog << std::endl;
deallog.pop();
deallog.pop();
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
dof_handler.clear();
deallog << "those should be zero: " << dof_handler.n_locally_owned_dofs()
- << " "
+ << ' '
<< Utilities::MPI::all_gather(MPI_COMM_SELF,
dof_handler.n_locally_owned_dofs())
.size()
- << " " << dof_handler.n_dofs() << std::endl;
+ << ' ' << dof_handler.n_dofs() << std::endl;
}
}
for (const auto &c : cell_order)
{
c->get_active_or_mg_dof_indices(cell_dofs);
- deallog << c->center() << ":";
+ deallog << c->center() << ':';
for (const auto d : cell_dofs)
- deallog << " " << d;
+ deallog << ' ' << d;
deallog << std::endl;
}
<< "plot '-' using 1:2 with lines notitle, '-' with labels tc rgb 'red' nopoint notitle, '-' with labels point pt 4 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(tria, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
// output cell order
for (unsigned int index = 0; index < cell_order.size(); ++index)
f << cell_order[index]->center() << " \"" << index << "\"\n";
f << std::flush;
- f << "e" << std::endl << std::endl;
+ f << 'e' << std::endl << std::endl;
// output only owned support points
for (auto it = support_points.cbegin(); it != support_points.cend();)
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 10);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
const std::vector<types::global_dof_index> n_dofs =
DoFTools::count_dofs_per_fe_component(dof_handler);
for (unsigned int i = 0; i < n_dofs.size(); ++i)
- deallog << n_dofs[i] << " ";
+ deallog << n_dofs[i] << ' ';
deallog << std::endl;
}
std::vector<types::global_dof_index> map(dof_handler.n_dofs());
DoFTools::map_dof_to_boundary_indices(dof_handler, map);
for (unsigned int i = 0; i < map.size(); ++i)
- deallog << (int)map[i] << " ";
+ deallog << (int)map[i] << ' ';
deallog << std::endl;
}
deallog << (map[i] == numbers::invalid_dof_index ?
-1 :
static_cast<signed int>(map[i]))
- << " ";
+ << ' ';
deallog << std::endl;
// check for boundary id 0 and 1
deallog << (map[i] == numbers::invalid_dof_index ?
-1 :
static_cast<signed int>(map[i]))
- << " ";
+ << ' ';
deallog << std::endl;
}
// output every third element
for (unsigned int i = 0; i < map.size(); i += 3)
- deallog << map[i] << " ";
+ deallog << map[i] << ' ';
deallog << std::endl;
}
// output every third element
for (unsigned int i = 0; i < dof_data.size(); i += 3)
- deallog << dof_data(i) << " ";
+ deallog << dof_data(i) << ' ';
deallog << std::endl;
DoFTools::distribute_cell_to_dof_vector(
dof_handler, cell_data, dof_data, dof_handler.get_fe().n_components() - 1);
for (unsigned int i = 0; i < dof_data.size(); i += 3)
- deallog << dof_data(i) << " ";
+ deallog << dof_data(i) << ' ';
deallog << std::endl;
}
DoFTools::distribute_cell_to_dof_vector(dof_handler, cell_data, dof_data);
// output every third element
for (unsigned int i = 0; i < dof_data.size(); i += 3)
- deallog << dof_data(i) << " ";
+ deallog << dof_data(i) << ' ';
deallog << std::endl;
// check that no other values were
DoFTools::distribute_cell_to_dof_vector(
dof_handler, cell_data, dof_data, dof_handler.get_fe().n_components() - 1);
for (unsigned int i = 0; i < dof_data.size(); i += 3)
- deallog << dof_data(i) << " ";
+ deallog << dof_data(i) << ' ';
deallog << std::endl;
// check that no other values were
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
for (unsigned int l = 0; l < sp.n_rows(); ++l)
{
for (unsigned int c = 0; c < sp.row_length(l); ++c)
- deallog << sp.column_number(l, c) << " ";
+ deallog << sp.column_number(l, c) << ' ';
deallog << std::endl;
}
{
const unsigned int line = l * (sp.n_rows() / 20);
for (unsigned int c = 0; c < sp.row_length(line); ++c)
- deallog << sp.column_number(line, c) << " ";
+ deallog << sp.column_number(line, c) << ' ';
deallog << std::endl;
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
++c)
deallog << sp.block(block_row.first, col)
.column_number(block_row.second, c)
- << " ";
+ << ' ';
deallog << std::endl;
}
}
deallog << "DoFs of face_1:";
for (unsigned int c = 0; c < fe.n_components(); ++c)
{
- deallog << std::endl << " component " << c << ":";
+ deallog << std::endl << " component " << c << ':';
for (unsigned int i = 0; i < fe.dofs_per_face; ++i)
{
if (fe.face_system_to_component_index(i).first == c)
deallog << " (" << dofs_1[i] << " - " << support_points[dofs_1[i]]
- << ")";
+ << ')';
}
}
deallog << std::endl;
deallog << "DoFs of face_2:";
for (unsigned int c = 0; c < fe.n_components(); ++c)
{
- deallog << std::endl << " component " << c << ":";
+ deallog << std::endl << " component " << c << ':';
for (unsigned int i = 0; i < fe.dofs_per_face; ++i)
{
if (fe.face_system_to_component_index(i).first == c)
deallog << " (" << dofs_2[i] << " - " << support_points[dofs_2[i]]
- << ")";
+ << ')';
}
}
deallog << std::endl;
deallog << "DoFs of face_1:";
for (unsigned int c = 0; c < fe.n_components(); ++c)
{
- deallog << std::endl << " component " << c << ":";
+ deallog << std::endl << " component " << c << ':';
for (unsigned int i = 0; i < fe.dofs_per_face; ++i)
{
if (fe.face_system_to_component_index(i).first == c)
deallog << " (" << dofs_1[i] << " - " << support_points[dofs_1[i]]
- << ")";
+ << ')';
}
}
deallog << std::endl;
deallog << "DoFs of face_2:";
for (unsigned int c = 0; c < fe.n_components(); ++c)
{
- deallog << std::endl << " component " << c << ":";
+ deallog << std::endl << " component " << c << ':';
for (unsigned int i = 0; i < fe.dofs_per_face; ++i)
{
if (fe.face_system_to_component_index(i).first == c)
deallog << " (" << dofs_2[i] << " - " << support_points[dofs_2[i]]
- << ")";
+ << ')';
}
}
deallog << std::endl;
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
dh.clear();
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
dh.clear();
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
{
out << "plot '-' using 1:2 with lines, '-' with labels point pt 2 offset 1,1"
<< std::endl;
GridOut().write_gnuplot(triangulation, deallog.get_file_stream());
- out << "e" << std::endl;
+ out << 'e' << std::endl;
std::map<types::global_dof_index, Point<dim>> support_points;
DoFTools::map_dofs_to_support_points(MappingQ1<dim>(),
support_points);
DoFTools::write_gnuplot_dof_support_point_info(deallog.get_file_stream(),
support_points);
- out << "e" << std::endl;
+ out << 'e' << std::endl;
}
<< "plot '-' using 1:2 with lines, '-' with labels point pt 2 offset 1,1"
<< std::endl;
GridOut().write_gnuplot(triangulation, deallog.get_file_stream());
- out << "e" << std::endl;
+ out << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(deallog.get_file_stream(),
support_points);
- out << "e" << std::endl;
+ out << 'e' << std::endl;
}
<< "plot '-' using 1:2 with lines, '-' with labels point pt 2 offset 1,1"
<< std::endl;
GridOut().write_gnuplot(triangulation, deallog.get_file_stream());
- out << "e" << std::endl;
+ out << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(deallog.get_file_stream(),
support_points);
- out << "e" << std::endl;
+ out << 'e' << std::endl;
}
component_mask);
for (unsigned int i = 0; i < dof_handler.n_dofs(); ++i)
if (fixed_dofs[i] == true)
- deallog << i << " " << dirichlet_dofs[i] << std::endl;
+ deallog << i << ' ' << dirichlet_dofs[i] << std::endl;
}
for (; it_0 != support_points_0.end(); ++it_0, ++it_1)
{
- deallog << it_0->second << " " << it_1->second << std::endl;
+ deallog << it_0->second << ' ' << it_1->second << std::endl;
}
}
const Vector<double> & /*solution*/) const
{
std::ostringstream filename;
- filename << output_name_base << "-" << this->refinement_cycle << ".eps"
+ filename << output_name_base << '-' << this->refinement_cycle << ".eps"
<< std::ends;
GridOut().write_eps(dof_handler.get_triangulation(),
for (unsigned int realization = 0; realization < n_realizations;
++realization)
{
- deallog << "Realization " << realization << ":" << std::endl;
+ deallog << "Realization " << realization << ':' << std::endl;
MinimizationProblem<1> minimization_problem_1d(realization);
minimization_problem_1d.run();
void
test(const unsigned int degree)
{
- deallog << "FE_RaviartThomas<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_RaviartThomas<" << dim << "> (" << degree << ')' << std::endl;
FE_RaviartThomas<dim> fe_rt(degree);
const double threshold = 1e-6;
deallog << ", dofs_per_cell=" << fe.dofs_per_cell << "; relative residual: "
<< (relative_residual < threshold ? "ok" : "botched up!")
- << " (relative residual=" << relative_residual << ")" << std::endl;
+ << " (relative residual=" << relative_residual << ')' << std::endl;
}
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
for (unsigned int realization = 0; realization < n_realizations;
++realization)
{
- deallog << "Realization " << realization << ":" << std::endl;
+ deallog << "Realization " << realization << ':' << std::endl;
MinimizationProblem<1> minimization_problem_1d(realization);
minimization_problem_1d.run();
for (unsigned int i = 0; i < fe_bdm.dofs_per_cell; ++i)
{
for (unsigned int c = 0; c < dim; ++c)
- deallog << " " << fe_bdm.shape_value_component(i, p, c);
+ deallog << ' ' << fe_bdm.shape_value_component(i, p, c);
deallog << " ";
}
deallog << std::endl << "grad " << p;
<< ", restriction is additive flags:" << std::endl;
for (unsigned int i = 0; i < fe_bdm.dofs_per_cell; ++i)
- deallog << fe_bdm.restriction_is_additive(i) << " ";
+ deallog << fe_bdm.restriction_is_additive(i) << ' ';
deallog << std::endl;
}
void
test(const unsigned int degree)
{
- deallog << "FE_BDM<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_BDM<" << dim << "> (" << degree << ')' << std::endl;
FE_BDM<dim> fe_rt(degree);
const FullMatrix<double> &constraints = fe_rt.constraints();
void
test(const unsigned int degree)
{
- deallog << "FE_BDM<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_BDM<" << dim << "> (" << degree << ')' << std::endl;
FE_BDM<dim> fe_rt(degree);
deallog << "[ ";
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_values.jacobian(q)[d][e] << " ";
+ deallog << fe_values.jacobian(q)[d][e] << ' ';
deallog << " ] ";
}
deallog << std::endl;
{
deallog << "[ ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << fe_values.shape_grad(fe.dofs_per_cell / 2, q)[d] << " ";
+ deallog << fe_values.shape_grad(fe.dofs_per_cell / 2, q)[d] << ' ';
deallog << " ] ";
}
deallog << std::endl;
deallog << "[ ";
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_values.jacobian(q)[d][e] << " ";
+ deallog << fe_values.jacobian(q)[d][e] << ' ';
deallog << " ] ";
}
deallog << std::endl;
deallog << "[ ";
for (unsigned int d = 0; d < dim; ++d)
deallog << fe_values.shape_grad(fe.dofs_per_cell / 2, q)[d]
- << " ";
+ << ' ';
deallog << " ] ";
}
deallog << std::endl;
deallog << "[ ";
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_values.jacobian(q)[d][e] << " ";
+ deallog << fe_values.jacobian(q)[d][e] << ' ';
deallog << " ] ";
}
deallog << std::endl;
{
deallog << "[ ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << fe_values.shape_grad(fe.dofs_per_cell / 2, q)[d] << " ";
+ deallog << fe_values.shape_grad(fe.dofs_per_cell / 2, q)[d] << ' ';
deallog << " ] ";
}
deallog << std::endl;
void
test(const unsigned int degree)
{
- deallog << "FE_Q<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_Q<" << dim << "> (" << degree << ')' << std::endl;
FE_Q<dim> fe_q(degree);
FE_Q<dim> x(fe_q);
void
test(const unsigned int degree)
{
- deallog << "FE_DGPMonomial<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_DGPMonomial<" << dim << "> (" << degree << ')' << std::endl;
FE_DGPMonomial<dim> fe_q(degree);
void
test(const unsigned int degree1, const unsigned int degree2)
{
- deallog << "FE_DGPMonomial" << dim << "> (" << degree1 << ")"
- << " to FE_DGPMonomial<" << dim << "> (" << degree2 << ")"
+ deallog << "FE_DGPMonomial" << dim << "> (" << degree1 << ')'
+ << " to FE_DGPMonomial<" << dim << "> (" << degree2 << ')'
<< std::endl;
FE_DGPMonomial<dim> fe1(degree1);
void
test(const unsigned int degree1, const unsigned int degree2)
{
- deallog << "FE_DGQ<" << dim << "> (" << degree1 << ")"
- << " to FE_DGQ<" << dim << "> (" << degree2 << ")" << std::endl;
+ deallog << "FE_DGQ<" << dim << "> (" << degree1 << ')' << " to FE_DGQ<" << dim
+ << "> (" << degree2 << ')' << std::endl;
FE_DGQ<dim> fe1(degree1);
FE_DGQ<dim> fe2(degree2);
for (unsigned int r = 0; r < constant_modes.n_rows(); ++r)
{
for (unsigned int c = 0; c < constant_modes.n_cols(); ++c)
- deallog << constant_modes(r, c) << " ";
+ deallog << constant_modes(r, c) << ' ';
deallog << std::endl;
}
deallog << std::endl;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
for (unsigned int c = 0; c < fe.n_components(); ++c)
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
const unsigned int p_feq = 1,
const unsigned int p_feen = 2)
{
- deallog << "hp: " << do_href << " " << p_feq << " " << p_feen << std::endl;
+ deallog << "hp: " << do_href << ' ' << p_feq << ' ' << p_feen << std::endl;
Triangulation<dim> triangulation;
DoFHandler<dim> dof_handler(triangulation);
void
test2cells(const unsigned int p_feq = 2, const unsigned int p_feen = 1)
{
- deallog << "2cells: " << dim << " " << p_feq << " " << p_feen << std::endl;
+ deallog << "2cells: " << dim << ' ' << p_feq << ' ' << p_feen << std::endl;
Triangulation<dim> triangulation;
{
Triangulation<dim> triangulationL;
void
test2cellsFESystem(const unsigned int p_feq = 2, const unsigned int p_feen = 1)
{
- deallog << "2cells: " << dim << " " << p_feq << " " << p_feen << std::endl;
+ deallog << "2cells: " << dim << ' ' << p_feq << ' ' << p_feen << std::endl;
Triangulation<dim> triangulation;
{
Triangulation<dim> triangulationL;
for (int i = 0; i < 5; ++i)
for (int j = 0; j < 5; ++j)
{
- deallog << i << ":" << j << "="
+ deallog << i << ':' << j << '='
<< ColorEnriched::internal::find_connection_between_subdomains(
dof_handler, predicates[i], predicates[j])
<< std::endl;
// 0 1 0 indicates predicate with index 2 is true in the cell.
deallog << cell->index() << ":predicates=";
for (auto predicate : vec_predicates)
- deallog << predicate(cell) << ":";
+ deallog << predicate(cell) << ':';
// print color predicate pairs for a cell
// Note that here material id is used to identify cells
for (auto color_predicate_pair :
cellwise_color_predicate_map[cell->material_id()])
{
- deallog << "(" << color_predicate_pair.first << ","
+ deallog << '(' << color_predicate_pair.first << ','
<< color_predicate_pair.second << "):";
}
//{1,2} indicates 2 enrichment functions of color 1 and 2 are relevant.
deallog << ":fe_active_index:" << cell->active_fe_index() << ":fe_set:";
for (auto fe_set_element : fe_sets[cell->active_fe_index()])
- deallog << fe_set_element << ":";
+ deallog << fe_set_element << ':';
deallog << std::endl;
}
unsigned int cell_id = cell->index();
deallog << cell_id << ":predicates=";
for (auto predicate : vec_predicates)
- deallog << predicate(cell) << ":";
+ deallog << predicate(cell) << ':';
/*
* Check if a color and enrichment index map exists for the cell.
{
deallog << "color:";
for (auto color : fe_set)
- deallog << ":" << color;
+ deallog << ':' << color;
deallog << std::endl;
}
for (unsigned int i = 0; i < points_enrichments.size(); i = i + dim)
{
for (int d = 0; d < dim; ++d)
- std::cout << points_enrichments[i + d] << " ";
+ std::cout << points_enrichments[i + d] << ' ';
std::cout << std::endl;
}
<< std::endl;
GridOut grid_out;
grid_out.write_gnuplot(dof_handler.get_triangulation(), f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
std::cout << "...finished printing support points" << std::endl;
}
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
for (auto it : dof_handler.active_cell_iterators())
f << it->center() << " \"" << it->active_fe_index() << "\"\n";
- f << std::flush << "e" << std::endl;
+ f << std::flush << 'e' << std::endl;
pcout << "...finished print fe indices" << std::endl;
}
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
for (auto it : dof_handler.active_cell_iterators())
f << it->center() << " \"" << it->index() << "\"\n";
- f << std::flush << "e" << std::endl;
+ f << std::flush << 'e' << std::endl;
pcout << "...end print cell indices" << std::endl;
}
}
pcout << "refinement h_smallest Dofs L2_norm H1_norm" << std::endl;
- pcout << prm.global_refinement << " "
- << prm.size / std::pow(2.0, prm.global_refinement) << " "
- << dof_handler.n_dofs() << " " << L2_error << " " << H1_error
+ pcout << prm.global_refinement << ' '
+ << prm.size / std::pow(2.0, prm.global_refinement) << ' '
+ << dof_handler.n_dofs() << ' ' << L2_error << ' ' << H1_error
<< std::endl;
}
<< std::endl;
GridOut grid_out;
grid_out.write_gnuplot(dof_handler.get_triangulation(), f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
deallog << "...finished printing support points" << std::endl;
}
// now print some data on the shape
// functions
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << "shape_function " << i << ":" << std::endl
+ deallog << "shape_function " << i << ':' << std::endl
<< " phi=" << fe_values.shape_value(i, 0) << std::endl
<< " grad phi=" << fe_values.shape_grad(i, 0) << std::endl
<< " grad^2 phi=" << fe_values.shape_hessian(i, 0)
// now print some data on the shape
// functions
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << "shape_function " << i << ":" << std::endl
+ deallog << "shape_function " << i << ':' << std::endl
<< " phi=" << fe_values.shape_value(i, 0) << std::endl
<< " grad phi=" << fe_values.shape_grad(i, 0) << std::endl
<< " grad^2 phi=" << fe_values.shape_hessian(i, 0)
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << "DoF#" << i << ", value=["
<< fe_values[component].value(i, 0) << "], curl=["
- << fe_values[component].curl(i, 0) << "]" << std::endl;
+ << fe_values[component].curl(i, 0) << ']' << std::endl;
}
}
}
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
const double Linfty_error = difference_per_cell.linfty_norm();
deallog << std::endl
- << fe->get_name() << " " << i << std::endl
+ << fe->get_name() << ' ' << i << std::endl
<< "L2_error: " << L2_error << std::endl
<< "H1_error: " << H1_error << std::endl
<< "Linfty_error: " << Linfty_error << std::endl
{
degree = 1;
FESystem<dim> fe(FE_Q<dim>(degree + 1), dim, FE_Q<dim>(degree), 1);
- deallog << fe.get_name() << ":" << std::endl;
+ deallog << fe.get_name() << ':' << std::endl;
StokesProblem<2> flow_problem(degree, fe);
flow_problem.run();
}
{
degree = 1;
FESystem<2> fe(FE_Q<dim>(degree + 1), dim, FE_Q_DG0<dim>(degree), 1);
- deallog << fe.get_name() << ":" << std::endl;
+ deallog << fe.get_name() << ':' << std::endl;
StokesProblem<2> flow_problem(degree, fe);
flow_problem.run();
}
{
degree = 2;
FESystem<2> fe(FE_Q<dim>(degree + 1), dim, FE_Q_DG0<dim>(degree), 1);
- deallog << fe.get_name() << ":" << std::endl;
+ deallog << fe.get_name() << ':' << std::endl;
StokesProblem<2> flow_problem(degree, fe);
flow_problem.run();
}
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
deallog << N(i, j) - 0.0;
}
if (j + 1 < 4)
- deallog << " ";
+ deallog << ' ';
else
deallog << std::endl;
}
for (unsigned int j = 0; j < n_dofs; ++j)
{
- deallog << local_dofs[j] - interpolated_local_dofs[j] << " ";
+ deallog << local_dofs[j] - interpolated_local_dofs[j] << ' ';
}
deallog << std::endl;
}
{
for (unsigned int q = 0; q < quadrature.size(); ++q)
{
- deallog << fev.shape_value(i, q) << " ";
+ deallog << fev.shape_value(i, q) << ' ';
for (unsigned int d = 0; d < 2; ++d)
{
- deallog << fev.shape_grad(i, q)[d] << " ";
+ deallog << fev.shape_grad(i, q)[d] << ' ';
}
}
deallog << std::endl;
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
deallog << "Cell nodes:" << std::endl;
for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
- deallog << i << ": (" << cell->vertex(i) << ")" << std::endl;
+ deallog << i << ": (" << cell->vertex(i) << ')' << std::endl;
bool cell_ok = true;
deallog << "calculated:" << std::endl;
for (unsigned int i = 0; i < N; ++i)
- deallog << fourier_coefficients[i].real() << " "
+ deallog << fourier_coefficients[i].real() << ' '
<< fourier_coefficients[i].imag() << std::endl;
deallog << "exact:" << std::endl;
for (unsigned int i = 0; i < N; ++i)
- deallog << exact[i].real() << " " << exact[i].imag() << std::endl;
+ deallog << exact[i].real() << ' ' << exact[i].imag() << std::endl;
}
}
for (unsigned int i = 0; i < coeff_in.size(); ++i)
- deallog << coeff_in[i] << " ";
+ deallog << coeff_in[i] << ' ';
deallog << std::endl;
for (unsigned int i = 0; i < N; ++i)
- deallog << coeff_out[i] << " ";
+ deallog << coeff_out[i] << ' ';
deallog << std::endl;
deallog << "local dofs:";
for (unsigned int i = 0; i < cell_n_dofs; ++i)
- dealii::deallog << " " << local_dof_values[i];
+ dealii::deallog << ' ' << local_dof_values[i];
dealii::deallog << std::endl;
}
{
deallog << "l=" << l << ": ";
for (double x = -1.0; x <= 1.0; x += 1.0)
- deallog << std_cxx17::legendre(l, x) << " ";
+ deallog << std_cxx17::legendre(l, x) << ' ';
deallog << std::endl;
}
}
ortho *= (1.0 + k1 + k2) / 2.0;
- deallog << "(" << k1 << "," << k2 << ") = " << ortho << std::endl;
+ deallog << '(' << k1 << ',' << k2 << ") = " << ortho << std::endl;
}
deallog << std::endl;
}
{
for (unsigned int i = 0; i < coeff.size(0); ++i)
for (unsigned int j = 0; j < coeff.size(1); ++j)
- deallog << coeff(i, j) << " ";
+ deallog << coeff(i, j) << ' ';
deallog << std::endl;
}
for (unsigned int i = 0; i < coeff.size(0); ++i)
for (unsigned int j = 0; j < coeff.size(1); ++j)
for (unsigned int k = 0; k < coeff.size(2); ++k)
- deallog << coeff(i, j, k) << " ";
+ deallog << coeff(i, j, k) << ' ';
deallog << std::endl;
}
std::pair<double, double> fit = FESeries::linear_regression(x, y);
- deallog << "exact: " << k_in << " " << b_in << std::endl;
- deallog << "calculated: " << fit.first << " " << fit.second << std::endl;
+ deallog << "exact: " << k_in << ' ' << b_in << std::endl;
+ deallog << "calculated: " << fit.first << ' ' << fit.second << std::endl;
}
{
deallog << i << ": ( ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << cell->vertex(i)[d] << " ";
- deallog << ")" << std::endl;
+ deallog << cell->vertex(i)[d] << ' ';
+ deallog << ')' << std::endl;
}
bool cell_ok = true;
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 0.5,0.5 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
}
deallog << fe.get_name() << std::endl;
for (auto it : fe.get_generalized_support_points())
{
- deallog << "(" << it[0] << "," << it[1] << ") ";
+ deallog << '(' << it[0] << ',' << it[1] << ") ";
}
deallog << std::endl;
};
deallog << std::setw(width) << std::setprecision(precision)
<< A(i, j);
else
- deallog << std::setw(width) << std::setprecision(precision) << "~";
+ deallog << std::setw(width) << std::setprecision(precision) << '~';
deallog << ' ';
};
deallog << std::endl;
{
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << selected_vector_values[q][d][e][f] << " ";
+ deallog << selected_vector_values[q][d][e][f] << ' ';
deallog << std::endl;
Assert((selected_vector_values[q][d] - vector_values[q][c + d])
.norm() <= 1e-12 * selected_vector_values[q][d].norm(),
<< std::endl
<< "Total number of cells: " << triangulation.n_cells() << std::endl
<< "Number of degrees of freedom: " << dof_handler.n_dofs() << " = ("
- << n_stress_dof << " + " << n_gamma_dof << ")" << std::endl;
+ << n_stress_dof << " + " << n_gamma_dof << ')' << std::endl;
// following step-22 use of simple
// compressed block sparsity
<< std::endl
<< "Total number of cells: " << triangulation.n_cells() << std::endl
<< "Number of degrees of freedom: " << dof_handler.n_dofs() << " = ("
- << n_stress_dof << " + " << n_gamma_dof << ")" << std::endl;
+ << n_stress_dof << " + " << n_gamma_dof << ')' << std::endl;
// following step-22 use of simple
// compressed block sparsity
<< std::endl
<< "Total number of cells: " << triangulation.n_cells() << std::endl
<< "Number of degrees of freedom: " << dof_handler.n_dofs() << " = ("
- << n_stress_dof << " + " << n_gamma_dof << ")" << std::endl;
+ << n_stress_dof << " + " << n_gamma_dof << ')' << std::endl;
{
BlockDynamicSparsityPattern csp(2, 2);
<< std::endl
<< "Total number of cells: " << triangulation.n_cells() << std::endl
<< "Number of degrees of freedom: " << dof_handler.n_dofs() << " = ("
- << n_stress_dof << " + " << n_gamma_dof << ")" << std::endl;
+ << n_stress_dof << " + " << n_gamma_dof << ')' << std::endl;
// following step-22 use of simple compressed block sparsity pattern for
// efficiency
unsigned int cc = 0;
for (; cell != endc; ++cell) // loop over all cells
{
- deallog << ++cc << " ";
+ deallog << ++cc << ' ';
cell_matrix = 0;
cell_rhs = 0;
TableIndices<2> indices(i, j);
unsigned int unrolled =
Tensor<2, dim>::component_to_unrolled_index(indices);
- deallog << i << " " << j << " -> " << unrolled << std::endl;
+ deallog << i << ' ' << j << " -> " << unrolled << std::endl;
indices = Tensor<2, dim>::unrolled_to_component_indices(unrolled);
- deallog << unrolled << " -> " << indices[0] << " " << indices[1]
+ deallog << unrolled << " -> " << indices[0] << ' ' << indices[1]
<< std::endl;
}
}
template solution_gradient_type<double>
t2;
- deallog << "Test<" << Utilities::dim_string(dim, spacedim) << ">" << std::endl
+ deallog << "Test<" << Utilities::dim_string(dim, spacedim) << '>' << std::endl
<< Utilities::type_to_string(t1) << std::endl
<< Utilities::type_to_string(t2) << std::endl;
}
for (unsigned int i = 1; i < 4; ++i)
for (unsigned int j = i; j < 4; ++j)
{
- deallog << "inj " << i << " " << j << ":" << std::endl;
+ deallog << "inj " << i << ' ' << j << ':' << std::endl;
do_check(FE_Q_DG0<dim>(QIterated<1>(QTrapezoid<1>(), i)),
FE_Q_DG0<dim>(QIterated<1>(QTrapezoid<1>(), j)));
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.jacobian(0)[d][e] << " ";
+ deallog << fe_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_val.jacobian_pushed_forward_grad(0)[d][e][f] << " ";
+ deallog << fe_val.jacobian_pushed_forward_grad(0)[d][e][f] << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
for (unsigned int g = 0; g < dim; ++g)
- deallog << fe_val.jacobian_2nd_derivative(0)[d][e][f][g] << " ";
+ deallog << fe_val.jacobian_2nd_derivative(0)[d][e][f][g] << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int g = 0; g < dim; ++g)
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_3rd_derivative(0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.jacobian(0)[d][e] << " ";
+ deallog << fe_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_sub_val.jacobian(0)[d][e] << " ";
+ deallog << fe_sub_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
// Also check the inverse Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_sub_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_sub_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_sub_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_sub_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
}
}
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
deallog << fe_val.jacobian_pushed_forward_grad(0)[d][e][f]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int f = 0; f < dim; ++f)
deallog
<< fe_sub_val.jacobian_pushed_forward_grad(0)[d][e][f]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int f = 0; f < dim; ++f)
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_2nd_derivative(0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int g = 0; g < dim; ++g)
deallog
<< fe_sub_val.jacobian_2nd_derivative(0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
deallog
<< fe_sub_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int g = 0; g < dim; ++g)
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_3rd_derivative(0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_sub_val.jacobian_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
deallog
<< fe_sub_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.jacobian(0)[d][e] << " ";
+ deallog << fe_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_sub_val.jacobian(0)[d][e] << " ";
+ deallog << fe_sub_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
// Also check the inverse Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_sub_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_sub_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_sub_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_sub_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
}
}
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
deallog << fe_val.jacobian_pushed_forward_grad(0)[d][e][f]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int f = 0; f < dim; ++f)
deallog
<< fe_sub_val.jacobian_pushed_forward_grad(0)[d][e][f]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int f = 0; f < dim; ++f)
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_2nd_derivative(0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int g = 0; g < dim; ++g)
deallog
<< fe_sub_val.jacobian_2nd_derivative(0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
deallog
<< fe_sub_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int g = 0; g < dim; ++g)
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_3rd_derivative(0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_sub_val.jacobian_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
deallog
<< fe_sub_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.jacobian(0)[d][e] << " ";
+ deallog << fe_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_sub_val.jacobian(0)[d][e] << " ";
+ deallog << fe_sub_val.jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
// Also check the inverse Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
- deallog << fe_sub_val.inverse_jacobian(0)[d][e] << " ";
+ deallog << fe_sub_val.inverse_jacobian(0)[d][e] << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int d = 0; d < dim; ++d)
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
- deallog << fe_sub_val.jacobian_grad(0)[d][e][f] << " ";
+ deallog << fe_sub_val.jacobian_grad(0)[d][e][f] << ' ';
deallog << std::endl;
}
}
for (unsigned int e = 0; e < dim; ++e)
for (unsigned int f = 0; f < dim; ++f)
deallog << fe_val.jacobian_pushed_forward_grad(0)[d][e][f]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int f = 0; f < dim; ++f)
deallog
<< fe_sub_val.jacobian_pushed_forward_grad(0)[d][e][f]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int f = 0; f < dim; ++f)
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_2nd_derivative(0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int g = 0; g < dim; ++g)
deallog
<< fe_sub_val.jacobian_2nd_derivative(0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int g = 0; g < dim; ++g)
deallog << fe_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
deallog
<< fe_sub_val.jacobian_pushed_forward_2nd_derivative(
0)[d][e][f][g]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int g = 0; g < dim; ++g)
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_3rd_derivative(0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_sub_val.jacobian_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int h = 0; h < dim; ++h)
deallog << fe_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
// Also check the Jacobian with FESubfaceValues
deallog
<< fe_sub_val.jacobian_pushed_forward_3rd_derivative(
0)[d][e][f][g][h]
- << " ";
+ << ' ';
deallog << std::endl;
}
}
for (unsigned int d = 0; d < dim; ++d)
deallog << (d == 0 ? "" : " ") << shape_values[q](d);
- deallog << "]" << std::endl;
+ deallog << ']' << std::endl;
};
deallog << std::endl;
const double expected = (i == j) ? 1. : 0.;
if (std::fabs(result(i, j) - expected) > 1.e-12)
{
- deallog << i << " " << j << " " << result(i, j) << std::endl;
+ deallog << i << ' ' << j << ' ' << result(i, j) << std::endl;
is_identity = false;
}
}
for (unsigned int i = 0; i < fe_rt.dofs_per_cell; ++i)
{
for (unsigned int c = 0; c < dim; ++c)
- deallog << " " << fe_rt.shape_value_component(i, p, c);
+ deallog << ' ' << fe_rt.shape_value_component(i, p, c);
deallog << " ";
}
deallog << std::endl << "grad " << p;
deallog << "[ ";
for (unsigned int c = 0; c < fe_rt.n_components(); ++c)
deallog << fe_values.shape_grad_component(i, q, c) << ' ';
- deallog << "]";
+ deallog << ']';
}
deallog << std::endl;
}
void
test(const unsigned int degree)
{
- deallog << "FE_RaviartThomas<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_RaviartThomas<" << dim << "> (" << degree << ')' << std::endl;
FE_RaviartThomas<dim> fe_rt(degree);
const FullMatrix<double> &constraints = fe_rt.constraints();
void
test(const unsigned int degree)
{
- deallog << "FE_RaviartThomas<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_RaviartThomas<" << dim << "> (" << degree << ')' << std::endl;
FE_RaviartThomas<dim> fe_rt(degree);
if (q_point % QIterated<1>(q_trapez, div).size() == 0)
deallog << std::endl;
- deallog << fe.quadrature_point(q_point) << " ";
+ deallog << fe.quadrature_point(q_point) << ' ';
for (unsigned int i = 0; i < fe_rt.dofs_per_cell; ++i)
for (unsigned int c = 0; c < fe.get_fe().n_components(); ++c)
- deallog << " " << fe.shape_value_component(i, q_point, c);
+ deallog << ' ' << fe.shape_value_component(i, q_point, c);
deallog << std::endl;
}
for (unsigned int i = 0; i < fe_rt_bubbles.dofs_per_cell; ++i)
{
for (unsigned int c = 0; c < dim; ++c)
- deallog << " "
+ deallog << ' '
<< fe_rt_bubbles.shape_value_component(i, p, c);
deallog << " ";
}
<< ", restriction is additive flags:" << std::endl;
for (unsigned int i = 0; i < fe_rt_bubbles.dofs_per_cell; ++i)
- deallog << fe_rt_bubbles.restriction_is_additive(i) << " ";
+ deallog << fe_rt_bubbles.restriction_is_additive(i) << ' ';
deallog << std::endl;
}
void
test(const unsigned int degree)
{
- deallog << "FE_RT_Bubbles<" << dim << "> (" << degree << ")" << std::endl;
+ deallog << "FE_RT_Bubbles<" << dim << "> (" << degree << ')' << std::endl;
FE_RT_Bubbles<dim> fe_rt_bubbles(degree);
const FullMatrix<double> &constraints = fe_rt_bubbles.constraints();
if (q_point % QIterated<1>(q_trapez, div).size() == 0)
deallog << std::endl;
- deallog << fe.quadrature_point(q_point) << " ";
+ deallog << fe.quadrature_point(q_point) << ' ';
for (unsigned int i = 0; i < fe_rt.dofs_per_cell; ++i)
for (unsigned int c = 0; c < fe.get_fe().n_components(); ++c)
- deallog << " " << fe.shape_value_component(i, q_point, c);
+ deallog << ' ' << fe.shape_value_component(i, q_point, c);
deallog << std::endl;
}
deallog << "interface_dof_indices: ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
mycell->get_dof_indices(indices);
deallog << "cell " << c << ": ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
++mycell;
}
deallog << "interface_dof_indices: ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
mycell->get_dof_indices(indices);
deallog << "cell " << c << ": ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
++mycell;
}
deallog << "interface_dof_indices: ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
mycell->get_mg_dof_indices(indices);
deallog << "cell " << c << ": ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
++mycell;
}
mycell->get_mg_dof_indices(indices);
deallog << "cell " << c << ": ";
for (auto i : indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "\n";
mycell = cell->neighbor(f);
}
AdvectionProblem<dim>::output_results(const unsigned int cycle) const
{
const std::string filename = "solution-" + std::to_string(cycle) + ".vtk";
- deallog << "Writing solution to <" << filename << ">" << std::endl;
+ deallog << "Writing solution to <" << filename << '>' << std::endl;
std::ofstream output(filename);
DataOut<dim> data_out;
for (std::size_t j = 0; j < n; ++j)
A(i, j) = n * i + j;
- deallog << "Size of A:" << std::endl << A.m() << " " << A.n() << std::endl;
+ deallog << "Size of A:" << std::endl << A.m() << ' ' << A.n() << std::endl;
FullMatrix<double> B = std::move(A);
- deallog << "Size of B:" << std::endl << B.m() << " " << B.n() << std::endl;
- deallog << "Size of A:" << std::endl << A.m() << " " << A.n() << std::endl;
+ deallog << "Size of B:" << std::endl << B.m() << ' ' << B.n() << std::endl;
+ deallog << "Size of A:" << std::endl << A.m() << ' ' << A.n() << std::endl;
A = std::move(B);
- deallog << "Size of B:" << std::endl << B.m() << " " << B.n() << std::endl;
- deallog << "Size of A:" << std::endl << A.m() << " " << A.n() << std::endl;
+ deallog << "Size of B:" << std::endl << B.m() << ' ' << B.n() << std::endl;
+ deallog << "Size of A:" << std::endl << A.m() << ' ' << A.n() << std::endl;
return 0;
}
deallog << std::setw(4) << cell->subdomain_id() << " : ";
for (const auto dof : dofs)
- deallog << std::setw(4) << dof << " ";
+ deallog << std::setw(4) << dof << ' ';
deallog << std::endl;
}
}
parallel::fullydistributed::Triangulation<dim> tria_pft(comm);
tria_pft.create_triangulation(construction_data);
- deallog << tria.n_locally_owned_active_cells() << " "
+ deallog << tria.n_locally_owned_active_cells() << ' '
<< tria_pft.n_locally_owned_active_cells() << std::endl;
}
const std::vector<types::global_dof_index> dofs_per_block =
DoFTools::count_dofs_per_fe_block(dof_handler, sub_blocks);
- deallog << "size: " << dofs_per_block[0] << " " << dofs_per_block[1]
+ deallog << "size: " << dofs_per_block[0] << ' ' << dofs_per_block[1]
<< std::endl;
std::vector<IndexSet> locally_relevant_partitioning;
const std::vector<types::global_dof_index> dofs_per_block =
DoFTools::count_dofs_per_fe_block(dof_handler, sub_blocks);
- deallog << "size: " << dofs_per_block[0] << " " << dofs_per_block[1]
+ deallog << "size: " << dofs_per_block[0] << ' ' << dofs_per_block[1]
<< std::endl;
std::vector<IndexSet> locally_relevant_partitioning;
// check local values
if (myid == 0)
{
- deallog << myid * 2 << ":" << get_real_assert_zero_imag(v(myid * 2))
+ deallog << myid * 2 << ':' << get_real_assert_zero_imag(v(myid * 2))
<< std::endl;
- deallog << myid * 2 + 1 << ":"
+ deallog << myid * 2 + 1 << ':'
<< get_real_assert_zero_imag(v(myid * 2 + 1)) << std::endl;
}
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << get_real_assert_zero_imag(v(myid * 2))
+ deallog << myid * 2 << ':' << get_real_assert_zero_imag(v(myid * 2))
<< std::endl;
- deallog << myid * 2 + 1 << ":"
+ deallog << myid * 2 + 1 << ':'
<< get_real_assert_zero_imag(v(myid * 2 + 1)) << std::endl;
}
void
test(const std::uint8_t kind, const std::string out = "")
{
- deallog << "Testing kind(" << (int)kind << ") in dimensions "
- << "<" << dim << "," << spacedim << ">" << std::endl;
+ deallog << "Testing kind(" << (int)kind << ") in dimensions " << '<' << dim
+ << ',' << spacedim << '>' << std::endl;
Triangulation<dim, spacedim> tria;
GridGenerator::reference_cell(
void
test(const std::uint8_t kind, const std::string out = "")
{
- deallog << "Testing kind(" << (int)kind << ") in dimensions "
- << "<" << dim << "," << spacedim << ">" << std::endl;
+ deallog << "Testing kind(" << (int)kind << ") in dimensions " << '<' << dim
+ << ',' << spacedim << '>' << std::endl;
Triangulation<dim, spacedim> tria;
GridGenerator::reference_cell(
for (; cell != endc; ++cell)
{
- deallog << cell->level() << " " << cell->index() << " " << cell->id()
- << " " << cell->id().to_string() << std::endl;
+ deallog << cell->level() << ' ' << cell->index() << ' ' << cell->id()
+ << ' ' << cell->id().to_string() << std::endl;
}
deallog << "OK" << std::endl;
CellId tmp;
std::istringstream in(outb.str());
in >> tmp;
- deallog << cell->level() << " " << cell->index() << " " << cell->id()
- << " " << tmp << std::endl;
+ deallog << cell->level() << ' ' << cell->index() << ' ' << cell->id()
+ << ' ' << tmp << std::endl;
}
for (; cell != endc; ++cell)
{
- deallog << cell->level() << " " << cell->index() << std::endl;
+ deallog << cell->level() << ' ' << cell->index() << std::endl;
// Store the CellId and create a cell iterator pointing to the same cell
typename TRIA::cell_iterator cell2 = tr.create_cell_iterator(cid);
- deallog << cell2->level() << " " << cell2->index() << std::endl;
+ deallog << cell2->level() << ' ' << cell2->index() << std::endl;
}
deallog << "OK" << std::endl;
for (; cell != endc; ++cell)
{
- deallog << cell->level() << " " << cell->index() << std::endl;
+ deallog << cell->level() << ' ' << cell->index() << std::endl;
// Store the CellId, convert it to a binary representation,
// create a new CellId from that, and create a cell iterator
Assert(cid2 == cid, ExcInternalError());
Assert(cell2 == cell, ExcInternalError());
- deallog << cell2->level() << " " << cell2->index() << std::endl;
+ deallog << cell2->level() << ' ' << cell2->index() << std::endl;
}
deallog << "OK" << std::endl;
{id0, id3}, // grand child (false, true)
{id0, id4}} // cell with different coarse-cell id (false, false)
)
- deallog << pair.first.is_parent_of(pair.second) << " "
+ deallog << pair.first.is_parent_of(pair.second) << ' '
<< pair.first.is_ancestor_of(pair.second) << std::endl;
}
unsigned int indices1[GeometryInfo<1>::vertices_per_cell] = {0, 1};
std::vector<unsigned int> indices2 = {0, 1};
- deallog << "1d: " << GridTools::cell_measure(points, indices1) << " "
+ deallog << "1d: " << GridTools::cell_measure(points, indices1) << ' '
<< GridTools::cell_measure(points, indices2) << std::endl;
}
unsigned int indices1[GeometryInfo<2>::vertices_per_cell] = {0, 1, 2, 3};
std::vector<unsigned int> indices2 = {0, 1, 2, 3};
- deallog << "2d: " << GridTools::cell_measure(points, indices1) << " "
+ deallog << "2d: " << GridTools::cell_measure(points, indices1) << ' '
<< GridTools::cell_measure(points, indices2) << std::endl;
}
0, 1, 2, 3, 4, 5, 6, 7};
std::vector<unsigned int> indices2 = {0, 1, 2, 3, 4, 5, 6, 7};
- deallog << "3d: " << GridTools::cell_measure(points, indices1) << " "
+ deallog << "3d: " << GridTools::cell_measure(points, indices1) << ' '
<< GridTools::cell_measure(points, indices2) << std::endl;
}
void
test()
{
- deallog << "Testing <" << dim << "," << spacedim1 << "> VS <" << dim << ","
- << spacedim2 << ">" << std::endl;
+ deallog << "Testing <" << dim << ',' << spacedim1 << "> VS <" << dim << ','
+ << spacedim2 << '>' << std::endl;
Triangulation<dim, spacedim1> tria1;
GridGenerator::hyper_cube(tria1);
typename dealii::DoFHandler<dim>::active_cell_iterator
patch_cell = *(patch_iter);
Point<dim> cell_bary = patch_cell->barycenter();
- deallog << "(";
+ deallog << '(';
for (unsigned int d = 0; d < dim - 1; ++d)
deallog << cell_bary[d] << ", ";
deallog << cell_bary[dim - 1] << ") ";
for (const auto cell : tria.active_cell_iterators())
if (!cell->is_artificial())
- deallog << cell->id() << " -> " << cell->subdomain_id() << " "
+ deallog << cell->id() << " -> " << cell->subdomain_id() << ' '
<< cell->global_active_cell_index() << std::endl;
const Utilities::MPI::Partitioner &part =
for (const auto cell : tria.cell_iterators_on_level(l))
if (cell->level_subdomain_id() !=
dealii::numbers::artificial_subdomain_id)
- deallog << cell->id() << " -> " << cell->level_subdomain_id() << " "
+ deallog << cell->id() << " -> " << cell->level_subdomain_id() << ' '
<< cell->global_level_cell_index() << std::endl;
const Utilities::MPI::Partitioner &part =
{
for (const auto &cell : tria)
{
- deallog << cell.material_id() << " ";
+ deallog << cell.material_id() << ' ';
for (const unsigned int f : GeometryInfo<dim>::face_indices())
deallog << (cell.face(f)->at_boundary() ? cell.face(f)->boundary_id() :
-1)
- << " ";
+ << ' ';
for (const unsigned int v : GeometryInfo<dim>::vertex_indices())
- deallog << cell.vertex(v) << " ";
+ deallog << cell.vertex(v) << ' ';
deallog << std::endl;
}
Triangulation<dim, spacedim> tria;
deallog << "Generating Triangulation<" << dim << ", " << spacedim
- << "> : " << name << "(" << arguments << ")" << std::endl;
+ << "> : " << name << '(' << arguments << ')' << std::endl;
GridGenerator::generate_from_name_and_arguments(tria, name, arguments);
{
deallog << cell->line_orientation(line_index) << " ";
} // line_index
- deallog << "}" << std::endl << std::endl;
+ deallog << '}' << std::endl << std::endl;
} // cell
}
{
deallog << cell->line_orientation(line_index) << " ";
} // line_index
- deallog << "}" << std::endl << std::endl;
+ deallog << '}' << std::endl << std::endl;
} // cell
}
gi.attach_triangulation(tria2);
gi.read_vtk(infile);
- deallog << "Testing Triangulation<" << dim << "," << spacedim << ">"
+ deallog << "Testing Triangulation<" << dim << ',' << spacedim << '>'
<< std::endl;
AssertDimension(tria.n_vertices(), tria2.n_vertices());
AssertDimension(tria.n_active_cells(), tria2.n_active_cells());
if (cell->level_subdomain_id() != 4294967294)
deallog << cell->level_subdomain_id();
else
- deallog << "-";
+ deallog << '-';
deallog << std::endl;
}
deallog << std::endl;
{
deallog << "* checking dim=" << dim << " subd=";
for (unsigned int i = 0; i < dim; ++i)
- deallog << subd[i] << " ";
+ deallog << subd[i] << ' ';
deallog << std::endl;
// Data structure defining dim coordinates that make up a
it != boundary_count.end();
++it)
{
- deallog << it->first << "(" << it->second << " times) ";
+ deallog << it->first << '(' << it->second << " times) ";
}
deallog << std::endl;
}
endc = tria.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << static_cast<int>(cell->material_id())
+ deallog << count << ' ' << static_cast<int>(cell->material_id())
<< std::endl;
}
deallog << std::endl;
endc = tria.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << static_cast<int>(cell->material_id())
+ deallog << count << ' ' << static_cast<int>(cell->material_id())
<< std::endl;
}
deallog << std::endl;
auto bounding_box =
GridTools::compute_bounding_box(tria, predicate); // General predicate
- deallog << bounding_box.first << " " << bounding_box.second << std::endl;
+ deallog << bounding_box.first << ' ' << bounding_box.second << std::endl;
}
BoundingBox<dim> bounding_box =
GridTools::compute_bounding_box(tria, predicate); // General predicate
- deallog << bounding_box.get_boundary_points().first << " "
+ deallog << bounding_box.get_boundary_points().first << ' '
<< bounding_box.get_boundary_points().second << std::endl;
}
endc = tria.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << static_cast<int>(cell->material_id())
+ deallog << count << ' ' << static_cast<int>(cell->material_id())
<< std::endl;
}
deallog << std::endl;
endc = tria.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << static_cast<int>(cell->material_id())
+ deallog << count << ' ' << static_cast<int>(cell->material_id())
<< std::endl;
}
deallog << std::endl;
endc = tria.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << static_cast<int>(cell->material_id())
+ deallog << count << ' ' << static_cast<int>(cell->material_id())
<< std::endl;
}
deallog << std::endl;
endc = dof_handler.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << cell->active_fe_index() << std::endl;
+ deallog << count << ' ' << cell->active_fe_index() << std::endl;
}
deallog << std::endl;
}
endc = dof_handler.end();
for (; cell != endc; ++cell, ++count)
{
- deallog << count << " " << cell->active_fe_index() << std::endl;
+ deallog << count << ' ' << cell->active_fe_index() << std::endl;
}
deallog << std::endl;
}
ExcMessage("Cell is not a ghost cell!"));
AssertThrow(cell_2->is_ghost() == true,
ExcMessage("Halo cell is not a ghost cell!"));
- deallog << "Ghost " << cell_1->level() << " " << cell_1->index()
- << " " << cell_1->id() << " " << cell_1->id().to_string()
- << " "
- << "Halo " << cell_2->level() << " " << cell_2->index()
- << " " << cell_2->id() << " " << cell_2->id().to_string()
- << std::endl;
+ deallog << "Ghost " << cell_1->level() << ' ' << cell_1->index()
+ << ' ' << cell_1->id() << ' ' << cell_1->id().to_string()
+ << ' ' << "Halo " << cell_2->level() << ' '
+ << cell_2->index() << ' ' << cell_2->id() << ' '
+ << cell_2->id().to_string() << std::endl;
AssertThrow(cell_2 == cell_1,
ExcMessage(
"Halo cell is not identical to ghost cell."));
it != boundary_count.end();
++it)
{
- deallog << it->first << "(" << it->second << " times) ";
+ deallog << it->first << '(' << it->second << " times) ";
}
deallog << std::endl;
}
void
mesh_info(const Triangulation<dim> &tria, const std::string &filename)
{
- deallog << "Mesh info for " << filename << ":" << std::endl
+ deallog << "Mesh info for " << filename << ':' << std::endl
<< " dimension: " << dim << std::endl
<< " no. of cells: " << tria.n_active_cells() << std::endl;
it != boundary_count.end();
++it)
{
- deallog << it->first << "(" << it->second << " times) ";
+ deallog << it->first << '(' << it->second << " times) ";
}
deallog << std::endl;
}
void
test()
{
- deallog << dim << "d" << std::endl;
+ deallog << dim << 'd' << std::endl;
Triangulation<dim> tria;
GridGenerator::hyper_cube(tria);
void
test()
{
- deallog << dim << "d" << std::endl;
+ deallog << dim << 'd' << std::endl;
Triangulation<dim> tria;
GridGenerator::hyper_cube(tria);
GridTools::partition_triangulation_zorder(n_partitions, tria, blocked);
for (const auto &cell : tria.active_cell_iterators())
- deallog << cell->subdomain_id() << " ";
+ deallog << cell->subdomain_id() << ' ';
deallog << std::endl;
}
deallog << "Test run in " << dim << " dimensions" << std::endl;
for (unsigned int i = 0; i < periodic_faces.size(); ++i)
{
- deallog << periodic_faces[i].cell[0]->index() << " "
- << periodic_faces[i].cell[1]->index() << " "
- << periodic_faces[i].face_idx[0] << " "
- << periodic_faces[i].face_idx[1] << " "
+ deallog << periodic_faces[i].cell[0]->index() << ' '
+ << periodic_faces[i].cell[1]->index() << ' '
+ << periodic_faces[i].face_idx[0] << ' '
+ << periodic_faces[i].face_idx[1] << ' '
<< periodic_faces[i].orientation << std::endl;
}
}
mapping_point -= cell->real_to_unit_cell_affine_approximation(p);
deallog << "Distance to mapping point: ";
for (unsigned int d = 0; d < dim; ++d)
- deallog << mapping_point[d] << " ";
+ deallog << mapping_point[d] << ' ';
deallog << std::endl;
}
catch (const typename Mapping<dim, spacedim>::ExcTransformationFailed &)
GridGenerator::subdivided_hyper_cube(tria, 3);
for (const auto &cell : tria.active_cell_iterators())
- deallog << static_cast<int>(cell->reference_cell()) << " ";
+ deallog << static_cast<int>(cell->reference_cell()) << ' ';
deallog << std::endl;
if (dim != 1)
for (const auto &face : tria.active_face_iterators())
- deallog << static_cast<int>(face->reference_cell()) << " ";
+ deallog << static_cast<int>(face->reference_cell()) << ' ';
deallog << std::endl;
for (const auto &cell : tria.active_cell_iterators())
for (const auto &face : cell->face_iterators())
- deallog << static_cast<int>(face->reference_cell()) << " ";
+ deallog << static_cast<int>(face->reference_cell()) << ' ';
deallog << std::endl;
}
deallog << "n_active_cells: " << tria.n_active_cells() << std::endl;
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> tria_1, tria_2;
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> tria_1, tria_2;
deallog.get_file_stream() << "set view equal xyz" << std::endl
<< "splot '-' w l" << std::endl;
GridOut().write_gnuplot(triangulation, deallog.get_file_stream());
- deallog.get_file_stream() << "e" << std::endl << "pause -1" << std::endl;
+ deallog.get_file_stream() << 'e' << std::endl << "pause -1" << std::endl;
}
<< cell->line(line)->nth_active_fe_index(i) << " ("
<< fe_collection[cell->line(line)->nth_active_fe_index(i)]
.get_name()
- << ")" << std::endl;
+ << ')' << std::endl;
cell->line(line)->get_dof_indices(
line_dof_indices_1, cell->line(line)->nth_active_fe_index(i));
for (const auto &p : hp_fe_face_values.get_present_fe_values()
.get_quadrature_points())
- deallog << p << " ";
+ deallog << p << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (const auto &p : hp_fe_face_values.get_present_fe_values()
.get_quadrature_points())
- deallog << p << " ";
+ deallog << p << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (const auto &p : hp_fe_face_values.get_present_fe_values()
.get_quadrature_points())
- deallog << p << " ";
+ deallog << p << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (const auto &p : hp_fe_face_values.get_present_fe_values()
.get_quadrature_points())
- deallog << p << " ";
+ deallog << p << ' ';
deallog << std::endl;
}
deallog << std::endl;
deallog << " idx: " << fe_index << ", sequence:";
for (const auto index : sequence)
- deallog << " " << index;
+ deallog << ' ' << index;
deallog << std::endl;
}
}
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
// create a hp::DoFHandler with different finite elements on the
// cells. note that we skip setting active_fe_indices on inactive
{
deallog << "ncells: " << tria.n_global_active_cells() << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->active_fe_index();
+ deallog << ' ' << cell->active_fe_index();
deallog << std::endl;
}
fe_face_values.get_quadrature_points();
for (unsigned int q = 0; q < n_q_points; ++q)
- deallog << "u[" << q_points[q] << "]={" << values[q][0] << ","
- << values[q][1] << "}" << std::endl;
+ deallog << "u[" << q_points[q] << "]={" << values[q][0] << ','
+ << values[q][1] << '}' << std::endl;
}
}
{
pairs_point_value.push_back(
std::make_pair(q_points[q], values[q]));
- // deallog << "@"<<q_points[q]<<" u =
+ // deallog << '@'<<q_points[q]<<" u =
// {"<<values[q][0]; for (unsigned int
// c = 1; c < n_comp; c++)
- // deallog << ","<<values[q][c];
- // deallog << "}"<<std::endl;
+ // deallog << ','<<values[q][c];
+ // deallog << '}'<<std::endl;
}
}
}
const Vector<double> &val = pairs_point_value[p].second;
Assert(val.size() == n_comp, ExcInternalError());
- deallog << "@" << pt << " u = {" << val[0];
+ deallog << '@' << pt << " u = {" << val[0];
for (unsigned int c = 1; c < n_comp; ++c)
- deallog << "," << val[c];
- deallog << "}" << std::endl;
+ deallog << ',' << val[c];
+ deallog << '}' << std::endl;
}
dof_handler.clear();
data_out.build_patches(20);
std::ostringstream filename;
- filename << "shape_" << dim << "d"
- << (apply_constrains ? "_constrained" : "") << hp_string << "_"
+ filename << "shape_" << dim << 'd'
+ << (apply_constrains ? "_constrained" : "") << hp_string << '_'
<< i << ".vtk";
std::ofstream output(filename.str().c_str());
deallog << "future FE indices before adaptation:" << std::endl;
for (const auto &cell : dofh.active_cell_iterators())
- deallog << " " << cell->id().to_string() << " " << cell->future_fe_index()
+ deallog << ' ' << cell->id().to_string() << ' ' << cell->future_fe_index()
<< std::endl;
tria.execute_coarsening_and_refinement();
deallog << "active FE indices after adaptation:" << std::endl;
for (const auto &cell : dofh.active_cell_iterators())
- deallog << " " << cell->id().to_string() << " " << cell->active_fe_index()
+ deallog << ' ' << cell->id().to_string() << ' ' << cell->active_fe_index()
<< std::endl;
deallog << "OK" << std::endl;
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
{
deallog << " fe_indices:";
for (const auto &cell : dh.active_cell_iterators())
- deallog << " " << cell->future_fe_index();
+ deallog << ' ' << cell->future_fe_index();
deallog << std::endl;
}
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
// create a hp::DoFHandler with different finite elements on the
// cells. note that we skip setting active_fe_indices on inactive
, dof_handler(triangulation)
, mapping(MappingQ<dim>(mapping_degree))
{
- deallog << "Using mapping with degree " << mapping_degree << ":" << std::endl
+ deallog << "Using mapping with degree " << mapping_degree << ':' << std::endl
<< "============================" << std::endl;
}
data_out.build_patches();
std::ostringstream filename;
- filename << output_name_base << "-" << this->refinement_cycle
+ filename << output_name_base << '-' << this->refinement_cycle
<< data_out.default_suffix(output_format) << std::ends;
data_out.write(deallog.get_file_stream(), output_format);
for (unsigned int step = 0; true; ++step)
{
- deallog << step << " " << std::flush;
+ deallog << step << ' ' << std::flush;
solver.solve_problem();
const auto p = idx.global_to_local(i);
AssertDimension(p.first, i / block_size);
AssertDimension(p.second, i % block_size);
- deallog << i << " -> (" << p.first << "," << p.second << ")" << std::endl;
+ deallog << i << " -> (" << p.first << ',' << p.second << ')' << std::endl;
}
deallog << std::endl;
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
{ \
deallog << "[block " << i << " ] " << std::flush; \
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
{ \
deallog << "[block " << i << " ] " << std::flush; \
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
deallog << "[block " << i << " ] " << var.block(i) << std::endl; \
deallog << std::endl;
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
deallog << "[block " << i << " ] " << var.block(i) << std::endl; \
deallog << std::endl;
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
deallog << "[block " << i << " ] " << var.block(i) << std::endl;
for (unsigned int m = 0; m < global_matrix.m(); ++m)
{
for (unsigned int n = 0; n < global_matrix.n(); ++n)
- deallog << global_matrix(m, n) << " ";
+ deallog << global_matrix(m, n) << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int m = 0; m < global_matrix.m(); ++m)
{
for (unsigned int n = 0; n < global_matrix.n(); ++n)
- deallog << global_matrix(m, n) << " ";
+ deallog << global_matrix(m, n) << ' ';
deallog << std::endl;
}
deallog << std::endl;
deallog << line.index;
for (auto entry : line.entries)
{
- deallog << " (" << entry.first << "," << entry.second << ")";
+ deallog << " (" << entry.first << ',' << entry.second << ')';
}
deallog << " - " << line.inhomogeneity << std::endl;
}
const double t = sparse_matrix.diag_element(glob_index);
if (std::abs(d - t) / t > 1e-10)
{
- deallog << glob_index << " " << d << " != " << t << std::endl;
+ deallog << glob_index << ' ' << d << " != " << t << std::endl;
}
}
{
deallog << "Vector add reference: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << v1[i] << " ";
+ deallog << v1[i] << ' ';
deallog << std::endl;
deallog << "Vector check reference: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << check[i] << " ";
+ deallog << check[i] << ' ';
deallog << std::endl;
const number constant = 1.;
v1.add(constant);
deallog << "Vector add constant: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << v1[i] << " ";
+ deallog << v1[i] << ' ';
deallog << std::endl;
}
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
deallog << "[block " << i << " ] " << var.block(i);
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
deallog << "[block " << i << " ] " << var.block(i);
{
for (types::global_dof_index i = 0; i < vec.size(); ++i)
{
- deallog << vec(i) << " ";
+ deallog << vec(i) << ' ';
}
deallog << std::endl;
}
{
for (types::global_dof_index i = 0; i < vec.size(); ++i)
{
- deallog << vec(i) << " ";
+ deallog << vec(i) << ' ';
}
deallog << std::endl;
}
deallog << "Exact inverse: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << in(i) / m(i, i) << " ";
+ deallog << in(i) / m(i, i) << ' ';
deallog << std::endl;
deallog << "Check vmult orig: ";
prec.vmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
deallog << "Check Tvmult orig: ";
prec.Tvmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
Vector<double> matrix_diagonal(size);
deallog << "Check vmult diag: ";
prec.vmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
deallog << "Check Tvmult diag: ";
prec.Tvmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
}
deallog << "Exact inverse: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << in(i) / m(i, i) << " ";
+ deallog << in(i) / m(i, i) << ' ';
deallog << std::endl;
deallog << "Check vmult ones: ";
prec.vmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
deallog << "Check Tvmult ones: ";
prec.Tvmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
data.preconditioner->reinit(m);
deallog << "Check vmult diag: ";
prec.vmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
deallog << "Check Tvmult diag: ";
prec.Tvmult(out, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
deallog << std::endl;
}
deallog << "Exact inverse: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << in(i) / m(i, i) << " ";
+ deallog << in(i) / m(i, i) << ' ';
deallog << std::endl;
deallog << "Check vmult usual init: ";
prec.vmult(ref, in);
for (unsigned int i = 0; i < size; ++i)
- deallog << ref(i) << " ";
+ deallog << ref(i) << ' ';
deallog << std::endl;
prec.initialize(m, data);
prec.vmult(out, in);
deallog << "Check vmult zero init: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
out -= ref;
deallog << " difference norm = " << out.linfty_norm() << std::endl;
prec2.vmult(out, in);
deallog << "Check vmult zero init: ";
for (unsigned int i = 0; i < size; ++i)
- deallog << out(i) << " ";
+ deallog << out(i) << ' ';
out -= ref;
deallog << " difference norm = " << out.linfty_norm() << std::endl;
}
{
deallog.get_file_stream() << std::setw(9) << Q[j](i);
if (j < size - 1)
- deallog.get_file_stream() << " ";
+ deallog.get_file_stream() << ' ';
else
deallog.get_file_stream() << std::endl;
}
{
deallog.get_file_stream() << std::setw(9) << Q[j](i);
if (j < size - 1)
- deallog.get_file_stream() << " ";
+ deallog.get_file_stream() << ' ';
else
deallog.get_file_stream() << std::endl;
}
auto print_givens = [](const unsigned int i,
const unsigned int j,
const std::array<number, 3> &csr) {
- deallog.get_file_stream() << "Givens " << i << " " << j << ": " << csr[0]
- << " " << csr[1] << " " << csr[2] << std::endl;
+ deallog.get_file_stream() << "Givens " << i << ' ' << j << ": " << csr[0]
+ << ' ' << csr[1] << ' ' << csr[2] << std::endl;
};
qr.connect_givens_slot(print_givens);
{
deallog.get_file_stream() << std::setw(9) << Q[j](i);
if (j < size - 1)
- deallog.get_file_stream() << " ";
+ deallog.get_file_stream() << ' ';
else
deallog.get_file_stream() << std::endl;
}
{
deallog.get_file_stream() << std::setw(9) << A[j](i);
if (j < size - 1)
- deallog.get_file_stream() << " ";
+ deallog.get_file_stream() << ' ';
else
deallog.get_file_stream() << std::endl;
}
auto print_givens = [](const unsigned int i,
const unsigned int j,
const std::array<number, 3> &csr) {
- deallog.get_file_stream() << "Givens " << i << " " << j << ": " << csr[0]
- << " " << csr[1] << " " << csr[2] << std::endl;
+ deallog.get_file_stream() << "Givens " << i << ' ' << j << ": " << csr[0]
+ << ' ' << csr[1] << ' ' << csr[2] << std::endl;
};
qr.connect_givens_slot(print_givens);
{
deallog.get_file_stream() << std::setw(9) << Q[j](i);
if (j < size - 1)
- deallog.get_file_stream() << " ";
+ deallog.get_file_stream() << ' ';
else
deallog.get_file_stream() << std::endl;
}
{
deallog.get_file_stream() << std::setw(9) << A[j](i);
if (j < size - 1)
- deallog.get_file_stream() << " ";
+ deallog.get_file_stream() << ' ';
else
deallog.get_file_stream() << std::endl;
}
for (unsigned int i = 0; i < H.m(); ++i)
{
for (unsigned int j = 0; j < H.n(); ++j)
- deallog << H(i, j) << " ";
+ deallog << H(i, j) << ' ';
deallog << std::endl;
}
}
TridiagonalMatrix<number> M(size);
deallog << "all_zero " << M.all_zero();
matrix1(M);
- deallog << " " << M.all_zero() << std::endl;
+ deallog << ' ' << M.all_zero() << std::endl;
deallog << "Matrix [-1,2,-1]" << std::endl;
M.print(deallog, 7, 0);
check_vmult(M);
TridiagonalMatrix<number> M(size, true);
deallog << "all_zero " << M.all_zero();
matrix1(M);
- deallog << " " << M.all_zero() << std::endl;
+ deallog << ' ' << M.all_zero() << std::endl;
deallog << "Matrix [-1,2,-1]" << std::endl;
M.print(deallog, 7, 0);
check_vmult(M);
{
const double est = Utilities::LinearAlgebra::lanczos_largest_eigenvalue(
OP, init_vector, k, vector_memory);
- deallog << k << " " << est << std::endl;
+ deallog << k << ' ' << est << std::endl;
}
// exact eigenvectors via PArpack
x(i) = random_value<double>();
}
- deallog << " Modes inside/outside: " << n_in << " " << n_out << std::endl;
+ deallog << " Modes inside/outside: " << n_in << ' ' << n_out << std::endl;
// for x = x_i v_i , where v_i are eigenvectors
// p[H]x = \sum_i x_i p(\lambda_i) v_i
diff = y;
diff -= exact;
- deallog << " Filter [" << a << "," << b << "]" << std::endl;
+ deallog << " Filter [" << a << ',' << b << ']' << std::endl;
deallog << " Error: " << diff.linfty_norm() / exact.linfty_norm()
<< std::endl;
const number result = v1 * v2;
deallog << static_cast<double>(std::abs(result - inner_product))
- << " ";
+ << ' ';
}
deallog << std::endl;
}
MPI_Comm communicator =
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v1.reinit(set, communicator);
- deallog << "reinit: " << v1.size() << " ";
+ deallog << "reinit: " << v1.size() << ' ';
#ifdef DEAL_II_WITH_MPI
MPI_Comm_free(&communicator);
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v2.reinit(set, communicator);
v1.reinit(v2);
- deallog << v1.size() << " ";
+ deallog << v1.size() << ' ';
v1.reinit(v2);
deallog << v1.size() << std::endl;
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v2.reinit(set, communicator);
v1 = v2;
- deallog << "assign " << v1.size() << " ";
+ deallog << "assign " << v1.size() << ' ';
v1 = v2;
deallog << v1.size() << std::endl;
typename VectorMemory<VectorType>::Pointer v3(memory);
v1.reinit(set, communicator);
v3->reinit(v1);
- deallog << "reinit pool " << v1.size() << " " << v3->size() << " ";
+ deallog << "reinit pool " << v1.size() << ' ' << v3->size() << ' ';
#ifdef DEAL_II_WITH_MPI
MPI_Comm_free(&communicator);
MPI_Comm communicator =
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v1.reinit(set, communicator);
- deallog << "reinit: " << v1.size() << " ";
+ deallog << "reinit: " << v1.size() << ' ';
#ifdef DEAL_II_WITH_MPI
MPI_Comm_free(&communicator);
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v2.reinit(set, communicator);
v1.reinit(v2);
- deallog << v1.size() << " ";
+ deallog << v1.size() << ' ';
v1.reinit(v2);
deallog << v1.size() << std::endl;
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v2.reinit(set, communicator);
v1 = v2;
- deallog << "assign " << v1.size() << " ";
+ deallog << "assign " << v1.size() << ' ';
v1 = v2;
deallog << v1.size() << std::endl;
typename VectorMemory<VectorType>::Pointer v3(memory);
v1.reinit(set, communicator);
v3->reinit(v1);
- deallog << "reinit pool " << v1.size() << " " << v3->size() << " ";
+ deallog << "reinit pool " << v1.size() << ' ' << v3->size() << ' ';
#ifdef DEAL_II_WITH_MPI
MPI_Comm_free(&communicator);
MPI_Comm communicator =
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v1.reinit(set, communicator);
- deallog << "reinit: " << v1.size() << " ";
+ deallog << "reinit: " << v1.size() << ' ';
#ifdef DEAL_II_WITH_MPI
MPI_Comm_free(&communicator);
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v2.reinit(set, communicator);
v1.reinit(v2);
- deallog << v1.size() << " ";
+ deallog << v1.size() << ' ';
v1.reinit(v2);
deallog << v1.size() << std::endl;
Utilities::MPI::duplicate_communicator(MPI_COMM_WORLD);
v2.reinit(set, communicator);
v1 = v2;
- deallog << "assign " << v1.size() << " ";
+ deallog << "assign " << v1.size() << ' ';
v1 = v2;
deallog << v1.size() << std::endl;
typename VectorMemory<VectorType>::Pointer v3(memory);
v1.reinit(set, communicator);
v3->reinit(v1);
- deallog << "reinit pool " << v1.size() << " " << v3->size() << " ";
+ deallog << "reinit pool " << v1.size() << ' ' << v3->size() << ' ';
#ifdef DEAL_II_WITH_MPI
MPI_Comm_free(&communicator);
M.compute_cholesky_factorization();
const double rcond = M.reciprocal_condition_number(la_l1);
- deallog << 1. / (l1 * inv_l1) << " " << rcond << std::endl;
+ deallog << 1. / (l1 * inv_l1) << ' ' << rcond << std::endl;
}
double,
double,
double,
- << "Error in element (" << arg1 << "," << arg2 << "): " << arg3
+ << "Error in element (" << arg1 << ',' << arg2 << "): " << arg3
<< " != " << arg4 << " delta=" << arg5);
template <typename NumberType>
const unsigned int k,
const NumberType eps)
{
- deallog << m << " " << n << " " << k << " " << std::endl;
+ deallog << m << ' ' << n << ' ' << k << ' ' << std::endl;
FullMatrix<NumberType> A(k, m), B(k, n), C(m, n), D(k, k);
LAPACKFullMatrix<NumberType> AL(k, m), BL(k, n), CL(m, n);
Vector<NumberType> DL(k);
double,
double,
double,
- << "Error in element (" << arg1 << "," << arg2 << "): " << arg3
+ << "Error in element (" << arg1 << ',' << arg2 << "): " << arg3
<< " != " << arg4 << " delta=" << arg5);
template <typename NumberType>
void
test(const unsigned int n, const unsigned int k, const NumberType eps)
{
- deallog << n << " " << k << " " << std::endl;
+ deallog << n << ' ' << k << ' ' << std::endl;
FullMatrix<NumberType> A(k, n), C(k, n), D(k, k);
LAPACKFullMatrix<NumberType> AL(k, n);
Vector<NumberType> DL(k);
double,
double,
double,
- << "Error in element (" << arg1 << "," << arg2 << "): " << arg3
+ << "Error in element (" << arg1 << ',' << arg2 << "): " << arg3
<< " != " << arg4 << " delta=" << arg5);
template <typename NumberType>
void
test(const unsigned int n, const unsigned int k, const NumberType eps)
{
- deallog << n << " " << k << " " << std::endl;
+ deallog << n << ' ' << k << ' ' << std::endl;
FullMatrix<NumberType> A(k, n), C(n, n);
LAPACKFullMatrix<NumberType> AL(k, n), CL(n, n);
double,
double,
double,
- << "Error in element (" << arg1 << "," << arg2 << "): " << arg3
+ << "Error in element (" << arg1 << ',' << arg2 << "): " << arg3
<< " != " << arg4 << " delta=" << arg5);
template <typename NumberType>
void
test(const unsigned int n, const unsigned int k, const NumberType eps)
{
- deallog << n << " " << k << " " << std::endl;
+ deallog << n << ' ' << k << ' ' << std::endl;
FullMatrix<NumberType> A(n, k), C(n, n);
LAPACKFullMatrix<NumberType> AL(n, k), CL(n, n);
deallog << " p(" << q << "): " << fe_values.quadrature_point(q)
<< std::endl;
for (unsigned int i = 0; i < fe_values.dofs_per_cell; ++i)
- deallog << " shape " << i << "," << q << ": "
- << fe_values.shape_value(i, q) << " "
+ deallog << " shape " << i << ',' << q << ": "
+ << fe_values.shape_value(i, q) << ' '
<< fe_values.shape_grad(i, q) << std::endl;
}
deallog << " p(" << q << "): " << fe_values.quadrature_point(q)
<< std::endl;
for (unsigned int i = 0; i < fe_values.dofs_per_cell; ++i)
- deallog << " shape " << i << "," << q << ": "
- << fe_values.shape_value(i, q) << " "
+ deallog << " shape " << i << ',' << q << ": "
+ << fe_values.shape_value(i, q) << ' '
<< fe_values.shape_grad(i, q) << std::endl;
}
Point<2> center(0.0, 1.0);
- out << center << " " << sp[0] << std::endl
- << center << " " << sp[1] << std::endl;
+ out << center << ' ' << sp[0] << std::endl
+ << center << ' ' << sp[1] << std::endl;
for (unsigned int i = 0; i < n_intermediates + 1; ++i)
{
Tensor<1, spacedim> t1 = manifold.get_tangent_vector(ip, sp[0]);
Tensor<1, spacedim> t2 = manifold.get_tangent_vector(ip, sp[1]);
- out << ip << " " << t2 << std::endl;
+ out << ip << ' ' << t2 << std::endl;
}
- out << "e" << std::endl;
+ out << 'e' << std::endl;
return 0;
}
Point<2> center;
- out << center << " " << sp[0] << std::endl
- << center << " " << sp[1] << std::endl;
+ out << center << ' ' << sp[0] << std::endl
+ << center << ' ' << sp[1] << std::endl;
for (unsigned int i = 0; i < n_intermediates + 1; ++i)
{
Tensor<1, spacedim> t1 = manifold.get_tangent_vector(ip, sp[0]);
Tensor<1, spacedim> t2 = manifold.get_tangent_vector(ip, sp[1]);
- out << ip << " " << t2 << std::endl;
+ out << ip << ' ' << t2 << std::endl;
}
- out << "e" << std::endl;
+ out << 'e' << std::endl;
return 0;
}
<< "plot '-' with vectors " << std::endl;
for (unsigned int v = 0; v < sp.size(); ++v)
- out << center << " " << sp[v] << std::endl;
+ out << center << ' ' << sp[v] << std::endl;
for (unsigned int i = 0; i < n_intermediates + 1; ++i)
Tensor<1, spacedim> t1 = manifold.get_tangent_vector(ip, sp[0]);
Tensor<1, spacedim> t2 = manifold.get_tangent_vector(ip, sp[1]);
- out << ip << " " << t2 << std::endl;
+ out << ip << ' ' << t2 << std::endl;
}
- out << "e" << std::endl;
+ out << 'e' << std::endl;
out << "set terminal aqua " << 1 << std::endl
<< "set size ratio -1" << std::endl
out << ip << std::endl;
}
- out << "e" << std::endl;
+ out << 'e' << std::endl;
return 0;
}
ellipse.push_forward(chart_point_minusphi);
deallog << "Gradient by finite differences: "
- << (space_point_plusc - space_point_minusc) / (2.0 * h) << " "
+ << (space_point_plusc - space_point_minusc) / (2.0 * h) << ' '
<< (space_point_plusphi - space_point_minusphi) / (2.0 * h)
<< std::endl;
deallog << "Analytic gradient: "
deallog << " p(" << q << "): " << fe_values.quadrature_point(q)
<< std::endl;
for (unsigned int i = 0; i < fe_values.dofs_per_cell; ++i)
- deallog << " shape " << i << "," << q << ": "
- << fe_values.shape_value(i, q) << " "
+ deallog << " shape " << i << ',' << q << ": "
+ << fe_values.shape_value(i, q) << ' '
<< fe_values.shape_grad(i, q) << std::endl;
}
<< (1.0 - cell->face(f)->vertex(1) *
spherical.normal_vector(cell->face(f),
cell->face(f)->vertex(1)))
- << " "
+ << ' '
<< (1.0 -
cell->face(f)->center(/*respect_manifold=*/true) *
spherical.normal_vector(cell->face(f),
<< (0.5 - cell->face(f)->vertex(1) *
spherical.normal_vector(cell->face(f),
cell->face(f)->vertex(1)))
- << " "
+ << ' '
<< (0.5 -
cell->face(f)->center(/*respect_manifold=*/true) *
spherical.normal_vector(cell->face(f),
out << "set view equal xyz" << std::endl
<< "splot '-' with lines, '-' with vectors " << std::endl;
GridOut().write_gnuplot(tria, out);
- out << "e" << std::endl;
+ out << 'e' << std::endl;
Triangulation<2, 3>::active_cell_iterator it = tria.begin_active();
for (; it != tria.end(); ++it)
Tensor<1, 3> t2 = manifold.get_tangent_vector(p, it->vertex(1));
Tensor<1, 3> n = cross_product_3d(t1, t2);
n /= -n.norm();
- out << it->center() << " " << n << std::endl;
+ out << it->center() << ' ' << n << std::endl;
}
- out << "e" << std::endl;
+ out << 'e' << std::endl;
}
// now print some data on the shape
// functions
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << "shape_function " << i << ":" << std::endl
+ deallog << "shape_function " << i << ':' << std::endl
<< " phi=" << fe_values.shape_value(i, 0) << std::endl
<< " grad phi=" << fe_values.shape_grad(i, 0) << std::endl
<< " grad^2 phi=" << fe_values.shape_hessian(i, 0)
// now print some data on the shape
// functions
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << "shape_function " << i << ":" << std::endl
+ deallog << "shape_function " << i << ':' << std::endl
<< " phi=" << fe_values.shape_value(i, 0) << std::endl
<< " grad phi=" << fe_values.shape_grad(i, 0) << std::endl
<< " grad^2 phi=" << fe_values.shape_hessian(i, 0)
// now print some data on the shape
// functions
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << "shape_function " << i << ":" << std::endl
+ deallog << "shape_function " << i << ':' << std::endl
<< " phi=" << fe_values.shape_value(i, 0) << std::endl
<< " grad phi=" << fe_values.shape_grad(i, 0) << std::endl
<< " grad^2 phi=" << fe_values.shape_hessian(i, 0)
// now print some data on the shape
// functions
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << "shape_function " << i << ":" << std::endl
+ deallog << "shape_function " << i << ':' << std::endl
<< " phi=" << fe_values.shape_value(i, 0) << std::endl
<< " grad phi=" << fe_values.shape_grad(i, 0) << std::endl
<< " grad^2 phi=" << fe_values.shape_hessian(i, 0)
dof.distribute_dofs(fe_q4);
typename DoFHandler<dim>::cell_iterator cell = dof.begin_active();
- deallog << "Triangulation" << i << ":" << std::endl;
+ deallog << "Triangulation" << i << ':' << std::endl;
deallog << "exact_area=" << exact_areas[i] << std::endl;
for (unsigned int j = 0; j < mapping_size; ++j)
test_bounding_boxes(const Mapping<dim, spacedim> &mapping,
const unsigned int degree)
{
- deallog << "Testing " << boost::core::demangle(typeid(mapping).name()) << "("
- << degree << ")" << std::endl;
+ deallog << "Testing " << boost::core::demangle(typeid(mapping).name()) << '('
+ << degree << ')' << std::endl;
Triangulation<dim, spacedim> triangulation;
GridGenerator::hyper_ball(triangulation);
}
}
- out << "e" << std::endl
+ out << 'e' << std::endl
<< std::endl
<< std::endl
<< "set terminal aqua " << 2 * (dim + spacedim) + 1 << std::endl
fe_v.get_normal_vectors();
for (unsigned int i = 0; i < qps.size(); ++i)
{
- out << qps[i] << " " << nps[i] << std::endl;
+ out << qps[i] << ' ' << nps[i] << std::endl;
if (std::abs((center + nps[i] - qps[i]).norm()) > 1e-10)
out << "# Error! The normal vector should be radial! "
<< std::endl
out << std::endl;
}
}
- out << "e" << std::endl << std::endl;
+ out << 'e' << std::endl << std::endl;
}
if ((test - dp_real).norm() > tol)
{
- deallog << " " << std::endl;
+ deallog << ' ' << std::endl;
deallog << "ERROR" << std::endl;
deallog << "cell = " << index << std::endl;
deallog << "cell vertex(0): " << cell->vertex(0) << std::endl;
deallog << "cell vertex(1): " << cell->vertex(1) << std::endl;
deallog << "cell vertex(2): " << cell->vertex(2) << std::endl;
deallog << "cell vertex(3): " << cell->vertex(3) << std::endl;
- deallog << " " << std::endl;
+ deallog << ' ' << std::endl;
deallog << "test point = " << test << " mapped point = " << dp
<< " back-mapping = " << dp_real << std::endl;
deallog << "test point (unit mid) = " << test_unit_mid
for (unsigned int d = 0; d < dim; ++d)
p2[d] = 0.5;
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "cell " << cell->id() << ": "
for (unsigned int d = 0; d < dim; ++d)
p2[d] = 0.5;
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "cell " << cell->id() << ": "
for (unsigned int d = 0; d < dim; ++d)
p2[d] = 0.5;
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "cell " << cell->id() << ": "
tria.refine_global(1);
mapping_cache.initialize(tria, mapping);
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "cell " << cell->id() << ": "
for (unsigned int d = 0; d < dim; ++d)
p2[d] = 0.5;
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.cell_iterators())
{
deallog << "cell " << cell->id() << ": "
tria.refine_global(1);
mapping_cache.initialize(tria, position_lambda);
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "cell " << cell->id() << ": "
mapping_cache.initialize(tria, position_lambda);
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.cell_iterators())
{
deallog << "vertices on cell " << cell->id() << std::endl;
tria.refine_global(1);
mapping_cache.initialize(tria, position_lambda);
- deallog << "Testing degree " << degree << " in " << dim << "D" << std::endl;
+ deallog << "Testing degree " << degree << " in " << dim << 'D' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "vertices on cell " << cell->id() << std::endl;
for (auto point = active_vertices.begin(); point != active_vertices.end();
++point)
- deallog << point->second << " ";
+ deallog << point->second << ' ';
deallog << std::endl << "Ok." << std::endl;
}
for (const auto &cell : dof_handler.active_cell_iterators())
{
deallog << "Center: [" << cell->center() << "], with mapping ["
- << euler.get_center(cell, false) << "]" << std::endl;
+ << euler.get_center(cell, false) << ']' << std::endl;
deallog << "Center: [" << cell->center() << "], with mapping + flag ["
- << euler.get_center(cell, true) << "]" << std::endl;
+ << euler.get_center(cell, true) << ']' << std::endl;
}
}
const auto p1 = cell->bounding_box().get_boundary_points();
const auto p2 = euler.get_bounding_box(cell).get_boundary_points();
deallog << "BBox: [" << p1.first << ", " << p1.second
- << "], with mapping [" << p2.first << ", " << p2.second << "]"
+ << "], with mapping [" << p2.first << ", " << p2.second << ']'
<< std::endl;
}
}
out -= in;
double diff_norm = out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " " << std::endl;
+ deallog << "Norm of difference: " << diff_norm << ' ' << std::endl;
}
out -= in;
double diff_norm = out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " " << std::endl;
+ deallog << "Norm of difference: " << diff_norm << ' ' << std::endl;
}
out -= in;
double diff_norm = out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " " << std::endl;
+ deallog << "Norm of difference: " << diff_norm << ' ' << std::endl;
}
fe_eval.begin_dof_values()[j][v];
}
test_matrix.add(-1., cell_matrix);
- deallog << test_matrix.frobenius_norm() << " ";
+ deallog << test_matrix.frobenius_norm() << ' ';
}
deallog << std::endl;
}
phi_u.begin_dof_values()[j][v];
}
test_matrix.add(-1., cell_matrix);
- deallog << test_matrix.frobenius_norm() << " ";
+ deallog << test_matrix.frobenius_norm() << ' ';
}
deallog << std::endl;
}
deallog << "Level: " << level << std::endl;
deallog << "Interior faces: ";
for (unsigned int f = 0; f < n_inner_faces.size(); ++f)
- deallog << n_inner_faces[f] << " ";
+ deallog << n_inner_faces[f] << ' ';
deallog << std::endl << "Exterior faces: ";
for (unsigned int f = 0; f < n_inner_other_faces.size(); ++f)
- deallog << n_inner_other_faces[f] << " ";
+ deallog << n_inner_other_faces[f] << ' ';
deallog << std::endl << "Boundary faces: ";
for (unsigned int f = 0; f < n_boundary_faces.size(); ++f)
- deallog << n_boundary_faces[f] << " ";
+ deallog << n_boundary_faces[f] << ' ';
deallog << std::endl;
}
}
my_rows.erase(std::unique(my_rows.begin(), my_rows.end()),
my_rows.end());
for (auto el : my_rows)
- deallog << " " << el;
+ deallog << ' ' << el;
deallog << std::endl;
};
get_and_log(true);
<< "plot '-' using 1:2 with lines notitle, '-' with labels tc rgb 'red' nopoint notitle, '-' with labels point pt 4 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(tria, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
// output cell blocks:
for (unsigned int cell = 0; cell < n_cells; ++cell)
}
f << std::flush;
- f << "e" << std::endl << std::endl;
+ f << 'e' << std::endl << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
}
my_rows.erase(std::unique(my_rows.begin(), my_rows.end()),
my_rows.end());
for (auto el : my_rows)
- deallog << " " << el;
+ deallog << ' ' << el;
deallog << std::endl;
};
get_and_log(true);
<< "plot '-' using 1:2 with lines notitle, '-' with labels tc rgb 'red' nopoint notitle, '-' with labels point pt 4 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(tria, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
// output cell blocks:
for (unsigned int cell = 0; cell < n_cells; ++cell)
}
f << std::flush;
- f << "e" << std::endl << std::endl;
+ f << 'e' << std::endl << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
}
for (unsigned int i = 0; i < phi_m.static_dofs_per_component; ++i)
deallog << static_cast<int>(phi_m.begin_dof_values()[i][0])
- << " ";
+ << ' ';
deallog << std::endl;
phi_m.gather_evaluate(src, EvaluationFlags::values);
for (unsigned int i = 0; i < phi_m.static_n_q_points; ++i)
- deallog << static_cast<int>(phi_m.begin_values()[i][0]) << " ";
+ deallog << static_cast<int>(phi_m.begin_values()[i][0]) << ' ';
deallog << std::endl;
phi_p.read_dof_values(src);
for (unsigned int i = 0; i < phi_p.static_dofs_per_component; ++i)
deallog << static_cast<int>(phi_p.begin_dof_values()[i][0])
- << " ";
+ << ' ';
deallog << std::endl;
phi_p.gather_evaluate(src, EvaluationFlags::values);
for (unsigned int i = 0; i < phi_p.static_n_q_points; ++i)
- deallog << static_cast<int>(phi_p.begin_values()[i][0]) << " ";
+ deallog << static_cast<int>(phi_p.begin_values()[i][0]) << ' ';
deallog << std::endl << std::endl;
}
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
- deallog << y[i] - y_ref[i] << " ";
+ deallog << y[i] - y_ref[i] << ' ';
deallog << std::endl;
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
- deallog << x[i] - x_ref[i] << " ";
+ deallog << x[i] - x_ref[i] << ' ';
deallog << std::endl;
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
- deallog << y[i] - y_ref[i] << " ";
+ deallog << y[i] - y_ref[i] << ' ';
deallog << std::endl;
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
- deallog << x[i] - x_ref[i] << " ";
+ deallog << x[i] - x_ref[i] << ' ';
deallog << std::endl;
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
- deallog << y[i] - y_ref[i] << " ";
+ deallog << y[i] - y_ref[i] << ' ';
deallog << std::endl;
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
- deallog << x[i] - x_ref[i] << " ";
+ deallog << x[i] - x_ref[i] << ' ';
deallog << std::endl;
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
- deallog << x[i] - y_ref[i] << " ";
+ deallog << x[i] - y_ref[i] << ' ';
deallog << std::endl;
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
- deallog << x[i] - x_ref[i] << " ";
+ deallog << x[i] - x_ref[i] << ' ';
deallog << std::endl;
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
- deallog << x[i] - y_ref[i] << " ";
+ deallog << x[i] - y_ref[i] << ' ';
deallog << std::endl;
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
- deallog << x[i] - x_ref[i] << " ";
+ deallog << x[i] - x_ref[i] << ' ';
deallog << std::endl;
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
- deallog << x[i] - y_ref[i] << " ";
+ deallog << x[i] - y_ref[i] << ' ';
deallog << std::endl;
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
- deallog << x[i] - x_ref[i] << " ";
+ deallog << x[i] - x_ref[i] << ' ';
deallog << std::endl;
}
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
{
- deallog << y[i][0] - y_ref[i][0] << " ";
+ deallog << y[i][0] - y_ref[i][0] << ' ';
for (unsigned int v = 1; v < VectorizedArray<double>::size(); ++v)
AssertThrow(std::abs(y[i][v] - y_ref[i][v]) < 1e-12,
ExcInternalError());
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
{
- deallog << x[i][0] - x_ref[i][0] << " ";
+ deallog << x[i][0] - x_ref[i][0] << ' ';
for (unsigned int v = 1; v < VectorizedArray<double>::size(); ++v)
AssertThrow(std::abs(x[i][v] - x_ref[i][v]) < 1e-12,
ExcInternalError());
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
{
- deallog << y[i][0] - y_ref[i][0] << " ";
+ deallog << y[i][0] - y_ref[i][0] << ' ';
for (unsigned int v = 1; v < VectorizedArray<double>::size(); ++v)
AssertThrow(std::abs(y[i][v] - y_ref[i][v]) < 1e-12,
ExcInternalError());
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
{
- deallog << x[i][0] - x_ref[i][0] << " ";
+ deallog << x[i][0] - x_ref[i][0] << ' ';
for (unsigned int v = 1; v < VectorizedArray<double>::size(); ++v)
AssertThrow(std::abs(x[i][v] - x_ref[i][v]) < 1e-12,
ExcInternalError());
deallog << "Errors no transpose: ";
for (unsigned int i = 0; i < M; ++i)
{
- deallog << y[i][0] - y_ref[i][0] << " ";
+ deallog << y[i][0] - y_ref[i][0] << ' ';
for (unsigned int v = 1; v < VectorizedArray<double>::size(); ++v)
AssertThrow(std::abs(y[i][v] - y_ref[i][v]) < 1e-12,
ExcInternalError());
deallog << "Errors transpose: ";
for (unsigned int i = 0; i < N; ++i)
{
- deallog << x[i][0] - x_ref[i][0] << " ";
+ deallog << x[i][0] - x_ref[i][0] << ' ';
for (unsigned int v = 1; v < VectorizedArray<double>::size(); ++v)
AssertThrow(std::abs(x[i][v] - x_ref[i][v]) < 1e-12,
ExcInternalError());
if (std::abs(diff[v]) > 1e-12)
{
deallog << "Error detected on interior face " << face
- << ", v=" << v << ", q=" << q << "!" << std::endl;
+ << ", v=" << v << ", q=" << q << '!' << std::endl;
deallog << "ref: ";
for (unsigned int i = 0; i < ref.dofs_per_cell; ++i)
- deallog << ref.get_dof_value(i)[v] << " ";
+ deallog << ref.get_dof_value(i)[v] << ' ';
deallog << std::endl;
deallog << "done: " << check.get_value(q)[v]
<< " instead of " << ref.get_value(q)[v]
<< std::endl;
deallog
- << data.get_face_info(face).cells_interior[v] << " "
- << (int)data.get_face_info(face).interior_face_no << " "
- << (int)data.get_face_info(face).face_orientation << " "
+ << data.get_face_info(face).cells_interior[v] << ' '
+ << (int)data.get_face_info(face).interior_face_no << ' '
+ << (int)data.get_face_info(face).face_orientation << ' '
<< (int)data.get_face_info(face).subface_index
<< std::endl;
deallog << std::endl;
if (std::abs(diff[v]) > 1e-12)
{
deallog << "Error detected on exterior face " << face
- << ", v=" << v << ", q=" << q << "!" << std::endl;
+ << ", v=" << v << ", q=" << q << '!' << std::endl;
deallog << "ref: ";
for (unsigned int i = 0; i < ref.dofs_per_cell; ++i)
- deallog << refr.get_dof_value(i)[v] << " ";
+ deallog << refr.get_dof_value(i)[v] << ' ';
deallog << std::endl;
deallog << "done: " << checkr.get_value(q)[v]
<< " instead of " << refr.get_value(q)[v]
<< std::endl;
deallog
- << data.get_face_info(face).cells_exterior[v] << " "
- << (int)data.get_face_info(face).exterior_face_no << " "
- << (int)data.get_face_info(face).face_orientation << " "
+ << data.get_face_info(face).cells_exterior[v] << ' '
+ << (int)data.get_face_info(face).exterior_face_no << ' '
+ << (int)data.get_face_info(face).face_orientation << ' '
<< (int)data.get_face_info(face).subface_index
<< std::endl;
deallog << std::endl;
if (std::abs(diff[v]) > 1e-12)
{
deallog << "Error detected on face" << face << ", v=" << v
- << "!" << std::endl;
+ << '!' << std::endl;
deallog << "ref: ";
for (unsigned int i = 0; i < ref.dofs_per_cell; ++i)
- deallog << ref.get_dof_value(i)[v] << " ";
+ deallog << ref.get_dof_value(i)[v] << ' ';
deallog << std::endl;
deallog << "done: " << check.get_value(q)[v]
<< " instead of " << ref.get_value(q)[v]
<< std::endl;
deallog
- << data.get_face_info(face).cells_interior[v] << " "
- << (int)data.get_face_info(face).interior_face_no << " "
- << (int)data.get_face_info(face).face_orientation << " "
+ << data.get_face_info(face).cells_interior[v] << ' '
+ << (int)data.get_face_info(face).interior_face_no << ' '
+ << (int)data.get_face_info(face).face_orientation << ' '
<< (int)data.get_face_info(face).subface_index
<< std::endl;
deallog << std::endl;
if (std::abs(diff[v]) > 1e-12)
{
deallog << "Error detected on face" << face << ", v=" << v
- << "!" << std::endl;
+ << '!' << std::endl;
deallog << "ref: ";
for (unsigned int i = 0; i < ref.dofs_per_cell; ++i)
- deallog << refr.get_dof_value(i)[v] << " ";
+ deallog << refr.get_dof_value(i)[v] << ' ';
deallog << std::endl;
deallog << "done: " << check.get_value(q)[v]
<< " instead of " << ref.get_value(q)[v]
<< std::endl;
deallog
- << data.get_face_info(face).cells_exterior[v] << " "
- << (int)data.get_face_info(face).exterior_face_no << " "
- << (int)data.get_face_info(face).face_orientation << " "
+ << data.get_face_info(face).cells_exterior[v] << ' '
+ << (int)data.get_face_info(face).exterior_face_no << ' '
+ << (int)data.get_face_info(face).face_orientation << ' '
<< (int)data.get_face_info(face).subface_index
<< std::endl;
deallog << std::endl;
if (std::abs(diff[v]) > 1e-12)
{
deallog << "Error detected on interior face " << face
- << ", v=" << v << ", q=" << q << "!" << std::endl;
+ << ", v=" << v << ", q=" << q << '!' << std::endl;
deallog << "ref: ";
for (unsigned int i = 0; i < ref.dofs_per_cell; ++i)
- deallog << ref.get_dof_value(i)[v] << " ";
+ deallog << ref.get_dof_value(i)[v] << ' ';
deallog << std::endl;
deallog << "done: " << check.get_value(q)[v]
<< " instead of " << ref.get_value(q)[v]
<< std::endl;
deallog
- << data.get_face_info(face).cells_interior[v] << " "
- << (int)data.get_face_info(face).interior_face_no << " "
- << (int)data.get_face_info(face).face_orientation << " "
+ << data.get_face_info(face).cells_interior[v] << ' '
+ << (int)data.get_face_info(face).interior_face_no << ' '
+ << (int)data.get_face_info(face).face_orientation << ' '
<< (int)data.get_face_info(face).subface_index
<< std::endl;
deallog << std::endl;
if (std::abs(diff[v]) > 1e-12)
{
deallog << "Error detected on exterior face " << face
- << ", v=" << v << ", q=" << q << "!" << std::endl;
+ << ", v=" << v << ", q=" << q << '!' << std::endl;
deallog << "ref: ";
for (unsigned int i = 0; i < ref.dofs_per_cell; ++i)
- deallog << refr.get_dof_value(i)[v] << " ";
+ deallog << refr.get_dof_value(i)[v] << ' ';
deallog << std::endl;
deallog << "done: " << checkr.get_value(q)[v]
<< " instead of " << refr.get_value(q)[v]
<< std::endl;
deallog
- << data.get_face_info(face).cells_exterior[v] << " "
- << (int)data.get_face_info(face).exterior_face_no << " "
- << (int)data.get_face_info(face).face_orientation << " "
+ << data.get_face_info(face).cells_exterior[v] << ' '
+ << (int)data.get_face_info(face).exterior_face_no << ' '
+ << (int)data.get_face_info(face).face_orientation << ' '
<< (int)data.get_face_info(face).subface_index
<< std::endl;
deallog << std::endl;
{
for (unsigned int j = 1; j < 25; ++j)
if (FEEvaluation<dim, -1, 0, 1>::fast_evaluation_supported(i, j))
- deallog << 1 << " ";
+ deallog << 1 << ' ';
else
deallog << " ";
deallog << std::endl;
{
for (unsigned int j = 1; j < 25; ++j)
if (FEFaceEvaluation<dim, -1, 0, 1>::fast_evaluation_supported(i, j))
- deallog << 1 << " ";
+ deallog << 1 << ' ';
else
deallog << " ";
deallog << std::endl;
deallog << "Face " << face << ": ";
for (unsigned int q = 0; q < fe_eval.n_q_points; ++q)
{
- deallog << fe_eval.get_value(q)[0] << " "
+ deallog << fe_eval.get_value(q)[0] << ' '
<< fe_eval.get_normal_derivative(q)[0] << " ";
}
deallog << std::endl;
}
for (const auto i : values1)
- deallog << i[0] << " ";
+ deallog << i[0] << ' ';
deallog << std::endl;
internal::FEEvaluationImplHangingNodesReference<
1, eval.get_shape_info(), b == 1, cmask, values2.data());
for (const auto i : values1)
- deallog << i[0] << " ";
+ deallog << i[0] << ' ';
deallog << std::endl;
for (const auto i : values2)
- deallog << i[0] << " ";
+ deallog << i[0] << ' ';
deallog << std::endl;
deallog << std::endl;
{
std::cout << "dofs: ";
for (const auto i : dof_indices)
- std::cout << i << " ";
+ std::cout << i << ' ';
std::cout << std::endl << "values: ";
std::vector<LevelNumberType> local_values(
dof_indices.size());
level_projection[level].extract_subvector_to(dof_indices,
local_values);
for (const auto v : local_values)
- std::cout << v << " ";
+ std::cout << v << ' ';
std::cout << std::endl
<< "val(q)=" << q_values[q] << std::endl;
std::cout << "MGTransfer indices:" << std::endl;
deallog << "Active level (with max_level="
<< tria.n_global_levels() - 1 << "):" << std::endl;
else
- deallog << "Multigrid level " << level << ":" << std::endl;
+ deallog << "Multigrid level " << level << ':' << std::endl;
AffineConstraints<Number> constraint;
deallog << "cell: " << cell.to_string() << std::endl;
for (const auto &face : faces)
- deallog << "face: " << face.first.to_string() << " "
+ deallog << "face: " << face.first.to_string() << ' '
<< face.second.to_string() << std::endl;
for (const auto boundary : boundaries)
mf.vmult(out, in);
out -= ref;
const double diff_norm = out.linfty_norm();
- deallog << " " << diff_norm;
+ deallog << ' ' << diff_norm;
}
deallog << std::endl;
}
sparse_matrix.vmult(ref, in[i]);
out[i] -= ref;
const double diff_norm = out[i].linfty_norm();
- deallog << diff_norm << " ";
+ deallog << diff_norm << ' ';
}
deallog << std::endl << std::endl;
}
sparse_matrix.vmult(ref, in.block(i));
out.block(i) -= ref;
const double diff_norm = out.block(i).linfty_norm();
- deallog << diff_norm << " ";
+ deallog << diff_norm << ' ';
}
deallog << std::endl << std::endl;
}
sparse_matrix.vmult(ref, in.block(i));
out.block(i) -= ref;
const double diff_norm = out.block(i).linfty_norm();
- deallog << diff_norm << " ";
+ deallog << diff_norm << ' ';
}
deallog << std::endl << std::endl;
}
sparse_matrix.vmult(ref, in.block(i));
out.block(i) -= ref;
const double diff_norm = out.block(i).linfty_norm();
- deallog << diff_norm << " ";
+ deallog << diff_norm << ' ';
}
deallog << std::endl << std::endl;
}
sparse_matrix.vmult(ref, in[i]);
out[i] -= ref;
const double diff_norm = out[i].linfty_norm();
- deallog << diff_norm << " ";
+ deallog << diff_norm << ' ';
}
deallog << std::endl << std::endl;
}
sparse_matrix.vmult(ref, in[i]);
out[i] -= ref;
const double diff_norm = out[i].linfty_norm();
- deallog << diff_norm << " ";
+ deallog << diff_norm << ' ';
}
deallog << std::endl << std::endl;
}
out -= ref;
const double diff_norm = out.linfty_norm();
- deallog << " " << diff_norm;
+ deallog << ' ' << diff_norm;
}
deallog << std::endl;
}
out_dist -= out;
double diff_norm = out_dist.linfty_norm() / out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing matrix-vector product twice
mf2.vmult(out_dist, in);
out_dist -= out;
double diff_norm = out_dist.linfty_norm() / out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing matrix-vector product twice
mf2.vmult(out_dist, in);
out(renumbering[i]) -= out_orig.local_element(i);
double diff_norm = out.linfty_norm() / out_orig.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing matrix-vector product twice
mf2.vmult(out, in);
out(renumbering[i]) -= out_orig.local_element(i);
double diff_norm = out.linfty_norm() / out_orig.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing matrix-vector product twice
mf2.vmult(out, in);
out(renumbering[i]) -= out_orig.local_element(i);
double diff_norm = out.linfty_norm() / out_orig.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing matrix-vector product twice
mf2.vmult(out, in);
out_dist -= out;
double diff_norm = out_dist.linfty_norm() / out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing a matrix-vector product and then an add, which
// should give twice the reference result
out_dist -= out;
double diff_norm = out_dist.linfty_norm() / out.linfty_norm();
- deallog << "Norm of difference: " << diff_norm << " ";
+ deallog << "Norm of difference: " << diff_norm << ' ';
// test again, now doing matrix-vector product twice
mf2.vmult(out_dist, in);
deallog << "dst FEE: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst[i] << " ";
+ deallog << dst[i] << ' ';
deallog << std::endl;
deallog << "dst FEV: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst2[i] << " ";
+ deallog << dst2[i] << ' ';
deallog << std::endl;
// compare solutions of matrix vector product
deallog << "dst FEE: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst[i] << " ";
+ deallog << dst[i] << ' ';
deallog << std::endl;
deallog << "dst FEV: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst2[i] << " ";
+ deallog << dst2[i] << ' ';
deallog << std::endl;
// compare solutions of matrix vector product
deallog << "dst FEE: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst[i] << " ";
+ deallog << dst[i] << ' ';
deallog << std::endl;
deallog << "dst FEV: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst2[i] << " ";
+ deallog << dst2[i] << ' ';
deallog << std::endl;
// compare solutions of matrix vector product
deallog << "dst FEE: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst[i] << " ";
+ deallog << dst[i] << ' ';
deallog << std::endl;
deallog << "dst FEV: ";
for (unsigned int i = 0; i < end_of_print_dst; ++i)
- deallog << dst2[i] << " ";
+ deallog << dst2[i] << ' ';
deallog << std::endl;
// compare solutions of matrix vector product
mf_data);
mf.vmult(out, in);
out -= ref;
- deallog << "Error with " << fe_degree + 2 << "^" << dim
+ deallog << "Error with " << fe_degree + 2 << '^' << dim
<< " quadrature points: " << out.l2_norm() << std::endl;
}
MatrixFreeTest<dim, fe_degree, double, Vector<double>, 100> mf(mf_data);
mf.vmult(out, in);
out -= ref;
- deallog << "Error with " << 100 << "^" << dim
+ deallog << "Error with " << 100 << '^' << dim
<< " quadrature points: " << out.l2_norm() << std::endl;
}
{
MatrixFreeTest<dim, fe_degree, double, Vector<double>, 200> mf(mf_data);
mf.vmult(out, in);
out -= ref;
- deallog << "Error with " << 200 << "^" << dim
+ deallog << "Error with " << 200 << '^' << dim
<< " quadrature points: " << out.l2_norm() << std::endl;
}
{
MatrixFreeTest<dim, fe_degree, double, Vector<double>, 500> mf(mf_data);
mf.vmult(out, in);
out -= ref;
- deallog << "Error with " << 500 << "^" << dim
+ deallog << "Error with " << 500 << '^' << dim
<< " quadrature points: " << out.l2_norm() << std::endl;
}
{
MatrixFreeTest<dim, fe_degree, double, Vector<double>, 1000> mf(mf_data);
mf.vmult(out, in);
out -= ref;
- deallog << "Error with " << 1000 << "^" << dim
+ deallog << "Error with " << 1000 << '^' << dim
<< " quadrature points: " << out.l2_norm() << std::endl;
}
}
i < matrix_free.get_dof_info(0).row_starts[c + 1].first;
++i)
deallog << std::setw(3) << matrix_free.get_dof_info(0).dof_indices[i]
- << " ";
+ << ' ';
deallog << std::endl;
}
deallog << std::endl;
i++)
dst.begin()[i] = 0;
for (unsigned int i = 0; i < 2 * Utilities::pow(fe_degree + 1, dim); ++i)
- deallog << static_cast<int>(dst[i]) << " ";
+ deallog << static_cast<int>(dst[i]) << ' ';
deallog << std::endl << std::endl;
}
{
deallog << "src:" << std::endl;
for (unsigned int i = 0; i < 2 * Utilities::pow(fe_degree + 1, dim); ++i)
- deallog << static_cast<int>(src[i]) << " ";
+ deallog << static_cast<int>(src[i]) << ' ';
deallog << std::endl;
for (unsigned int i = Utilities::pow(fe_degree + 1, dim);
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << factor_float * i << " ";
+ deallog << factor_float * i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
evaluator_scalar.integrate(solution_values,
EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
evaluator_scalar.integrate(solution_values,
EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::values | EvaluationFlags::gradients);
for (const auto i : solution_values)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
EvaluationFlags::gradients);
for (unsigned int i = 0; i < solution_values.size(); ++i)
- deallog << solution_values[i] - solution_values2[i] << " ";
+ deallog << solution_values[i] - solution_values2[i] << ' ';
deallog << std::endl;
}
}
EvaluationFlags::gradients);
for (unsigned int i = 0; i < solution_values.size(); ++i)
- deallog << solution_values[i] - solution_values2[i] << " ";
+ deallog << solution_values[i] - solution_values2[i] << ' ';
deallog << std::endl;
}
}
Assert(cell_data_m[lane] ==
data.get_cell_iterator(cell, lane)->id(),
ExcInternalError());
- // deallog << "m" << cell_data_m[lane] << std::endl;
+ // deallog << 'm' << cell_data_m[lane] << std::endl;
const auto bids =
data.get_faces_by_cells_boundary_id(cell, face);
{
internal::MatrixFreeFunctions::ShapeInfo<double> shape_info;
shape_info.reinit(quad, fe, 0);
- deallog << "Testing " << fe.get_name() << " with " << quadrature_name << "("
- << quad.size() << ")" << std::endl;
+ deallog << "Testing " << fe.get_name() << " with " << quadrature_name << '('
+ << quad.size() << ')' << std::endl;
deallog << "shape values: " << std::endl;
const auto &univariate_shape_data = shape_info.get_shape_data(0, 0);
for (unsigned int i = 0; i < univariate_shape_data.fe_degree + 1; ++i)
for (unsigned int q = 0; q < quad.size(); ++q)
deallog << std::setw(15)
<< univariate_shape_data.shape_values[i * quad.size() + q]
- << " ";
+ << ' ';
deallog << std::endl;
}
deallog << "inverse shape values: " << std::endl;
deallog
<< std::setw(15)
<< univariate_shape_data.inverse_shape_values[i * quad.size() + q]
- << " ";
+ << ' ';
deallog << std::endl;
}
deallog << "inverse shapes' * shapes: " << std::endl;
sum +=
univariate_shape_data.inverse_shape_values[k * quad.size() + i] *
univariate_shape_data.shape_values[k * quad.size() + j];
- deallog << std::setw(15) << sum << " ";
+ deallog << std::setw(15) << sum << ' ';
}
deallog << std::endl;
}
sum +=
univariate_shape_data.inverse_shape_values[i * quad.size() + k] *
univariate_shape_data.shape_values[j * quad.size() + k];
- deallog << std::setw(15) << sum << " ";
+ deallog << std::setw(15) << sum << ' ';
}
deallog << std::endl;
}
if (degree == 1)
{
- deallog << "Evaluate d-linear shortcut in " << dim << "d" << std::endl;
+ deallog << "Evaluate d-linear shortcut in " << dim << 'd' << std::endl;
for (const auto &p : evaluation_points)
{
const auto val = internal::evaluate_tensor_product_value_and_gradient(
if (degree == 1)
{
- deallog << "Evaluate d-linear shortcut in " << dim << "d" << std::endl;
+ deallog << "Evaluate d-linear shortcut in " << dim << 'd' << std::endl;
for (const auto &p : evaluation_points)
{
const auto val = internal::evaluate_tensor_product_value_and_gradient(
if (degree == 1)
{
- deallog << "Evaluate d-linear shortcut in " << dim << "d" << std::endl;
+ deallog << "Evaluate d-linear shortcut in " << dim << 'd' << std::endl;
for (const auto &p : evaluation_points)
{
Point<dim, VectorizedArray<double>> p_vec;
if (degree == 1)
{
- deallog << "Evaluate d-linear shortcut in " << dim << "d" << std::endl;
+ deallog << "Evaluate d-linear shortcut in " << dim << 'd' << std::endl;
for (const auto &p : evaluation_points)
{
Point<dim, VectorizedArray<double>> p_vec;
boundary_worker,
face_worker);
- deallog << "Testing <" << dim << "," << spacedim << ">" << std::endl;
+ deallog << "Testing <" << dim << ',' << spacedim << '>' << std::endl;
deallog << "Volume: " << std::get<0>(measures) << std::endl;
std::get<2>(measures) =
Utilities::MPI::sum(std::get<2>(measures), MPI_COMM_WORLD);
- deallog << "Testing <" << dim << "," << spacedim << ">" << std::endl;
+ deallog << "Testing <" << dim << ',' << spacedim << '>' << std::endl;
deallog << "Volume: " << std::get<0>(measures) << std::endl;
boundary_worker,
face_worker);
- deallog << "Testing <" << dim << "," << spacedim << ">" << std::endl;
+ deallog << "Testing <" << dim << ',' << spacedim << '>' << std::endl;
deallog << "Volume: " << std::get<0>(measures) << std::endl;
boundary_worker,
face_worker);
- deallog << "Testing <" << dim << "," << spacedim << ">" << std::endl;
+ deallog << "Testing <" << dim << ',' << spacedim << '>' << std::endl;
deallog << "Volume: " << std::get<0>(measures) << std::endl;
void
test()
{
- deallog << dim << "D" << std::endl;
+ deallog << dim << 'D' << std::endl;
Triangulation<dim> triangulation;
GridGenerator::hyper_cube(triangulation);
triangulation.begin_active();
for (; cell != triangulation.end(); ++cell)
{
- deallog << cell->subdomain_id() << " ";
+ deallog << cell->subdomain_id() << ' ';
}
deallog << std::endl;
}
check(tria);
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
fu);
for (const auto r : result)
- deallog << r << " ";
+ deallog << r << ' ';
deallog << std::endl;
for (unsigned int rank = 0;
rank);
for (const auto r : result)
- deallog << r << " ";
+ deallog << r << ' ';
deallog << std::endl;
}
}
}
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
- deallog << "OK for " << dim << "d" << std::endl;
+ deallog << "OK for " << dim << 'd' << std::endl;
}
int
operator<<(std::ostream &os, const TestObject &test_object)
{
for (const auto &i : test_object.int_vector)
- os << i << " ";
+ os << i << ' ';
os << test_object.string;
const auto result = Utilities::MPI::broadcast(MPI_COMM_WORLD, test_object);
- deallog << result << " ";
+ deallog << result << ' ';
deallog << std::endl;
}
void
test()
{
- deallog << "Testing " << Utilities::int_to_string(dim, 1) << "D" << std::endl;
+ deallog << "Testing " << Utilities::int_to_string(dim, 1) << 'D' << std::endl;
parallel::distributed::Triangulation<dim> triangulation(MPI_COMM_WORLD);
GridGenerator::hyper_cube(triangulation, -1., 1., true);
MPI_Recv(&value[1], 1, MPI_UNSIGNED, src, tag, comm2, MPI_STATUS_IGNORE);
MPI_Recv(&value[0], 1, MPI_UNSIGNED, src, tag, comm, MPI_STATUS_IGNORE);
- deallog << value[0] << " " << value[1] << " " << value[2] << std::endl;
+ deallog << value[0] << ' ' << value[1] << ' ' << value[2] << std::endl;
}
Utilities::MPI::free_communicator(comm2);
typename VectorMemory<VectorType>::Pointer v3(memory);
*v3 = v1;
- deallog << v1.l2_norm() << " " << v3->l2_norm() << std::endl;
+ deallog << v1.l2_norm() << ' ' << v3->l2_norm() << std::endl;
}
deallog << "owning_ranks_of_ghosts:" << std::endl;
for (auto i : owning_ranks_of_ghosts)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
deallog << "requesters:" << std::endl;
{
const auto bigtype = Utilities::MPI::create_mpi_data_type_n_bytes(n_bytes);
- deallog << "checking size " << n_bytes << ":";
+ deallog << "checking size " << n_bytes << ':';
int size32;
int ierr = MPI_Type_size(*bigtype, &size32);
i < Utilities::MPI::n_mpi_processes(MPI_COMM_WORLD);
++i)
{
- deallog << "Process " << i << ":" << std::endl;
+ deallog << "Process " << i << ':' << std::endl;
cat_file((filename + "-" + Utilities::int_to_string(i, 2)).c_str());
}
i < Utilities::MPI::n_mpi_processes(MPI_COMM_WORLD);
++i)
{
- deallog << "Process " << i << ":" << std::endl;
+ deallog << "Process " << i << ':' << std::endl;
cat_file((filename + "-" + Utilities::int_to_string(i, 2)).c_str());
}
if (myid == 0)
{
- deallog << "blocks: " << csp.n_block_rows() << "x" << csp.n_block_cols()
+ deallog << "blocks: " << csp.n_block_rows() << 'x' << csp.n_block_cols()
<< std::endl;
- deallog << "size: " << csp.n_rows() << "x" << csp.n_cols() << std::endl;
+ deallog << "size: " << csp.n_rows() << 'x' << csp.n_cols() << std::endl;
}
SparsityTools::distribute_sparsity_pattern(csp,
if (myid == 0)
{
- deallog << "blocks: " << csp.n_block_rows() << "x" << csp.n_block_cols()
+ deallog << "blocks: " << csp.n_block_rows() << 'x' << csp.n_block_cols()
<< std::endl;
- deallog << "size: " << csp.n_rows() << "x" << csp.n_cols() << std::endl;
+ deallog << "size: " << csp.n_rows() << 'x' << csp.n_cols() << std::endl;
}
// checking...
for (unsigned int i = 0; i < locally_level_active.size(); ++i)
if (locally_level_active.is_element(i))
- deallog << i << " ";
+ deallog << i << ' ';
deallog << "OK" << std::endl;
}
}
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << get_real_assert_zero_imag(v(myid * 2))
+ deallog << myid * 2 << ':' << get_real_assert_zero_imag(v(myid * 2))
<< std::endl;
- deallog << myid * 2 + 1 << ":"
+ deallog << myid * 2 + 1 << ':'
<< get_real_assert_zero_imag(v(myid * 2 + 1)) << std::endl;
}
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << get_real_assert_zero_imag(v(myid * 2))
+ deallog << myid * 2 << ':' << get_real_assert_zero_imag(v(myid * 2))
<< std::endl;
- deallog << myid * 2 + 1 << ":"
+ deallog << myid * 2 + 1 << ':'
<< get_real_assert_zero_imag(v(myid * 2 + 1)) << std::endl;
}
tria_sequential.execute_coarsening_and_refinement();
}
- deallog << n_global << " " << n_local
+ deallog << n_global << ' ' << n_local
<< " distrib=" << tria_distrib.has_hanging_nodes()
<< "; shared=" << tria_sequential.has_hanging_nodes() << std::endl;
}
const unsigned int checksum = tr.get_checksum();
const unsigned int checksum2 = tr2.get_checksum();
if (myid == 0)
- deallog << "Checksum: " << checksum << " " << checksum2 << std::endl;
+ deallog << "Checksum: " << checksum << ' ' << checksum2 << std::endl;
}
}
deallog << "active FE indices after adaptation:" << std::endl;
for (const auto &cell :
dofh.active_cell_iterators() | IteratorFilters::LocallyOwnedCell())
- deallog << " " << cell->id().to_string() << " " << cell->active_fe_index()
+ deallog << ' ' << cell->id().to_string() << ' ' << cell->active_fe_index()
<< std::endl;
deallog << "OK" << std::endl;
if (cell->level_subdomain_id() != 4294967294)
deallog << cell->level_subdomain_id();
else
- deallog << "-";
+ deallog << '-';
deallog << std::endl;
}
deallog << std::endl;
if (cell->level_subdomain_id() != 4294967294)
deallog << cell->level_subdomain_id();
else
- deallog << "-";
+ deallog << '-';
}
deallog << std::endl;
}
deallog << "locally_owned_mg_dofs_per_processor:" << std::endl;
for (unsigned int lvl = 0; lvl < tr.n_global_levels(); ++lvl)
{
- deallog << "level " << lvl << ":" << std::endl;
+ deallog << "level " << lvl << ':' << std::endl;
const std::vector<IndexSet> vec =
Utilities::MPI::all_gather(MPI_COMM_WORLD,
if (dofs[i] == numbers::invalid_dof_index)
deallog << "- ";
else
- deallog << dofs[i] << " ";
+ deallog << dofs[i] << ' ';
deallog << " | ";
}
deallog << std::endl;
if (dofs[i] == numbers::invalid_dof_index)
deallog << "- ";
else
- deallog << dofs[i] << " ";
+ deallog << dofs[i] << ' ';
deallog << " | ";
}
deallog << std::endl;
<< cell->level_subdomain_id() << ": ";
cell->get_mg_dof_indices(dof_indices);
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << dof_indices[i] << " ";
+ deallog << dof_indices[i] << ' ';
deallog << std::endl;
}
}
<< cell->level_subdomain_id() << ": ";
cell->get_mg_dof_indices(dof_indices);
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << dof_indices[i] << " ";
+ deallog << dof_indices[i] << ' ';
deallog << std::endl;
}
}
<< ", owned by " << cell->level_subdomain_id() << ": ";
cell->get_mg_dof_indices(dof_indices);
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << dof_indices[i] << " ";
+ deallog << dof_indices[i] << ' ';
deallog << std::endl;
}
}
<< cell->level_subdomain_id() << ": ";
cell->get_mg_dof_indices(dof_indices);
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << dof_indices[i] << " ";
+ deallog << dof_indices[i] << ' ';
deallog << std::endl;
}
}
dof_handler.distribute_mg_dofs();
deallog << "Number of DoFs per level: ";
for (unsigned int level = 0; level < tria.n_global_levels(); ++level)
- deallog << dof_handler.n_dofs(level) << " ";
+ deallog << dof_handler.n_dofs(level) << ' ';
deallog << std::endl;
}
for (typename Triangulation<dim>::cell_iterator cell = tria.begin();
cell != tria.end();
++cell)
- deallog << cell->id().to_string() << " " << cell->level_subdomain_id()
+ deallog << cell->id().to_string() << ' ' << cell->level_subdomain_id()
<< std::endl;
if (0)
for (typename Triangulation<dim>::cell_iterator cell = tria.begin();
cell != tria.end();
++cell)
- deallog << cell->id().to_string() << " " << cell->level_subdomain_id()
+ deallog << cell->id().to_string() << ' ' << cell->level_subdomain_id()
<< std::endl;
FE_DGQ<dim> fe1(1);
for (const auto &cell : tria.cell_iterators())
if (cell->level_subdomain_id() == tria.locally_owned_subdomain())
{
- deallog << Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) << " "
+ deallog << Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) << ' '
<< cell->id() << " neighbor subdomain ids: ";
for (unsigned int f : GeometryInfo<dim>::face_indices())
{
- deallog << cell->neighbor_or_periodic_neighbor(f)->id() << " ";
+ deallog << cell->neighbor_or_periodic_neighbor(f)->id() << ' ';
if (cell->is_active())
deallog
<< cell->neighbor_or_periodic_neighbor(f)->subdomain_id()
- << " ";
+ << ' ';
deallog << cell->neighbor_or_periodic_neighbor(f)
->level_subdomain_id()
<< " ";
// GridTools::get_subdomain_association(tr, cell_subd);
// for (unsigned int i=0;i<tr.n_active_cells();++i)
- // deallog << cell_subd[i] << " ";
+ // deallog << cell_subd[i] << ' ';
// deallog << std::endl;
if (myid == 0)
cell->get_dof_indices(local_dof_indices);
for (unsigned int i = 0; i < dofs_per_cell; ++i)
- deallog << local_dof_indices[i] << " ";
+ deallog << local_dof_indices[i] << ' ';
deallog << std::endl;
}
GridTools::get_subdomain_association(tr, cell_subd);
for (unsigned int i = 0; i < tr.n_active_cells(); ++i)
- deallog << cell_subd[i] << " ";
+ deallog << cell_subd[i] << ' ';
deallog << std::endl;
}
GridTools::get_subdomain_association(tr, cell_subd);
for (unsigned int i = 0; i < tr.n_active_cells(); ++i)
- deallog << cell_subd[i] << " ";
+ deallog << cell_subd[i] << ' ';
deallog << std::endl;
}
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
for (unsigned int i = 0; i < tr.n_active_cells(); ++i)
- deallog << cell_subd[i] << " ";
+ deallog << cell_subd[i] << ' ';
deallog << std::endl;
}
cell->get_dof_indices(local_dof_indices);
for (unsigned int i = 0; i < cell->get_fe().dofs_per_cell;
++i)
- deallog << local_dof_indices[i] << " ";
+ deallog << local_dof_indices[i] << ' ';
deallog << std::endl;
}
}
local_dof_indices.resize(cell->get_fe().dofs_per_cell);
cell->get_dof_indices(local_dof_indices);
for (unsigned int i = 0; i < cell->get_fe().dofs_per_cell; ++i)
- deallog << local_dof_indices[i] << " ";
+ deallog << local_dof_indices[i] << ' ';
deallog << std::endl;
}
}
GridTools::get_subdomain_association(tr, cell_subd);
for (unsigned int i = 0; i < tr.n_active_cells(); ++i)
- deallog << cell_subd[i] << " ";
+ deallog << cell_subd[i] << ' ';
deallog << std::endl;
}
unsigned int myid = Utilities::MPI::this_mpi_process(MPI_COMM_WORLD);
- std::cout << myid << ":" << getpid() << std::endl;
+ std::cout << myid << ':' << getpid() << std::endl;
// system("sleep 20");
deallog << "cells(0) = " << tr.n_active_cells() << std::endl;
}
deallog << "Checksum: " << tr.get_checksum() << std::endl;
- deallog << "sum: " << norm << " " << norm2 << std::endl;
+ deallog << "sum: " << norm << ' ' << norm2 << std::endl;
}
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
const unsigned int coarse_cellid =
std::stoul(cellid.substr(0, cellid.find("_")));
- deallog << " (" << coarse_cellid << "," << cell->future_fe_index()
- << ")";
+ deallog << " (" << coarse_cellid << ',' << cell->future_fe_index()
+ << ')';
}
deallog << std::endl;
}
const double diff_norm = std::abs(res - res2);
const double diff_norm2 = std::abs(res - res3);
- deallog << "Norm of difference: " << diff_norm << " " << diff_norm2
+ deallog << "Norm of difference: " << diff_norm << ' ' << diff_norm2
<< std::endl;
}
file << "**** proc " << myid << std::endl;
file << "ghost targets: ";
for (unsigned int i = 0; i < v.ghost_targets().size(); ++i)
- file << "[" << v.ghost_targets()[i].first << "/"
+ file << '[' << v.ghost_targets()[i].first << '/'
<< v.ghost_targets()[i].second << "] ";
file << std::endl;
file << "import targets: ";
for (unsigned int i = 0; i < v.import_targets().size(); ++i)
- file << "[" << v.import_targets()[i].first << "/"
+ file << '[' << v.import_targets()[i].first << '/'
<< v.import_targets()[i].second << "] ";
file << std::endl;
file << "import indices:" << std::endl;
for (unsigned int i = 0; i < v.import_indices().size(); ++i)
- file << "[" << v.import_indices()[i].first << "/"
- << v.import_indices()[i].second << ")" << std::endl;
+ file << '[' << v.import_indices()[i].first << '/'
+ << v.import_indices()[i].second << ')' << std::endl;
file << "****" << std::endl;
}
local_relevant.print(file);
file << "ghost targets: ";
for (unsigned int i = 0; i < v.ghost_targets().size(); ++i)
- file << "[" << v.ghost_targets()[i].first << "/"
+ file << '[' << v.ghost_targets()[i].first << '/'
<< v.ghost_targets()[i].second << "] ";
file << std::endl;
file << "import targets: ";
for (unsigned int i = 0; i < v.import_targets().size(); ++i)
- file << "[" << v.import_targets()[i].first << "/"
+ file << '[' << v.import_targets()[i].first << '/'
<< v.import_targets()[i].second << "] ";
file << std::endl;
file << "import indices:" << std::endl;
for (unsigned int i = 0; i < v.import_indices().size(); ++i)
- file << "[" << v.import_indices()[i].first << "/"
- << v.import_indices()[i].second << ")" << std::endl;
+ file << '[' << v.import_indices()[i].first << '/'
+ << v.import_indices()[i].second << ')' << std::endl;
file << "****" << std::endl;
}
deallog << "Ghost subset in " << v.n_ghost_indices() << " indices: ";
for (unsigned int i = 0; i < v.ghost_indices_within_larger_ghost_set().size();
++i)
- deallog << "[" << v.ghost_indices_within_larger_ghost_set()[i].first << ", "
+ deallog << '[' << v.ghost_indices_within_larger_ghost_set()[i].first << ", "
<< v.ghost_indices_within_larger_ghost_set()[i].second << ") ";
deallog << std::endl;
deallog << "Ghost subset in " << w.n_ghost_indices() << " indices: ";
for (unsigned int i = 0; i < w.ghost_indices_within_larger_ghost_set().size();
++i)
- deallog << "[" << w.ghost_indices_within_larger_ghost_set()[i].first << ", "
+ deallog << '[' << w.ghost_indices_within_larger_ghost_set()[i].first << ", "
<< w.ghost_indices_within_larger_ghost_set()[i].second << ") ";
deallog << std::endl;
deallog << "Ghost subset in " << x.n_ghost_indices() << " indices: ";
for (unsigned int i = 0; i < x.ghost_indices_within_larger_ghost_set().size();
++i)
- deallog << "[" << x.ghost_indices_within_larger_ghost_set()[i].first << ", "
+ deallog << '[' << x.ghost_indices_within_larger_ghost_set()[i].first << ", "
<< x.ghost_indices_within_larger_ghost_set()[i].second << ") ";
deallog << std::endl;
}
v.export_to_ghosted_array_finish(make_array_view(ghosts), requests);
deallog << "All ghosts: ";
for (unsigned int i = 0; i < ghosts.size(); ++i)
- deallog << ghosts[i] << " ";
+ deallog << ghosts[i] << ' ';
deallog << std::endl;
// send only the array in w
w.export_to_ghosted_array_finish(make_array_view(ghosts), requests);
deallog << "Ghosts on reduced 1: ";
for (unsigned int i = 0; i < ghosts.size(); ++i)
- deallog << ghosts[i] << " ";
+ deallog << ghosts[i] << ' ';
deallog << std::endl;
std::fill(ghosts.begin(), ghosts.end(), 0);
x.export_to_ghosted_array_finish(make_array_view(ghosts), requests);
deallog << "Ghosts on reduced 2: ";
for (unsigned int i = 0; i < ghosts.size(); ++i)
- deallog << ghosts[i] << " ";
+ deallog << ghosts[i] << ' ';
deallog << std::endl;
x.export_to_ghosted_array_finish(make_array_view(ghosts2), requests2);
deallog << "Ghosts on reduced 2 without excess entries: ";
for (unsigned int i = 0; i < ghosts2.size(); ++i)
- deallog << ghosts2[i] << " ";
+ deallog << ghosts2[i] << ' ';
deallog << std::endl;
x.export_to_ghosted_array_start(3,
x.export_to_ghosted_array_finish(make_array_view(ghosts), requests);
deallog << "Ghosts on reduced 2: ";
for (unsigned int i = 0; i < ghosts.size(); ++i)
- deallog << ghosts[i] << " ";
+ deallog << ghosts[i] << ' ';
deallog << std::endl;
}
}
deallog << "From all ghosts: ";
for (unsigned int i = 0; i < locally_owned_array.size(); ++i)
- deallog << locally_owned_array[i] << " ";
+ deallog << locally_owned_array[i] << ' ';
deallog << std::endl;
// send only the array in w
}
deallog << "From reduced ghosts 1: ";
for (unsigned int i = 0; i < locally_owned_array.size(); ++i)
- deallog << locally_owned_array[i] << " ";
+ deallog << locally_owned_array[i] << ' ';
deallog << std::endl;
// send only the array in x
}
deallog << "From reduced ghosts 2: ";
for (unsigned int i = 0; i < locally_owned_array.size(); ++i)
- deallog << locally_owned_array[i] << " ";
+ deallog << locally_owned_array[i] << ' ';
deallog << std::endl;
// now send a tight array from x and add into the existing entries
requests);
deallog << "From tight reduced ghosts 2: ";
for (unsigned int i = 0; i < locally_owned_array.size(); ++i)
- deallog << locally_owned_array[i] << " ";
+ deallog << locally_owned_array[i] << ' ';
deallog << std::endl;
}
auto print = [&]() {
deallog << "owned:" << std::endl;
for (auto el : owned)
- deallog << el << " ";
+ deallog << el << ' ';
deallog << std::endl << "ghost:" << std::endl;
for (auto el : ghost)
- deallog << el << " ";
+ deallog << el << ' ';
deallog << std::endl;
};
deallog << "ghost targets: ";
for (const auto &p : part.ghost_targets())
- deallog << "p" << p.first << " n_indices=" << p.second << " ";
+ deallog << 'p' << p.first << " n_indices=" << p.second << " ";
deallog << std::endl;
deallog << "import targets: ";
for (const auto &p : part.import_targets())
- deallog << "p" << p.first << " n_indices=" << p.second << " ";
+ deallog << 'p' << p.first << " n_indices=" << p.second << " ";
deallog << std::endl;
deallog << "import indices: ";
for (const auto &p : part.import_indices())
- deallog << "[" << p.first << " " << p.second << ") ";
+ deallog << '[' << p.first << ' ' << p.second << ") ";
deallog << std::endl;
}
if (myid == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
Assert(v(myid * 2) == myid * 4.0, ExcInternalError());
if (myid == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
// import ghosts onto all procs
if (myid == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
// import ghosts onto all procs
if (myid == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
v(1) = -7;
if (myid == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
// import ghosts onto all procs
MPI_COMM_WORLD);
deallog << "Local range of proc 0: "
- << v.get_partitioner()->local_range().first << " "
+ << v.get_partitioner()->local_range().first << ' '
<< v.get_partitioner()->local_range().second << std::endl;
// set local values
v6.reinit(local_owned_b, newcomm);
deallog << "local compatibility v1-v2: "
- << v1.partitioners_are_compatible(*v2.get_partitioner()) << " "
+ << v1.partitioners_are_compatible(*v2.get_partitioner()) << ' '
<< v2.partitioners_are_compatible(*v1.get_partitioner()) << std::endl;
deallog << "global compatibility v1-v2: "
<< v1.partitioners_are_globally_compatible(*v2.get_partitioner())
- << " "
+ << ' '
<< v2.partitioners_are_globally_compatible(*v1.get_partitioner())
<< std::endl;
deallog << "local compatibility v2-v3: "
- << v2.partitioners_are_compatible(*v3.get_partitioner()) << " "
+ << v2.partitioners_are_compatible(*v3.get_partitioner()) << ' '
<< v3.partitioners_are_compatible(*v2.get_partitioner()) << std::endl;
deallog << "global compatibility v2-v3: "
<< v2.partitioners_are_globally_compatible(*v3.get_partitioner())
- << " "
+ << ' '
<< v3.partitioners_are_globally_compatible(*v2.get_partitioner())
<< std::endl;
deallog << "local compatibility v3-v4: "
- << v4.partitioners_are_compatible(*v3.get_partitioner()) << " "
+ << v4.partitioners_are_compatible(*v3.get_partitioner()) << ' '
<< v3.partitioners_are_compatible(*v4.get_partitioner()) << std::endl;
deallog << "global compatibility v3-v4: "
<< v4.partitioners_are_globally_compatible(*v3.get_partitioner())
- << " "
+ << ' '
<< v3.partitioners_are_globally_compatible(*v4.get_partitioner())
<< std::endl;
deallog << "local compatibility v4-v5: "
- << v4.partitioners_are_compatible(*v5.get_partitioner()) << " "
+ << v4.partitioners_are_compatible(*v5.get_partitioner()) << ' '
<< v5.partitioners_are_compatible(*v4.get_partitioner()) << std::endl;
deallog << "global compatibility v4-v5: "
<< v4.partitioners_are_globally_compatible(*v5.get_partitioner())
- << " "
+ << ' '
<< v5.partitioners_are_globally_compatible(*v4.get_partitioner())
<< std::endl;
deallog << "local compatibility v5-v6: "
- << v6.partitioners_are_compatible(*v5.get_partitioner()) << " "
+ << v6.partitioners_are_compatible(*v5.get_partitioner()) << ' '
<< v5.partitioners_are_compatible(*v6.get_partitioner()) << std::endl;
deallog << "global compatibility v5-v6: "
<< v6.partitioners_are_globally_compatible(*v5.get_partitioner())
- << " "
+ << ' '
<< v5.partitioners_are_globally_compatible(*v6.get_partitioner())
<< std::endl;
}
v *= 2.0;
// check setup of vectors
- deallog << myid << ":"
- << "first owned entry: " << v(myid * 2) << std::endl;
- deallog << myid << ":"
- << "second owned entry: " << v(myid * 2 + 1) << std::endl;
+ deallog << myid << ':' << "first owned entry: " << v(myid * 2) << std::endl;
+ deallog << myid << ':' << "second owned entry: " << v(myid * 2 + 1)
+ << std::endl;
// set ghost dof on owning processor and maximize
if (myid)
v.update_ghost_values();
// check
- deallog << myid << ":"
- << "ghost entry after max from owner: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after max from owner: " << v(1)
+ << std::endl;
// ghosts are set to zero
v.zero_out_ghost_values();
v.update_ghost_values();
// check
- deallog << myid << ":"
- << "ghost entry after min from zero: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after min from zero: " << v(1)
+ << std::endl;
// set ghost dof on non-owning processors and minimize
v.zero_out_ghost_values();
v.update_ghost_values();
// check
- deallog << myid << ":"
- << "ghost entry after min from : " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after min from : " << v(1)
+ << std::endl;
// set vector to 1, zeros in ghosts except on owner where -1. is set
v.zero_out_ghost_values();
// even if only one value is set (-1. on owner), the other values
// contribute a "0" and maximization receives zero and returns it
- deallog << myid << ":"
- << "ghost entry after max and partly init: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after max and partly init: " << v(1)
+ << std::endl;
// however, if the ghost value is set on all processors, the
// maximum is -1:
v(1) = -1.0;
v.compress(VectorOperation::max);
v.update_ghost_values();
- deallog << myid << ":"
- << "ghost entry after max and full init: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after max and full init: " << v(1)
+ << std::endl;
// what happens in case max is called two times and all values were smaller
// than zero
v = -1.0;
v(1) = -1.0;
v.compress(VectorOperation::max);
- deallog << myid << ":"
- << "ghost entry after first max: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after first max: " << v(1)
+ << std::endl;
v.compress(VectorOperation::max);
- deallog << myid << ":"
- << "ghost entry after second max: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after second max: " << v(1)
+ << std::endl;
if (myid == 0)
deallog << "OK" << std::endl;
v.import(read_write_vector, VectorOperation::max);
v.update_ghost_values();
- deallog << myid << ":"
- << "ghost entry after max: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after max: " << v(1) << std::endl;
if (!myid)
read_write_vector(1) = -1.0;
v.import(read_write_vector, VectorOperation::min);
v.update_ghost_values();
- deallog << myid << ":"
- << "ghost entry after min: " << v(1) << std::endl;
+ deallog << myid << ':' << "ghost entry after min: " << v(1) << std::endl;
if (myid == 0)
if (locally_relevant_dofs.is_element(i) && constraints.is_constrained(i))
{
deallog << "Coordinates:" << std::endl;
- deallog << i << "@" << supportPoints[i] << std::endl;
+ deallog << i << '@' << supportPoints[i] << std::endl;
for (auto c : *constraints.get_constraint_entries(i))
- deallog << c.first << "@" << supportPoints[c.first] << std::endl;
+ deallog << c.first << '@' << supportPoints[c.first] << std::endl;
}
}
unsigned int buf = numbers::invalid_unsigned_int;
MPI_Status status;
MPI_Recv(&buf, 1, MPI_UNSIGNED, i, 1, MPI_COMM_WORLD, &status);
- deallog << "got message '" << buf << "' from CPU " << i + 1 << "!"
+ deallog << "got message '" << buf << "' from CPU " << i + 1 << '!'
<< std::endl;
Assert(buf == i, ExcInternalError());
}
<< "plot '-' using 1:2 with lines notitle, '-' with labels point pt 2 offset 1,1 notitle"
<< std::endl;
GridOut().write_gnuplot(triangulation, f);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
DoFTools::write_gnuplot_dof_support_point_info(f, support_points);
- f << "e" << std::endl;
+ f << 'e' << std::endl;
}
}
for (std::set<types::subdomain_id>::iterator it = ghost_owners.begin();
it != ghost_owners.end();
++it)
- deallog << *it << " ";
+ deallog << *it << ' ';
deallog << std::endl;
mpi_check(ghost_owners);
level_ghost_owners.begin();
it != level_ghost_owners.end();
++it)
- deallog << *it << " ";
+ deallog << *it << ' ';
deallog << std::endl;
mpi_check(level_ghost_owners);
for (std::set<types::subdomain_id>::iterator it = ghost_owners.begin();
it != ghost_owners.end();
++it)
- deallog << *it << " ";
+ deallog << *it << ' ';
deallog << std::endl;
mpi_check(ghost_owners);
level_ghost_owners.begin();
it != level_ghost_owners.end();
++it)
- deallog << *it << " ";
+ deallog << *it << ' ';
deallog << std::endl;
mpi_check(level_ghost_owners);
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
Assert(v(myid * 2) == myid * 4.0, ExcInternalError());
if (myid == 0)
{
- deallog << myid * 2 << ":" << v(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << v(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << v(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << v(myid * 2 + 1) << std::endl;
}
if (myid == 0)
double l1b = n_procs * 1.2;
A.compress(VectorOperation::add);
- deallog << "1: " << A.l1_norm() << " " << B.l1_norm() << " (should be " << l1a
+ deallog << "1: " << A.l1_norm() << ' ' << B.l1_norm() << " (should be " << l1a
<< " 0.0)" << std::endl;
deallog << "set B=A..." << std::endl;
B.copy_from(A);
- deallog << "2: " << A.l1_norm() << " " << B.l1_norm() << " (should be " << l1a
- << " " << l1a << ")" << std::endl;
+ deallog << "2: " << A.l1_norm() << ' ' << B.l1_norm() << " (should be " << l1a
+ << ' ' << l1a << ')' << std::endl;
if (my_id == 0)
{
A = 0;
A.add(0, 0, -1.2);
A.compress(VectorOperation::add);
- deallog << "3: " << A.l1_norm() << " " << B.l1_norm() << " (should be " << l1b
- << " " << l1a << ")" << std::endl;
+ deallog << "3: " << A.l1_norm() << ' ' << B.l1_norm() << " (should be " << l1b
+ << ' ' << l1a << ')' << std::endl;
if (my_id == 0)
{
const auto result = Utilities::MPI::compute_set_union(vector, comm);
for (auto i : result)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
std::set<unsigned int>(vector.begin(), vector.end()), comm);
for (auto i : result)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
i, type);
for (const auto i : sequence)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int j = 1; j < 25; ++j)
if (MGTwoLevelTransfer<2, LinearAlgebra::distributed::Vector<double>>::
fast_polynomial_transfer_supported(i, j))
- deallog << 1 << " ";
+ deallog << 1 << ' ';
else
deallog << " ";
deallog << std::endl;
operators,
transfer);
- deallog << dim << " " << fe_degree_fine << " " << n_refinements << " "
- << (do_simplex_mesh ? "tri " : "quad") << " "
+ deallog << dim << ' ' << fe_degree_fine << ' ' << n_refinements << ' '
+ << (do_simplex_mesh ? "tri " : "quad") << ' '
<< solver_control.last_step() << std::endl;
static unsigned int counter = 0;
constraints[max_level].distribute(dst);
- deallog << dim << " " << fe_degree_fine << " " << n_refinements << " "
+ deallog << dim << ' ' << fe_degree_fine << ' ' << n_refinements << ' '
<< solver_control.last_step() << std::endl;
return;
constraints[max_level].distribute(dst);
- deallog << dim << " " << fe_degree_fine << " " << n_refinements << " "
- << (do_simplex_mesh ? "tri " : "quad") << " "
+ deallog << dim << ' ' << fe_degree_fine << ' ' << n_refinements << ' '
+ << (do_simplex_mesh ? "tri " : "quad") << ' '
<< solver_control.last_step() << std::endl;
static unsigned int counter = 0;
constraints[max_level].distribute(dst);
- deallog << dim << " " << fe_degree_fine << " " << n_refinements << " "
+ deallog << dim << ' ' << fe_degree_fine << ' ' << n_refinements << ' '
<< solver_control.last_step() << std::endl;
return;
constraints[max_level].distribute(dst);
- deallog << dim << " " << fe_degree_fine << " " << n_refinements << " "
- << level << " " << dst.size() << " " << solver_control.last_step()
+ deallog << dim << ' ' << fe_degree_fine << ' ' << n_refinements << ' '
+ << level << ' ' << dst.size() << ' ' << solver_control.last_step()
<< std::endl;
return;
const unsigned int n_levels = tr.n_global_levels();
for (unsigned int level = 0; level < n_levels; ++level)
{
- deallog << "Level " << level << ":" << std::endl;
+ deallog << "Level " << level << ':' << std::endl;
IndexSet rei = mg_constrained_dofs.get_refinement_edge_indices(level);
deallog << "get_refinement_edge_indices:" << std::endl;
const unsigned int n_levels = tr.n_global_levels();
for (unsigned int level = 0; level < n_levels; ++level)
{
- deallog << "Level " << level << ":" << std::endl;
+ deallog << "Level " << level << ':' << std::endl;
IndexSet rei = mg_constrained_dofs.get_refinement_edge_indices(level);
deallog << "get_refinement_edge_indices:" << std::endl;
const unsigned int n_levels = tr.n_global_levels();
for (unsigned int level = 0; level < n_levels; ++level)
{
- deallog << "Level " << level << ":" << std::endl;
+ deallog << "Level " << level << ':' << std::endl;
IndexSet boundary_indices =
mg_constrained_dofs.get_boundary_indices(level);
boundary_indices.print(deallog);
for (unsigned int l = 0; l < triangulation.n_levels(); ++l)
{
diff(d[l], mg_dof_handler_renumbered, u[l], l);
- deallog << l << " " << u[l].l2_norm() << '\t' << v[l].l2_norm() << '\t'
+ deallog << l << ' ' << u[l].l2_norm() << '\t' << v[l].l2_norm() << '\t'
<< d[l].l2_norm() << std::endl;
for (unsigned int i = 0; i < d[l].size(); ++i)
if (d[l](i) != 0)
- deallog << i << " " << d[l](i) << std::endl;
+ deallog << i << ' ' << d[l](i) << std::endl;
}
output_gpl(mg_dof_handler_renumbered, d);
}
cell != dh.end(level);
++cell)
{
- deallog << "cell " << cell->id() << ":" << std::endl;
+ deallog << "cell " << cell->id() << ':' << std::endl;
cell->get_mg_dof_indices(local_dofs);
for (unsigned int i = 0; i < n_dofs_per_cell; ++i)
- deallog << local_dofs[i] << " ";
+ deallog << local_dofs[i] << ' ';
deallog << std::endl;
}
}
cell != dh.end(level);
++cell)
{
- deallog << "cell " << cell->id() << ":" << std::endl;
+ deallog << "cell " << cell->id() << ':' << std::endl;
cell->get_mg_dof_indices(local_dofs);
for (unsigned int i = 0; i < n_dofs_per_cell; ++i)
- deallog << local_dofs[i] << " ";
+ deallog << local_dofs[i] << ' ';
deallog << std::endl;
}
}
cell->get_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
for (unsigned int l = 0; l < dof.get_triangulation().n_global_levels(); ++l)
cell->get_mg_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
cell->get_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
for (unsigned int l = 0; l < dof.get_triangulation().n_global_levels(); ++l)
cell->get_mg_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
cell->get_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
for (unsigned int l = 0; l < dof.get_triangulation().n_global_levels(); ++l)
cell->get_mg_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
cell->get_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
for (unsigned int l = 0; l < dof.get_triangulation().n_global_levels(); ++l)
cell->get_mg_dof_indices(dof_indices);
deallog << "cell " << cell->id() << ": ";
for (types::global_dof_index i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
else
{
cell_matrix(i, j) = 0;
- std::cout << i << " " << j << "\n";
+ std::cout << i << ' ' << j << "\n";
}
else
{
cell_matrix(i, j) = 0;
- std::cout << i << " " << j << "\n";
+ std::cout << i << ' ' << j << "\n";
}
else
{
cell_matrix(i, j) = 0;
- std::cout << i << " " << j << "\n";
+ std::cout << i << ' ' << j << "\n";
}
for (unsigned int i = 0; i < triangulation.n_global_levels(); ++i)
{
mg_matrices[i].compress(VectorOperation::add);
- deallog << "mg_mat" << i << " " << mg_matrices[i].frobenius_norm()
+ deallog << "mg_mat" << i << ' ' << mg_matrices[i].frobenius_norm()
<< std::endl;
mg_interface_matrices[i].compress(VectorOperation::add);
- deallog << "mg_interface_mat" << i << " "
+ deallog << "mg_interface_mat" << i << ' '
<< mg_interface_matrices[i].frobenius_norm() << std::endl;
}
}
for (unsigned int i = 0; i < dofh.locally_owned_dofs().n_elements(); ++i)
{
unsigned int index = dofh.locally_owned_dofs().nth_index_in_set(i);
- deallog << v[index] << " ";
+ deallog << v[index] << ' ';
}
}
// v.print(deallog.get_file_stream());
for (unsigned int i = 0; i < dofh.locally_owned_dofs().n_elements(); ++i)
{
unsigned int index = dofh.locally_owned_dofs().nth_index_in_set(i);
- deallog << static_cast<PetscScalar>(v(index)) << " ";
+ deallog << static_cast<PetscScalar>(v(index)) << ' ';
}
}
// v.print(deallog.get_file_stream());
deallog << "Diff prolongate l" << level << ": "
<< filter_out_small_numbers(v3.l2_norm(), tolerance)
<< std::endl;
- deallog << "Vectors have ghosts: " << v2.has_ghost_elements() << " "
+ deallog << "Vectors have ghosts: " << v2.has_ghost_elements() << ' '
<< v3.has_ghost_elements() << std::endl;
}
deallog << "SRC Vector" << std::endl;
LinearAlgebra::distributed::Vector<double> src_level_0(mgdof.n_dofs(0));
for (unsigned int i = 0; i < mgdof.n_dofs(0); ++i)
- deallog << src_level_0(i) << " ";
+ deallog << src_level_0(i) << ' ';
deallog << std::endl << std::endl;
{
transfer_mf.prolongate(1, dst_level_1, src_level_0);
deallog << "DST Vector" << std::endl;
for (unsigned int i = 0; i < mgdof.n_dofs(1); ++i)
- deallog << dst_level_1(i) << " ";
+ deallog << dst_level_1(i) << ' ';
deallog << std::endl;
}
}
deallog << "SRC Vector" << std::endl;
Vector<double> src_level_0(mgdof.n_dofs(0));
for (unsigned int i = 0; i < mgdof.n_dofs(0); ++i)
- deallog << src_level_0(i) << " ";
+ deallog << src_level_0(i) << ' ';
deallog << std::endl << std::endl;
{
transfer_pb.prolongate(1, dst_level_1, src_level_0);
deallog << "DST Vector" << std::endl;
for (unsigned int i = 0; i < mgdof.n_dofs(1); ++i)
- deallog << dst_level_1(i) << " ";
+ deallog << dst_level_1(i) << ' ';
deallog << std::endl;
}
}
const unsigned int n_phys_cores =
std::min(n_max_threads, MultithreadInfo::n_cores());
std::cout << "MultithreadInfo::n_cores()=" << n_phys_cores
- << " (limited from " << MultithreadInfo::n_cores() << ")"
+ << " (limited from " << MultithreadInfo::n_cores() << ')'
<< std::endl;
std::cout << "MultithreadInfo::n_threads()=" << MultithreadInfo::n_threads()
<< std::endl;
timer.stop();
const double time = timer.last_wall_time();
avg += time;
- std::cout << time << " " << std::flush;
+ std::cout << time << ' ' << std::flush;
reference_l2 = system_rhs.l2_norm();
}
avg /= n_runs;
timer.stop();
const double time = timer.last_wall_time();
avg += time;
- std::cout << time << " " << std::flush;
+ std::cout << time << ' ' << std::flush;
Assert(abs(reference_l2 - system_rhs.l2_norm()) < 1e-10,
ExcInternalError());
}
timer.stop();
const double time = timer.last_wall_time();
avg += time;
- std::cout << time << " " << std::flush;
+ std::cout << time << ' ' << std::flush;
Assert(abs(reference_l2 - system_rhs.l2_norm()) < 1e-10,
ExcInternalError());
}
timer.stop();
const double time = timer.last_wall_time();
avg += time;
- std::cout << time << " " << std::flush;
+ std::cout << time << ' ' << std::flush;
Assert(abs(reference_l2 - system_rhs.l2_norm()) < 1e-10,
ExcInternalError());
}
timer.stop();
const double time = timer.last_wall_time();
avg += time;
- std::cout << time << " " << std::flush;
+ std::cout << time << ' ' << std::flush;
Assert(abs(reference_l2 - system_rhs.l2_norm()) < 1e-10,
ExcInternalError());
}
timer.stop();
const double time = timer.last_wall_time();
avg += time;
- std::cout << time << " " << std::flush;
+ std::cout << time << ' ' << std::flush;
Assert(abs(reference_l2 - system_rhs.l2_norm()) < 1e-10,
ExcInternalError());
}
{
const NonMatching::LocationToLevelSet cell_position =
classifier.location_to_level_set(cell, i);
- deallog << "face " << i << " " << location_to_string(cell_position)
+ deallog << "face " << i << ' ' << location_to_string(cell_position)
<< std::endl;
}
}
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
// output("neuman.vtu",
get_h_area<dim>(h, A, L);
const double expected_value_squared = h * A * std::pow(func.get_c(), 2) / p;
dealii::deallog << "expected:" << std::endl
- << " " << std::sqrt(expected_value_squared) << std::endl;
+ << ' ' << std::sqrt(expected_value_squared) << std::endl;
AssertThrow(std::fabs(std::sqrt(expected_value_squared) - error[0]) < 1e-5,
dealii::ExcInternalError());
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
// output("regular.vtu",
const double expected_value_squared =
h * A * std::pow(func.get_k(), 2) / 2.0 / std::max(p1, p2);
dealii::deallog << "expected:" << std::endl
- << " " << std::sqrt(expected_value_squared) << std::endl;
+ << ' ' << std::sqrt(expected_value_squared) << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
AssertThrow(std::fabs(std::sqrt(expected_value_squared) - error[i]) < 1e-6,
dealii::ExcInternalError());
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
// output("irregular.vtu",
dealii::deallog << "expected:" << std::endl;
for (unsigned int i = 0; i < expected_error.size(); ++i)
- deallog << " " << expected_error[i];
+ deallog << ' ' << expected_error[i];
deallog << std::endl;
for (unsigned int i = 0; i < expected_error.size(); ++i)
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
dof_handler.clear();
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
// output("neuman.vtu",
get_h_area<dim>(h, A, L);
const double expected_value_squared = h * A * std::pow(func.get_c(), 2) / p;
dealii::deallog << "expected:" << std::endl
- << " " << std::sqrt(expected_value_squared) << std::endl;
+ << ' ' << std::sqrt(expected_value_squared) << std::endl;
AssertThrow(std::fabs(std::sqrt(expected_value_squared) - error[0]) < 1e-5,
dealii::ExcInternalError());
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
// output("regular.vtu",
const double expected_value_squared =
h * A * std::pow(func.get_k(), 2) / 2.0 / std::max(p1, p2);
dealii::deallog << "expected:" << std::endl
- << " " << std::sqrt(expected_value_squared) << std::endl;
+ << ' ' << std::sqrt(expected_value_squared) << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
AssertThrow(std::fabs(std::sqrt(expected_value_squared) - error[i]) < 1e-6,
dealii::ExcInternalError());
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
// output("irregular.vtu",
dealii::deallog << "expected:" << std::endl;
for (unsigned int i = 0; i < expected_error.size(); ++i)
- deallog << " " << expected_error[i];
+ deallog << ' ' << expected_error[i];
deallog << std::endl;
for (unsigned int i = 0; i < expected_error.size(); ++i)
dealii::deallog << "dof values:" << std::endl;
for (unsigned int i = 0; i < values.size(); ++i)
- dealii::deallog << " " << values[i];
+ dealii::deallog << ' ' << values[i];
dealii::deallog << std::endl;
// call Kelly
dealii::deallog << "error:" << std::endl;
for (unsigned int i = 0; i < error.size(); ++i)
- dealii::deallog << " " << error[i];
+ dealii::deallog << ' ' << error[i];
dealii::deallog << std::endl;
dof_handler.clear();
unit_support_point = cell->get_fe().unit_support_point(shapefun);
support_point =
mapping.transform_unit_to_real_cell(cell, unit_support_point);
- deallog << " " << support_point << ":\n "
+ deallog << ' ' << support_point << ":\n "
<< u_1[local_dof_indices[shapefun]] << endl
<< endl;
}
unit_support_point = cell->get_fe().unit_support_point(shapefun);
support_point =
mapping.transform_unit_to_real_cell(cell, unit_support_point);
- deallog << " " << support_point << ":\n "
+ deallog << ' ' << support_point << ":\n "
<< u_2[local_dof_indices[shapefun]] << endl
<< endl;
}
unit_support_point = cell->get_fe().unit_support_point(shapefun);
support_point =
mapping.transform_unit_to_real_cell(cell, unit_support_point);
- deallog << " " << support_point << ":\n "
+ deallog << ' ' << support_point << ":\n "
<< u_1[local_dof_indices_1[shapefun]] << endl
<< endl;
}
unit_support_point = cell->get_fe().unit_support_point(shapefun);
support_point =
mapping.transform_unit_to_real_cell(cell, unit_support_point);
- deallog << " " << support_point << ":\n "
+ deallog << ' ' << support_point << ":\n "
<< u_2[local_dof_indices_2[shapefun]] << endl
<< endl;
}
i != bv.end();
++i)
// also output log of value to also display small numbers
- deallog << i->first << ' ' << i->second << " "
+ deallog << i->first << ' ' << i->second << ' '
<< (std::abs(i->second) > 0 ? std::log(std::abs(i->second)) :
-10000)
<< std::endl;
else
deallog << cell->vertex(1);
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
}
tria.clear();
}
deallog << quad->vertex(2);
deallog << " to ";
deallog << quad->vertex(3);
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
// now make sure that p is
// indeed closer to
deallog << quad->vertex(2);
deallog << " to ";
deallog << quad->vertex(3);
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
// now make sure that p is
// indeed closer to
v = std::get<3>(ref);
deallog << "Origin: " << points[i] << ", on unit circle: " << pp
- << ", with local coordinates (u, v): (" << u << ", " << v << ")"
+ << ", with local coordinates (u, v): (" << u << ", " << v << ')'
<< std::endl;
}
return 0;
void
test()
{
- deallog << "Testing <2," << spacedim << ">" << std::endl;
+ deallog << "Testing <2," << spacedim << '>' << std::endl;
Triangulation<2, spacedim> tria1;
Triangulation<2, spacedim> tria2;
for (unsigned int i = 0; i < surrounding_points.size(); ++i)
{
- deallog << "Surrunding point " << i << " " << surrounding_points[i]
+ deallog << "Surrunding point " << i << ' ' << surrounding_points[i]
<< " weight " << weights[i] << std::endl;
}
deallog << "Mean point " << new_point_flat << std::endl;
- deallog << "Projected point "
- << " " << new_point << std::endl;
+ deallog << "Projected point " << ' ' << new_point << std::endl;
}
const auto line_min =
[&](number &f, VectorType &x, VectorType &g, const VectorType &p) {
deallog << "-------------------" << std::endl
- << "Line search " << iteration++ << ":" << std::endl;
+ << "Line search " << iteration++ << ':' << std::endl;
const number g_norm_sqr = g.norm_sqr();
const double g2 = g(x2);
const double res = *LineMinimization::cubic_fit(x1, f1, g1, x2, f2, g2);
const double res2 = *LineMinimization::cubic_fit(x2, f2, g2, x1, f1, g1);
- deallog << x1 << " " << x2 << std::endl
- << f1 << " " << f2 << std::endl
- << g1 << " " << g2 << std::endl
+ deallog << x1 << ' ' << x2 << std::endl
+ << f1 << ' ' << f2 << std::endl
+ << g1 << ' ' << g2 << std::endl
<< res << std::endl
<< res2 << std::endl;
}
const double g1 = g(x1);
const double res =
*LineMinimization::cubic_fit_three_points(x1, f1, g1, x2, f2, x3, f3);
- deallog << x1 << " " << f1 << " " << g1 << std::endl
- << x2 << " " << f2 << std::endl
- << x3 << " " << f3 << std::endl
+ deallog << x1 << ' ' << f1 << ' ' << g1 << std::endl
+ << x2 << ' ' << f2 << std::endl
+ << x3 << ' ' << f3 << std::endl
<< res << std::endl;
}
}
0.001);
const auto fgi = func(res.first);
- deallog << res.second << " " << res.first << " " << fgi.second
+ deallog << res.second << ' ' << res.first << ' ' << fgi.second
<< std::endl;
}
}
0.1);
const auto fgi = func(res.first);
- deallog << res.second << " " << res.first << " " << fgi.second
+ deallog << res.second << ' ' << res.first << ' ' << fgi.second
<< std::endl;
}
}
unsigned int ind = 4;
for (auto p : params)
{
- deallog << "Table " << ind++ << ":" << std::endl;
+ deallog << "Table " << ind++ << ':' << std::endl;
const double b1 = p.first;
const double b2 = p.second;
0.001);
const auto fgi = func(res.first);
- deallog << res.second << " " << res.first << " " << fgi.second
+ deallog << res.second << ' ' << res.first << ' ' << fgi.second
<< std::endl;
}
}
0.001);
const auto fgi = func(res.first);
- deallog << res.second << " " << res.first << " " << fgi.second
+ deallog << res.second << ' ' << res.first << ' ' << fgi.second
<< std::endl;
}
}
0.1);
const auto fgi = func(res.first);
- deallog << res.second << " " << res.first << " " << fgi.second
+ deallog << res.second << ' ' << res.first << ' ' << fgi.second
<< std::endl;
}
}
unsigned int ind = 4;
for (auto p : params)
{
- deallog << "Table " << ind++ << ":" << std::endl;
+ deallog << "Table " << ind++ << ':' << std::endl;
const double b1 = p.first;
const double b2 = p.second;
0.001);
const auto fgi = func(res.first);
- deallog << res.second << " " << res.first << " " << fgi.second
+ deallog << res.second << ' ' << res.first << ' ' << fgi.second
<< std::endl;
}
}
const double g1 = g(x1);
const double g2 = g(x2);
const double res = *LineMinimization::quadratic_fit(x1, f1, g1, x2, f2);
- deallog << x1 << " " << x2 << std::endl
- << f1 << " " << f2 << std::endl
- << g1 << " " << g2 << std::endl
+ deallog << x1 << ' ' << x2 << std::endl
+ << f1 << ' ' << f2 << std::endl
+ << g1 << ' ' << g2 << std::endl
<< res << std::endl;
}
}
foo.parse_input(ss);
deallog << "input: ";
foo.enter_subsection("bar");
- deallog << foo.get_double("val") << " ";
+ deallog << foo.get_double("val") << ' ';
foo.leave_subsection();
deallog << foo.get_double("val2") << std::endl;
}
<< std::endl;
for (auto i : a)
- deallog << i.first << ":" << i.second << std::endl;
+ deallog << i.first << ':' << i.second << std::endl;
return 0;
}
particle_handler.signals.particle_lost.connect(
[](const auto &particle, const auto &cell) {
- deallog << particle->get_id() << " " << cell->id() << std::endl;
+ deallog << particle->get_id() << ' ' << cell->id() << std::endl;
});
particle_handler.begin()->set_location(Point<dim>{2.0, 2.0});
auto p = random_point<spacedim>();
for (const auto part : tree | bgi::adaptors::queried(bgi::nearest(p, 3)))
deallog << "Particle " << part.get_id() << " is close to " << p
- << " (location = " << part.get_location() << ")" << std::endl;
+ << " (location = " << part.get_location() << ')' << std::endl;
}
int
auto p = random_point<spacedim>();
for (const auto &part : tree | bgi::adaptors::queried(bgi::nearest(p, 3)))
deallog << "Particle " << part.get_id() << " is close to " << p
- << " (location = " << part.get_location() << ")" << std::endl;
+ << " (location = " << part.get_location() << ')' << std::endl;
}
int
for (unsigned int i = 0; i < ncomponents; ++i)
{
deallog << interpolatedParticleQuantities[part * ncomponents + i]
- << " ";
+ << ' ';
}
deallog << std::endl;
deallog << "expected quantities: ";
for (unsigned int i = 0; i < dim; ++i)
{
- deallog << iter->get_location()[i] << " ";
+ deallog << iter->get_location()[i] << ' ';
}
deallog << " 1" << std::endl;
deallog << std::endl;
for (unsigned int i = 0; i < ncomponents; ++i)
{
deallog << interpolatedParticleQuantities[part * ncomponents + i]
- << " ";
+ << ' ';
}
deallog << std::endl;
deallog << "expected quantities: ";
for (unsigned int i = 0; i < dim; ++i)
{
- deallog << iter->get_location()[i] << " ";
+ deallog << iter->get_location()[i] << ' ';
}
deallog << " 1" << std::endl;
deallog << std::endl;
deallog << "Pool properties:";
for (unsigned int i = 0; i < pool.get_properties(handle).size(); ++i)
- deallog << " " << pool.get_properties(handle)[i];
+ deallog << ' ' << pool.get_properties(handle)[i];
deallog << std::endl;
for (const auto &particle : particle_handler)
{
deallog << "Particle " << particle.get_id() << ", at "
- << particle.get_location() << "/"
+ << particle.get_location() << '/'
<< particle.get_reference_location() << " with properties ";
for (const auto x : particle.get_properties())
deallog << x << ' ';
"analytical-particles");
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
- deallog << "Writing particle output file: " << file_name << "-" << it
+ deallog << "Writing particle output file: " << file_name << '-' << it
<< std::endl;
particle_output.write_vtu_with_pvtu_record(
const std::string file_name("background");
if (Utilities::MPI::this_mpi_process(mpi_communicator) == 0)
- deallog << "Writing background field file: " << file_name << "-" << it
+ deallog << "Writing background field file: " << file_name << '-' << it
<< std::endl;
data_out.write_vtu_with_pvtu_record(
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << copied(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << copied(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << copied(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << copied(myid * 2 + 1) << std::endl;
}
for (unsigned int bl = 0; bl < 2; ++bl)
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << copied(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << copied(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << copied(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << copied(myid * 2 + 1) << std::endl;
}
for (unsigned int bl = 0; bl < 2; ++bl)
for (unsigned int i = 0; i < m.m(); ++i)
{
for (unsigned int j = 0; j < m.n(); ++j)
- deallog << m(i, j) << " ";
+ deallog << m(i, j) << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (unsigned int i = 0; i < m.m(); ++i)
{
for (unsigned int j = 0; j < m.n(); ++j)
- deallog << m(i, j) << " ";
+ deallog << m(i, j) << ' ';
deallog << std::endl;
}
deallog << std::endl;
deallog << "before: " << m(0, 1) << std::endl;
for (unsigned int i = 0; i < s; ++i)
- deallog << m(i, i) << " ";
+ deallog << m(i, i) << ' ';
deallog << std::endl;
m.add(1.0, m2);
deallog << "after: " << m(0, 1) << std::endl;
for (unsigned int i = 0; i < s; ++i)
- deallog << m(i, i) << " ";
+ deallog << m(i, i) << ' ';
deallog << std::endl;
m.add(-1.0, m2);
deallog << "back to original: " << m(0, 1) << std::endl;
for (unsigned int i = 0; i < s; ++i)
- deallog << m(i, i) << " ";
+ deallog << m(i, i) << ' ';
deallog << std::endl;
deallog << "OK" << std::endl;
Mat mm = m;
Mat m2m = m2;
- // deallog << mm << " " << m2m << std::endl;
+ // deallog << mm << ' ' << m2m << std::endl;
// forbidden: m2 = m;
{
Mat mm = m;
Mat m2m = m2;
- // deallog << mm << " " << m2m << std::endl;
+ // deallog << mm << ' ' << m2m << std::endl;
}
}
}
for (unsigned int i = 0; i < m.m(); ++i)
{
for (unsigned int j = 0; j < m.n(); ++j)
- deallog << m(i, j) << " ";
+ deallog << m(i, j) << ' ';
deallog << std::endl;
}
};
deallog << "before: " << m(0, 1) << std::endl;
for (unsigned int k = 0; k < s; ++k)
- deallog << m(k, k) << " ";
+ deallog << m(k, k) << ' ';
deallog << std::endl;
m.add(m2, 1.0);
deallog << "after: " << m(0, 1) << std::endl;
for (unsigned int k = 0; k < s; ++k)
- deallog << m(k, k) << " ";
+ deallog << m(k, k) << ' ';
deallog << std::endl;
m.add(m2, -1.0);
deallog << "back to original: " << m(0, 1) << std::endl;
for (unsigned int k = 0; k < s; ++k)
- deallog << m(k, k) << " ";
+ deallog << m(k, k) << ' ';
deallog << std::endl;
deallog << "OK" << std::endl;
deallog << "before: " << std::endl;
for (unsigned int k = 0; k < s; ++k)
- deallog << "(" << v(k).real() << "," << v(k).imag() << "i) ";
+ deallog << '(' << v(k).real() << ',' << v(k).imag() << "i) ";
deallog << std::endl;
v.add(1.0, v2);
deallog << "after: " << std::endl;
for (unsigned int k = 0; k < s; ++k)
- deallog << "(" << v(k).real() << "," << v(k).imag() << "i) ";
+ deallog << '(' << v(k).real() << ',' << v(k).imag() << "i) ";
deallog << std::endl;
v.add(-1.0, v2);
deallog << "back to original: " << std::endl;
for (unsigned int k = 0; k < s; ++k)
- deallog << "(" << v(k).real() << "," << v(k).imag() << "i) ";
+ deallog << '(' << v(k).real() << ',' << v(k).imag() << "i) ";
deallog << std::endl;
deallog << "OK" << std::endl;
pcout << (p == 0 ? ' ' : '+')
<< (GridTools::count_cells_with_subdomain_association(
triangulation, p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
setup_system();
pcout << " Number of degrees of freedom: " << dof_handler.n_dofs()
<< " (by partition:";
pcout << (p == 0 ? ' ' : '+')
<< (DoFTools::count_dofs_with_subdomain_association(dof_handler,
p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
// Get point at which to output displacement
// (outer radius of displaced surface)
{
pcout << (p == 0 ? ' ' : '+')
<< (GridTools::count_cells_with_subdomain_association(
triangulation, p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
setup_system();
pcout << " Number of degrees of freedom: " << dof_handler.n_dofs()
<< " (by partition:";
pcout << (p == 0 ? ' ' : '+')
<< (DoFTools::count_dofs_with_subdomain_association(dof_handler,
p));
- pcout << ")" << std::endl;
+ pcout << ')' << std::endl;
// Get point at which to output displacement
// (outer radius of displaced surface)
{
{
pcout << std::endl
<< "Timestep " << time.get_timestep() << " @ " << time.current()
- << "s" << std::endl;
+ << 's' << std::endl;
BlockVector<double> newton_update(dofs_per_block);
error_residual.reset();
error_residual_0.reset();
unsigned int newton_iteration = 0;
for (; newton_iteration < parameters.max_iterations_NR; ++newton_iteration)
{
- pcout << " " << std::setw(2) << newton_iteration << " " << std::flush;
+ pcout << ' ' << std::setw(2) << newton_iteration << ' ' << std::flush;
tangent_matrix = 0.0;
system_rhs = 0.0;
assemble_system_rhs();
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
pcout << " SOLVER STEP "
<< " | LIN_IT LIN_RES RES_NORM "
<< " RES_U RES_P RES_J NU_NORM "
<< " NU_U NU_P NU_J " << std::endl;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
}
template <int dim>
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
const std::pair<double, double> error_dil = get_error_dilation();
pcout << "Relative errors:" << std::endl
{
pcout << std::endl
<< "Timestep " << time.get_timestep() << " @ " << time.current()
- << "s" << std::endl;
+ << 's' << std::endl;
BlockVector<double> newton_update(dofs_per_block);
error_residual.reset();
error_residual_0.reset();
unsigned int newton_iteration = 0;
for (; newton_iteration < parameters.max_iterations_NR; ++newton_iteration)
{
- pcout << " " << std::setw(2) << newton_iteration << " " << std::flush;
+ pcout << ' ' << std::setw(2) << newton_iteration << ' ' << std::flush;
tangent_matrix = 0.0;
system_rhs = 0.0;
assemble_system_rhs();
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
pcout << " SOLVER STEP "
<< " | LIN_IT LIN_RES RES_NORM "
<< " RES_U RES_P RES_J NU_NORM "
<< " NU_U NU_P NU_J " << std::endl;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
}
template <int dim>
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
const std::pair<double, double> error_dil = get_error_dilation();
pcout << "Relative errors:" << std::endl
{
pcout << std::endl
<< "Timestep " << time.get_timestep() << " @ " << time.current()
- << "s" << std::endl;
+ << 's' << std::endl;
BlockVector<double> newton_update(dofs_per_block);
error_residual.reset();
error_residual_0.reset();
unsigned int newton_iteration = 0;
for (; newton_iteration < parameters.max_iterations_NR; ++newton_iteration)
{
- pcout << " " << std::setw(2) << newton_iteration << " " << std::flush;
+ pcout << ' ' << std::setw(2) << newton_iteration << ' ' << std::flush;
tangent_matrix = 0.0;
system_rhs = 0.0;
assemble_system_rhs();
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
pcout << " SOLVER STEP "
<< " | LIN_IT LIN_RES RES_NORM "
<< " RES_U RES_P RES_J NU_NORM "
<< " NU_U NU_P NU_J " << std::endl;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
}
template <int dim>
{
static const unsigned int l_width = 155;
for (unsigned int i = 0; i < l_width; ++i)
- pcout << "_";
+ pcout << '_';
pcout << std::endl;
const std::pair<double, double> error_dil = get_error_dilation();
pcout << "Relative errors:" << std::endl
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
MPI_Comm_size(MPI_COMM_WORLD, &nproc);
- std::cout << " Hi from " << myrank << "/" << nproc << std::endl;
+ std::cout << " Hi from " << myrank << '/' << nproc << std::endl;
if (nproc != 2)
{
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, grid, block_size, LAPACKSupport::Property::symmetric);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_spd(full_in);
, mapping(mapping_degree)
, last_error(std::numeric_limits<double>::max())
{
- deallog << "Using mapping with degree " << mapping_degree << ":" << std::endl
+ deallog << "Using mapping with degree " << mapping_degree << ':' << std::endl
<< "============================" << std::endl;
}
eval, dof_handler, vec, VectorTools::EvaluationFlags::insert);
for (unsigned int i = 0; i < evaluation_points.size(); ++i)
- deallog << i << " " << result_avg[i] << " " << result_min[i] << " "
- << result_max[i] << " " << result_insert[i] << " "
+ deallog << i << ' ' << result_avg[i] << ' ' << result_min[i] << ' '
+ << result_max[i] << ' ' << result_insert[i] << ' '
<< eval.get_point_ptrs()[i + 1] - eval.get_point_ptrs()[i]
<< std::endl;
}
const auto expected_global_count =
Utilities::MPI::sum(local_points.size(), MPI_COMM_WORLD);
- deallog << global_count << " " << expected_global_count << std::endl;
+ deallog << global_count << ' ' << expected_global_count << std::endl;
}
eval, dof_handler, vec, VectorTools::EvaluationFlags::insert);
for (unsigned int i = 0; i < evaluation_points.size(); ++i)
- deallog << "1e-" << (i + 1) << " " << result_avg[i] << " " << result_min[i]
- << " " << result_max[i] << " " << result_insert[i] << " "
+ deallog << "1e-" << (i + 1) << ' ' << result_avg[i] << ' ' << result_min[i]
+ << ' ' << result_max[i] << ' ' << result_insert[i] << ' '
<< eval.get_point_ptrs()[i + 1] - eval.get_point_ptrs()[i]
<< std::endl;
}
{
const unsigned int n_points = std::get<1>(result)[i].size();
- std::cout << std::get<0>(result)[i]->level() << " "
+ std::cout << std::get<0>(result)[i]->level() << ' '
<< std::get<0>(result)[i]->index() << " x " << n_points
<< std::endl;
{
if (JxW[q].distance(Point<spacedim>(phi_normal.get_value(q))) >
1e-7)
- std::cout << JxW[q] << " " << phi_normal.get_value(q)
+ std::cout << JxW[q] << ' ' << phi_normal.get_value(q)
<< std::endl;
}
}
{
if (integration_points[i].distance(
Point<spacedim>(evaluation_point_results[i])) > 1e-7)
- std::cout << integration_points[i] << " " << evaluation_point_results[i]
+ std::cout << integration_points[i] << ' ' << evaluation_point_results[i]
<< std::endl;
}
}
Teuchos::RCP<const VectorType> xg = x_rol.getVector();
std::cout << "The solution to minimization problem is: ";
- std::cout << (*xg)[0] << " " << (*xg)[1] << std::endl;
+ std::cout << (*xg)[0] << ' ' << (*xg)[1] << std::endl;
}
int
mpi_communicator, size, size, block_size, block_size);
ScaLAPACKMatrix<NumberType> scalapack_matrix(size, grid, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
{
unsigned int index = 0;
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, grid, block_size, LAPACKSupport::Property::symmetric);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_spd(full_in);
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, grid, block_size, LAPACKSupport::Property::symmetric);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_spd(full_in);
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, grid, block_size, LAPACKSupport::Property::general);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
// add a skew-symmetric matrix to the s.p.d matrix
// the positive definiteness is inherited from the symmetric part
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, grid, block_size, LAPACKSupport::Property::lower_triangular);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_random_lt(full_in);
block_size,
LAPACKSupport::Property::symmetric);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_spd(full_A);
dealii::Utilities::MPI::sum(s_frobenius, mpi_communicator) /
n_mpi_processes;
- pcout << l1 << " " << s_l1 << " " << as_l1 << std::endl
- << linfty << " " << s_linfty << " " << as_linfty << std::endl
- << frobenius << " " << s_frobenius << " " << as_frobenius << std::endl;
+ pcout << l1 << ' ' << s_l1 << ' ' << as_l1 << std::endl
+ << linfty << ' ' << s_linfty << ' ' << as_linfty << std::endl
+ << frobenius << ' ' << s_frobenius << ' ' << as_frobenius << std::endl;
AssertThrow(std::abs(l1 - as_l1) < tol * std::abs(l1),
dealii::ExcInternalError());
ScaLAPACKMatrix<NumberType> scalapack(
size, size, grid, block_size, block_size, LAPACKSupport::Property::general);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_random(full);
scalapack = full;
dealii::Utilities::MPI::sum(s_frobenius, mpi_communicator) /
n_mpi_processes;
- pcout << l1 << " " << s_l1 << " " << as_l1 << std::endl
- << linfty << " " << s_linfty << " " << as_linfty << std::endl
- << frobenius << " " << s_frobenius << " " << as_frobenius << std::endl;
+ pcout << l1 << ' ' << s_l1 << ' ' << as_l1 << std::endl
+ << linfty << ' ' << s_linfty << ' ' << as_linfty << std::endl
+ << frobenius << ' ' << s_frobenius << ' ' << as_frobenius << std::endl;
AssertThrow(std::abs(l1 - as_l1) < tol * std::abs(l1),
dealii::ExcInternalError());
block_size,
LAPACKSupport::Property::symmetric);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
create_spd(full_A);
inv_A.invert(full_A);
scalapack_A.reciprocal_condition_number(scalapack_l1);
- pcout << 1. / (l1 * inv_l1) << " " << rcond << std::endl;
+ pcout << 1. / (l1 * inv_l1) << ' ' << rcond << std::endl;
}
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
ScaLAPACKMatrix<NumberType> scalapack_matrix_source(
size, size, grid_single, block_size_j, block_size_i);
- pcout << "2D grid matrix: dim=" << scalapack_matrix_2d.m() << "x"
- << scalapack_matrix_2d.n() << "; blocks=" << block_size_i << "x"
- << block_size_i << "; grid=" << grid_2d->get_process_grid_rows() << "x"
+ pcout << "2D grid matrix: dim=" << scalapack_matrix_2d.m() << 'x'
+ << scalapack_matrix_2d.n() << "; blocks=" << block_size_i << 'x'
+ << block_size_i << "; grid=" << grid_2d->get_process_grid_rows() << 'x'
<< grid_2d->get_process_grid_columns() << std::endl;
- pcout << "1D grid matrix: " << scalapack_matrix_1d.m() << "x"
- << scalapack_matrix_1d.n() << "; blocks=" << block_size_j << "x"
- << block_size_j << "; grid=" << grid_1d->get_process_grid_rows() << "x"
+ pcout << "1D grid matrix: " << scalapack_matrix_1d.m() << 'x'
+ << scalapack_matrix_1d.n() << "; blocks=" << block_size_j << 'x'
+ << block_size_j << "; grid=" << grid_1d->get_process_grid_rows() << 'x'
<< grid_1d->get_process_grid_columns() << std::endl;
- pcout << "single process matrix: " << scalapack_matrix_single.m() << "x"
- << scalapack_matrix_single.n() << "; blocks=" << block_size_i << "x"
+ pcout << "single process matrix: " << scalapack_matrix_single.m() << 'x'
+ << scalapack_matrix_single.n() << "; blocks=" << block_size_i << 'x'
<< block_size_j << "; grid=" << grid_single->get_process_grid_rows()
- << "x" << grid_single->get_process_grid_columns() << std::endl
+ << 'x' << grid_single->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_matrix_source = full;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << std::endl;
+ pcout << size << ' ' << block_size << std::endl;
// Create s.p.d matrices of requested size:
FullMatrix<NumberType> full_A(size);
scalapack_matrix_copy.copy_to(copy);
copy.add(-1, full);
- pcout << size << " " << block_size << std::endl;
+ pcout << size << ' ' << block_size << std::endl;
if (copy.frobenius_norm() > 1e-12)
pcout << "norm of difference: " << copy.frobenius_norm() << std::endl;
copy_I.add(-1, full);
copy_II.add(-1, full);
- pcout << size << " " << block_size << std::endl;
+ pcout << size << ' ' << block_size << std::endl;
if (copy_I.frobenius_norm() > 1e-12)
pcout << "norm of difference I: " << copy_I.frobenius_norm() << std::endl;
scalapack_matrix_copy.copy_to(copy);
copy.add(-1, full);
- pcout << size.first << "x" << size.second << " & " << block_size << " & "
- << chunk_size.first << "x" << chunk_size.second << " & "
- << grid->get_process_grid_rows() << "x"
+ pcout << size.first << 'x' << size.second << " & " << block_size << " & "
+ << chunk_size.first << 'x' << chunk_size.second << " & "
+ << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl;
AssertThrow(copy.frobenius_norm() < 1e-12, ExcInternalError());
std::remove(filename.c_str());
scalapack_matrix.copy_to(copy);
copy.add(-1, full);
- pcout << size << " " << block_size << std::endl;
+ pcout << size << ' ' << block_size << std::endl;
if (copy.frobenius_norm() > 1e-12)
pcout << "norm of difference: " << copy.frobenius_norm() << std::endl;
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, size, grid, block_size_i, block_size_i);
- pcout << "2D grid matrix: dim=" << scalapack_matrix.m() << "x"
- << scalapack_matrix.n() << "; blocks=" << block_size_i << "x"
- << block_size_i << "; grid=" << grid->get_process_grid_rows() << "x"
+ pcout << "2D grid matrix: dim=" << scalapack_matrix.m() << 'x'
+ << scalapack_matrix.n() << "; blocks=" << block_size_i << 'x'
+ << block_size_i << "; grid=" << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
std::make_shared<Utilities::MPI::ProcessGrid>(mpi_communicator,
proc_rows,
proc_columns);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_C.copy_to(tmp_full_C);
pcout << " computing C = b A * B + c C with"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << "),"
- << " B in R^(" << scalapack_B.m() << "x" << scalapack_B.n() << ") and"
- << " C in R^(" << scalapack_C.m() << "x" << scalapack_C.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << "),"
+ << " B in R^(" << scalapack_B.m() << 'x' << scalapack_B.n() << ") and"
+ << " C in R^(" << scalapack_C.m() << 'x' << scalapack_C.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_C.frobenius_norm() << " & "
<< full_C.frobenius_norm() << " for " << typeid(NumberType).name()
std::make_shared<Utilities::MPI::ProcessGrid>(mpi_communicator,
proc_rows,
proc_columns);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_C.copy_to(tmp_full_C);
pcout << " computing C = b A^T * B + c C with"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << "),"
- << " B in R^(" << scalapack_B.m() << "x" << scalapack_B.n() << ") and"
- << " C in R^(" << scalapack_C.m() << "x" << scalapack_C.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << "),"
+ << " B in R^(" << scalapack_B.m() << 'x' << scalapack_B.n() << ") and"
+ << " C in R^(" << scalapack_C.m() << 'x' << scalapack_C.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_C.frobenius_norm() << " & "
<< full_C.frobenius_norm() << " for " << typeid(NumberType).name()
std::make_shared<Utilities::MPI::ProcessGrid>(mpi_communicator,
proc_rows,
proc_columns);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_C.copy_to(tmp_full_C);
pcout << " computing C = b A * B^T + c C with"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << "),"
- << " B in R^(" << scalapack_B.m() << "x" << scalapack_B.n() << ") and"
- << " C in R^(" << scalapack_C.m() << "x" << scalapack_C.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << "),"
+ << " B in R^(" << scalapack_B.m() << 'x' << scalapack_B.n() << ") and"
+ << " C in R^(" << scalapack_C.m() << 'x' << scalapack_C.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_C.frobenius_norm() << " & "
<< full_C.frobenius_norm() << " for " << typeid(NumberType).name()
std::make_shared<Utilities::MPI::ProcessGrid>(mpi_communicator,
proc_rows,
proc_columns);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_C.copy_to(tmp_full_C);
pcout << " computing C = b A^T * B^T + c C with"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << "),"
- << " B in R^(" << scalapack_B.m() << "x" << scalapack_B.n() << ") and"
- << " C in R^(" << scalapack_C.m() << "x" << scalapack_C.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << "),"
+ << " B in R^(" << scalapack_B.m() << 'x' << scalapack_B.n() << ") and"
+ << " C in R^(" << scalapack_C.m() << 'x' << scalapack_C.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_C.frobenius_norm() << " & "
<< full_C.frobenius_norm() << " for " << typeid(NumberType).name()
std::make_shared<Utilities::MPI::ProcessGrid>(mpi_communicator,
proc_rows,
proc_columns);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_A.copy_to(tmp_full_A);
pcout << " computing A = alpha A + beta B with"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << ") and"
- << " B in R^(" << scalapack_B.m() << "x" << scalapack_B.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << ") and"
+ << " B in R^(" << scalapack_B.m() << 'x' << scalapack_B.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_A.frobenius_norm() << " & "
<< full_A.frobenius_norm() << " for " << typeid(NumberType).name()
std::make_shared<Utilities::MPI::ProcessGrid>(mpi_communicator,
proc_rows,
proc_columns);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
scalapack_A.copy_to(tmp_full_A);
pcout << " computing A = alpha A + beta B^T with"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << ") and"
- << " B in R^(" << scalapack_B.m() << "x" << scalapack_B.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << ") and"
+ << " B in R^(" << scalapack_B.m() << 'x' << scalapack_B.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_A.frobenius_norm() << " & "
<< full_A.frobenius_norm() << " for " << typeid(NumberType).name()
std::shared_ptr<Utilities::MPI::ProcessGrid> grid =
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, sizes[0], sizes[1], block_size_i, block_size_i);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
full_A(i, j) *= scaling_factors[i];
pcout << " Row scaling for"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_A.frobenius_norm() << " & "
<< full_A.frobenius_norm() << " for " << typeid(NumberType).name()
std::shared_ptr<Utilities::MPI::ProcessGrid> grid =
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, sizes[0], sizes[1], block_size_i, block_size_i);
- pcout << "2D process grid: " << grid->get_process_grid_rows() << "x"
+ pcout << "2D process grid: " << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
full_A(i, j) *= scaling_factors[j];
pcout << " Column scaling for"
- << " A in R^(" << scalapack_A.m() << "x" << scalapack_A.n() << ")"
+ << " A in R^(" << scalapack_A.m() << 'x' << scalapack_A.n() << ')'
<< std::endl;
pcout << " norms: " << tmp_full_A.frobenius_norm() << " & "
<< full_A.frobenius_norm() << " for " << typeid(NumberType).name()
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
const unsigned int n_eigenvalues = size;
const unsigned int max_n_eigenvalues = 5;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size, size, block_size, block_size);
- pcout << size << " " << block_size << " " << grid->get_process_grid_rows()
- << " " << grid->get_process_grid_columns() << std::endl;
+ pcout << size << ' ' << block_size << ' ' << grid->get_process_grid_rows()
+ << ' ' << grid->get_process_grid_columns() << std::endl;
// Create SPD matrices of requested size:
FullMatrix<NumberType> full_A(size), singular_A(size);
if (this_mpi_process == 0)
{
- std::cout << "ranks: " << rank_1 << "/" << size << " & ";
- std::cout << rank_2 << "/" << size << std::endl;
+ std::cout << "ranks: " << rank_1 << '/' << size << " & ";
+ std::cout << rank_2 << '/' << size << std::endl;
double norm = full_pseudo_inverse.frobenius_norm();
full_inverse.add(-1, full_pseudo_inverse);
norm = full_inverse.frobenius_norm() / norm;
std::make_shared<Utilities::MPI::ProcessGrid>(
mpi_communicator, size_1, size_2, block_size, block_size);
- pcout << size_1 << "x" << size_2 << " " << block_size << " "
- << grid->get_process_grid_rows() << " "
+ pcout << size_1 << 'x' << size_2 << ' ' << block_size << ' '
+ << grid->get_process_grid_rows() << ' '
<< grid->get_process_grid_columns() << std::endl;
// Create randomly filled matrix of requested dimension size_1xsize_2:
if (this_mpi_process == 0)
{
- std::cout << "rank=" << rank << "/" << std::min(size_1, size_2)
+ std::cout << "rank=" << rank << '/' << std::min(size_1, size_2)
<< std::endl;
AssertThrow(norm < tol, ExcInternalError());
}
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, size, grid, block_size_i, block_size_i);
- pcout << "2D grid matrix: dim=" << scalapack_matrix.m() << "x"
- << scalapack_matrix.n() << "; blocks=" << block_size_i << "x"
- << block_size_i << "; grid=" << grid->get_process_grid_rows() << "x"
+ pcout << "2D grid matrix: dim=" << scalapack_matrix.m() << 'x'
+ << scalapack_matrix.n() << "; blocks=" << block_size_i << 'x'
+ << block_size_i << "; grid=" << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
ScaLAPACKMatrix<NumberType> scalapack_matrix(
size, size, grid, block_size_i, block_size_i);
- pcout << "2D grid matrix: dim=" << scalapack_matrix.m() << "x"
- << scalapack_matrix.n() << "; blocks=" << block_size_i << "x"
- << block_size_i << "; grid=" << grid->get_process_grid_rows() << "x"
+ pcout << "2D grid matrix: dim=" << scalapack_matrix.m() << 'x'
+ << scalapack_matrix.n() << "; blocks=" << block_size_i << 'x'
+ << block_size_i << "; grid=" << grid->get_process_grid_rows() << 'x'
<< grid->get_process_grid_columns() << std::endl
<< std::endl;
deallog << "Before serialization particle id " << particle.get_id()
<< " has location " << particle.get_location()
<< ", has reference location " << particle.get_reference_location()
- << ", and has properties " << particle.get_properties()[0] << " "
+ << ", and has properties " << particle.get_properties()[0] << ' '
<< particle.get_properties()[1] << std::endl;
boost::archive::text_oarchive oa(oss, boost::archive::no_header);
deallog << "After serialization particle id " << particle.get_id()
<< " has location " << particle.get_location()
<< ", has reference location " << particle.get_reference_location()
- << ", and has properties " << particle.get_properties()[0] << " "
+ << ", and has properties " << particle.get_properties()[0] << ' '
<< particle.get_properties()[1] << std::endl;
}
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
cell->get_dof_indices(local_dof_indices);
deallog << "cell" << cell->index() << " has dofs: ";
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << local_dof_indices[i] << " ";
+ deallog << local_dof_indices[i] << ' ';
deallog << std::endl;
}
}
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
// unsigned int sum = 0;
// for (unsigned int i=0; i<v.size(); ++i)
// {
- // deallog << v[i] << " ";
+ // deallog << v[i] << ' ';
// sum += v[i];
// }
// deallog << " sum: " << sum << std::endl;
unsigned int sum = 0;
for (unsigned int i = 0; i < v.size(); ++i)
{
- deallog << v[i] << " ";
+ deallog << v[i] << ' ';
sum += v[i];
}
deallog << " sum: " << sum << std::endl;
deallog << "future FE indices before adaptation:" << std::endl;
for (const auto &cell :
dofh.active_cell_iterators() | IteratorFilters::LocallyOwnedCell())
- deallog << " " << cell->id().to_string() << " " << cell->future_fe_index()
+ deallog << ' ' << cell->id().to_string() << ' ' << cell->future_fe_index()
<< std::endl;
tria.execute_coarsening_and_refinement();
deallog << "active FE indices after adaptation:" << std::endl;
for (const auto &cell :
dofh.active_cell_iterators() | IteratorFilters::LocallyOwnedCell())
- deallog << " " << cell->id().to_string() << " " << cell->active_fe_index()
+ deallog << ' ' << cell->id().to_string() << ' ' << cell->active_fe_index()
<< std::endl;
deallog << "OK" << std::endl;
<< ", "
<< "cell " << cell->id() << ", mg_dof_indices: ";
for (unsigned int i = 0; i < fe.dofs_per_cell; ++i)
- deallog << local_mg_dof_indices[i] << " ";
+ deallog << local_mg_dof_indices[i] << ' ';
deallog << std::endl;
}
}
tria.level_ghost_owners().begin();
it != tria.level_ghost_owners().end();
++it)
- deallog << *it << " ";
+ deallog << *it << ' ';
deallog << std::endl;
write_dof_data(dof_handler);
unsigned int sum = 0;
for (unsigned int i = 0; i < v.size(); ++i)
{
- deallog << v[i] << " ";
+ deallog << v[i] << ' ';
sum += v[i];
}
deallog << " sum: " << sum << std::endl;
/*deallog << "n_locally_owned_active_cells_per_processor: ";
std::vector<unsigned int> v = tr.n_locally_owned_active_cells_per_processor();
for (unsigned int i=0;i<v.size();++i)
- deallog << v[i] << " ";
+ deallog << v[i] << ' ';
deallog << std::endl;*/
// until parmetis is stable, do not output partitioning
// cell->subdomain_id()
AssertThrow(true_subdomain_ids_of_cells[index] == it->subdomain_id(),
ExcInternalError());
- // deallog << it->subdomain_id() << " ";
+ // deallog << it->subdomain_id() << ' ';
}
deallog << std::endl;
/*deallog << "n_locally_owned_active_cells_per_processor: ";
std::vector<unsigned int> v = tr.n_locally_owned_active_cells_per_processor();
for (unsigned int i=0;i<v.size();++i)
- deallog << v[i] << " ";
+ deallog << v[i] << ' ';
deallog << std::endl;*/
// until parmetis is stable, do not output partitioning
AssertThrow((it->is_artificial() == true) ||
(true_subdomain_ids_of_cells[index] == it->subdomain_id()),
ExcInternalError());
- // deallog << (int) it->subdomain_id() << " ";
+ // deallog << (int) it->subdomain_id() << ' ';
}
deallog << std::endl;
endc = shared_tria.end();
for (; cell != endc; ++cell)
if (cell->subdomain_id() != numbers::artificial_subdomain_id)
- deallog << "(" << cell->id().to_string() << "," << cell->subdomain_id()
- << ")" << std::endl;
+ deallog << '(' << cell->id().to_string() << ',' << cell->subdomain_id()
+ << ')' << std::endl;
}
int
endc = shared_tria.end();
for (; cell != endc; ++cell)
if (cell->subdomain_id() != numbers::artificial_subdomain_id)
- deallog << "(" << cell->id().to_string() << "," << cell->subdomain_id()
- << ")" << std::endl;
+ deallog << '(' << cell->id().to_string() << ',' << cell->subdomain_id()
+ << ')' << std::endl;
}
int
endc = shared_tria.end();
for (; cell != endc; ++cell)
if (cell->subdomain_id() != numbers::artificial_subdomain_id)
- deallog << "(" << cell->id().to_string() << "," << cell->subdomain_id()
- << ")" << std::endl;
+ deallog << '(' << cell->id().to_string() << ',' << cell->subdomain_id()
+ << ')' << std::endl;
}
{
endc = shared_tria.end();
for (; cell != endc; ++cell)
if (cell->level_subdomain_id() != numbers::artificial_subdomain_id)
- deallog << "(" << cell->id().to_string() << ","
- << cell->level_subdomain_id() << ")" << std::endl;
+ deallog << '(' << cell->id().to_string() << ','
+ << cell->level_subdomain_id() << ')' << std::endl;
}
}
endc = shared_tria.end(lvl);
for (; cell != endc; ++cell)
if (cell->level_subdomain_id() != numbers::artificial_subdomain_id)
- deallog << "(" << cell->id().to_string() << ","
- << cell->level_subdomain_id() << ")" << std::endl;
+ deallog << '(' << cell->id().to_string() << ','
+ << cell->level_subdomain_id() << ')' << std::endl;
}
}
endc = shared_tria.end();
for (; cell != endc; ++cell)
if (cell->is_locally_owned())
- deallog << "(" << cell->id().to_string() << "," << cell->subdomain_id()
- << ")" << std::endl;
+ deallog << '(' << cell->id().to_string() << ',' << cell->subdomain_id()
+ << ')' << std::endl;
}
int
Triangulation<dim, spacedim> tria;
tria.create_triangulation(vertices, cells, SubCellData());
- deallog << "dim=" << dim << " spacedim=" << spacedim << ":" << std::endl;
+ deallog << "dim=" << dim << " spacedim=" << spacedim << ':' << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
deallog << "measure: " << cell->measure() << std::endl;
deallog << "Print out results in " << dim << "D: " << std::endl;
for (unsigned int i = 0; i < cells.size(); ++i)
{
- deallog << "At cell " << i << ":" << std::endl;
+ deallog << "At cell " << i << ':' << std::endl;
for (unsigned int j = 0; j < qpoints[i].size(); ++j)
{
deallog << " qpoints " << j << ": " << std::endl;
- deallog << " reference position : (" << qpoints[i][j] << ")"
+ deallog << " reference position : (" << qpoints[i][j] << ')'
<< std::endl;
deallog << " physical position : (" << points[indices[i][j]]
- << ")" << std::endl;
+ << ')' << std::endl;
deallog << " FE mapping position : ("
<< mapping.transform_unit_to_real_cell(cells[i],
qpoints[i][j])
- << ")" << std::endl;
+ << ')' << std::endl;
}
}
deallog << std::endl;
deallog << " n_dofs_per_quad(): ";
for (unsigned int i = 0; i < (dim == 2 ? 1 : fe.reference_cell().n_faces());
++i)
- deallog << fe.n_dofs_per_quad(i) << " ";
+ deallog << fe.n_dofs_per_quad(i) << ' ';
deallog << std::endl;
deallog << " n_dofs_per_hex(): " << fe.n_dofs_per_hex() << std::endl;
deallog << " n_dofs_per_face(): ";
for (unsigned int i = 0; i < fe.reference_cell().n_faces(); ++i)
- deallog << fe.n_dofs_per_face(i) << " ";
+ deallog << fe.n_dofs_per_face(i) << ' ';
deallog << std::endl;
deallog << " n_dofs_per_cell(): " << fe.n_dofs_per_cell() << std::endl;
{
deallog << point << " : " << std::endl;
for (unsigned int i = 0; i < fe.n_dofs_per_cell(); ++i)
- deallog << fe.shape_value(i, point) << " ";
+ deallog << fe.shape_value(i, point) << ' ';
for (unsigned int i = 0; i < fe.n_dofs_per_cell(); ++i)
- deallog << fe.shape_grad(i, point) << " ";
+ deallog << fe.shape_grad(i, point) << ' ';
for (unsigned int i = 0; i < fe.n_dofs_per_cell(); ++i)
- deallog << fe.shape_grad_grad(i, point) << " ";
+ deallog << fe.shape_grad_grad(i, point) << ' ';
deallog << std::endl;
}
deallog << std::endl;
{
deallog << point << " : " << std::endl;
for (unsigned int i = 0; i < fe.n_dofs_per_cell(); ++i)
- deallog << fe.shape_value(i, point) << " ";
+ deallog << fe.shape_value(i, point) << ' ';
for (unsigned int i = 0; i < fe.n_dofs_per_cell(); ++i)
- deallog << fe.shape_grad(i, point) << " ";
+ deallog << fe.shape_grad(i, point) << ' ';
for (unsigned int i = 0; i < fe.n_dofs_per_cell(); ++i)
- deallog << fe.shape_grad_grad(i, point) << " ";
+ deallog << fe.shape_grad_grad(i, point) << ' ';
deallog << std::endl;
}
deallog << std::endl;
Assert(std::abs(result_mf.second - result_mb.second) < 1e-8,
ExcNotImplemented());
- deallog << "dim=" << dim << " ";
- deallog << "degree=" << degree << " ";
+ deallog << "dim=" << dim << ' ';
+ deallog << "degree=" << degree << ' ';
deallog << "Type=";
if (do_helmholtz)
deallog << "mesh=";
if (version == 0)
- deallog << "P";
+ deallog << 'P';
else if (version == 1)
- deallog << "Q";
+ deallog << 'Q';
else if (version == 2)
- deallog << "M";
+ deallog << 'M';
deallog << " : ";
- deallog << "dim=" << dim << " ";
- deallog << "degree=" << degree << " ";
+ deallog << "dim=" << dim << ' ';
+ deallog << "degree=" << degree << ' ';
deallog << "Type=";
if (do_helmholtz)
Vector<double> difference(tria.n_active_cells());
- deallog << "dim=" << dim << " ";
- deallog << "degree=" << degree << " ";
+ deallog << "dim=" << dim << ' ';
+ deallog << "degree=" << degree << ' ';
VectorTools::integrate_difference(mapping,
dof_handler,
Vector<double> difference(tria.n_active_cells());
- deallog << "dim=" << dim << " ";
- deallog << "degree=" << degree << " ";
+ deallog << "dim=" << dim << ' ';
+ deallog << "degree=" << degree << ' ';
VectorTools::integrate_difference(mappings,
dof_handler,
std::sort(i.begin(), i.end());
for (const auto &j : i)
- deallog << j << " ";
+ deallog << j << ' ';
deallog << std::endl;
}
{
std::sort(i.begin(), i.end());
for (const auto &j : i)
- deallog << j.first << "@" << j.second << " ";
+ deallog << j.first << '@' << j.second << " ";
deallog << std::endl;
}
{
std::sort(i.begin(), i.end());
for (const auto &j : i)
- deallog << j.first << "@" << j.second << " ";
+ deallog << j.first << '@' << j.second << " ";
deallog << std::endl;
}
}
cell++;
// check orientation
- deallog << "face orientation: " << orientation << " " << std::endl;
+ deallog << "face orientation: " << orientation << ' ' << std::endl;
AssertDimension(orientation,
(cell->face_orientation(0) * 1 + cell->face_rotation(0) * 2 +
cell->face_flip(0) * 4));
// check vertices
{
for (unsigned int v = 0; v < cell->n_vertices(); ++v)
- deallog << cell->vertex_index(v) << " ";
+ deallog << cell->vertex_index(v) << ' ';
deallog << " vs. ";
for (unsigned int v = 0; v < cell->n_vertices(); ++v)
- deallog << cells[1].vertices[v] << " ";
+ deallog << cells[1].vertices[v] << ' ';
deallog << std::endl;
for (const auto v : cell->vertex_indices())
cells[1].vertices[(l + 1) % face->n_vertices()]}};
std::sort(b.begin(), b.end());
- deallog << a[0] << "-" << a[1] << " vs. " << b[0] << "-" << b[1]
+ deallog << a[0] << '-' << a[1] << " vs. " << b[0] << '-' << b[1]
<< std::endl;
AssertDimension(a[0], b[0]);
std::string fname = dimension + Utilities::int_to_string(it) + ".vtk";
- deallog << " Writing solution to <" << fname << ">" << std::endl;
+ deallog << " Writing solution to <" << fname << '>' << std::endl;
std::ofstream output(fname.c_str());
fourth_derivatives);
for (auto v : values)
- deallog << v << " ";
+ deallog << v << ' ';
deallog << std::endl;
for (auto v : grads)
- deallog << v << " ";
+ deallog << v << ' ';
deallog << std::endl;
}
}
deallog << "quad size = " << quad.size() << std::endl;
for (unsigned int q = 0; q < quad.size(); ++q)
{
- deallog << quad.point(q) << " ";
- deallog << quad.weight(q) << " ";
+ deallog << quad.point(q) << ' ';
+ deallog << quad.weight(q) << ' ';
deallog << std::endl;
}
}
const bool face_orientation) {
deallog << "face_no=" << face_no
<< " face_orientation=" << (face_orientation ? "true" : "false")
- << ":" << std::endl;
+ << ':' << std::endl;
for (unsigned int
q = 0,
i =
q < quad_ref.size();
++q, ++i)
{
- deallog << quad.point(i) << " ";
- deallog << quad.weight(i) << " ";
+ deallog << quad.point(i) << ' ';
+ deallog << quad.weight(i) << ' ';
deallog << std::endl;
}
deallog << std::endl;
deallog << "face_no=" << face_no
<< " face_orientation=" << (face_orientation ? "true" : "false")
<< " face_flip=" << (face_flip ? "true" : "false")
- << " face_rotation=" << (face_rotation ? "true" : "false") << ":"
+ << " face_rotation=" << (face_rotation ? "true" : "false") << ':'
<< std::endl;
for (unsigned int q = 0,
i = QProjector<dim>::DataSetDescriptor::face(
q < quad_ref.size();
++q, ++i)
{
- deallog << quad.point(i) << " ";
- deallog << quad.weight(i) << " ";
+ deallog << quad.point(i) << ' ';
+ deallog << quad.weight(i) << ' ';
deallog << std::endl;
}
deallog << std::endl;
deallog << "quad size = " << quad.size() << std::endl;
for (unsigned int q = 0; q < quad.size(); ++q)
{
- deallog << quad.point(q) << " ";
- deallog << quad.weight(q) << " ";
+ deallog << quad.point(q) << ' ';
+ deallog << quad.weight(q) << ' ';
deallog << std::endl;
}
}
deallog << "quad size = " << quad.size() << std::endl;
for (unsigned int q = 0; q < quad.size(); ++q)
{
- deallog << quad.point(q) << " ";
- deallog << quad.weight(q) << " ";
+ deallog << quad.point(q) << ' ';
+ deallog << quad.weight(q) << ' ';
deallog << std::endl;
}
}
for (unsigned int q = 0; q < quad.size(); ++q)
{
- deallog << quad.point(q) << " ";
- deallog << quad.weight(q) << " ";
+ deallog << quad.point(q) << ' ';
+ deallog << quad.weight(q) << ' ';
deallog << std::endl;
}
}
{
deallog << v << ": ";
for (const auto i : kind.faces_for_given_vertex(v))
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
deallog << std::endl;
for (const auto &cell : tria.active_cell_iterators())
{
- deallog << cell->level() << ":" << cell->index() << " ";
+ deallog << cell->level() << ':' << cell->index() << " ";
for (const auto f : cell->face_indices())
if (cell->at_boundary(f))
deallog << "-:- ";
else
- deallog << cell->neighbor_level(f) << ":" << cell->neighbor_index(f)
- << " ";
+ deallog << cell->neighbor_level(f) << ':' << cell->neighbor_index(f)
+ << ' ';
deallog << std::endl;
}
AdvectionProblem<dim>::output_results(const unsigned int cycle) const
{
const std::string filename = "solution-" + std::to_string(cycle) + ".vtk";
- std::cout << " Writing solution to <" << filename << ">" << std::endl;
+ std::cout << " Writing solution to <" << filename << '>' << std::endl;
std::ofstream output(filename);
DataOut<dim> data_out;
dim == 2 ? ("step12-tri-" + std::to_string(cycle) + ".vtk") :
("step12-tet-" + std::to_string(cycle) + ".vtk");
# endif
- deallog << " Writing solution to <" << filename << ">" << std::endl;
+ deallog << " Writing solution to <" << filename << '>' << std::endl;
std::ofstream output(filename);
DataOut<dim> data_out;
deallog << (p == 0 ? ' ' : '+')
<< (DoFTools::count_dofs_with_subdomain_association(dof_handler,
p));
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
assemble_system();
solve();
deallog.depth_file(previous_depth);
deallog << "norm: " << distributed_incremental_displacement.linfty_norm()
- << " " << distributed_incremental_displacement.l1_norm() << " "
+ << ' ' << distributed_incremental_displacement.l1_norm() << ' '
<< distributed_incremental_displacement.l2_norm() << std::endl;
incremental_displacement = distributed_incremental_displacement;
deallog << (p == 0 ? ' ' : '+')
<< (GridTools::count_cells_with_subdomain_association(
triangulation, p));
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
setup_system();
deallog << (p == 0 ? ' ' : '+')
<< (DoFTools::count_dofs_with_subdomain_association(
dof_handler, p));
- deallog << ")" << std::endl;
+ deallog << ')' << std::endl;
solve_timestep();
}
pcout << "Running with "
<< Utilities::MPI::n_mpi_processes(MPI_COMM_WORLD)
<< " MPI processes" << std::endl;
- pcout << "Vectorization over " << n_vect_number << " "
+ pcout << "Vectorization over " << n_vect_number << ' '
<< (std::is_same<Number, double>::value ? "doubles" : "floats")
<< " = " << n_vect_bits << " bits ("
- << Utilities::System::get_current_vectorization_level() << ")"
+ << Utilities::System::get_current_vectorization_level() << ')'
<< std::endl;
*/
}
quad_ref);
const auto print = [&](const unsigned int face_no) {
- deallog << "face_no=" << face_no << ":" << std::endl;
+ deallog << "face_no=" << face_no << ':' << std::endl;
for (unsigned int q = 0,
i = QProjector<dim>::DataSetDescriptor::face(
ReferenceCells::Quadrilateral,
q < quad_ref[face_no].size();
++q, ++i)
{
- deallog << quad.point(i) << " ";
- deallog << quad.weight(i) << " ";
+ deallog << quad.point(i) << ' ';
+ deallog << quad.weight(i) << ' ';
deallog << std::endl;
}
deallog << std::endl;
{
mapping.fill_fe_face_values(cell, face_no, quad_ref, *data_ref, data);
- deallog << "face_no=" << face_no << ":" << std::endl;
+ deallog << "face_no=" << face_no << ':' << std::endl;
for (unsigned int q = 0; q < quad_ref[face_no].size(); ++q)
{
- deallog << data.quadrature_points[q] << " ";
- deallog << data.JxW_values[q] << " ";
+ deallog << data.quadrature_points[q] << ' ';
+ deallog << data.JxW_values[q] << ' ';
deallog << std::endl;
}
deallog << std::endl;
fe_face_values.get_function_values(vector_1, values_1);
for (unsigned int q = 0; q < values_0.size(); ++q)
- deallog << values_0[q] << " " << values_1[q] << " " << std::endl;
+ deallog << values_0[q] << ' ' << values_1[q] << ' ' << std::endl;
deallog << std::endl;
}
Vector<double>(dim));
fe_face_values.get_function_values(vector_0, values_0);
- deallog << "face_no=" << face_no << ":" << std::endl;
+ deallog << "face_no=" << face_no << ':' << std::endl;
for (unsigned int q = 0; q < values_0.size(); ++q)
- deallog << values_0[q][0] << " " << values_0[q][1] << " "
+ deallog << values_0[q][0] << ' ' << values_0[q][1] << ' '
<< std::endl;
deallog << std::endl;
Vector<double>(dim));
fe_face_values.get_function_values(vector_0, values_0);
- deallog << "face_no=" << face_no << ":" << std::endl;
+ deallog << "face_no=" << face_no << ':' << std::endl;
for (unsigned int q = 0; q < values_0.size(); ++q)
- deallog << values_0[q][0] << " " << values_0[q][1] << " "
- << values_0[q][2] << " " << std::endl;
+ deallog << values_0[q][0] << ' ' << values_0[q][1] << ' '
+ << values_0[q][2] << ' ' << std::endl;
deallog << std::endl;
}
fe_face_values.get_present_fe_values().get_function_values(
vector_0, values_0);
- deallog << "q_index=" << q_index << " face_no=" << face_no << ":"
+ deallog << "q_index=" << q_index << " face_no=" << face_no << ':'
<< std::endl;
for (unsigned int q = 0; q < values_0.size(); ++q)
- deallog << values_0[q][0] << " " << values_0[q][1] << " "
+ deallog << values_0[q][0] << ' ' << values_0[q][1] << ' '
<< std::endl;
deallog << std::endl;
Vector<double>(dim));
fe_face_values.get_function_values(vector_0, values_0);
- deallog << "face_no=" << face_no << ":" << std::endl;
+ deallog << "face_no=" << face_no << ':' << std::endl;
for (unsigned int q = 0; q < values_0.size(); ++q)
- deallog << values_0[q][0] << " " << values_0[q][1] << " "
+ deallog << values_0[q][0] << ' ' << values_0[q][1] << ' '
<< std::endl;
deallog << std::endl;
Vector<double>(dim));
fe_face_values.get_function_values(vector_0, values_0);
- deallog << "face_no=" << face_no << ":" << std::endl;
+ deallog << "face_no=" << face_no << ':' << std::endl;
for (unsigned int q = 0; q < values_0.size(); ++q)
- deallog << values_0[q][0] << " " << values_0[q][1] << " "
- << " " << values_0[q][2] << " " << std::endl;
+ deallog << values_0[q][0] << ' ' << values_0[q][1] << ' ' << ' '
+ << values_0[q][2] << ' ' << std::endl;
deallog << std::endl;
}
cell->face(face)->get_dof_indices(dof_indices);
for (const auto i : dof_indices)
- deallog << i << " ";
+ deallog << i << ' ';
deallog << std::endl;
}
}
deallog << "Eigenvalues:";
for (unsigned int i = 0; i < v.size(); ++i)
{
- deallog << " " << v[i];
+ deallog << ' ' << v[i];
if (i != (v.size() - 1))
- deallog << ",";
+ deallog << ',';
}
deallog << std::endl << std::endl;
}
deallog << "Eigenvalues:";
for (unsigned int i = 0; i < v.size(); ++i)
{
- deallog << " " << v[i];
+ deallog << ' ' << v[i];
if (i != (v.size() - 1))
- deallog << ",";
+ deallog << ',';
}
deallog << std::endl << std::endl;
}
csp.add(1, 2);
csp.compress();
- deallog << "blocks: " << csp.n_block_rows() << "x" << csp.n_block_cols()
+ deallog << "blocks: " << csp.n_block_rows() << 'x' << csp.n_block_cols()
<< std::endl;
- deallog << "size: " << csp.n_rows() << "x" << csp.n_cols() << std::endl;
- deallog << "size block(1,0):" << csp.block(1, 0).n_rows() << "x"
+ deallog << "size: " << csp.n_rows() << 'x' << csp.n_cols() << std::endl;
+ deallog << "size block(1,0):" << csp.block(1, 0).n_rows() << 'x'
<< csp.block(1, 0).n_cols() << std::endl;
csp.print(deallog.get_file_stream());
deallog << "row " << i << ": ";
for (unsigned int j = 0; j < csp.row_length(i); ++j)
- deallog << csp.column_number(i, j) << " ";
+ deallog << csp.column_number(i, j) << ' ';
deallog << std::endl;
}
part.push_back(a);
BlockDynamicSparsityPattern csp(part);
- deallog << "blocks: " << csp.n_block_rows() << "x" << csp.n_block_cols()
+ deallog << "blocks: " << csp.n_block_rows() << 'x' << csp.n_block_cols()
<< std::endl;
- deallog << "size: " << csp.n_rows() << "x" << csp.n_cols() << std::endl;
- deallog << "size block(1,0):" << csp.block(1, 0).n_rows() << "x"
+ deallog << "size: " << csp.n_rows() << 'x' << csp.n_cols() << std::endl;
+ deallog << "size block(1,0):" << csp.block(1, 0).n_rows() << 'x'
<< csp.block(1, 0).n_cols() << std::endl;
part.pop_back();
csp.reinit(part); // also check the reinit variant.
- deallog << "blocks: " << csp.n_block_rows() << "x" << csp.n_block_cols()
+ deallog << "blocks: " << csp.n_block_rows() << 'x' << csp.n_block_cols()
<< std::endl;
- deallog << "size: " << csp.n_rows() << "x" << csp.n_cols() << std::endl;
- deallog << "size block(1,0):" << csp.block(1, 0).n_rows() << "x"
+ deallog << "size: " << csp.n_rows() << 'x' << csp.n_cols() << std::endl;
+ deallog << "size block(1,0):" << csp.block(1, 0).n_rows() << 'x'
<< csp.block(1, 0).n_cols() << std::endl;
for (int i = 0; i < 13; ++i)
for (types::global_dof_index c = 0; c < rlen; ++c)
{
types::global_dof_index column = csp.column_number(row, c);
- deallog << row << "," << column << std::endl;
+ deallog << row << ',' << column << std::endl;
}
}
deallog << "Row " << row << " has the column indices: ";
for (auto it = sp.begin(row); it != sp.end(row); ++it)
{
- deallog << it->column() << " ";
+ deallog << it->column() << ' ';
}
deallog << std::endl;
}
{
DynamicSparsityPattern::iterator col = sp.begin(row),
end_col = sp.end(row);
- deallog << "row " << row << ":" << std::endl;
+ deallog << "row " << row << ':' << std::endl;
for (; col != end_col; ++col)
{
deallog << "row= " << col->row() << ", col= " << col->column()
SparsityPattern sp1((N - 1) * (N - 1), (N - 1) * (N - 1), 5);
FDMatrix(N, N).five_point_structure(sp1);
sp1.compress();
- deallog << sp1.n_rows() << " " << sp1.n_cols() << " " << sp1.bandwidth()
- << " " << sp1.n_nonzero_elements() << std::endl;
+ deallog << sp1.n_rows() << ' ' << sp1.n_cols() << ' ' << sp1.bandwidth()
+ << ' ' << sp1.n_nonzero_elements() << std::endl;
for (unsigned int i = 0; i < sp1.n_rows(); ++i)
deallog << sp1.row_length(i) << std::endl;
sp1.print_gnuplot(deallog.get_file_stream());
// off-diagonals
SparsityPattern sp2(sp1, 10, 2);
sp2.compress();
- deallog << sp2.n_rows() << " " << sp2.n_cols() << " " << sp2.bandwidth()
- << " " << sp2.n_nonzero_elements() << std::endl;
+ deallog << sp2.n_rows() << ' ' << sp2.n_cols() << ' ' << sp2.bandwidth()
+ << ' ' << sp2.n_nonzero_elements() << std::endl;
for (unsigned int i = 0; i < sp2.n_rows(); ++i)
deallog << sp2.row_length(i) << std::endl;
sp2.print_gnuplot(deallog.get_file_stream());
sp3.add(0, i);
sp3.symmetrize();
sp3.compress();
- deallog << sp3.n_rows() << " " << sp3.n_cols() << " " << sp3.bandwidth()
- << " " << sp3.n_nonzero_elements() << std::endl;
+ deallog << sp3.n_rows() << ' ' << sp3.n_cols() << ' ' << sp3.bandwidth()
+ << ' ' << sp3.n_nonzero_elements() << std::endl;
for (unsigned int i = 0; i < sp3.n_rows(); ++i)
deallog << sp3.row_length(i) << std::endl;
sp3.print_gnuplot(deallog.get_file_stream());
ode.output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << std::endl;
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << std::endl;
return 0;
};
// limit the output to every 10th step and increase the precision to make
// the test more robust
if (step_number % 10 == 0)
- deallog << t << " " << std::setprecision(7) << sol[0] << " " << sol[1]
+ deallog << t << ' ' << std::setprecision(7) << sol[0] << ' ' << sol[1]
<< std::endl;
return 0;
};
// limit the output to every 10th step and increase the precision to make
// the test more robust
if (step_number % 10 == 0)
- deallog << t << " " << std::setprecision(10) << sol[0] << " " << sol[1]
- << " " << sol[2] << std::endl;
+ deallog << t << ' ' << std::setprecision(10) << sol[0] << ' ' << sol[1]
+ << ' ' << sol[2] << std::endl;
return 0;
};
ode.output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << " " << sol[2]
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << ' ' << sol[2]
<< std::endl;
return 0;
};
ode.output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << " " << sol[2]
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << ' ' << sol[2]
<< std::endl;
return 0;
};
ode.output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << " " << sol[2]
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << ' ' << sol[2]
<< std::endl;
return 0;
};
ode.output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << " " << sol[2]
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << ' ' << sol[2]
<< std::endl;
return 0;
};
ode.output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << std::endl;
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << std::endl;
return 0;
};
ode->output_step = [&](const double t,
const VectorType & sol,
const unsigned int step_number) -> int {
- deallog << t << " " << sol[0] << " " << sol[1] << std::endl;
+ deallog << t << ' ' << sol[0] << ' ' << sol[1] << std::endl;
return 0;
};
return ode;
const VectorType & sol,
const VectorType & sol_dot,
const unsigned int step_number) -> int {
- out << t << " " << sol[0] << " " << sol[1] << " " << sol_dot[0] << " "
+ out << t << ' ' << sol[0] << ' ' << sol[1] << ' ' << sol_dot[0] << ' '
<< sol_dot[1] << std::endl;
return 0;
};
const VectorType & sol,
const VectorType & sol_dot,
const unsigned int step_number) -> int {
- out << t << " " << sol[0] << " " << sol[1] << " " << sol_dot[0] << " "
+ out << t << ' ' << sol[0] << ' ' << sol[1] << ' ' << sol_dot[0] << ' '
<< sol_dot[1] << std::endl;
return 0;
};
kinsol.reinit_vector = [N](VectorType &v) { v.reinit(N); };
kinsol.residual = [](const VectorType &u, VectorType &F) -> int {
- deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
F(0) = std::cos(u[0] + u[1]) - 1 + 2 * u[0];
kinsol.setup_jacobian = [](const VectorType &u, const VectorType &F) -> int {
// We don't do any kind of set-up in this program, but we can at least
// say that we're here
- deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
return 0;
};
const VectorType &rhs,
VectorType & dst) -> int {
deallog << "Solving Jacobian system with rhs=(" << rhs[0] << ',' << rhs[1]
- << ")" << std::endl;
+ << ')' << std::endl;
// This isn't right for SUNDIALS >4.0: We don't actually get a valid
// 'u' vector, and so do the linearization of the problem around
kinsol.reinit_vector = [N](VectorType &v) { v.reinit(N); };
kinsol.residual = [](const VectorType &u, VectorType &F) -> int {
- deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
F(0) = std::cos(u[0] + u[1]) - 1 + 2 * u[0];
kinsol.setup_jacobian = [](const VectorType &u, const VectorType &F) -> int {
// We don't do any kind of set-up in this program, but we can at least
// say that we're here
- deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
return 0;
};
VectorType & dst,
const double /*tolerance*/) -> int {
deallog << "Solving Jacobian system with rhs=(" << rhs[0] << ',' << rhs[1]
- << ")" << std::endl;
+ << ')' << std::endl;
// This isn't right for SUNDIALS >4.0: We don't actually get a valid
// 'u' vector, and so do the linearization of the problem around
kinsol.reinit_vector = [N](VectorType &v) { v.reinit(N); };
kinsol.residual = [](const VectorType &u, VectorType &F) -> int {
- deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
F(0) = std::cos(u[0] + u[1]) - 1 + 2 * u[0];
kinsol.setup_jacobian = [&J_inverse](const VectorType &u,
const VectorType &F) -> int {
- deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
FullMatrix<double> J(2, 2);
const VectorType &rhs,
VectorType & dst) -> int {
deallog << "Solving Jacobian system with rhs=(" << rhs[0] << ',' << rhs[1]
- << ")" << std::endl;
+ << ')' << std::endl;
J_inverse.vmult(dst, rhs);
kinsol.reinit_vector = [N](VectorType &v) { v.reinit(N); };
kinsol.residual = [](const VectorType &u, VectorType &F) -> int {
- deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
F(0) = std::cos(u[0] + u[1]) - 1 + 2 * u[0];
kinsol.setup_jacobian = [&J_inverse](const VectorType &u,
const VectorType &F) -> int {
- deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
FullMatrix<double> J(2, 2);
VectorType & dst,
const double /*tolerance*/) -> int {
deallog << "Solving Jacobian system with rhs=(" << rhs[0] << ',' << rhs[1]
- << ")" << std::endl;
+ << ')' << std::endl;
J_inverse.vmult(dst, rhs);
kinsol.reinit_vector = [N](VectorType &v) { v.reinit(N); };
kinsol.residual = [](const VectorType &u, VectorType &F) -> int {
- deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
F(0) = std::cos(u[0] + u[1]) - 1 + 2 * u[0];
const VectorType &F) -> int {
// We don't do any kind of set-up in this program, but we can at least
// say that we're here
- deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
FullMatrix<double> J(2, 2);
const VectorType &rhs,
VectorType & dst) -> int {
deallog << "Solving Jacobian system with rhs=(" << rhs[0] << ',' << rhs[1]
- << ")" << std::endl;
+ << ')' << std::endl;
J_inverse.vmult(dst, rhs);
kinsol.reinit_vector = [N](VectorType &v) { v.reinit(N); };
kinsol.residual = [](const VectorType &u, VectorType &F) -> int {
- deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Evaluating the solution at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
F(0) = std::cos(u[0] + u[1]) - 1 + 2 * u[0];
const VectorType &F) -> int {
// We don't do any kind of set-up in this program, but we can at least
// say that we're here
- deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ")"
+ deallog << "Setting up Jacobian system at u=(" << u[0] << ',' << u[1] << ')'
<< std::endl;
FullMatrix<double> J(2, 2);
VectorType & dst,
const double /*tolerance*/) -> int {
deallog << "Solving Jacobian system with rhs=(" << rhs[0] << ',' << rhs[1]
- << ")" << std::endl;
+ << ')' << std::endl;
J_inverse.vmult(dst, rhs);
const Tensor<1, dim, NumberType> &t)
{
for (unsigned int i = 0; i < dim; ++i)
- stream << name << "[" << i << "]: " << t[i] << std::endl;
+ stream << name << '[' << i << "]: " << t[i] << std::endl;
}
template <typename Stream, int dim, typename NumberType>
void
{
for (unsigned int i = 0; i < dim; ++i)
for (unsigned int j = 0; j < dim; ++j)
- stream << name << "[" << i << "][" << j << "]: " << t[i][j] << std::endl;
+ stream << name << '[' << i << "][" << j << "]: " << t[i][j] << std::endl;
}
template <typename Stream, int dim, typename NumberType>
void
for (unsigned int i = 0; i < dim; ++i)
for (unsigned int j = 0; j < dim; ++j)
for (unsigned int k = 0; k < dim; ++k)
- stream << name << "[" << i << "][" << j << "][" << k
+ stream << name << '[' << i << "][" << j << "][" << k
<< "]: " << t[i][j][k] << std::endl;
}
template <typename Stream, int dim, typename NumberType>
for (unsigned int j = 0; j < dim; ++j)
for (unsigned int k = 0; k < dim; ++k)
for (unsigned int l = 0; l < dim; ++l)
- stream << name << "[" << i << "][" << j << "][" << k << "][" << l
+ stream << name << '[' << i << "][" << j << "][" << k << "][" << l
<< "]: " << t[i][j][k][l] << std::endl;
}
constexpr dealii::Tensor<rank, dim, Number> a;
constexpr dealii::Tensor<rank, dim, Number> b(a);
constexpr dealii::Tensor<rank, dim, Number> c = a;
- deallog << " Tensor<" << rank << "," << dim << ">" << std::endl;
+ deallog << " Tensor<" << rank << ',' << dim << '>' << std::endl;
deallog << a << std::endl;
deallog << b << std::endl;
deallog << c << std::endl;
for (unsigned int i = 0; i < dim; ++i)
for (unsigned int j = 0; j < dim; ++j)
- deallog << (i + 1) * (j + 1) << " " << (int)s[i][j] << " " << (int)t[i][j]
- << " " << (int)u[i][j] << std::endl;
+ deallog << (i + 1) * (j + 1) << ' ' << (int)s[i][j] << ' ' << (int)t[i][j]
+ << ' ' << (int)u[i][j] << std::endl;
}
test_tensor_constructor(const std::string &type1, const std::string &type2)
{
deallog << "Rank " << rank << ", "
- << "Dim " << dim << ":"
- << " From " << type2 << " To " << type1 << " ... " << std::flush;
+ << "Dim " << dim << ':' << " From " << type2 << " To " << type1
+ << " ... " << std::flush;
TensorType<rank, dim, NumberType2> tmp2;
TensorType<rank, dim, NumberType1> tmp1(tmp2);
deallog << "OK" << std::endl;
for (unsigned int i = 0; i < 2; ++i) \
for (unsigned int j = 0; j < 2; ++j) \
for (unsigned int k = 0; k < 2; ++k) \
- deallog << bar[i][j][k] << " "; \
+ deallog << bar[i][j][k] << ' '; \
deallog << std::endl;
// for (unsigned int k = 0; k < 4; ++k)
// for (unsigned int l = 0; l < 4; ++l)
// {
- // deallog << "(" << i << "," << j << "," << k << "," << l << "):
+ // deallog << '(' << i << ',' << j << ',' << k << ',' << l << "):
// "; deallog << result[i][j][k][l] << " = " << left2[i][j] << " *
// " << right2[k][l] << std::endl;
// }
m.compress(VectorOperation::insert);
m2.compress(VectorOperation::insert);
- deallog << "Matrix nonzeros: " << m.n_nonzero_elements() << " "
+ deallog << "Matrix nonzeros: " << m.n_nonzero_elements() << ' '
<< m2.n_nonzero_elements() << std::endl;
m.print(deallog.get_file_stream());
m2.compress(VectorOperation::insert);
m3.compress(VectorOperation::insert);
- deallog << "Matrix nonzeros: " << m.n_nonzero_elements() << " "
- << m2.n_nonzero_elements() << " " << m3.n_nonzero_elements()
+ deallog << "Matrix nonzeros: " << m.n_nonzero_elements() << ' '
+ << m2.n_nonzero_elements() << ' ' << m3.n_nonzero_elements()
<< std::endl;
m.copy_from(m2);
prec.initialize(m);
m.vmult(dst, src);
- deallog << "Vector norm: " << dst.l2_norm() << " ";
+ deallog << "Vector norm: " << dst.l2_norm() << ' ';
prec.vmult(dst, src);
deallog << dst.l2_norm() << std::endl;
m.add(0.06, m3);
m.vmult(dst, src);
- deallog << "Vector norm: " << dst.l2_norm() << " ";
+ deallog << "Vector norm: " << dst.l2_norm() << ' ';
prec.vmult(dst, src);
deallog << dst.l2_norm() << std::endl;
#include "../tests.h"
#define PRINTBLOCK(name, var) \
- deallog << "Block vector: " name << ":" << std::endl; \
+ deallog << "Block vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.n_blocks(); ++i) \
{ \
deallog << "[block " << i << " ] "; \
for (unsigned int j = 0; j < var.block(i).size(); ++j) \
- deallog << var.block(i)[j] << " "; \
+ deallog << var.block(i)[j] << ' '; \
deallog << std::endl; \
}
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << copied(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << copied(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << copied(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << copied(myid * 2 + 1) << std::endl;
}
for (unsigned int bl = 0; bl < 2; ++bl)
// check local values
if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
{
- deallog << myid * 2 << ":" << copied(myid * 2) << std::endl;
- deallog << myid * 2 + 1 << ":" << copied(myid * 2 + 1) << std::endl;
+ deallog << myid * 2 << ':' << copied(myid * 2) << std::endl;
+ deallog << myid * 2 + 1 << ':' << copied(myid * 2 + 1) << std::endl;
}
for (unsigned int bl = 0; bl < 2; ++bl)
for (const auto &el : sp)
{
- deallog << "index: " << el.index() << " = "
- << "(" << el.row() << " , " << el.column() << ")" << std::endl;
+ deallog << "index: " << el.index() << " = " << '(' << el.row() << " , "
+ << el.column() << ')' << std::endl;
}
sp.compress();
deallog << "after compress:" << std::endl;
for (const auto &el : sp)
{
- deallog << "index: " << el.index() << " = "
- << "(" << el.row() << " , " << el.column() << ")" << std::endl;
+ deallog << "index: " << el.index() << " = " << '(' << el.row() << " , "
+ << el.column() << ')' << std::endl;
}
}
#include "../tests.h"
#define PRINTME(name, var) \
- deallog << "Vector: " name << ":" << std::endl; \
+ deallog << "Vector: " name << ':' << std::endl; \
for (unsigned int i = 0; i < var.size(); ++i) \
- deallog << var[i] << " "; \
+ deallog << var[i] << ' '; \
deallog << std::endl;
int
deallog << "Number of colors used: " << num_colors << std::endl;
for (unsigned int i = 0; i < num_indices; ++i)
{
- deallog << i << " " << color_indices[i] << std::endl;
+ deallog << i << ' ' << color_indices[i] << std::endl;
}
}
deallog << "Number of colors used: " << num_colors << std::endl;
for (unsigned int i = 0; i < num_indices; ++i)
{
- deallog << i << " " << color_indices[i] << std::endl;
+ deallog << i << ' ' << color_indices[i] << std::endl;
}
}
deallog << "Number of colors used: " << num_colors << std::endl;
for (unsigned int i = 0; i < num_indices; ++i)
{
- deallog << i << " " << color_indices[i] << std::endl;
+ deallog << i << ' ' << color_indices[i] << std::endl;
}
}
projects / dealii.git / commitdiff