* auto min_line_length = [](const Triangulation<dim> &tria) -> double
* {
* double length = std::numeric_limits<double>::max();
- * for (const auto cell : tria.active_cell_iterators())
+ * for (const auto &cell : tria.active_cell_iterators())
* for (unsigned int n = 0; n < GeometryInfo<dim>::lines_per_cell; ++n)
* length = std::min(length, (cell->line(n)->vertex(0) -
* cell->line(n)->vertex(1)).norm());
// archive the cellids in an efficient binary format
const std::size_t n_cells = cell_ids.size();
ar & n_cells;
- for (auto &it : cell_ids)
+ for (const auto &id : cell_ids)
{
- CellId::binary_type binary_cell_id = it.template to_binary<dim>();
+ CellId::binary_type binary_cell_id = id.template to_binary<dim>();
ar & binary_cell_id;
}
vertices_with_ghost_neighbors =
tria->compute_vertices_with_ghost_neighbors();
- for (auto cell : tria->active_cell_iterators())
+ for (const auto &cell : tria->active_cell_iterators())
if (cell->is_locally_owned())
{
std::set<dealii::types::subdomain_id> send_to;
{
const CellId cellid = cell->id();
- for (auto it : send_to)
+ for (const auto subdomain : send_to)
{
- const dealii::types::subdomain_id subdomain = it;
-
// find the data buffer for proc "subdomain" if it exists
// or create an empty one otherwise
typename DestinationToBufferMap::iterator p =