* patch has no neighbor on
* one side.
*/
- static const unsigned int no_neighbor = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int no_neighbor = numbers::invalid_unsigned_int;
/** @addtogroup Exceptions
* @{ */
* that no component is
* selected.
*/
- static const unsigned int no_component = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int no_component = numbers::invalid_unsigned_int;
/**
* Constructor. Arguments are the
* @verbatim
// Define some constants that will be used by the function parser
std::map<std::string> constants;
- constants["pi"] = deal_II_numbers::PI;
+ constants["pi"] = numbers::PI;
// Define the variables that will be used inside the expressions
std::string variables = "x,y,z";
* the library as a marker for an invalid index, an invalid size of an
* array, and similar purposes.
*/
-namespace deal_II_numbers
+namespace numbers
{
/**
* Representation of the
bool is_finite (const std::complex<long double> x);
}
+
+/**
+ * Namespace alias with the old name for the numbers namespace. The namespace
+ * was originally called numbers, but has since been renamed to
+ * dealii::numbers when everything was moved into namespace dealii.
+ *
+ * @deprecated
+ */
+namespace deal_II_numbers = numbers;
+
+
+
DEAL_II_NAMESPACE_CLOSE
#endif
* later indices.
*/
TableIndices (const unsigned int index1,
- const unsigned int index2 = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int index2 = numbers::invalid_unsigned_int);
};
* later indices.
*/
TableIndices (const unsigned int index1,
- const unsigned int index2 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index3 = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int index2 = numbers::invalid_unsigned_int,
+ const unsigned int index3 = numbers::invalid_unsigned_int);
};
* later indices.
*/
TableIndices (const unsigned int index1,
- const unsigned int index2 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index3 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index4 = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int index2 = numbers::invalid_unsigned_int,
+ const unsigned int index3 = numbers::invalid_unsigned_int,
+ const unsigned int index4 = numbers::invalid_unsigned_int);
};
* later indices.
*/
TableIndices (const unsigned int index1,
- const unsigned int index2 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index3 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index4 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index5 = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int index2 = numbers::invalid_unsigned_int,
+ const unsigned int index3 = numbers::invalid_unsigned_int,
+ const unsigned int index4 = numbers::invalid_unsigned_int,
+ const unsigned int index5 = numbers::invalid_unsigned_int);
};
* later indices.
*/
TableIndices (const unsigned int index1,
- const unsigned int index2 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index3 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index4 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index5 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index6 = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int index2 = numbers::invalid_unsigned_int,
+ const unsigned int index3 = numbers::invalid_unsigned_int,
+ const unsigned int index4 = numbers::invalid_unsigned_int,
+ const unsigned int index5 = numbers::invalid_unsigned_int,
+ const unsigned int index6 = numbers::invalid_unsigned_int);
};
* later indices.
*/
TableIndices (const unsigned int index1,
- const unsigned int index2 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index3 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index4 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index5 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index6 = deal_II_numbers::invalid_unsigned_int,
- const unsigned int index7 = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int index2 = numbers::invalid_unsigned_int,
+ const unsigned int index3 = numbers::invalid_unsigned_int,
+ const unsigned int index4 = numbers::invalid_unsigned_int,
+ const unsigned int index5 = numbers::invalid_unsigned_int,
+ const unsigned int index6 = numbers::invalid_unsigned_int,
+ const unsigned int index7 = numbers::invalid_unsigned_int);
};
*/
std::string
int_to_string (const unsigned int i,
- const unsigned int digits = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int digits = numbers::invalid_unsigned_int);
/**
* Determine how many digits are needed to
*
* If no integer can be read at the
* indicated position, return
- * (-1,deal_II_numbers::invalid_unsigned_int)
+ * (-1,numbers::invalid_unsigned_int)
*/
std::pair<int, unsigned int>
get_integer_at_position (const std::string &name,
DEAL_II_NAMESPACE_OPEN
-namespace deal_II_numbers
+namespace numbers
{
bool is_finite (const double x)
{
GmvStream::GmvStream (std::ostream& out,
const DataOutBase::GmvFlags f)
:
- selected_component(deal_II_numbers::invalid_unsigned_int),
+ selected_component(numbers::invalid_unsigned_int),
stream(out), flags(f)
{}
GmvStream::write_point (const unsigned int,
const Point<dim>& p)
{
- Assert(selected_component != deal_II_numbers::invalid_unsigned_int,
+ Assert(selected_component != numbers::invalid_unsigned_int,
ExcNotInitialized());
stream << p(selected_component) << ' ';
}
TecplotStream::TecplotStream(std::ostream& out, const DataOutBase::TecplotFlags f)
:
- selected_component(deal_II_numbers::invalid_unsigned_int),
+ selected_component(numbers::invalid_unsigned_int),
stream(out), flags(f)
{}
TecplotStream::write_point (const unsigned int,
const Point<dim>& p)
{
- Assert(selected_component != deal_II_numbers::invalid_unsigned_int,
+ Assert(selected_component != numbers::invalid_unsigned_int,
ExcNotInitialized());
stream << p(selected_component) << '\n';
}
// the height field, I don't know
// it.
EpsCell2d eps_cell;
- const double pi = deal_II_numbers::PI;
+ const double pi = numbers::PI;
const double cx = -std::cos(pi-flags.azimut_angle * 2*pi / 360.),
cz = -std::cos(flags.turn_angle * 2*pi / 360.),
sx = std::sin(pi-flags.azimut_angle * 2*pi / 360.),
write_nodes(patches, gmv_out);
out << '\n';
}
- gmv_out.selected_component = deal_II_numbers::invalid_unsigned_int;
+ gmv_out.selected_component = numbers::invalid_unsigned_int;
for (unsigned int d=spacedim;d<3;++d)
{
for (unsigned int k=0;k<n;++k)
{
const Point<dim>& p = points[k];
- const double x = deal_II_numbers::PI/2. * p(0);
- const double y = deal_II_numbers::PI/2. * p(1);
+ const double x = numbers::PI/2. * p(0);
+ const double y = numbers::PI/2. * p(1);
const double cx = cos(x);
const double cy = cos(y);
const double sx = sin(x);
}
else if (dim==3)
{
- const double z = deal_II_numbers::PI/2. * p(2);
+ const double z = numbers::PI/2. * p(2);
const double cz = cos(z);
const double sz = sin(z);
for (unsigned int k=0;k<n;++k)
{
const Point<dim>& p = points[k];
- const double x = deal_II_numbers::PI/2. * p(0);
- const double y = deal_II_numbers::PI/2. * p(1);
+ const double x = numbers::PI/2. * p(0);
+ const double y = numbers::PI/2. * p(1);
const double c2x = cos(2*x);
const double c2y = cos(2*y);
const double s2x = sin(2*x);
if (dim==2)
{
- values[0][k][0] = -.25*deal_II_numbers::PI * s2x*s2y;
- values[0][k][1] = .5 *deal_II_numbers::PI * cx2*c2y;
- values[1][k][0] = -.5 *deal_II_numbers::PI * c2x*cy2;
- values[1][k][1] = .25*deal_II_numbers::PI * s2x*s2y;
- values[2][k][0] = .25*deal_II_numbers::PI * c2x*s2y;
- values[2][k][1] = .25*deal_II_numbers::PI * s2x*c2y;
+ values[0][k][0] = -.25*numbers::PI * s2x*s2y;
+ values[0][k][1] = .5 *numbers::PI * cx2*c2y;
+ values[1][k][0] = -.5 *numbers::PI * c2x*cy2;
+ values[1][k][1] = .25*numbers::PI * s2x*s2y;
+ values[2][k][0] = .25*numbers::PI * c2x*s2y;
+ values[2][k][1] = .25*numbers::PI * s2x*c2y;
}
else if (dim==3)
{
- const double z = deal_II_numbers::PI/2. * p(2);
+ const double z = numbers::PI/2. * p(2);
const double c2z = cos(2*z);
const double s2z = sin(2*z);
const double cz2 = .5+.5*c2z; // cos^2 z
- values[0][k][0] = -.125*deal_II_numbers::PI * s2x*s2y*s2z;
- values[0][k][1] = .25 *deal_II_numbers::PI * cx2*c2y*s2z;
- values[0][k][2] = .25 *deal_II_numbers::PI * cx2*s2y*c2z;
+ values[0][k][0] = -.125*numbers::PI * s2x*s2y*s2z;
+ values[0][k][1] = .25 *numbers::PI * cx2*c2y*s2z;
+ values[0][k][2] = .25 *numbers::PI * cx2*s2y*c2z;
- values[1][k][0] = .25 *deal_II_numbers::PI * c2x*cy2*s2z;
- values[1][k][1] = -.125*deal_II_numbers::PI * s2x*s2y*s2z;
- values[1][k][2] = .25 *deal_II_numbers::PI * s2x*cy2*c2z;
+ values[1][k][0] = .25 *numbers::PI * c2x*cy2*s2z;
+ values[1][k][1] = -.125*numbers::PI * s2x*s2y*s2z;
+ values[1][k][2] = .25 *numbers::PI * s2x*cy2*c2z;
- values[2][k][0] = -.5 *deal_II_numbers::PI * c2x*s2y*cz2;
- values[2][k][1] = -.5 *deal_II_numbers::PI * s2x*c2y*cz2;
- values[2][k][2] = .25 *deal_II_numbers::PI * s2x*s2y*s2z;
+ values[2][k][0] = -.5 *numbers::PI * c2x*s2y*cz2;
+ values[2][k][1] = -.5 *numbers::PI * s2x*c2y*cz2;
+ values[2][k][2] = .25 *numbers::PI * s2x*s2y*s2z;
- values[3][k][0] = .125*deal_II_numbers::PI * c2x*s2y*s2z;
- values[3][k][1] = .125*deal_II_numbers::PI * s2x*c2y*s2z;
- values[3][k][2] = .125*deal_II_numbers::PI * s2x*s2y*c2z;
+ values[3][k][0] = .125*numbers::PI * c2x*s2y*s2z;
+ values[3][k][1] = .125*numbers::PI * s2x*c2y*s2z;
+ values[3][k][2] = .125*numbers::PI * s2x*s2y*c2z;
}
else
{
for (unsigned int k=0;k<n;++k)
{
const Point<dim>& p = points[k];
- const double x = deal_II_numbers::PI/2. * p(0);
- const double y = deal_II_numbers::PI/2. * p(1);
+ const double x = numbers::PI/2. * p(0);
+ const double y = numbers::PI/2. * p(1);
const double c2x = cos(2*x);
const double c2y = cos(2*y);
const double s2x = sin(2*x);
const double s2y = sin(2*y);
- const double pi2 = .25 * deal_II_numbers::PI * deal_II_numbers::PI;
+ const double pi2 = .25 * numbers::PI * numbers::PI;
if (dim==2)
{
- values[0][k] = - pi2 * (1.+2.*c2x) * s2y - deal_II_numbers::PI/4. * c2x*s2y;
- values[1][k] = pi2 * s2x * (1.+2.*c2y) - deal_II_numbers::PI/4. * s2x*c2y;
+ values[0][k] = - pi2 * (1.+2.*c2x) * s2y - numbers::PI/4. * c2x*s2y;
+ values[1][k] = pi2 * s2x * (1.+2.*c2y) - numbers::PI/4. * s2x*c2y;
values[2][k] = 0.;
}
else if (dim==3)
{
- const double z = deal_II_numbers::PI * p(2);
+ const double z = numbers::PI * p(2);
const double c2z = cos(2*z);
const double s2z = sin(2*z);
- values[0][k] = - .5*pi2 * (1.+2.*c2x) * s2y * s2z - deal_II_numbers::PI/8. * c2x * s2y * s2z;
- values[1][k] = .5*pi2 * s2x * (1.+2.*c2y) * s2z - deal_II_numbers::PI/8. * s2x * c2y * s2z;
- values[2][k] = - .5*pi2 * s2x * s2y * (1.+2.*c2z) - deal_II_numbers::PI/8. * s2x * s2y * c2z;
+ values[0][k] = - .5*pi2 * (1.+2.*c2x) * s2y * s2z - numbers::PI/8. * c2x * s2y * s2z;
+ values[1][k] = .5*pi2 * s2x * (1.+2.*c2y) * s2z - numbers::PI/8. * s2x * c2y * s2z;
+ values[2][k] = - .5*pi2 * s2x * s2y * (1.+2.*c2z) - numbers::PI/8. * s2x * s2y * c2z;
values[3][k] = 0.;
}
else
StokesLSingularity::StokesLSingularity()
:
- omega (3./2.*deal_II_numbers::PI),
+ omega (3./2.*numbers::PI),
coslo (cos(lambda*omega)),
lp(1.+lambda),
lm(1.-lambda)
{
const Point<2>& p = points[k];
const double x = p(0);
- const double y = 2. * deal_II_numbers::PI * p(1);
+ const double y = 2. * numbers::PI * p(1);
const double elx = std::exp(lbda*x);
values[0][k] = 1. - elx * cos(y);
- values[1][k] = .5 / deal_II_numbers::PI * lbda * elx * sin(y);
+ values[1][k] = .5 / numbers::PI * lbda * elx * sin(y);
values[2][k] = -.5 * elx * elx + p_average - this->mean_pressure;
}
}
// u
gradients[0][i][0] = -lbda*elx*cy;
- gradients[0][i][1] = 2. * deal_II_numbers::PI*elx*sy;
+ gradients[0][i][1] = 2. * numbers::PI*elx*sy;
gradients[1][i][0] = lbda*lbda/(2*M_PI)*elx*sy;
gradients[1][i][1] =lbda*elx*cy;
// p
if (stokes)
{
- const double zp = 2. * deal_II_numbers::PI;
+ const double zp = 2. * numbers::PI;
for (unsigned int k=0;k<n;++k)
{
const Point<2>& p = points[k];
if (d>=r)
return 0.;
const double e = -r*r/(r*r-d*d);
- return ((e<-50) ? 0. : deal_II_numbers::E * exp(e));
+ return ((e<-50) ? 0. : numbers::E * exp(e));
}
return 0.;
}
values[i] = 0.;
} else {
const double e = -r*r/(r*r-d*d);
- values[i] = (e<-50) ? 0. : deal_II_numbers::E * exp(e);
+ values[i] = (e<-50) ? 0. : numbers::E * exp(e);
}
}
else
{
e = -r*r/(r*r-d*d);
if (e>-50)
- val = deal_II_numbers::E * exp(e);
+ val = numbers::E * exp(e);
}
if (this->selected==CutOffFunctionBase<dim>::no_component)
template <int dim> const unsigned int GeometryInfo<dim>::hexes_per_cell;
-using namespace deal_II_numbers;
+using namespace numbers;
// make sure that also the icc compiler defines (and not only declares)
// these variables
#ifdef HAVE_STD_NUMERIC_LIMITS
std::numeric_limits<unsigned int>::max();
#else
- deal_II_numbers::invalid_unsigned_int;
+ numbers::invalid_unsigned_int;
#endif
constants[this_c[0]] = tmp;
}
- constants["pi"] = deal_II_numbers::PI;
- constants["Pi"] = deal_II_numbers::PI;
+ constants["pi"] = numbers::PI;
+ constants["Pi"] = numbers::PI;
unsigned int nn = (Utilities::split_string_list(vnames)).size();
switch (nn)
Quadrature<1>::Quadrature (const Quadrature<0> &)
:
Subscriptor(),
- n_quadrature_points (deal_II_numbers::invalid_unsigned_int),
+ n_quadrature_points (numbers::invalid_unsigned_int),
quadrature_points (),
weights ()
{
default:
Assert (false, ExcInternalError());
}
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
default:
Assert (false, ExcInternalError());
}
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
QProjector<dim>::DataSetDescriptor::
DataSetDescriptor ()
:
- dataset_offset (deal_II_numbers::invalid_unsigned_int)
+ dataset_offset (numbers::invalid_unsigned_int)
{}
for (unsigned int i=1; i<=m; ++i)
{
- long double z = std::cos(deal_II_numbers::PI * (i-.25)/(n+.5));
+ long double z = std::cos(numbers::PI * (i-.25)/(n+.5));
long double pp;
long double p1, p2, p3;
{
// if second argument is invalid, then do
// not pad the resulting string at all
- if (digits == deal_II_numbers::invalid_unsigned_int)
+ if (digits == numbers::invalid_unsigned_int)
return int_to_string (i, needed_digits(i));
else
{
Assert (false, ExcNotImplemented());
- return std::make_pair (-1, deal_II_numbers::invalid_unsigned_int);
+ return std::make_pair (-1, numbers::invalid_unsigned_int);
}
}
else
- return std::make_pair (-1, deal_II_numbers::invalid_unsigned_int);
+ return std::make_pair (-1, numbers::invalid_unsigned_int);
}
DoFAccessor<structdim,DH>::DoFAccessor ()
:
DoFObjectAccessor_Inheritance<structdim, DH::dimension>::BaseClass (0,
- deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int),
+ numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int),
dof_handler(0)
{
Assert (false, ExcInvalidObject());
// which line in the constraint matrix
// handles this index
std::vector<unsigned int> distribute (sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = c;
const unsigned int n_rows = sparsity.n_rows();
for (unsigned int row=0; row<n_rows; ++row)
{
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
// regular line. loop over cols
{
for (typename SparseMatrix<number>::iterator
Assert (column != SparsityPattern::invalid_entry,
ExcMatrixNotClosed());
- if (distribute[column] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] != numbers::invalid_unsigned_int)
// distribute entry at
// regular row @p row
// and irregular column
Assert (column != SparsityPattern::invalid_entry,
ExcMatrixNotClosed());
- if (distribute[column] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] == numbers::invalid_unsigned_int)
// distribute entry at
// irregular row
// @p row and regular
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute (sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = c;
block_index = index_mapping.global_to_local(row);
const unsigned int block_row = block_index.first;
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
// regular line. loop over
// all columns and see
// whether this column must
const unsigned int global_col
= index_mapping.local_to_global(block_col,entry->column());
- if (distribute[global_col] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] != numbers::invalid_unsigned_int)
// distribute entry at
// regular row @p row
// and irregular column
= index_mapping.local_to_global (block_col, entry->column());
if (distribute[global_col] ==
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
// distribute
// entry at
// irregular
* certain value, but rather take
* its symbolic name.
*/
- static const unsigned int invalid_dof_index = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int invalid_dof_index = numbers::invalid_unsigned_int;
/**
* The default index of the
if (first_block_of_base_table[i] <= index)
return std::pair<unsigned int, unsigned int>(static_cast<unsigned int> (i),
index - first_block_of_base_table[i]);
- return std::make_pair(deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int);
+ return std::make_pair(numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int);
}
const unsigned int n_components,
const unsigned int degree,
const Conformity conformity = unknown,
- const unsigned int n_blocks = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int n_blocks = numbers::invalid_unsigned_int);
/**
* Number of dofs per vertex.
default:
Assert (false, ExcInternalError());
}
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
* face or subface number is
* invalid.
*/
- static const unsigned int invalid_face_number = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int invalid_face_number = numbers::invalid_unsigned_int;
/**
* Pairs of multiplicity and
* face or subface number is
* invalid.
*/
- static const unsigned int invalid_face_number = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int invalid_face_number = numbers::invalid_unsigned_int;
};
/*@}*/
* class of parallel edges
* the edge falls in when
* oriented.
- * deal_II_numbers::invalid_unsigned_int
+ * numbers::invalid_unsigned_int
* means not yet
* decided. This is also the
* default value after
CellAccessor<1>::face_index (const unsigned int) const
{
Assert (false, ExcImpossibleInDim(1));
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
* certain value, but rather take
* its symbolic name.
*/
- static const unsigned int invalid_dof_index = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int invalid_dof_index = numbers::invalid_unsigned_int;
/**
* The default index of the
* corresponds to an invalid
* value.
*/
- static const unsigned int default_fe_index = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int default_fe_index = numbers::invalid_unsigned_int;
/**
Assert (vertex_index < vertex_dofs_offsets.size(),
ExcIndexRange (vertex_index, 0, vertex_dofs_offsets.size()));
Assert (vertex_dofs_offsets[vertex_index] !=
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
ExcMessage ("This vertex is unused and has no DoFs associated with it"));
// hop along the list of index
const unsigned int this_fe_index = *pointer;
- Assert (this_fe_index != deal_II_numbers::invalid_unsigned_int,
+ Assert (this_fe_index != numbers::invalid_unsigned_int,
ExcInternalError());
Assert (this_fe_index < finite_elements->size(),
ExcInternalError());
Assert (fe_index < finite_elements->size(),
ExcInternalError());
Assert (vertex_dofs_offsets[vertex_index] !=
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
ExcMessage ("This vertex is unused and has no DoFs associated with it"));
// hop along the list of index
const unsigned int this_fe_index = *pointer;
- Assert (this_fe_index != deal_II_numbers::invalid_unsigned_int,
+ Assert (this_fe_index != numbers::invalid_unsigned_int,
ExcInternalError());
Assert (this_fe_index < finite_elements->size(),
ExcInternalError());
"this DoFHandler"));
// if this vertex is unused, return 0
- if (vertex_dofs_offsets[vertex_index] == deal_II_numbers::invalid_unsigned_int)
+ if (vertex_dofs_offsets[vertex_index] == numbers::invalid_unsigned_int)
return 0;
// hop along the list of index
const unsigned int starting_offset = vertex_dofs_offsets[vertex_index];
const unsigned int *pointer = &vertex_dofs[starting_offset];
- Assert (*pointer != deal_II_numbers::invalid_unsigned_int,
+ Assert (*pointer != numbers::invalid_unsigned_int,
ExcInternalError());
unsigned int counter = 0;
const unsigned int this_fe_index = *pointer;
- if (this_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (this_fe_index == numbers::invalid_unsigned_int)
return counter;
else
{
// make sure we don't ask on
// unused vertices
Assert (vertex_dofs_offsets[vertex_index] !=
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
ExcInternalError());
// hop along the list of index
const unsigned int starting_offset = vertex_dofs_offsets[vertex_index];
const unsigned int *pointer = &vertex_dofs[starting_offset];
- Assert (*pointer != deal_II_numbers::invalid_unsigned_int,
+ Assert (*pointer != numbers::invalid_unsigned_int,
ExcInternalError());
unsigned int counter = 0;
if (counter == n)
return this_fe_index;
- Assert (this_fe_index != deal_II_numbers::invalid_unsigned_int,
+ Assert (this_fe_index != numbers::invalid_unsigned_int,
ExcInternalError());
pointer += (*finite_elements)[this_fe_index].dofs_per_vertex + 1;
// make sure we don't ask on
// unused vertices
Assert (vertex_dofs_offsets[vertex_index] !=
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
ExcInternalError());
// hop along the list of index
const unsigned int starting_offset = vertex_dofs_offsets[vertex_index];
const unsigned int *pointer = &vertex_dofs[starting_offset];
- Assert (*pointer != deal_II_numbers::invalid_unsigned_int,
+ Assert (*pointer != numbers::invalid_unsigned_int,
ExcInternalError());
while (true)
Assert (this_fe_index < finite_elements->size(),
ExcInternalError());
- if (this_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (this_fe_index == numbers::invalid_unsigned_int)
return false;
else
if (this_fe_index == fe_index)
// make sure we are on an
// object for which DoFs have
// been allocated at all
- Assert (dof_offsets[obj_index] != deal_II_numbers::invalid_unsigned_int,
+ Assert (dof_offsets[obj_index] != numbers::invalid_unsigned_int,
ExcMessage ("You are trying to access degree of freedom "
"information for an object on which no such "
"information is available"));
const unsigned int *pointer = &dofs[starting_offset];
while (true)
{
- Assert (*pointer != deal_II_numbers::invalid_unsigned_int,
+ Assert (*pointer != numbers::invalid_unsigned_int,
ExcInternalError());
if (*pointer == fe_index)
return *(pointer + 1 + local_index);
// make sure we are on an
// object for which DoFs have
// been allocated at all
- Assert (dof_offsets[obj_index] != deal_II_numbers::invalid_unsigned_int,
+ Assert (dof_offsets[obj_index] != numbers::invalid_unsigned_int,
ExcMessage ("You are trying to access degree of freedom "
"information for an object on which no such "
"information is available"));
unsigned int *pointer = &dofs[starting_offset];
while (true)
{
- Assert (*pointer != deal_II_numbers::invalid_unsigned_int,
+ Assert (*pointer != numbers::invalid_unsigned_int,
ExcInternalError());
if (*pointer == fe_index)
{
// make sure we are on an
// object for which DoFs have
// been allocated at all
- if (dof_offsets[obj_index] == deal_II_numbers::invalid_unsigned_int)
+ if (dof_offsets[obj_index] == numbers::invalid_unsigned_int)
return 0;
// if we are on a cell, then the
unsigned int counter = 0;
while (true)
{
- if (*pointer == deal_II_numbers::invalid_unsigned_int)
+ if (*pointer == numbers::invalid_unsigned_int)
// end of list reached
return counter;
else
// make sure we are on an
// object for which DoFs have
// been allocated at all
- Assert (dof_offsets[obj_index] != deal_II_numbers::invalid_unsigned_int,
+ Assert (dof_offsets[obj_index] != numbers::invalid_unsigned_int,
ExcMessage ("You are trying to access degree of freedom "
"information for an object on which no such "
"information is available"));
unsigned int counter = 0;
while (true)
{
- Assert (*pointer != deal_II_numbers::invalid_unsigned_int,
+ Assert (*pointer != numbers::invalid_unsigned_int,
ExcInternalError());
const unsigned int fe_index = *pointer;
// make sure we are on an
// object for which DoFs have
// been allocated at all
- Assert (dof_offsets[obj_index] != deal_II_numbers::invalid_unsigned_int,
+ Assert (dof_offsets[obj_index] != numbers::invalid_unsigned_int,
ExcMessage ("You are trying to access degree of freedom "
"information for an object on which no such "
"information is available"));
const unsigned int *pointer = &dofs[starting_offset];
while (true)
{
- if (*pointer == deal_II_numbers::invalid_unsigned_int)
+ if (*pointer == numbers::invalid_unsigned_int)
// end of list reached
return false;
else
*/
void
reinit (const typename hp::DoFHandler<dim>::cell_iterator &cell,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
*/
void
reinit (const typename dealii::DoFHandler<dim>::cell_iterator &cell,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
*/
void
reinit (const typename MGDoFHandler<dim>::cell_iterator &cell,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
*/
void
reinit (const typename Triangulation<dim>::cell_iterator &cell,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
};
void
reinit (const typename hp::DoFHandler<dim>::cell_iterator &cell,
const unsigned int face_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
void
reinit (const typename dealii::DoFHandler<dim>::cell_iterator &cell,
const unsigned int face_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
void
reinit (const typename MGDoFHandler<dim>::cell_iterator &cell,
const unsigned int face_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
void
reinit (const typename Triangulation<dim>::cell_iterator &cell,
const unsigned int face_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
};
reinit (const typename hp::DoFHandler<dim>::cell_iterator &cell,
const unsigned int face_no,
const unsigned int subface_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
reinit (const typename dealii::DoFHandler<dim>::cell_iterator &cell,
const unsigned int face_no,
const unsigned int subface_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
reinit (const typename MGDoFHandler<dim>::cell_iterator &cell,
const unsigned int face_no,
const unsigned int subface_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
/**
* Like the previous function,
reinit (const typename Triangulation<dim>::cell_iterator &cell,
const unsigned int face_no,
const unsigned int subface_no,
- const unsigned int q_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int mapping_index = deal_II_numbers::invalid_unsigned_int,
- const unsigned int fe_index = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int q_index = numbers::invalid_unsigned_int,
+ const unsigned int mapping_index = numbers::invalid_unsigned_int,
+ const unsigned int fe_index = numbers::invalid_unsigned_int);
};
}
* component. Handle with care!
*/
void select (const unsigned int component,
- const unsigned int mg_component = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int mg_component = numbers::invalid_unsigned_int);
virtual void prolongate (const unsigned int to_level,
Vector<number> &dst,
const unsigned int mg_component)
{
selected_component = component;
- mg_selected_component = (mg_component == deal_II_numbers::invalid_unsigned_int)
+ mg_selected_component = (mg_component == numbers::invalid_unsigned_int)
? component
: mg_component;
}
* indicates whether we shall compute
* indicators for all cells (in case its
* value is the default,
- * <tt>deal_II_numbers::invalid_unsigned_int</tt>),
+ * <tt>numbers::invalid_unsigned_int</tt>),
* or only for the cells belonging to a
* certain subdomain with the given
* indicator. The latter case is used for
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Calls the @p estimate
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Same function as above, but
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Calls the @p estimate
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<dim> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Calls the @p estimate
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Same function as above, but
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Calls the @p estimate
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
const std::vector<bool> &component_mask = std::vector<bool>(),
const Function<1> *coefficients = 0,
const unsigned int n_threads = multithread_info.n_default_threads,
- const unsigned int subdomain_id = deal_II_numbers::invalid_unsigned_int,
- const unsigned int material_id = deal_II_numbers::invalid_unsigned_int);
+ const unsigned int subdomain_id = numbers::invalid_unsigned_int,
+ const unsigned int material_id = numbers::invalid_unsigned_int);
/**
* Exception
:
i+4*fe.dofs_per_vertex+8*fe.dofs_per_line))
:
- deal_II_numbers::invalid_unsigned_int)));
+ numbers::invalid_unsigned_int)));
Assert (cell_i < fe.dofs_per_cell, ExcInternalError());
// make sure
}
// append result of this cell
// to the end of the vector
- Assert (deal_II_numbers::is_finite(diff), ExcInternalError());
+ Assert (numbers::is_finite(diff), ExcInternalError());
difference(index) = diff;
}
}
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute(sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = c;
const unsigned int n_rows = sparsity.n_rows();
for (unsigned int row=0; row<n_rows; ++row)
{
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
{
// regular line. loop over cols all
// valid cols. note that this
// added ones only takes two
// comparisons (column index valid,
// distribute[column] necessarily
- // ==deal_II_numbers::invalid_unsigned_int),
+ // ==numbers::invalid_unsigned_int),
// it is cheaper to not do so and
// run right until the end of the
// line
{
const unsigned int column = entry->column();
- if (distribute[column] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] != numbers::invalid_unsigned_int)
{
// distribute entry
// at regular row
(entry != sparsity.end(row)) && entry->is_valid_entry(); ++entry)
{
const unsigned int column = entry->column();
- if (distribute[column] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] == numbers::invalid_unsigned_int)
// distribute entry at irregular
// row @p{row} and regular column
// sparsity.colnums[j]
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute(sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = c;
const unsigned int n_rows = sparsity.n_rows();
for (unsigned int row=0; row<n_rows; ++row)
{
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
// regular line. loop over
// cols. note that as we
// proceed to distribute
{
const unsigned int column = sparsity.column_number(row,j);
- if (distribute[column] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] != numbers::invalid_unsigned_int)
{
// distribute entry
// at regular row
{
const unsigned int column = sparsity.column_number(row,j);
- if (distribute[column] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] == numbers::invalid_unsigned_int)
// distribute entry at irregular
// row @p{row} and regular column
// sparsity.colnums[j]
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute(sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = c;
const unsigned int n_rows = sparsity.n_rows();
for (unsigned int row=0; row<n_rows; ++row)
{
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
{
// regular line. loop over
// cols. note that as we proceed to
{
const unsigned int column = *col_num;
- if (distribute[column] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] != numbers::invalid_unsigned_int)
{
// row
unsigned int old_rowlength = sparsity.row_length(row);
{
const unsigned int column = *col_num;
- if (distribute[column] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[column] == numbers::invalid_unsigned_int)
// distribute entry at irregular
// row @p{row} and regular column
// sparsity.colnums[j]
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute (sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = c;
block_index = index_mapping.global_to_local(row);
const unsigned int block_row = block_index.first;
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
// regular line. loop over
// all columns and see
// whether this column must
const unsigned int global_col
= index_mapping.local_to_global(block_col, entry->column());
- if (distribute[global_col] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] != numbers::invalid_unsigned_int)
// distribute entry at regular
// row @p{row} and irregular column
// global_col
const unsigned int global_col
= index_mapping.local_to_global (block_col, entry->column());
- if (distribute[global_col] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] == numbers::invalid_unsigned_int)
// distribute entry at irregular
// row @p{row} and regular column
// global_col.
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute (sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = static_cast<signed int>(c);
const unsigned int block_row = block_index.first;
const unsigned int local_row = block_index.second;
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
// regular line. loop over
// all columns and see
// whether this column must
= index_mapping.local_to_global(block_col,
block_sparsity.column_number(local_row,j));
- if (distribute[global_col] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] != numbers::invalid_unsigned_int)
// distribute entry at regular
// row @p{row} and irregular column
// global_col
= index_mapping.local_to_global (block_col,
block_sparsity.column_number(local_row,j));
- if (distribute[global_col] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] == numbers::invalid_unsigned_int)
// distribute entry at irregular
// row @p{row} and regular column
// global_col.
// store for each index whether it must be
// distributed or not. If entry is
- // deal_II_numbers::invalid_unsigned_int,
+ // numbers::invalid_unsigned_int,
// no distribution is necessary.
// otherwise, the number states which line
// in the constraint matrix handles this
// index
std::vector<unsigned int> distribute (sparsity.n_rows(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
for (unsigned int c=0; c<lines.size(); ++c)
distribute[lines[c].line] = static_cast<signed int>(c);
const unsigned int block_row = block_index.first;
const unsigned int local_row = block_index.second;
- if (distribute[row] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[row] == numbers::invalid_unsigned_int)
// regular line. loop over
// all columns and see
// whether this column must
const unsigned int global_col
= index_mapping.local_to_global(block_col, *j);
- if (distribute[global_col] != deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] != numbers::invalid_unsigned_int)
// distribute entry at regular
// row @p{row} and irregular column
// global_col
const unsigned int global_col
= index_mapping.local_to_global (block_col, *j);
- if (distribute[global_col] == deal_II_numbers::invalid_unsigned_int)
+ if (distribute[global_col] == numbers::invalid_unsigned_int)
// distribute entry at irregular
// row @p{row} and regular column
// global_col.
// same subdomain, then they will be in
// this order also after reordering
std::fill (new_dof_indices.begin(), new_dof_indices.end(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
unsigned int next_free_index = 0;
for (unsigned int subdomain=0; subdomain<n_subdomains; ++subdomain)
for (unsigned int i=0; i<n_dofs; ++i)
if (subdomain_association[i] == subdomain)
{
- Assert (new_dof_indices[i] == deal_II_numbers::invalid_unsigned_int,
+ Assert (new_dof_indices[i] == numbers::invalid_unsigned_int,
ExcInternalError());
new_dof_indices[i] = next_free_index;
++next_free_index;
// we should have numbered all dofs
Assert (next_free_index == n_dofs, ExcInternalError());
Assert (std::find (new_dof_indices.begin(), new_dof_indices.end(),
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
== new_dof_indices.end(),
ExcInternalError());
}
:
i+4*fe.dofs_per_vertex+8*fe.dofs_per_line))
:
- deal_II_numbers::invalid_unsigned_int)));
+ 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]
// preset all values by an invalid value
std::fill_n (subdomain_association.begin(), dof_handler.n_dofs(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
std::vector<unsigned int> local_dof_indices;
local_dof_indices.reserve (max_dofs_per_cell(dof_handler));
Assert (std::find (subdomain_association.begin(),
subdomain_association.end(),
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
== subdomain_association.end(),
ExcInternalError());
}
const unsigned int parameter_dof = weight_mapping[i];
// if this global dof is a
// parameter
- if (parameter_dof != deal_II_numbers::invalid_unsigned_int)
+ if (parameter_dof != 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> (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int);
+ return TableIndices<2> (numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int);
}
GeometryInfo<dim>::quads_per_cell * dofs_per_quad +
GeometryInfo<dim>::hexes_per_cell * dofs_per_hex),
components(n_components),
- blocks(n_blocks == deal_II_numbers::invalid_unsigned_int
+ blocks(n_blocks == numbers::invalid_unsigned_int
? n_components : n_blocks),
degree(degree),
conforming_space(conformity)
if (i*i == N)
return i;
Assert (false, ExcInternalError());
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
if (i*i*i == N)
return i;
Assert (false, ExcInternalError());
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
if (i*i == N)
return i;
Assert (false, ExcInternalError());
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
if (i*i*i == N)
return i;
Assert (false, ExcInternalError());
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
// non-primitive shape functions,
// have a special invalid index.
const std::pair<unsigned int, unsigned int>
- non_primitive_index (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int);
+ non_primitive_index (numbers::invalid_unsigned_int,
+ 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 (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int);
+ non_primitive_index (numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int);
// 1. Vertices
unsigned int total_index = 0;
// Choose a quadrature rule
// Gauss is exact up to degree 2n-1
const unsigned int degree = std::max(fe1.tensor_degree(), fe2.tensor_degree());
- Assert (degree != deal_II_numbers::invalid_unsigned_int,
+ Assert (degree != numbers::invalid_unsigned_int,
ExcNotImplemented());
QGauss<dim> quadrature(degree+1);
std::vector<Point<dim> > vertices (4*n_cells);
- double beta_step=n_rotations*deal_II_numbers::PI/2.0/n_cells;
- double alpha_step=2.0*deal_II_numbers::PI/n_cells;
+ double beta_step=n_rotations*numbers::PI/2.0/n_cells;
+ double alpha_step=2.0*numbers::PI/n_cells;
for (unsigned int i=0; i<n_cells; ++i)
for (unsigned int j=0; j<4; ++j)
{
- vertices[4*i+j][0]=R*std::cos(i*alpha_step)+r*std::cos(i*beta_step+j*deal_II_numbers::PI/2.0)*std::cos(i*alpha_step);
- vertices[4*i+j][1]=R*std::sin(i*alpha_step)+r*std::cos(i*beta_step+j*deal_II_numbers::PI/2.0)*std::sin(i*alpha_step);
- vertices[4*i+j][2]=r*std::sin(i*beta_step+j*deal_II_numbers::PI/2.0);
+ vertices[4*i+j][0]=R*std::cos(i*alpha_step)+r*std::cos(i*beta_step+j*numbers::PI/2.0)*std::cos(i*alpha_step);
+ vertices[4*i+j][1]=R*std::sin(i*alpha_step)+r*std::cos(i*beta_step+j*numbers::PI/2.0)*std::sin(i*alpha_step);
+ vertices[4*i+j][2]=r*std::sin(i*beta_step+j*numbers::PI/2.0);
}
unsigned int offset=0;
Assert ((inner_radius > 0) && (inner_radius < outer_radius),
ExcInvalidRadii ());
- const double pi = deal_II_numbers::PI;
+ const double pi = numbers::PI;
// determine the number of cells
// for the grid. if not provided by
Assert ((inner_radius > 0) && (inner_radius < outer_radius),
ExcInvalidRadii ());
- const double pi = deal_II_numbers::PI;
+ const double pi = numbers::PI;
// determine the number of cells
// for the grid. if not provided by
// the user determine it such that
Assert ((inner_radius > 0) && (inner_radius < outer_radius),
ExcInvalidRadii ());
- const double pi = deal_II_numbers::PI;
+ const double pi = numbers::PI;
// determine the number of cells
// for the grid. if not provided by
{
// no such vertex index
AssertThrow (false, ExcInvalidVertexIndex(cell, cells.back().vertices[i]));
- cells.back().vertices[i] = deal_II_numbers::invalid_unsigned_int;
+ cells.back().vertices[i] = numbers::invalid_unsigned_int;
};
}
else
ExcInvalidVertexIndex(cell,
subcelldata.boundary_lines.back().vertices[i]));
subcelldata.boundary_lines.back().vertices[i]
- = deal_II_numbers::invalid_unsigned_int;
+ = numbers::invalid_unsigned_int;
};
}
else
ExcInvalidVertexIndex(cell,
subcelldata.boundary_quads.back().vertices[i]));
subcelldata.boundary_quads.back().vertices[i] =
- deal_II_numbers::invalid_unsigned_int;
+ numbers::invalid_unsigned_int;
};
}
{
// no such vertex index
AssertThrow (false, ExcInvalidVertexIndex(cell, cells.back().vertices[i]));
- cells.back().vertices[i] = deal_II_numbers::invalid_unsigned_int;
+ cells.back().vertices[i] = numbers::invalid_unsigned_int;
};
}
else
ExcInvalidVertexIndex(cell,
subcelldata.boundary_lines.back().vertices[i]));
subcelldata.boundary_lines.back().vertices[i] =
- deal_II_numbers::invalid_unsigned_int;
+ numbers::invalid_unsigned_int;
};
}
else
ExcInvalidVertexIndex(cell,
subcelldata.boundary_quads.back().vertices[i]));
subcelldata.boundary_quads.back().vertices[i] =
- deal_II_numbers::invalid_unsigned_int;
+ numbers::invalid_unsigned_int;
};
}
// is in direction of the viewer, but
// I am too tired at present to fix
// this
- const double pi = deal_II_numbers::PI;
+ const double pi = numbers::PI;
const double z_angle = eps_flags_3.azimut_angle;
const double turn_angle = eps_flags_3.turn_angle;
const Point<dim> view_direction(-std::sin(z_angle * 2.*pi / 360.) * std::sin(turn_angle * 2.*pi / 360.),
const unsigned int initv1)
:
v0(initv0), v1(initv1),
- 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),
+ Q0(numbers::invalid_unsigned_int),
+ Q1(numbers::invalid_unsigned_int),
+ lsn0(numbers::invalid_unsigned_int),
+ lsn1(numbers::invalid_unsigned_int),
Oriented(false)
{}
for (unsigned int i = 0;i<4;++i)
{
MSide &ss = sides[(*it).side[i]];
- if (ss.Q0 == deal_II_numbers::invalid_unsigned_int)
+ if (ss.Q0 == numbers::invalid_unsigned_int)
{
ss.Q0 = qctr;
ss.lsn0 = i;
}
- else if (ss.Q1 == deal_II_numbers::invalid_unsigned_int)
+ else if (ss.Q1 == numbers::invalid_unsigned_int)
{
ss.Q1 = qctr;
ss.lsn1 = i;
lsn = s.lsn0;
}
- if (opquad != deal_II_numbers::invalid_unsigned_int)
+ if (opquad != numbers::invalid_unsigned_int)
{
qnum = opquad;
return true;
const unsigned int n1)
:
orientation_flag (unoriented_edge),
- group (deal_II_numbers::invalid_unsigned_int)
+ group (numbers::invalid_unsigned_int)
{
nodes[0] = n0;
nodes[1] = n1;
{
for (unsigned int i=0; i<GeometryInfo<3>::lines_per_cell; ++i)
{
- edges[i] = deal_II_numbers::invalid_unsigned_int;
+ edges[i] = numbers::invalid_unsigned_int;
local_orientation_flags[i] = forward_edge;
}
for (unsigned int i=0; i<GeometryInfo<3>::vertices_per_cell; ++i)
- nodes[i] = deal_II_numbers::invalid_unsigned_int;
+ nodes[i] = numbers::invalid_unsigned_int;
waiting_to_be_processed = false;
}
// Here the number of
// incoming edges is
// tallied for each node.
- unsigned int perm_num = deal_II_numbers::invalid_unsigned_int;
+ unsigned int perm_num = numbers::invalid_unsigned_int;
for (unsigned int node_num=0; node_num<8; ++node_num)
{
// The local edge
if (total == 3)
{
- Assert (perm_num == deal_II_numbers::invalid_unsigned_int,
+ Assert (perm_num == 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 != deal_II_numbers::invalid_unsigned_int,
+ Assert (perm_num != numbers::invalid_unsigned_int,
ExcGridOrientError("No node having 3 incoming edges found in curent hex."));
// So use the apropriate
// then renumber the vertices that
// are actually used in the same
// order as they were beforehand
- const unsigned int invalid_vertex = deal_II_numbers::invalid_unsigned_int;
+ const unsigned int invalid_vertex = 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)
CellAccessor<1>::neighbor_of_coarser_neighbor (const unsigned int) const
{
Assert(false, ExcImpossibleInDim(1));
- return std::make_pair (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int);
+ return std::make_pair (numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int);
}
// since then we did not find
// our way back...
Assert (false, ExcInternalError());
- return deal_II_numbers::invalid_unsigned_int;
+ return numbers::invalid_unsigned_int;
}
}
// since then we did not find
// our way back...
Assert (false, ExcInternalError());
- return std::make_pair (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int);
+ return std::make_pair (numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int);
}
identities[i].second);
Assert ((new_dof_indices[higher_dof_index] ==
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
||
(new_dof_indices[higher_dof_index] ==
lower_dof_index),
// slave to
// master
if (new_dof_indices[master_dof_index] !=
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
{
Assert (new_dof_indices[new_dof_indices[master_dof_index]] ==
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
ExcInternalError());
new_dof_indices[slave_dof_index]
else
{
Assert ((new_dof_indices[master_dof_index] ==
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
||
(new_dof_indices[slave_dof_index] ==
master_dof_index),
= line->dof_index (identities[i].second, other_fe_index);
Assert ((new_dof_indices[master_dof_index] ==
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
||
(new_dof_indices[slave_dof_index] ==
master_dof_index),
= quad->dof_index (identities[i].second, other_fe_index);
Assert ((new_dof_indices[master_dof_index] ==
- deal_II_numbers::invalid_unsigned_int)
+ numbers::invalid_unsigned_int)
||
(new_dof_indices[slave_dof_index] ==
master_dof_index),
// lower-dimensional objects
// where elements come together
std::vector<unsigned int>
- constrained_indices (used_dofs, deal_II_numbers::invalid_unsigned_int);
+ constrained_indices (used_dofs, numbers::invalid_unsigned_int);
compute_vertex_dof_identities (constrained_indices);
compute_line_dof_identities (constrained_indices);
compute_quad_dof_identities (constrained_indices);
// new numbers to those which are
// not constrained
std::vector<unsigned int>
- new_dof_indices (used_dofs, deal_II_numbers::invalid_unsigned_int);
+ new_dof_indices (used_dofs, numbers::invalid_unsigned_int);
unsigned int next_free_dof = 0;
for (unsigned int i=0; i<used_dofs; ++i)
- if (constrained_indices[i] == deal_II_numbers::invalid_unsigned_int)
+ if (constrained_indices[i] == numbers::invalid_unsigned_int)
{
new_dof_indices[i] = next_free_dof;
++next_free_dof;
// are constrained and record the
// new dof number for those:
for (unsigned int i=0; i<used_dofs; ++i)
- if (constrained_indices[i] != deal_II_numbers::invalid_unsigned_int)
+ if (constrained_indices[i] != numbers::invalid_unsigned_int)
{
Assert (new_dof_indices[constrained_indices[i]] !=
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
ExcInternalError());
new_dof_indices[i] = new_dof_indices[constrained_indices[i]];
for (unsigned int i=0; i<used_dofs; ++i)
{
- Assert (new_dof_indices[i] != deal_II_numbers::invalid_unsigned_int,
+ Assert (new_dof_indices[i] != numbers::invalid_unsigned_int,
ExcInternalError());
Assert (new_dof_indices[i] < next_free_dof,
ExcInternalError());
// line_dofs_offsets field
faces->lines.dof_offsets
.resize (tria->n_raw_lines(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
unsigned int line_slots_needed = 0;
for (unsigned int line=0; line<tria->n_raw_lines(); ++line)
}
// finally place the end
// marker
- faces->lines.dofs[pointer] = deal_II_numbers::invalid_unsigned_int;
+ faces->lines.dofs[pointer] = numbers::invalid_unsigned_int;
}
}
// already fill the
// vertex_dofs_offsets field
vertex_dofs_offsets.resize (tria->n_vertices(),
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
unsigned int vertex_slots_needed = 0;
for (unsigned int v=0; v<tria->n_vertices(); ++v)
}
// finally place the end
// marker
- vertex_dofs[pointer] = deal_II_numbers::invalid_unsigned_int;
+ vertex_dofs[pointer] = numbers::invalid_unsigned_int;
}
}
fe_values_table (fe_collection.size(),
mapping_collection.size(),
q_collection.size()),
- present_fe_values_index (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int),
+ present_fe_values_index (numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int),
update_flags (update_flags)
{}
fe_values_table (fe_collection.size(),
1,
q_collection.size()),
- present_fe_values_index (deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int,
- deal_II_numbers::invalid_unsigned_int),
+ present_fe_values_index (numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int),
update_flags (update_flags)
{}
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
{
if (this->q_collection.size() > 1)
real_q_index = cell->active_fe_index();
real_q_index = 0;
}
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
{
if (this->mapping_collection->size() > 1)
real_mapping_index = cell->active_fe_index();
real_mapping_index = 0;
}
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = cell->active_fe_index();
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
{
if (this->q_collection.size() > 1)
real_q_index = cell->active_fe_index();
real_q_index = 0;
}
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
{
if (this->mapping_collection->size() > 1)
real_mapping_index = cell->active_fe_index();
real_mapping_index = 0;
}
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = cell->active_fe_index();
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
{
if (this->q_collection.size() > 1)
real_q_index = cell->active_fe_index();
real_q_index = 0;
}
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
{
if (this->mapping_collection->size() > 1)
real_mapping_index = cell->active_fe_index();
real_mapping_index = 0;
}
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = cell->active_fe_index();
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
real_mapping_index = mapping_index,
real_fe_index = fe_index;
- if (real_q_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_q_index == numbers::invalid_unsigned_int)
real_q_index = 0;
- if (real_mapping_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_mapping_index == numbers::invalid_unsigned_int)
real_mapping_index = 0;
- if (real_fe_index == deal_II_numbers::invalid_unsigned_int)
+ if (real_fe_index == numbers::invalid_unsigned_int)
real_fe_index = 0;
// some checks
MGDoFAccessor<structdim, dim>::MGDoFAccessor ()
:
BaseClass (0,
- static_cast<int>(deal_II_numbers::invalid_unsigned_int),
- static_cast<int>(deal_II_numbers::invalid_unsigned_int),
+ static_cast<int>(numbers::invalid_unsigned_int),
+ static_cast<int>(numbers::invalid_unsigned_int),
0),
mg_dof_handler(0)
{
template <int dim>
MGDoFHandler<dim>::MGVertexDoFs::MGVertexDoFs ()
:
- coarsest_level (deal_II_numbers::invalid_unsigned_int),
+ coarsest_level (numbers::invalid_unsigned_int),
finest_level (0),
indices (0)
{}
:
i+4*fe.dofs_per_vertex+8*fe.dofs_per_line))
:
- deal_II_numbers::invalid_unsigned_int)));
+ numbers::invalid_unsigned_int)));
Assert (cell_i < fe.dofs_per_cell, ExcInternalError());
// make sure
if (selected[i])
mg_block[i] = n_mg_blocks++;
else
- mg_block[i] = deal_II_numbers::invalid_unsigned_int;
+ mg_block[i] = numbers::invalid_unsigned_int;
// Compute the lengths of all blocks
sizes.resize(n_levels);
std::distance (this->dofs->begin_active(),
active_cell_iterator (cell))
:
- deal_II_numbers::invalid_unsigned_int);
+ numbers::invalid_unsigned_int);
// get first cell in this thread
std::vector<Point<DH::dimension+1> > angle_directions (n_patches_per_circle+1);
for (unsigned int i=0; i<=n_patches_per_circle; ++i)
{
- angle_directions[i][DH::dimension-1] = std::cos(2*deal_II_numbers::PI *
+ angle_directions[i][DH::dimension-1] = std::cos(2*numbers::PI *
i/n_patches_per_circle);
- angle_directions[i][DH::dimension] = std::sin(2*deal_II_numbers::PI *
+ angle_directions[i][DH::dimension] = std::sin(2*numbers::PI *
i/n_patches_per_circle);
};
{
const double theta = std::acos(XX) / 3.;
EE[0] = am + R*std::cos(theta);
- EE[1] = am + R*std::cos(theta + 2./3.*deal_II_numbers::PI);
- EE[2] = am + R*std::cos(theta + 4./3.*deal_II_numbers::PI);
+ EE[1] = am + R*std::cos(theta + 2./3.*numbers::PI);
+ EE[2] = am + R*std::cos(theta + 4./3.*numbers::PI);
};
};
typename DH::active_cell_iterator cell = dof_handler.begin_active();
for (unsigned int cell_index=0; cell != dof_handler.end();
++cell, ++cell_index)
- if (((subdomain_id == deal_II_numbers::invalid_unsigned_int)
+ if (((subdomain_id == numbers::invalid_unsigned_int)
||
(cell->subdomain_id() == subdomain_id))
&&
- ((material_id == deal_II_numbers::invalid_unsigned_int)
+ ((material_id == numbers::invalid_unsigned_int)
||
(cell->material_id() == material_id)))
{
// material_id), or if one of the
// neighbors behind the face is on
// the subdomain we care for
- if ( ! ( ((subdomain_id == deal_II_numbers::invalid_unsigned_int)
+ if ( ! ( ((subdomain_id == numbers::invalid_unsigned_int)
||
(cell->subdomain_id() == subdomain_id))
&&
- ((material_id == deal_II_numbers::invalid_unsigned_int)
+ ((material_id == numbers::invalid_unsigned_int)
||
(cell->material_id() == material_id))) )
{
if (face->has_children() == false)
care_for_cell |= ((cell->neighbor(face_no)->subdomain_id()
== subdomain_id) ||
- (subdomain_id == deal_II_numbers::invalid_unsigned_int))
+ (subdomain_id == numbers::invalid_unsigned_int))
&&
((cell->neighbor(face_no)->material_id()
== material_id) ||
- (material_id == deal_II_numbers::invalid_unsigned_int));
+ (material_id == numbers::invalid_unsigned_int));
else
{
for (unsigned int sf=0; sf<face->n_children(); ++sf)
->subdomain_id() == subdomain_id)
&&
(material_id ==
- deal_II_numbers::invalid_unsigned_int))
+ numbers::invalid_unsigned_int))
||
((cell->neighbor_child_on_subface(face_no,sf)
->material_id() == material_id)
&&
(subdomain_id ==
- deal_II_numbers::invalid_unsigned_int)))
+ numbers::invalid_unsigned_int)))
{
care_for_cell = true;
break;
for (typename DH::active_cell_iterator cell=dof_handler.begin_active();
cell!=dof_handler.end();
++cell, ++present_cell)
- if ( ((subdomain_id == deal_II_numbers::invalid_unsigned_int)
+ if ( ((subdomain_id == numbers::invalid_unsigned_int)
||
(cell->subdomain_id() == subdomain_id))
&&
- ((material_id == deal_II_numbers::invalid_unsigned_int)
+ ((material_id == numbers::invalid_unsigned_int)
||
(cell->material_id() == material_id)))
{
Threads::ThreadMutex::ScopedLock lock (mutex);
for (unsigned int i=0; i<dofs_per_cell; ++i)
{
- if (dof_is_on_face[i] && dof_to_boundary_mapping[dofs[i]] != deal_II_numbers::invalid_unsigned_int)
+ if (dof_is_on_face[i] && dof_to_boundary_mapping[dofs[i]] != numbers::invalid_unsigned_int)
{
for (unsigned int j=0; j<dofs_per_cell; ++j)
- if (dof_is_on_face[j] && dof_to_boundary_mapping[dofs[j]] != deal_II_numbers::invalid_unsigned_int)
+ if (dof_is_on_face[j] && dof_to_boundary_mapping[dofs[j]] != numbers::invalid_unsigned_int)
matrix.add(dof_to_boundary_mapping[dofs[i]],
dof_to_boundary_mapping[dofs[j]],
cell_matrix(i,j));
TimeDependent::TimeDependent (const TimeSteppingData &data_primal,
const TimeSteppingData &data_dual,
const TimeSteppingData &data_postprocess):
- sweep_no (deal_II_numbers::invalid_unsigned_int),
+ sweep_no (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 (deal_II_numbers::invalid_unsigned_int),
- timestep_no (deal_II_numbers::invalid_unsigned_int),
+ sweep_no (numbers::invalid_unsigned_int),
+ timestep_no (numbers::invalid_unsigned_int),
time (time)
{}
</p>
<ol>
+ <li> <p>Changed: The namespace deal_II_numbers has been renamed dealii::numbers.
+ The old name stemmed from a time when not everything was already in
+ namespace <code>dealii</code>. The old name is retained via a namespace
+ alias but is deprecated and will eventually be removed.
+ <br>
+ (WB 2007/11/02)
+ </p>
+
<li> <p>Changed: When writing output files in UCD format using either the
DataOutBase or the GridOut class, we used to write a preamble at the
beginning of the file that included the date and time the file was created.
(p[0] < 0) &&
(p[1] < 1./3) &&
(p[1] > -1./3))
- return std::sin (this->get_time() * 4 * deal_II_numbers::PI);
+ return std::sin (this->get_time() * 4 * numbers::PI);
else
return 0;
}
(p[0] < 0) &&
(p[1] < 1./3) &&
(p[1] > -1./3))
- return (std::cos (this->get_time() * 4 * deal_II_numbers::PI) *
- 4 * deal_II_numbers::PI);
+ return (std::cos (this->get_time() * 4 * numbers::PI) *
+ 4 * numbers::PI);
else
return 0;
}
const double detector_step_angle = 2.25;
const double detector_radius = 0.5;
- for (double detector_angle = 2*deal_II_numbers::PI;
+ for (double detector_angle = 2*numbers::PI;
detector_angle >= 0;
- detector_angle -= detector_step_angle/360*2*deal_II_numbers::PI)
+ detector_angle -= detector_step_angle/360*2*numbers::PI)
detector_locations.push_back (Point<dim> (std::cos(detector_angle),
std::sin(detector_angle)) *
detector_radius);
case 2:
{
- const double theta = deal_II_numbers::PI/4.;
+ const double theta = numbers::PI/4.;
const double lambda = 1.;
const double a0 = 1.;
const double s = 1.;
case 3:
{
- double theta = deal_II_numbers::PI/4;
- double phi = deal_II_numbers::PI/4;
+ double theta = numbers::PI/4;
+ double phi = numbers::PI/4;
double tau = 1.;
double c0 = 1.;
double s = 1.;
&&
(i*i + j*j < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j));
k_vectors_magnitude.push_back (i*i+j*j);
}
&&
(i*i + j*j + k*k < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j,
- deal_II_numbers::PI * k));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j,
+ numbers::PI * k));
k_vectors_magnitude.push_back (i*i+j*j+k*k);
}
quadrature.weight(q);
}
fourier_transform_matrices[fe](k,j)
- = sum / std::pow(2*deal_II_numbers::PI, 1.*dim/2);
+ = sum / std::pow(2*numbers::PI, 1.*dim/2);
}
}
Point<dim> value;
value[0] = 2;
for (unsigned int i=1; i<dim; ++i)
- value[i] = 1+0.8*std::sin(8*deal_II_numbers::PI*p[0]);
+ value[i] = 1+0.8*std::sin(8*numbers::PI*p[0]);
return value;
}
{
Assert (component == 0, ExcIndexRange (component, 0, 1));
- const double sine_term = std::sin(16*deal_II_numbers::PI*std::sqrt(p.square()));
+ const double sine_term = std::sin(16*numbers::PI*std::sqrt(p.square()));
const double weight = std::exp(-5*p.square()) / std::exp(-5.);
return sine_term * weight;
}
unsigned int
AccessorBase<BlockMatrix>::block_row() const
{
- Assert (row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return row_block;
unsigned int
AccessorBase<BlockMatrix>::block_column() const
{
- Assert (col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return col_block;
{
// we were asked to create the end
// iterator for this matrix
- this->row_block = deal_II_numbers::invalid_unsigned_int;
- this->col_block = deal_II_numbers::invalid_unsigned_int;
+ this->row_block = numbers::invalid_unsigned_int;
+ this->col_block = numbers::invalid_unsigned_int;
}
}
unsigned int
Accessor<BlockMatrix, true>::row() const
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return (matrix->row_block_indices.local_to_global(this->row_block, 0) +
unsigned int
Accessor<BlockMatrix, true>::column() const
{
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return (matrix->column_block_indices.local_to_global(this->col_block,0) +
typename Accessor<BlockMatrix, true>::value_type
Accessor<BlockMatrix, true>::value () const
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return base_iterator->value();
void
Accessor<BlockMatrix, true>::advance ()
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
// Remember current row inside block
++this->row_block;
if (this->row_block == matrix->n_block_rows())
{
- this->row_block = deal_II_numbers::invalid_unsigned_int;
- this->col_block = deal_II_numbers::invalid_unsigned_int;
+ this->row_block = numbers::invalid_unsigned_int;
+ this->col_block = numbers::invalid_unsigned_int;
return;
}
}
// have to have the same
// base_iterator representation, but
// valid iterators have to
- return (((this->row_block == deal_II_numbers::invalid_unsigned_int)
+ return (((this->row_block == numbers::invalid_unsigned_int)
&&
- (this->col_block == deal_II_numbers::invalid_unsigned_int))
+ (this->col_block == numbers::invalid_unsigned_int))
||
(base_iterator == a.base_iterator));
{
// we were asked to create the end
// iterator for this matrix
- this->row_block = deal_II_numbers::invalid_unsigned_int;
- this->col_block = deal_II_numbers::invalid_unsigned_int;
+ this->row_block = numbers::invalid_unsigned_int;
+ this->col_block = numbers::invalid_unsigned_int;
}
}
unsigned int
Accessor<BlockMatrix, false>::row() const
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return (matrix->row_block_indices.local_to_global(this->row_block, 0) +
unsigned int
Accessor<BlockMatrix, false>::column() const
{
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return (matrix->column_block_indices.local_to_global(this->col_block,0) +
typename Accessor<BlockMatrix, false>::value_type
Accessor<BlockMatrix, false>::value () const
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
return base_iterator->value();
void
Accessor<BlockMatrix, false>::set_value (typename Accessor<BlockMatrix, false>::value_type newval) const
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
base_iterator->value() = newval;
void
Accessor<BlockMatrix, false>::advance ()
{
- Assert (this->row_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->row_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
- Assert (this->col_block != deal_II_numbers::invalid_unsigned_int,
+ Assert (this->col_block != numbers::invalid_unsigned_int,
ExcIteratorPastEnd());
// Remember current row inside block
++this->row_block;
if (this->row_block == matrix->n_block_rows())
{
- this->row_block = deal_II_numbers::invalid_unsigned_int;
- this->col_block = deal_II_numbers::invalid_unsigned_int;
+ this->row_block = numbers::invalid_unsigned_int;
+ this->col_block = numbers::invalid_unsigned_int;
return;
}
}
// have to have the same
// base_iterator representation, but
// valid iterators have to
- return (((this->row_block == deal_II_numbers::invalid_unsigned_int)
+ return (((this->row_block == numbers::invalid_unsigned_int)
&&
- (this->col_block == deal_II_numbers::invalid_unsigned_int))
+ (this->col_block == numbers::invalid_unsigned_int))
||
(base_iterator == a.base_iterator));
const value_type value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
const std::pair<unsigned int,unsigned int>
const value_type value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
// save some cycles for zero additions, but
const Number value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
const std::pair<unsigned int,unsigned int>
const Number value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
const std::pair<unsigned int,unsigned int>
BlockVector<Number>::operator = (const value_type s)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
BaseClass::operator = (s);
void BlockVector<Number>::scale (const value_type factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
for (unsigned int i=0; i<this->n_blocks();++i)
current_block = parent.n_blocks();
index_within_block = 0;
next_break_backward = global_index;
- next_break_forward = deal_II_numbers::invalid_unsigned_int;
+ next_break_forward = numbers::invalid_unsigned_int;
};
}
// then move the next
// boundary arbitrarily far
// away
- next_break_forward = deal_II_numbers::invalid_unsigned_int;
+ next_break_forward = numbers::invalid_unsigned_int;
};
++global_index;
// get into unspecified terrain
{
--current_block;
- index_within_block = deal_II_numbers::invalid_unsigned_int;
+ index_within_block = numbers::invalid_unsigned_int;
next_break_forward = 0;
next_break_backward = 0;
};
void BlockVectorBase<VectorType>::add (const value_type a)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
for (unsigned int i=0;i<n_blocks();++i)
const BlockVectorBase<VectorType>& v)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVectorBase<VectorType>& w)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVectorBase<VectorType>& v)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVectorBase<VectorType>& v)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVectorBase<VectorType>& w)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVectorBase<VectorType>& y)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(c),
+ Assert (numbers::is_finite(c),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVectorBase<VectorType>& w)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
const BlockVector2 &v)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (n_blocks() == v.n_blocks(),
BlockVectorBase<VectorType>::operator = (const value_type s)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
for (unsigned int i=0;i<n_blocks();++i)
BlockVectorBase<VectorType>::operator *= (const value_type factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
for (unsigned int i=0;i<n_blocks();++i)
BlockVectorBase<VectorType>::operator /= (const value_type factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (factor > 0., ExcZero() );
number
FullMatrix<number>::Accessor::value() const
{
- Assert (deal_II_numbers::is_finite( matrix->el(a_row, a_col) ),
+ Assert (numbers::is_finite( matrix->el(a_row, a_col) ),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
return matrix->el(a_row, a_col);
}
FullMatrix<number>::operator *= (const double factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
number *p = &this->el(0,0);
FullMatrix<number>::operator /= (const double factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
number *p = &this->el(0,0);
const number factor_inv = 1./factor;
- Assert (deal_II_numbers::is_finite(factor_inv),
+ Assert (numbers::is_finite(factor_inv),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
while (p != e)
* Constructor, optionally
* selecting a component.
*/
- MeanValueFilter(unsigned int component = deal_II_numbers::invalid_unsigned_int);
+ MeanValueFilter(unsigned int component = numbers::invalid_unsigned_int);
/**
* Subtract mean value from @p v.
void
MeanValueFilter::filter(BlockVector<number>& v) const
{
- Assert (component != deal_II_numbers::invalid_unsigned_int,
+ Assert (component != 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 != deal_II_numbers::invalid_unsigned_int,
+ Assert (component != 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 != deal_II_numbers::invalid_unsigned_int,
+ Assert (component != numbers::invalid_unsigned_int,
ExcNotInitialized());
Assert (dst.n_blocks() == src.n_blocks(),
const number value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (cols != 0, ExcNotInitialized());
const number value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (cols != 0, ExcNotInitialized());
/**
* Non-existent column number.
*/
- static const unsigned int invalid = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int invalid = numbers::invalid_unsigned_int;
};
/**
const number value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (i<m(), ExcIndexRange(i,0,m()));
const number value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (i<m(), ExcIndexRange(i,0,m()));
* but the actual value of the
* variable may change over time.
*/
- static const unsigned int invalid_entry = deal_II_numbers::invalid_unsigned_int;
+ static const unsigned int invalid_entry = numbers::invalid_unsigned_int;
/**
* Initialize the matrix empty,
inline
Vector<Number> & Vector<Number>::operator = (const Number s)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
if (s != Number())
Vector<Number> & Vector<Number>::operator *= (const Number factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
scale (factor);
Vector<Number> &
Vector<Number>::operator /= (const Number factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (factor > 0., ExcZero() );
void
Vector<Number>::scale (const Number factor)
{
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
Vector<Number>::add (const Number a,
const Vector<Number>& v)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
const Number a,
const Vector<Number>& v)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
template <typename Number>
inline Number sqr (const Number x)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
return x*x;
}
void Vector<Number>::add (const Number a, const Vector<Number>& v,
const Number b, const Vector<Number>& w)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
template <typename Number>
void Vector<Number>::sadd (const Number x, const Vector<Number>& v)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
const Vector<Number>& v, const Number b,
const Vector<Number>& w)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
const Vector<Number>& w, const Number c,
const Vector<Number>& y)
{
- Assert (deal_II_numbers::is_finite(x),
+ Assert (numbers::is_finite(x),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(c),
+ Assert (numbers::is_finite(c),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
template <typename Number2>
void Vector<Number>::equ (const Number a, const Vector<Number2>& u)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
void Vector<Number>::equ (const Number a, const Vector<Number>& u,
const Number b, const Vector<Number>& v)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (vec_size!=0, ExcEmptyObject());
const PetscScalar value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
if (last_action != LastAction::insert)
const PetscScalar value)
{
- Assert (deal_II_numbers::is_finite(value),
+ Assert (numbers::is_finite(value),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
if (last_action != LastAction::add)
VectorBase::operator = (const PetscScalar s)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
// flush previously cached elements. this
VectorBase::operator *= (const PetscScalar a)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
#if (PETSC_VERSION_MAJOR <= 2) && (PETSC_VERSION_MINOR < 3)
VectorBase::operator /= (const PetscScalar a)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
const PetscScalar factor = 1./a;
- Assert (deal_II_numbers::is_finite(factor),
+ Assert (numbers::is_finite(factor),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
#if (PETSC_VERSION_MAJOR <= 2) && (PETSC_VERSION_MINOR < 3)
VectorBase::add (const PetscScalar s)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
#if (PETSC_VERSION_MAJOR <= 2) && (PETSC_VERSION_MINOR < 3)
const VectorBase &v)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
#if (PETSC_VERSION_MAJOR <= 2) && (PETSC_VERSION_MINOR < 3)
const VectorBase &w)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
const PetscScalar weights[2] = {a,b};
const VectorBase &v)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
#if (PETSC_VERSION_MAJOR <= 2) && (PETSC_VERSION_MINOR < 3)
const VectorBase &v)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
// there is nothing like a AXPAY
const VectorBase &w)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
// there is no operation like MAXPAY, so
const VectorBase &x)
{
- Assert (deal_II_numbers::is_finite(s),
+ Assert (numbers::is_finite(s),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(c),
+ Assert (numbers::is_finite(c),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
// there is no operation like MAXPAY, so
const VectorBase &v)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (size() == v.size(),
const VectorBase &w)
{
- Assert (deal_II_numbers::is_finite(a),
+ Assert (numbers::is_finite(a),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
- Assert (deal_II_numbers::is_finite(b),
+ Assert (numbers::is_finite(b),
ExcMessage("The given value is not finite but either infinite or Not A Number (NaN)"));
Assert (size() == v.size(),
++vertex_number;
}
for (unsigned int i=0;i<GeometryInfo<dim>::faces_per_cell;++i)
- patches[0].neighbors[i] = deal_II_numbers::invalid_unsigned_int;
+ patches[0].neighbors[i] = numbers::invalid_unsigned_int;
patches[0].patch_index = 0;
patches[0].n_subdivisions = sub;
patches[0].points_are_available = false;
//
//---------------------------- is_finite.cc ---------------------------
-// check deal_II_numbers::is_finite
+// check numbers::is_finite
#include "../tests.h"
#include <base/logstream.h>
template <typename T>
void check ()
{
- using namespace deal_II_numbers;
+ using namespace numbers;
deallog << std::numeric_limits<T>::quiet_NaN() << " --> ";
deallog << is_finite(std::numeric_limits<T>::quiet_NaN()) << std::endl;
#include <fstream>
-const double xy_angle = deal_II_numbers::PI/6;
+const double xy_angle = numbers::PI/6;
template <int dim>
Point<dim> rotate_to_y (const Point<dim> &p)
v, this_error,
std::vector<bool>(), 0,
multithread_info.n_default_threads,
- deal_II_numbers::invalid_unsigned_int,
+ numbers::invalid_unsigned_int,
material);
this_error *= scaling_factor;
points[1] = Point<3>(1,0,0);
for (unsigned int i=0; i<2*n_cells-1; ++i)
{
- points[2+i]=Point<3>(std::cos(deal_II_numbers::PI/n_cells*(i+1)),
- std::sin(deal_II_numbers::PI/n_cells*(i+1)),
+ points[2+i]=Point<3>(std::cos(numbers::PI/n_cells*(i+1)),
+ std::sin(numbers::PI/n_cells*(i+1)),
0);
}
&&
(i*i + j*j < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j));
k_vectors_magnitude.push_back (i*i+j*j);
}
&&
(i*i + j*j + k*k < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j,
- deal_II_numbers::PI * k));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j,
+ numbers::PI * k));
k_vectors_magnitude.push_back (i*i+j*j+k*k);
}
quadrature.weight(q);
}
fourier_transform_matrices[fe](k,i)
- = sum / std::pow(2*deal_II_numbers::PI, 1.*dim/2);
+ = sum / std::pow(2*numbers::PI, 1.*dim/2);
}
}
{
// points on the lower surface
Point<dim>(0, 0, -4),
- Point<dim>(std::cos(0*deal_II_numbers::PI/6),
- std::sin(0*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(0*numbers::PI/6),
+ std::sin(0*numbers::PI/6),
-4),
- Point<dim>(std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
-4),
- Point<dim>(std::cos(4*deal_II_numbers::PI/6),
- std::sin(4*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(4*numbers::PI/6),
+ std::sin(4*numbers::PI/6),
-4),
- Point<dim>(std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
-4),
- Point<dim>(std::cos(8*deal_II_numbers::PI/6),
- std::sin(8*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(8*numbers::PI/6),
+ std::sin(8*numbers::PI/6),
-4),
- Point<dim>(std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
-4),
// same points on the top
// of the stem, with
// indentation in the middle
Point<dim>(0, 0, 4-std::sqrt(2.)/2),
- Point<dim>(std::cos(0*deal_II_numbers::PI/6),
- std::sin(0*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(0*numbers::PI/6),
+ std::sin(0*numbers::PI/6),
4),
- Point<dim>(std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
4),
- Point<dim>(std::cos(4*deal_II_numbers::PI/6),
- std::sin(4*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(4*numbers::PI/6),
+ std::sin(4*numbers::PI/6),
4),
- Point<dim>(std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
4),
- Point<dim>(std::cos(8*deal_II_numbers::PI/6),
- std::sin(8*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(8*numbers::PI/6),
+ std::sin(8*numbers::PI/6),
4),
- Point<dim>(std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
4),
// point at top of chevron
// points at the top of the
// first extension
// points 15-18
- Point<dim>(0, 0, 7) + Point<dim> (std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
+ Point<dim>(0, 0, 7) + Point<dim> (std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(0*deal_II_numbers::PI/6),
- std::sin(0*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(0*numbers::PI/6),
+ std::sin(0*numbers::PI/6),
+ 7) + Point<dim> (std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
+ 7) + Point<dim> (std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(4*deal_II_numbers::PI/6),
- std::sin(4*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(2*deal_II_numbers::PI/6),
- std::sin(2*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(4*numbers::PI/6),
+ std::sin(4*numbers::PI/6),
+ 7) + Point<dim> (std::cos(2*numbers::PI/6),
+ std::sin(2*numbers::PI/6),
0) * 4,
// points at the top of the
// second extension
// points 19-22
- Point<dim>(0, 0, 7) + Point<dim> (std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
+ Point<dim>(0, 0, 7) + Point<dim> (std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(4*deal_II_numbers::PI/6),
- std::sin(4*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(4*numbers::PI/6),
+ std::sin(4*numbers::PI/6),
+ 7) + Point<dim> (std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
+ 7) + Point<dim> (std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(8*deal_II_numbers::PI/6),
- std::sin(8*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(6*deal_II_numbers::PI/6),
- std::sin(6*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(8*numbers::PI/6),
+ std::sin(8*numbers::PI/6),
+ 7) + Point<dim> (std::cos(6*numbers::PI/6),
+ std::sin(6*numbers::PI/6),
0) * 4,
// points at the top of the
// third extension
// points 23-26
- Point<dim>(0, 0, 7) + Point<dim> (std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
+ Point<dim>(0, 0, 7) + Point<dim> (std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(8*deal_II_numbers::PI/6),
- std::sin(8*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(8*numbers::PI/6),
+ std::sin(8*numbers::PI/6),
+ 7) + Point<dim> (std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
+ 7) + Point<dim> (std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
0) * 4,
- Point<dim>(std::cos(0*deal_II_numbers::PI/6),
- std::sin(0*deal_II_numbers::PI/6),
- 7) + Point<dim> (std::cos(10*deal_II_numbers::PI/6),
- std::sin(10*deal_II_numbers::PI/6),
+ Point<dim>(std::cos(0*numbers::PI/6),
+ std::sin(0*numbers::PI/6),
+ 7) + Point<dim> (std::cos(10*numbers::PI/6),
+ std::sin(10*numbers::PI/6),
0) * 4,
};
&&
(i*i + j*j < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j));
k_vectors_magnitude.push_back (i*i+j*j);
}
&&
(i*i + j*j + k*k < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j,
- deal_II_numbers::PI * k));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j,
+ numbers::PI * k));
k_vectors_magnitude.push_back (i*i+j*j+k*k);
}
quadrature.weight(q);
}
fourier_transform_matrices[fe](k,i)
- = sum / std::pow(2*deal_II_numbers::PI, 1.*dim/2);
+ = sum / std::pow(2*numbers::PI, 1.*dim/2);
}
}
&&
(i*i + j*j < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j));
k_vectors_magnitude.push_back (i*i+j*j);
}
&&
(i*i + j*j + k*k < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j,
- deal_II_numbers::PI * k));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j,
+ numbers::PI * k));
k_vectors_magnitude.push_back (i*i+j*j+k*k);
}
quadrature.weight(q);
}
fourier_transform_matrices[fe](k,i)
- = sum / std::pow(2*deal_II_numbers::PI, 1.*dim/2);
+ = sum / std::pow(2*numbers::PI, 1.*dim/2);
}
}
&&
(i*i + j*j < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j));
k_vectors_magnitude.push_back (i*i+j*j);
}
&&
(i*i + j*j + k*k < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j,
- deal_II_numbers::PI * k));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j,
+ numbers::PI * k));
k_vectors_magnitude.push_back (i*i+j*j+k*k);
}
quadrature.weight(q);
}
fourier_transform_matrices[fe](k,i)
- = sum / std::pow(2*deal_II_numbers::PI, 1.*dim/2);
+ = sum / std::pow(2*numbers::PI, 1.*dim/2);
}
}
&&
(i*i + j*j < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j));
k_vectors_magnitude.push_back (i*i+j*j);
}
&&
(i*i + j*j + k*k < N*N))
{
- k_vectors.push_back (Point<dim>(deal_II_numbers::PI * i,
- deal_II_numbers::PI * j,
- deal_II_numbers::PI * k));
+ k_vectors.push_back (Point<dim>(numbers::PI * i,
+ numbers::PI * j,
+ numbers::PI * k));
k_vectors_magnitude.push_back (i*i+j*j+k*k);
}
quadrature.weight(q);
}
fourier_transform_matrices[fe](k,i)
- = sum / std::pow(2*deal_II_numbers::PI, 1.*dim/2);
+ = sum / std::pow(2*numbers::PI, 1.*dim/2);
}
}
* Satz 4.1.1)
*/
const double h = 1./size;
- const double s = std::sin(deal_II_numbers::PI*h/2.);
- const double c = std::cos(deal_II_numbers::PI*h/2.);
+ const double s = std::sin(numbers::PI*h/2.);
+ const double c = std::cos(numbers::PI*h/2.);
const double lambda_max = 8.*c*c;
const double lambda_min = 8.*s*s;