From 15207d76e635d9fd2b61f9e602061c0475f0a018 Mon Sep 17 00:00:00 2001 From: deal Date: Tue, 18 Jun 2002 08:58:19 +0000 Subject: [PATCH] Add an assertion that seems to trigger in our nightly tests... git-svn-id: https://svn.dealii.org/trunk@6155 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/deal.II/source/grid/grid_reordering.cc | 16 ++++++++++------ 1 file changed, 10 insertions(+), 6 deletions(-) diff --git a/deal.II/deal.II/source/grid/grid_reordering.cc b/deal.II/deal.II/source/grid/grid_reordering.cc index 3b9abab561..711c9b768c 100644 --- a/deal.II/deal.II/source/grid/grid_reordering.cc +++ b/deal.II/deal.II/source/grid/grid_reordering.cc @@ -1,6 +1,6 @@ //---------------------------- grid_reordering.cc --------------------------- -// $Id$ -// Version: $Name$ +// grid_reordering.cc,v 1.27 2002/05/28 07:43:22 wolf Exp +// Version: // // Copyright (C) 2000, 2001, 2002 by the deal.II authors // @@ -1106,7 +1106,6 @@ GridReordering::presort_cells (typename std::vector &cells, unsigned int next_free_new_number = 0; - // loop over each connected part of // the domain. since the domain may // consist of different unconnected @@ -1143,6 +1142,7 @@ GridReordering::presort_cells (typename std::vector &cells, // better is not possible break; }; + // have an array of the next // cells to be numbered (old numbers) std::vector next_round_cells (1, cell_with_min_neighbors); @@ -1197,7 +1197,6 @@ GridReordering::presort_cells (typename std::vector &cells, }; }; // end of loop over subdomains - Assert (std::find (new_cell_numbers.begin(), new_cell_numbers.end(), invalid_cell_number) == @@ -1210,7 +1209,7 @@ GridReordering::presort_cells (typename std::vector &cells, for (unsigned int i=0; i::presort_cells (typename std::vector &cells, Assert (cells[c].cell_no == c, ExcInternalError()); for (unsigned int n=0; n::faces_per_cell; ++n) - cells[c].neighbors[n] = new_cell_numbers[cells[c].neighbors[n]]; + { + Assert (cells[c].neighbors[n] < new_cell_numbers.size(), + ExcIndexRange(cells[c].neighbors[n], 0, + new_cell_numbers.size())); + cells[c].neighbors[n] = new_cell_numbers[cells[c].neighbors[n]]; + }; }; for (typename std::map::iterator i=faces.begin(); i!=faces.end(); ++i) -- 2.39.5