return dim+c;
// should never get here:
- AssertThrow(false, ExcInternalError());
+ Assert(false, ExcInternalError());
return 0;
}
}
return TableIndices<2>(d,e);
// should never get here:
- AssertThrow(false, ExcInternalError());
+ Assert(false, ExcInternalError());
return TableIndices<2>(0, 0);
}
}
if (filename != "")
{
int status = std::remove (filename.c_str());
- AssertThrow (status == 0, ExcInternalError());
+ (void)status;
+ Assert (status == 0, ExcInternalError());
filename = "";
};
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
partition();
this->update_number_cache ();
break;
}
default:
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
}
}
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
// note that now we have some content in the p4est objects and call the
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
this->update_number_cache ();
// triangulation should not
// be checking for
// distorted cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
this->update_number_cache ();
{
// the underlying triangulation should not be checking for
// distorted cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
refinement_in_progress = saved_refinement_in_progress;
{
// the underlying triangulation should not be checking for
// distorted cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
refinement_in_progress = saved_refinement_in_progress;
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
#ifdef DEBUG
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
refinement_in_progress = false;
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
//finally call the base class for storing the periodicity information
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
// note that now we have some content in the p4est objects and call the
{
// the underlying triangulation should not be checking for distorted
// cells
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
this->update_number_cache ();
const dealii::hp::FECollection<dim,spacedim> *
get_fe_collection (const dealii::DoFHandler<dim,spacedim> &)
{
- AssertThrow(false, ExcInternalError());
+ Assert(false, ExcInternalError());
return NULL;
}
}
q_fine.reset(new QGauss<dim> (degree+1));
break;
default:
- AssertThrow(false, ExcInternalError());
+ Assert(false, ExcInternalError());
}
Assert(q_fine.get() != NULL, ExcInternalError());
cell->face(f)->line(j)->set_boundary_id(1);
}
else
- AssertThrow (false, ExcInternalError());
+ Assert (false, ExcInternalError());
}
}
vertex_indices_var->get(&*vertex_indices.begin(), n_bquads, vertices_per_quad);
for (unsigned int i=0; i<vertex_indices.size(); ++i)
- AssertThrow(vertex_indices[i]>=0, ExcInternalError());
+ Assert(vertex_indices[i]>=0, ExcInternalError());
if (output)
{
vertex_indices_var->get(&*vertex_indices.begin(), n_cells, vertices_per_hex);
for (unsigned int i=0; i<vertex_indices.size(); ++i)
- AssertThrow(vertex_indices[i]>=0, ExcInternalError());
+ Assert(vertex_indices[i]>=0, ExcInternalError());
if (output)
{
if (matching == m_tff) return 1; // [true ,false,false]
static const MATCH_T m_ttf = {{ 1 , 0 }};
if (matching == m_ttf) return 3; // [true ,true ,false]
- AssertThrow(false, ExcInternalError());
+ Assert(false, ExcInternalError());
// what follows is dead code, but it avoids warnings about the lack
// of a return value
return 0;
if (matching == m_ftf) return 2; // [false,true ,false]
static const MATCH_T m_ftt = {{ 1 , 0 , 3 , 2 }};
if (matching == m_ftt) return 6; // [false,true ,true ]
- AssertThrow(false, ExcInternalError());
+ Assert(false, ExcInternalError());
// what follows is dead code, but it avoids warnings about the lack
// of a return value
return 0;
default:
// in 1d, a node must have one or two adjacent lines
if (spacedim==1)
- AssertThrow (false, ExcInternalError())
+ Assert (false, ExcInternalError())
else
AssertThrow (false,
ExcMessage ("You have a vertex in your triangulation "
int info = 0;
getrf(&mm, &nn, values, &mm, &ipiv[0], &info);
- AssertThrow(info >= 0, ExcInternalError());
+ Assert(info >= 0, ExcInternalError());
AssertThrow(info == 0, LACExceptions::ExcSingular());
state = lu;
{
getrf(&mm, &nn, values, &mm, &ipiv[0], &info);
- AssertThrow(info >= 0, ExcInternalError());
+ Assert(info >= 0, ExcInternalError());
AssertThrow(info == 0, LACExceptions::ExcSingular());
}
inv_work.resize (mm);
getri(&mm, values, &mm, &ipiv[0], &inv_work[0], &mm, &info);
- AssertThrow(info >= 0, ExcInternalError());
+ Assert(info >= 0, ExcInternalError());
AssertThrow(info == 0, LACExceptions::ExcSingular());
state = inverse_matrix;
getrs(trans, &nn, &one, values, &nn, &ipiv[0],
v.begin(), &nn, &info);
- AssertThrow(info == 0, ExcInternalError());
+ Assert(info == 0, ExcInternalError());
}
getrs(trans, &nn, &kk, values, &nn, &ipiv[0], &B.values[0], &nn, &info);
- AssertThrow(info == 0, ExcInternalError());
+ Assert(info == 0, ExcInternalError());
}