From 5db1626b0bd4e0ec001ff8b214fc86b75ecbb676 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Mon, 19 Mar 2018 17:20:08 -0600 Subject: [PATCH] Update a couple places where we do markup by hand. --- include/deal.II/lac/sparsity_pattern.h | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/include/deal.II/lac/sparsity_pattern.h b/include/deal.II/lac/sparsity_pattern.h index 362706e5cf..2644d4597d 100644 --- a/include/deal.II/lac/sparsity_pattern.h +++ b/include/deal.II/lac/sparsity_pattern.h @@ -496,11 +496,11 @@ public: SparsityPattern &operator = (const SparsityPattern &); /** - * Reallocate memory and set up data structures for a new matrix with m - * rows and n columns, with at most max_per_row + * Reallocate memory and set up data structures for a new matrix with @p m + * rows and @p n columns, with at most @p max_per_row * nonzero entries per row. * - * This function simply maps its operations to the other reinit + * This function simply maps its operations to the other reinit() * function. */ void reinit (const size_type m, @@ -509,9 +509,9 @@ public: /** - * Reallocate memory for a matrix of size m x n. The number of - * entries for each row is taken from the array row_lengths which - * has to give this number of each row i=1...m. + * Reallocate memory for a matrix of size @p m times @p n. The number of + * entries for each row is taken from the array @p row_lengths which + * has to give this number of each row $i=1\ldots m#. * * If m*n==0 all memory is freed, resulting in a total * reinitialization of the object. If it is nonzero, new memory is only -- 2.39.5