// internal::Triangulation
using dealii::Triangulation;
- /**
- * Exception
- * @ingroup Exceptions
- */
- DeclException0 (ExcTooFewVerticesAllocated);
/**
* Exception
* @ingroup Exceptions
while (triangulation.vertices_used[next_unused_vertex] == true)
++next_unused_vertex;
Assert (next_unused_vertex < triangulation.vertices.size(),
- ExcTooFewVerticesAllocated());
+ ExcMessage("Internal error: During refinement, the triangulation wants to access an element of the 'vertices' array but it turns out that the array is not large enough."));
triangulation.vertices_used[next_unused_vertex] = true;
new_vertices[8] = next_unused_vertex;
while (triangulation.vertices_used[next_unused_vertex] == true)
++next_unused_vertex;
Assert (next_unused_vertex < triangulation.vertices.size(),
- ExcTooFewVerticesAllocated());
+ ExcMessage("Internal error: During refinement, the triangulation wants to access an element of the 'vertices' array but it turns out that the array is not large enough."));
// Now we always ask the cell itself where to put
// the new point. The cell in turn will query the
while (triangulation.vertices_used[next_unused_vertex] == true)
++next_unused_vertex;
Assert (next_unused_vertex < triangulation.vertices.size(),
- ExcTooFewVerticesAllocated());
+ ExcMessage("Internal error: During refinement, the triangulation wants to access an element of the 'vertices' array but it turns out that the array is not large enough."));
triangulation.vertices_used[next_unused_vertex] = true;
if (spacedim == dim)
while (triangulation.vertices_used[next_unused_vertex] == true)
++next_unused_vertex;
Assert (next_unused_vertex < triangulation.vertices.size(),
- ExcTooFewVerticesAllocated());
+ ExcMessage("Internal error: During refinement, the triangulation wants to access an element of the 'vertices' array but it turns out that the array is not large enough."));
triangulation.vertices_used[next_unused_vertex] = true;
triangulation.vertices[next_unused_vertex]
while (triangulation.vertices_used[next_unused_vertex] == true)
++next_unused_vertex;
Assert (next_unused_vertex < triangulation.vertices.size(),
- ExcTooFewVerticesAllocated());
+ ExcMessage("Internal error: During refinement, the triangulation wants to access an element of the 'vertices' array but it turns out that the array is not large enough."));
// now: if the quad is refined anisotropically
// already, set the anisotropic refinement flag
while (triangulation.vertices_used[next_unused_vertex] == true)
++next_unused_vertex;
Assert (next_unused_vertex < triangulation.vertices.size(),
- ExcTooFewVerticesAllocated());
+ ExcMessage("Internal error: During refinement, the triangulation wants to access an element of the 'vertices' array but it turns out that the array is not large enough."));
triangulation.vertices_used[next_unused_vertex] = true;
// the new vertex is definitely in the interior,