From: bangerth Date: Wed, 15 Feb 2012 15:37:41 +0000 (+0000) Subject: Reindent the whole file. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=6d8545885996ed0cc52980efcd82bb26eec54a9f;p=dealii-svn.git Reindent the whole file. git-svn-id: https://svn.dealii.org/trunk@25082 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/source/grid/grid_tools.cc b/deal.II/source/grid/grid_tools.cc index 05e049b7fd..65218d46f7 100644 --- a/deal.II/source/grid/grid_tools.cc +++ b/deal.II/source/grid/grid_tools.cc @@ -841,33 +841,33 @@ namespace GridTools const Point &p) { Assert ((mapping.size() == 1) || - (mapping.size() == container.get_fe().size()), - ExcMessage ("Mapping collection needs to have either size 1 " - "or size equal to the number of elements in " - "the FECollection.")); + (mapping.size() == container.get_fe().size()), + ExcMessage ("Mapping collection needs to have either size 1 " + "or size equal to the number of elements in " + "the FECollection.")); typedef typename hp::DoFHandler::active_cell_iterator cell_iterator; std::pair > best_cell; - //If we have only one element in the MappingCollection, - //we use find_active_cell_around_point using only one - //mapping. + //If we have only one element in the MappingCollection, + //we use find_active_cell_around_point using only one + //mapping. if(mapping.size()==1) best_cell = find_active_cell_around_point(mapping[0], container, p); else { - // The best distance is set to the - // maximum allowable distance from - // the unit cell; we assume a - // max. deviation of 1e-10 + // The best distance is set to the + // maximum allowable distance from + // the unit cell; we assume a + // max. deviation of 1e-10 double best_distance = 1e-10; int best_level = -1; - // Find closest vertex and determine - // all adjacent cells + // Find closest vertex and determine + // all adjacent cells unsigned int vertex = find_closest_vertex(container, p); std::vector adjacent_cells = @@ -879,28 +879,28 @@ namespace GridTools for(; cell != endc; ++cell) { - const Point p_cell - = mapping[(*cell)->active_fe_index()].transform_real_to_unit_cell(*cell, p); - - // calculate the infinity norm of - // the distance vector to the unit cell. - const double dist = GeometryInfo::distance_to_unit_cell(p_cell); - - // We compare if the point is inside the - // unit cell (or at least not too far - // outside). If it is, it is also checked - // that the cell has a more refined state - if (dist < best_distance || - (dist == best_distance && (*cell)->level() > best_level)) - { - best_distance = dist; - best_level = (*cell)->level(); - best_cell = std::make_pair(*cell, p_cell); - } - } + const Point p_cell + = mapping[(*cell)->active_fe_index()].transform_real_to_unit_cell(*cell, p); + + // calculate the infinity norm of + // the distance vector to the unit cell. + const double dist = GeometryInfo::distance_to_unit_cell(p_cell); + + // We compare if the point is inside the + // unit cell (or at least not too far + // outside). If it is, it is also checked + // that the cell has a more refined state + if (dist < best_distance || + (dist == best_distance && (*cell)->level() > best_level)) + { + best_distance = dist; + best_level = (*cell)->level(); + best_cell = std::make_pair(*cell, p_cell); + } + } - Assert (best_cell.first.state() == IteratorState::valid, - ExcPointNotFound(p)); + Assert (best_cell.first.state() == IteratorState::valid, + ExcPointNotFound(p)); } return best_cell; } @@ -1546,7 +1546,7 @@ namespace GridTools const bool respect_manifold) { const Boundary + Iterator::AccessorType::space_dimension> *manifold = (respect_manifold ? &object->get_boundary() : 0); @@ -1902,13 +1902,13 @@ namespace GridTools // pass by CellData and that it will not reorder the vertices. std::map::cell_iterator, - typename Container::face_iterator> - surface_to_volume_mapping; + typename Container::face_iterator> + surface_to_volume_mapping; const unsigned int boundary_dim = dim-1; //dimension of the boundary mesh - // First create surface mesh and mapping - // from only level(0) cells of volume_mesh + // First create surface mesh and mapping + // from only level(0) cells of volume_mesh std::vector::face_iterator> mapping; // temporary map for level==0