From 79174ec50a1f9523f7e9cc5b7cbe85c24d9ef6a8 Mon Sep 17 00:00:00 2001 From: David Wells Date: Sun, 20 Sep 2020 13:12:47 -0400 Subject: [PATCH] Remove some commented-out code. We changed this code to assume the base quadrature is already set up in e4b860bbba680a002d5fd80035cff71ec39708eb. --- source/base/quadrature.cc | 110 -------------------------------------- 1 file changed, 110 deletions(-) diff --git a/source/base/quadrature.cc b/source/base/quadrature.cc index 59eebdb5dd..52825656d5 100644 --- a/source/base/quadrature.cc +++ b/source/base/quadrature.cc @@ -459,108 +459,6 @@ namespace internal } // namespace QIteratedImplementation } // namespace internal -// template <> -// void -// QIterated<1>::fill(Quadrature<1>& dst, -// const Quadrature<1> &base_quadrature, -// const unsigned int n_copies) -// { -// Assert (n_copies > 0, ExcZero()); -// Assert (base_quadrature.size() > 0, ExcZero()); - -// const unsigned int np = -// uses_both_endpoints(base_quadrature) -// ? (base_quadrature.size()-1) * n_copies + 1 -// : base_quadrature.size() * n_copies; - -// dst.quadrature_points.resize(np); -// dst.weights.resize(np); - -// if (!uses_both_endpoints(base_quadrature)) -// // we don't have to skip some -// // points in order to get a -// // reasonable quadrature formula -// { -// unsigned int next_point = 0; -// for (unsigned int copy=0; copy 0) && -// (base_quadrature.point(q_point)(0) == 0.)) -// continue; - -// dst.quadrature_points[next_point](0) -// = (copy+base_quadrature.point(q_point)(0)) / n_copies; - -// // 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)(0) == 1.)) -// dst.weights[next_point] = double_point_weight; -// else -// dst.weights[next_point] = base_quadrature.weight(q_point) / -// n_copies; - -// ++next_point; -// } -// } - -// #if DEBUG -// double sum_of_weights = 0; -// for (unsigned int i=0; i @@ -580,7 +478,6 @@ QIterated<1>::QIterated(const Quadrature<1> &base_quadrature, (base_quadrature.size() - 1) * n_copies + 1 : base_quadrature.size() * n_copies) { - // fill(*this, base_quadrature, n_copies); Assert(base_quadrature.size() > 0, ExcNotInitialized()); Assert(n_copies > 0, ExcZero()); @@ -673,13 +570,6 @@ QIterated<1>::QIterated(const Quadrature<1> &base_quadrature, } -// template -// void -// QIterated::fill(Quadrature&, const Quadrature<1>&, unsigned int) -// { -// Assert(false, ExcNotImplemented()); -// } - // construct higher dimensional quadrature formula by tensor product // of lower dimensional iterated quadrature formulae -- 2.39.5