From 2e8bf44c43183a00273ff8fb30d40ecbae13c6c1 Mon Sep 17 00:00:00 2001 From: bangerth Date: Wed, 30 May 2012 08:26:37 +0000 Subject: [PATCH] Reindent two tests. git-svn-id: https://svn.dealii.org/trunk@25565 0785d39b-7218-0410-832d-ea1e28bc413d --- tests/bits/find_cells_adjacent_to_vertex_1.cc | 29 +++++++++---------- tests/bits/find_cells_adjacent_to_vertex_2.cc | 29 +++++++++---------- 2 files changed, 26 insertions(+), 32 deletions(-) diff --git a/tests/bits/find_cells_adjacent_to_vertex_1.cc b/tests/bits/find_cells_adjacent_to_vertex_1.cc index 27cd5edfca..f29721f18c 100644 --- a/tests/bits/find_cells_adjacent_to_vertex_1.cc +++ b/tests/bits/find_cells_adjacent_to_vertex_1.cc @@ -1,8 +1,8 @@ // ---------------- find_cells_adjacent_to_vertex_1.cc ------------------ // $Id$ -// Version: $Name$ +// Version: $Name$ // -// Copyright (C) 2006 by the deal.II authors and Ralf B. Schulz +// Copyright (C) 2006, 2012 by the deal.II authors and Ralf B. Schulz // // This file is subject to QPL and may not be distributed // without copyright and license information. Please refer @@ -41,23 +41,23 @@ void check (Triangulation<2> &tria) { - for(unsigned i=0; i::active_cell_iterator> - cells = GridTools::find_cells_adjacent_to_vertex(tria, i); + for(unsigned i=0; i::active_cell_iterator> + cells = GridTools::find_cells_adjacent_to_vertex(tria, i); - deallog << "Vertex " << i << " at " << tria.get_vertices()[i] << ": " << cells.size() << " cells" << std::endl; + deallog << "Vertex " << i << " at " << tria.get_vertices()[i] << ": " << cells.size() << " cells" << std::endl; - for(unsigned c=0; c::vertices_per_cell; ++v) - deallog << "<" << cells[c]->vertex(v) << "> "; - deallog << std::endl; - } + for(unsigned c=0; c::vertices_per_cell; ++v) + deallog << "<" << cells[c]->vertex(v) << "> "; + deallog << std::endl; } + } } -int main () +int main () { std::ofstream logfile("find_cells_adjacent_to_vertex_1/output"); deallog.attach(logfile); @@ -80,6 +80,3 @@ int main () deallog << exc.what() << std::endl; } } - - - diff --git a/tests/bits/find_cells_adjacent_to_vertex_2.cc b/tests/bits/find_cells_adjacent_to_vertex_2.cc index 853555993c..0892326250 100644 --- a/tests/bits/find_cells_adjacent_to_vertex_2.cc +++ b/tests/bits/find_cells_adjacent_to_vertex_2.cc @@ -1,8 +1,8 @@ // ---------------- find_cells_adjacent_to_vertex_2.cc ------------------ // $Id$ -// Version: $Name$ +// Version: $Name$ // -// Copyright (C) 2006 by the deal.II authors and Ralf B. Schulz +// Copyright (C) 2006, 2012 by the deal.II authors and Ralf B. Schulz // // This file is subject to QPL and may not be distributed // without copyright and license information. Please refer @@ -30,23 +30,23 @@ void check (Triangulation<3> &tria) { - for(unsigned i=0; i::active_cell_iterator> - cells = GridTools::find_cells_adjacent_to_vertex(tria, i); + for(unsigned i=0; i::active_cell_iterator> + cells = GridTools::find_cells_adjacent_to_vertex(tria, i); - deallog << "Vertex " << i << " at " << tria.get_vertices()[i] << ": " << cells.size() << " cells" << std::endl; + deallog << "Vertex " << i << " at " << tria.get_vertices()[i] << ": " << cells.size() << " cells" << std::endl; - for(unsigned c=0; c::vertices_per_cell; ++v) - deallog << "<" << cells[c]->vertex(v) << "> "; - deallog << std::endl; - } + for(unsigned c=0; c::vertices_per_cell; ++v) + deallog << "<" << cells[c]->vertex(v) << "> "; + deallog << std::endl; } + } } -int main () +int main () { std::ofstream logfile("find_cells_adjacent_to_vertex_2/output"); deallog.attach(logfile); @@ -69,6 +69,3 @@ int main () deallog << exc.what() << std::endl; } } - - - -- 2.39.5