From 433be4ce4cf7404d480fc5e6c534afb2ebac43c0 Mon Sep 17 00:00:00 2001 From: wolf Date: Sun, 29 Apr 2001 16:01:40 +0000 Subject: [PATCH] Remove comment of mine which I no more understand. git-svn-id: https://svn.dealii.org/trunk@4500 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/base/source/quadrature.cc | 42 +++++++++++++------------------ 1 file changed, 18 insertions(+), 24 deletions(-) diff --git a/deal.II/base/source/quadrature.cc b/deal.II/base/source/quadrature.cc index bb9f2a99ea..2ef9f386af 100644 --- a/deal.II/base/source/quadrature.cc +++ b/deal.II/base/source/quadrature.cc @@ -221,18 +221,10 @@ QProjector::QProjector (const Quadrature &quadrature, project_to_faces (quadrature, quadrature_points); const unsigned int n = GeometryInfo::faces_per_cell - * (sub ? GeometryInfo::subfaces_per_face : 1); - -// WB: Can we keep it that simple for non-symmetric formulae? -// Otherwise we'll have to include the weights in the project* functions. -// This may pose a problem anyway, since we do not want to switch endpoints -// in Gauss-Radau formulae. -// GK: I don't see the problem. The project* functions copy the points -// consecutively, so do we do with the weights here. - + * (sub ? GeometryInfo::subfaces_per_face : 1); unsigned int k=0; - for (unsigned int i=0;i::project_to_face (const Quadrature<0> &, } -//TODO: [?] Replace code reduplication for opposite faces. -// We need a variable then, telling whether the constant value is 0 or 1 template <> void QProjector<2>::project_to_face (const Quadrature<1> &quadrature, @@ -424,9 +414,10 @@ void QProjector<3>::project_to_subface (const Quadrature<2> &quadrature, Assert (subface_no<(1<<(dim-1)), ExcIndexRange (face_no, 0, 1<<(dim-1))); - // for all faces and subfaces: first project - // onto the first subface of each face, then - // move it to the right place + // for all faces and subfaces: + // first project onto the first + // subface of each face, then move + // it to the right place for (unsigned int p=0; p::QIterated (const Quadrature<1> &base_quadrature, for (unsigned int copy=0; copy 0) && (base_quadrature.point(q_point) == Point<1>(0.0))) continue; @@ -709,9 +701,11 @@ QIterated<1>::QIterated (const Quadrature<1> &base_quadrature, + (1.0*copy)/n_copies); - // if this is the rightmost point of - // one of the non-last copies: give - // it the double weight + // if this is the + // rightmost point of one + // of the non-last + // copies: give it the + // double weight if ((copy != n_copies-1) && (base_quadrature.point(q_point) == Point<1>(1.0))) weights[next_point] = double_point_weight; @@ -733,8 +727,8 @@ QIterated<1>::QIterated (const Quadrature<1> &base_quadrature, -// construct higher dimensional quadrature formula by tensor product of lower -// dimensional iterated quadrature formulae +// construct higher dimensional quadrature formula by tensor product +// of lower dimensional iterated quadrature formulae template QIterated::QIterated (const Quadrature<1> &base_quadrature, const unsigned int N) : -- 2.39.5