From 6c3efc130e8efaea68ed2243ddb4293dd91578dc Mon Sep 17 00:00:00 2001 From: Daniel Arndt Date: Sun, 12 Apr 2020 19:55:33 -0400 Subject: [PATCH] Avoid some failing link requests --- include/deal.II/fe/mapping_fe_field.h | 2 +- include/deal.II/fe/mapping_manifold.h | 8 ++++---- include/deal.II/fe/mapping_q_generic.h | 4 ++-- include/deal.II/lac/solver_gmres.h | 2 +- include/deal.II/matrix_free/matrix_free.h | 4 ++-- 5 files changed, 10 insertions(+), 10 deletions(-) diff --git a/include/deal.II/fe/mapping_fe_field.h b/include/deal.II/fe/mapping_fe_field.h index 4f1e23d22f..44a0201b3c 100644 --- a/include/deal.II/fe/mapping_fe_field.h +++ b/include/deal.II/fe/mapping_fe_field.h @@ -402,7 +402,7 @@ public: * Unit tangential vectors. Used for the computation of boundary forms and * normal vectors. * - * This array has (dim-1)*GeometryInfo::faces_per_cell entries. The first + * This array has `(dim-1)*GeometryInfo::%faces_per_cell` entries. The first * GeometryInfo::faces_per_cell contain the vectors in the first * tangential direction for each face; the second set of * GeometryInfo::faces_per_cell entries contain the vectors in the second diff --git a/include/deal.II/fe/mapping_manifold.h b/include/deal.II/fe/mapping_manifold.h index 7dd5a81adc..0db436c814 100644 --- a/include/deal.II/fe/mapping_manifold.h +++ b/include/deal.II/fe/mapping_manifold.h @@ -279,11 +279,11 @@ public: * Unit tangential vectors. Used for the computation of boundary forms and * normal vectors. * - * This array has (dim-1)*GeometryInfo::faces_per_cell entries. The first - * GeometryInfo::faces_per_cell contain the vectors in the first + * This array has (dim-1)*GeometryInfo%::%faces_per_cell entries. The + * first GeometryInfo::faces_per_cell contain the vectors in the first * tangential direction for each face; the second set of - * GeometryInfo::faces_per_cell entries contain the vectors in the second - * tangential direction (only in 3d, since there we have 2 tangential + * GeometryInfo::faces_per_cell entries contain the vectors in the + * second tangential direction (only in 3d, since there we have 2 tangential * directions per face), etc. * * Filled once. diff --git a/include/deal.II/fe/mapping_q_generic.h b/include/deal.II/fe/mapping_q_generic.h index c954a79df2..4eaaa422a9 100644 --- a/include/deal.II/fe/mapping_q_generic.h +++ b/include/deal.II/fe/mapping_q_generic.h @@ -410,8 +410,8 @@ public: * Unit tangential vectors. Used for the computation of boundary forms and * normal vectors. * - * This array has (dim-1)*GeometryInfo::faces_per_cell entries. The first - * GeometryInfo::faces_per_cell contain the vectors in the first + * This array has (dim-1)*GeometryInfo%::%faces_per_cell entries. The + * first GeometryInfo::faces_per_cell contain the vectors in the first * tangential direction for each face; the second set of * GeometryInfo::faces_per_cell entries contain the vectors in the second * tangential direction (only in 3d, since there we have 2 tangential diff --git a/include/deal.II/lac/solver_gmres.h b/include/deal.II/lac/solver_gmres.h index 42c4f6f2a7..a9994b1247 100644 --- a/include/deal.II/lac/solver_gmres.h +++ b/include/deal.II/lac/solver_gmres.h @@ -451,7 +451,7 @@ protected: * preconditioner from the right. * * FGMRES needs two vectors in each iteration steps yielding a total of - * 2*SolverFGMRES::AdditionalData::max_basis_size+1 auxiliary + * 2*SolverFGMRES::%AdditionalData::%max_basis_size+1 auxiliary * vectors. Otherwise, FGMRES requires roughly the same number of operations * per iteration compared to GMRES, except one application of the * preconditioner less at each restart and at the end of solve(). diff --git a/include/deal.II/matrix_free/matrix_free.h b/include/deal.II/matrix_free/matrix_free.h index 5eef5bb14a..4427698ade 100644 --- a/include/deal.II/matrix_free/matrix_free.h +++ b/include/deal.II/matrix_free/matrix_free.h @@ -1570,7 +1570,7 @@ public: * general. The cell range in @p cell_loop runs from zero to n_cell_batches() * (exclusive), so this is the appropriate size if you want to store arrays * of data for all cells to be worked on. This number is approximately - * `n_physical_cells()/VectorizedArray::size()` (depending on how + * `n_physical_cells()/VectorizedArray::%size()` (depending on how * many cell chunks that do not get filled up completely). */ unsigned int @@ -1582,7 +1582,7 @@ public: * general. The cell range in @p cell_loop runs from zero to * n_cell_batches() (exclusive), so this is the appropriate size if you want * to store arrays of data for all cells to be worked on. This number is - * approximately `n_physical_cells()/VectorizedArray::size()` + * approximately `n_physical_cells()/VectorizedArray::%size()` * (depending on how many cell chunks that do not get filled up completely). */ unsigned int -- 2.39.5