/**
* Value for no neighbor.
*/
- static const unsigned int no_neighbor = static_cast<unsigned int>(-1);
+ static const unsigned int no_neighbor = deal_II_numbers::invalid_unsigned_int;
/**
* Exception
* that no component is
* selected.
*/
- static const unsigned int no_component = static_cast<unsigned int>(-1);
+ static const unsigned int no_component = deal_II_numbers::invalid_unsigned_int;
/**
* Constructor. Arguments are the
#ifdef HAVE_STD_NUMERIC_LIMITS
std::numeric_limits<unsigned int>::max();
#else
- static_cast<unsigned int>(-1);
+ deal_II_numbers::invalid_unsigned_int;
#endif
default:
Assert (false, ExcInternalError());
}
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
default:
Assert (false, ExcInternalError());
}
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
QProjector<dim>::DataSetDescriptor::
DataSetDescriptor ()
:
- dataset_offset (static_cast<unsigned int>(-1))
+ dataset_offset (deal_II_numbers::invalid_unsigned_int)
{}
* certain value, but rather take
* its symbolic name.
*/
- static const unsigned int invalid_dof_index = static_cast<unsigned int>(-1);
+ static const unsigned int invalid_dof_index = deal_II_numbers::invalid_unsigned_int;
/**
* Constructor. Take @p{tria} as the
* face or subface number is
* invalid.
*/
- static const unsigned int invalid_face_number = static_cast<unsigned int>(-1);
+ static const unsigned int invalid_face_number = deal_II_numbers::invalid_unsigned_int;
/**
* Pairs of multiplicity and
* face or subface number is
* invalid.
*/
- static const unsigned int invalid_face_number = static_cast<unsigned int>(-1);
+ static const unsigned int invalid_face_number = deal_II_numbers::invalid_unsigned_int;
};
/*@}*/
:
i+4*fe.dofs_per_vertex+8*fe.dofs_per_line))
:
- static_cast<unsigned int>(-1))));
+ deal_II_numbers::invalid_unsigned_int)));
if (fe.is_primitive (cell_index))
selected_dofs[face_dof_indices[i]]
= (component_select[fe.face_system_to_component_index(i).first]
const unsigned int parameter_dof = weight_mapping[i];
// if this global dof is a
// parameter
- if (parameter_dof != static_cast<unsigned int>(-1))
+ if (parameter_dof != deal_II_numbers::invalid_unsigned_int)
{
Assert (parameter_dof < n_global_parm_dofs, ExcInternalError());
Assert (inverse_weight_mapping[parameter_dof] == DoFHandler<dim>::invalid_dof_index,
default:
Assert (false, ExcNotImplemented());
};
- return TableIndices<2> (static_cast<unsigned int>(-1),
- static_cast<unsigned int>(-1));
+ return TableIndices<2> (deal_II_numbers::invalid_unsigned_int,
+ deal_II_numbers::invalid_unsigned_int);
}
if (i*i == N)
return i;
Assert (false, ExcInternalError());
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
if (i*i*i == N)
return i;
Assert (false, ExcInternalError());
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
if (i*i == N)
return i;
Assert (false, ExcInternalError());
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
if (i*i*i == N)
return i;
Assert (false, ExcInternalError());
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
}
Assert (false, ExcInternalError());
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
{
Assert (false, ExcNotImplemented());
// const unsigned int N1d = 2+fe_data.dofs_per_line;
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
}
// non-primitive shape functions,
// have a special invalid index.
const std::pair<unsigned int, unsigned int>
- non_primitive_index (static_cast<unsigned int>(-1),
- static_cast<unsigned int>(-1));
+ non_primitive_index (deal_II_numbers::invalid_unsigned_int,
+ deal_II_numbers::invalid_unsigned_int);
// First enumerate vertex indices,
// where we first enumerate all
// functions, have a special
// invalid index
const std::pair<unsigned int, unsigned int>
- non_primitive_index (static_cast<unsigned int>(-1),
- static_cast<unsigned int>(-1));
+ non_primitive_index (deal_II_numbers::invalid_unsigned_int,
+ deal_II_numbers::invalid_unsigned_int);
// 1. Vertices
unsigned int total_index = 0;
else
{
Assert (false, ExcNotImplemented());
- return std::make_pair (-1, static_cast<unsigned int>(-1));
+ return std::make_pair (-1, deal_II_numbers::invalid_unsigned_int);
}
}
else
- return std::make_pair (-1, static_cast<unsigned int>(-1));
+ return std::make_pair (-1, deal_II_numbers::invalid_unsigned_int);
}
// then renumber the vertices that
// are actually used in the same
// order as they were beforehand
- const unsigned int invalid_vertex = static_cast<unsigned int>(-1);
+ const unsigned int invalid_vertex = deal_II_numbers::invalid_unsigned_int;
std::vector<unsigned int> new_vertex_numbers (vertices.size(), invalid_vertex);
unsigned int next_free_number = 0;
for (unsigned int i=0; i<vertices.size(); ++i)
const unsigned int initv1)
:
v0(initv0), v1(initv1),
- Q0(static_cast<unsigned int>(-1)),
- Q1(static_cast<unsigned int>(-1)),
- lsn0(static_cast<unsigned int>(-1)),
- lsn1(static_cast<unsigned int>(-1)),
+ Q0(deal_II_numbers::invalid_unsigned_int),
+ Q1(deal_II_numbers::invalid_unsigned_int),
+ lsn0(deal_II_numbers::invalid_unsigned_int),
+ lsn1(deal_II_numbers::invalid_unsigned_int),
Oriented(false)
{}
for (unsigned int i = 0;i<4;++i)
{
MSide &ss = sides[(*it).side[i]];
- if (ss.Q0 == static_cast<unsigned int>(-1))
+ if (ss.Q0 == deal_II_numbers::invalid_unsigned_int)
{
ss.Q0 = qctr;
ss.lsn0 = i;
}
- else if (ss.Q1 == static_cast<unsigned int>(-1))
+ else if (ss.Q1 == deal_II_numbers::invalid_unsigned_int)
{
ss.Q1 = qctr;
ss.lsn1 = i;
lsn = s.lsn0;
}
- if (opquad != static_cast<unsigned int>(-1))
+ if (opquad != deal_II_numbers::invalid_unsigned_int)
{
qnum = opquad;
return true;
{
for (unsigned int i=0; i<GeometryInfo<3>::lines_per_cell; ++i)
{
- edges[i] = static_cast<unsigned int>(-1);
+ edges[i] = deal_II_numbers::invalid_unsigned_int;
local_orientation_flags[i] = 1;
}
for (unsigned int i=0; i<GeometryInfo<3>::vertices_per_cell; ++i)
- nodes[i] = static_cast<unsigned int>(-1);
+ nodes[i] = deal_II_numbers::invalid_unsigned_int;
waiting_to_be_processed = false;
}
// Here the number of
// incoming edges is
// tallied for each node.
- unsigned int perm_num = static_cast<unsigned int>(-1);
+ unsigned int perm_num = deal_II_numbers::invalid_unsigned_int;
for (unsigned int node_num=0; node_num<8; ++node_num)
{
// The local edge
if (total == 3)
{
- Assert (perm_num == static_cast<unsigned int>(-1),
+ Assert (perm_num == deal_II_numbers::invalid_unsigned_int,
ExcGridOrientError("More than one node with 3 incoming "
"edges found in curent hex."));
perm_num = node_num;
}
// We should now have a
// valid permutation number
- Assert (perm_num != static_cast<unsigned int>(-1),
+ Assert (perm_num != deal_II_numbers::invalid_unsigned_int,
ExcGridOrientError("No node having 3 incoming edges found in curent hex."));
// So use the apropriate
CellAccessor<1>::neighbor_of_coarser_neighbor (const unsigned int) const
{
Assert(false, ExcImpossibleInDim(1));
- return std::make_pair (static_cast<unsigned int>(-1),
- static_cast<unsigned int>(-1));
+ return std::make_pair (deal_II_numbers::invalid_unsigned_int,
+ deal_II_numbers::invalid_unsigned_int);
}
// since then we did not find
// our way back...
Assert (false, ExcInternalError());
- return static_cast<unsigned int>(-1);
+ return deal_II_numbers::invalid_unsigned_int;
};
}
// since then we did not find
// our way back...
Assert (false, ExcInternalError());
- return std::make_pair (static_cast<unsigned int>(-1),
- static_cast<unsigned int>(-1));
+ return std::make_pair (deal_II_numbers::invalid_unsigned_int,
+ deal_II_numbers::invalid_unsigned_int);
}
TimeDependent::TimeDependent (const TimeSteppingData &data_primal,
const TimeSteppingData &data_dual,
const TimeSteppingData &data_postprocess):
- sweep_no (static_cast<unsigned int>(-1)),
+ sweep_no (deal_II_numbers::invalid_unsigned_int),
timestepping_data_primal (data_primal),
timestepping_data_dual (data_dual),
timestepping_data_postprocess (data_postprocess)
TimeStepBase::TimeStepBase (const double time) :
previous_timestep(0),
next_timestep (0),
- sweep_no (static_cast<unsigned int>(-1)),
- timestep_no (static_cast<unsigned int>(-1)),
+ sweep_no (deal_II_numbers::invalid_unsigned_int),
+ timestep_no (deal_II_numbers::invalid_unsigned_int),
time (time)
{}
:
i+4*fe.dofs_per_vertex+8*fe.dofs_per_line))
:
- static_cast<unsigned int>(-1))));
+ deal_II_numbers::invalid_unsigned_int)));
Assert (cell_i < fe.dofs_per_cell, ExcInternalError());
// make sure
current_block = parent.n_blocks();
index_within_block = 0;
next_break_backward = global_index;
- next_break_forward = static_cast<unsigned int>(-1);
+ next_break_forward = deal_II_numbers::invalid_unsigned_int;
};
}
// then move the next
// boundary arbitrarily far
// away
- next_break_forward = static_cast<unsigned int>(-1);
+ next_break_forward = deal_II_numbers::invalid_unsigned_int;
};
++global_index;
// get into unspecified terrain
{
--current_block;
- index_within_block = static_cast<unsigned int>(-1);
+ index_within_block = deal_II_numbers::invalid_unsigned_int;
next_break_forward = 0;
next_break_backward = 0;
};
* Constructor, optionally
* selecting a component.
*/
- MeanValueFilter(unsigned int component = static_cast<unsigned int>(-1));
+ MeanValueFilter(unsigned int component = deal_II_numbers::invalid_unsigned_int);
/**
* Subtract mean value from @p{v}.
void
MeanValueFilter::filter(BlockVector<number>& v) const
{
- Assert (component != static_cast<unsigned int>(-1),
+ Assert (component != deal_II_numbers::invalid_unsigned_int,
ExcNotInitialized());
for (unsigned int i=0;i<v.n_blocks();++i)
MeanValueFilter::vmult(BlockVector<number>& dst,
const BlockVector<number>& src) const
{
- Assert (component != static_cast<unsigned int>(-1),
+ Assert (component != deal_II_numbers::invalid_unsigned_int,
ExcNotInitialized());
Assert (dst.n_blocks() == src.n_blocks(),
MeanValueFilter::vmult_add(BlockVector<number>& dst,
const BlockVector<number>& src) const
{
- Assert (component != static_cast<unsigned int>(-1),
+ Assert (component != deal_II_numbers::invalid_unsigned_int,
ExcNotInitialized());
Assert (dst.n_blocks() == src.n_blocks(),
/**
* Non-existent column number.
*/
- static const unsigned int invalid = static_cast<unsigned int>(-1);
+ static const unsigned int invalid = deal_II_numbers::invalid_unsigned_int;
};
/**
* but the actual value of the
* variable may change over time.
*/
- static const unsigned int invalid_entry = static_cast<unsigned int>(-1);
+ static const unsigned int invalid_entry = deal_II_numbers::invalid_unsigned_int;
/**
* Initialize the matrix empty,