From 467ed8d475e0ebb4b6e0a42ca159a8c316dd1d32 Mon Sep 17 00:00:00 2001
From: Elias Pipping <elias.pipping@fu-berlin.de>
Date: Mon, 31 Oct 2011 14:28:29 +0100
Subject: [PATCH] Cleanup
---
src/myblockproblem.hh | 12 +++++-------
1 file changed, 5 insertions(+), 7 deletions(-)
diff --git a/src/myblockproblem.hh b/src/myblockproblem.hh
index 69e14ede..560e1d9a 100644
--- a/src/myblockproblem.hh
+++ b/src/myblockproblem.hh
@@ -25,7 +25,7 @@ template <class MyConvexProblemTypeTEMPLATE> class MyBlockProblem {
typedef typename MyConvexProblemType::LocalVectorType LocalVectorType;
typedef typename MyConvexProblemType::LocalMatrixType LocalMatrixType;
- static const int block_size = MyConvexProblemType::block_size;
+ static int const block_size = MyConvexProblemType::block_size;
/** \brief Solves one local system using a modified gradient method */
class IterateObject;
@@ -56,27 +56,25 @@ class MyBlockProblem<MyConvexProblemTypeTEMPLATE>::IterateObject {
* \param problem The problem including quadratic part and nonlinear part
*/
IterateObject(const Bisection& bisection, MyConvexProblemType& problem)
- : problem(problem), bisection(bisection) {};
+ : problem(problem), bisection(bisection) {}
public:
/** \brief Set the current iterate */
void setIterate(VectorType& u) {
this->u = u;
return;
- };
+ }
/** \brief Update the i-th block of the current iterate */
void updateIterate(const LocalVectorType& ui, int i) {
u[i] = ui;
return;
- };
+ }
- /** \brief Minimize a local problem using a scalar Gauss-Seidel method
+ /** \brief Minimise a local problem using a modified gradient method
* \param[out] ui The solution
* \param m Block number
* \param ignore Set of degrees of freedom to leave untouched
- *
- * \return The minimizer of the local functional in the variable ui
*/
void solveLocalProblem(
LocalVectorType& ui, int m,
--
GitLab