]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Add some missing std's.
authorhartmann <hartmann@0785d39b-7218-0410-832d-ea1e28bc413d>
Tue, 9 Mar 2004 16:46:02 +0000 (16:46 +0000)
committerhartmann <hartmann@0785d39b-7218-0410-832d-ea1e28bc413d>
Tue, 9 Mar 2004 16:46:02 +0000 (16:46 +0000)
git-svn-id: https://svn.dealii.org/trunk@8702 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/base/include/base/polynomial_space.h
deal.II/base/include/base/polynomials_p.h
deal.II/base/source/polynomial_space.cc
deal.II/base/source/polynomials_p.cc

index c3b375d5fcaba6313800558d56cb867b19cae89c..b8e071105db746cea7626c18ece5c86deb41c34b 100644 (file)
@@ -78,7 +78,7 @@ class PolynomialSpace
                                      * <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
index ee110547fc0ff00894f6da879a28810010c0dc53..d2c808ee789014e4e61bb984d581d9b6dabf5246 100644 (file)
@@ -79,7 +79,7 @@ class PolynomialsP: public PolynomialSpace<dim>
                                     /**
                                      * Fills the <tt>index_map</tt>.
                                      */
-    void create_polynomial_ordering(vector<unsigned int> &index_map) const;
+    void create_polynomial_ordering(std::vector<unsigned int> &index_map) const;
 
                                     /**
                                      * Degree <tt>k<tt> of the
index eaa6ef02ffdfea8f5c97b58ba8988441ab153610..be0ebf6fae27567b77bd6833df7e74e8d4888ad6 100644 (file)
@@ -117,7 +117,7 @@ PolynomialSpace<dim>::output_indices(std::ostream &out) const
       out << i << "\t";
       for (unsigned int d=0; d<dim; ++d)
        out << ix[d] << " ";
-      out << endl;
+      out << std::endl;
     }
 }
 
@@ -126,7 +126,7 @@ PolynomialSpace<dim>::output_indices(std::ostream &out) const
 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()));
index e2ce67889f27c596d27452c5315875134c0b9ab2..5be3757c4e3ddefc7eaaa096ca995918e5103e6b 100644 (file)
@@ -20,7 +20,7 @@ PolynomialsP<dim>::PolynomialsP (const unsigned int k)
                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);
 }
@@ -28,7 +28,7 @@ PolynomialsP<dim>::PolynomialsP (const unsigned int k)
 
 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()));
 
@@ -51,7 +51,7 @@ const unsigned int imap2[6][21]=
 
 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());
@@ -76,7 +76,7 @@ const unsigned int imap3[4][20]=
 
 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());

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.