* <tt>index_map.size()==n()</tt>. Stores
* a copy of <tt>index_map</tt>.
*/
- void set_polynomial_ordering(const vector<unsigned int> &index_map);
+ void set_polynomial_ordering(const std::vector<unsigned int> &index_map);
/**
* Computes the value and the
out << i << "\t";
for (unsigned int d=0; d<dim; ++d)
out << ix[d] << " ";
- out << endl;
+ out << std::endl;
}
}
template <int dim>
void
PolynomialSpace<dim>::set_polynomial_ordering(
- const vector<unsigned int> &imap)
+ const std::vector<unsigned int> &imap)
{
Assert(imap.size()==index_map.size(),
ExcDimensionMismatch(imap.size(), index_map.size()));
PolynomialSpace<dim>(Polynomials::Monomial<double>::generate_complete_basis(k)),
k(k)
{
- vector<unsigned int> index_map(n());
+ std::vector<unsigned int> index_map(n());
create_polynomial_ordering(index_map);
set_polynomial_ordering(index_map);
}
template <>
void PolynomialsP<1>::create_polynomial_ordering(
- vector<unsigned int> &index_map) const
+ std::vector<unsigned int> &index_map) const
{
Assert(index_map.size()==n(), ExcDimensionMismatch(index_map.size(), n()));
template <>
void PolynomialsP<2>::create_polynomial_ordering(
- vector<unsigned int> &index_map) const
+ std::vector<unsigned int> &index_map) const
{
Assert(index_map.size()==n(), ExcDimensionMismatch(index_map.size(), n()));
Assert(k<=5, ExcNotImplemented());
template <>
void PolynomialsP<3>::create_polynomial_ordering(
- vector<unsigned int> &index_map) const
+ std::vector<unsigned int> &index_map) const
{
Assert(index_map.size()==n(), ExcDimensionMismatch(index_map.size(), n()));
Assert(k<=3, ExcNotImplemented());