From 85edd74aa7234fedfccae90b2b25aa9534d065fc Mon Sep 17 00:00:00 2001 From: hartmann Date: Thu, 11 Mar 2004 14:51:29 +0000 Subject: [PATCH] Several renamings. git-svn-id: https://svn.dealii.org/trunk@8714 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/base/include/base/polynomial_space.h | 16 ++++++++-------- deal.II/base/source/polynomial_space.cc | 18 +++++++++--------- deal.II/base/source/polynomials_p.cc | 2 +- 3 files changed, 18 insertions(+), 18 deletions(-) diff --git a/deal.II/base/include/base/polynomial_space.h b/deal.II/base/include/base/polynomial_space.h index b8e071105d..7d13f32c6f 100644 --- a/deal.II/base/include/base/polynomial_space.h +++ b/deal.II/base/include/base/polynomial_space.h @@ -31,16 +31,16 @@ * Given a vector of n one-dimensional polynomials * P0 to Pn, where * Pi has degree i, this class generates all - * multi-dimensional polynomials of the form + * dim-dimensional polynomials of the form * Pijk(x,y,z) = * Pi(x)Pj(y)Pk(z), where the sum * of i, j and k is less than or equal n. * * The @ref{output_indices} function prints the ordering of the - * polynomials, i.e. for each multi-dimensional polynomial in the + * polynomials, i.e. for each dim-dimensional polynomial in the * polynomial space it gives the indices i,j,k of the one-dimensional * polynomials in x,y and z direction. The ordering of the - * multi-dimensional polynomials can be changed by using the + * dim-dimensional polynomials can be changed by using the * @p{set_polynomial_ordering} function. * * @author Guido Kanschat, 2002, Wolfgang Bangerth, 2003, Ralf Hartmann 2004 @@ -78,7 +78,7 @@ class PolynomialSpace * index_map.size()==n(). Stores * a copy of index_map. */ - void set_polynomial_ordering(const std::vector &index_map); + void set_renumbering(const std::vector &index_map); /** * Computes the value and the @@ -213,7 +213,7 @@ class PolynomialSpace * Index map for reordering the * polynomials. */ - std::vector reverse_index_map; + std::vector index_map_inverse; /** * Static function used in the @@ -248,16 +248,16 @@ PolynomialSpace::PolynomialSpace (const std::vector &pols) polynomials (pols.begin(), pols.end()), n_pols (compute_n_pols(polynomials.size())), index_map(n_pols), - reverse_index_map(n_pols) + index_map_inverse(n_pols) { // per default set this index map // to identity. This map can be // changed by the user through the - // set_polynomial_ordering function + // set_renumbering function for (unsigned int i=0; i::output_indices(std::ostream &out) const template void -PolynomialSpace::set_polynomial_ordering( - const std::vector &imap) +PolynomialSpace::set_renumbering( + const std::vector &renumber) { - Assert(imap.size()==index_map.size(), - ExcDimensionMismatch(imap.size(), index_map.size())); + Assert(renumber.size()==index_map.size(), + ExcDimensionMismatch(renumber.size(), index_map.size())); - index_map=imap; + index_map=renumber; for (unsigned int i=0; i::compute (const Point &p, for (unsigned int iz=0;iz<((dim>2) ? n_1d : 1);++iz) for (unsigned int iy=0;iy<((dim>1) ? n_1d-iz : 1);++iy) for (unsigned int ix=0; ix1) ? v[1][iy][0] : 1.) * ((dim>2) ? v[2][iz][0] : 1.); @@ -289,7 +289,7 @@ PolynomialSpace::compute (const Point &p, for (unsigned int iy=0;iy<((dim>1) ? n_1d-iz : 1);++iy) for (unsigned int ix=0; ix1) ? v[1][iy][(d==1) ? 1 : 0] : 1.) @@ -305,7 +305,7 @@ PolynomialSpace::compute (const Point &p, for (unsigned int iy=0;iy<((dim>1) ? n_1d-iz : 1);++iy) for (unsigned int ix=0; ix::PolynomialsP (const unsigned int p) { std::vector index_map(this->n()); create_polynomial_ordering(index_map); - this->set_polynomial_ordering(index_map); + this->set_renumbering(index_map); } -- 2.39.5