#881 Update ticket number associated with a \todo.

Sources/Operators/GlobalVariationalOperator/Private/Impl/Recursivity.hpp

@@ -138,7 +138,7 @@ namespace HappyHeart
                 /*!
                  * \brief Reduce the elementary matrix to the subset that must be reported in the global matrix.
                  *
-                 * Let's consider for instance a Stokes operator in a nonmonolithic way: same elementary matrix
+                 * Let's consider for instance a Stokes operator in a non monolithic way: same elementary matrix
                  * must be reported in two blocks of different sizes (said size is deduced from numbering subset 
                  * arguments).
                  * Role of current function is to generate a smaller matrix that includes only the elements to report
@@ -147,15 +147,12 @@ namespace HappyHeart
                  */
                 template<class LocalVariationalOperatorT>
                 static LocalMatrix& ComputeReducedLocalMatrix(const NumberingSubset& row_numbering_subset,
-                                                       const NumberingSubset& col_numbering_subset,
-                                                       LocalVariationalOperatorT& local_variational_operator);
+                                                              const NumberingSubset& col_numbering_subset,
+                                                              LocalVariationalOperatorT& local_variational_operator);
                 
             };
             
             
-       
-
-            
             /*!
              * \brief Another struct for recursion that works in the opposite direction: the stopping condition
              * is when index is 0.

Sources/Operators/GlobalVariationalOperator/Private/Impl/Recursivity.hxx

@@ -231,9 +231,9 @@ namespace HappyHeart
                         col_unknown_list.push_back(extended_unknown_ptr);
                 }
                 
-                // \todo #513 Here I assumed clearly exactly one unknown is expected for row and columm!
-                assert(row_unknown_list.size() == 1 && "See #513");
-                assert(col_unknown_list.size() == 1 && "See #513");
+                // \todo #881 Here I assumed clearly exactly one unknown is expected for row and columm!
+                assert(row_unknown_list.size() == 1 && "See #881");
+                assert(col_unknown_list.size() == 1 && "See #881");
                 const auto& unknown1 = *(row_unknown_list.front());
                 const auto& unknown2 = *(col_unknown_list.front());