std::vector<std::pair<unsigned int, unsigned int> >
hp_vertex_dof_identities (const FiniteElement<dim> &fe_other) const;
+ /*@}*/
+
/**
* Return the matrix interpolating from a face of one
* element to the face of the neighboring element. The
* @endcode
* Note that by the @p set_to_next_positive call the first cell with
* a set user flag was assigned to the @p begin iterator. For the
- * @{end} iterator, no such call was necessary, since the past-the-end
+ * #end iterator, no such call was necessary, since the past-the-end
* iterator always satisfies all predicates.
*
* The same can be achieved by the following snippet, though harder to read:
class TridiagonalMatrix
{
public:
+ ///@name Constructors
+ //@{
/**
* Declare type for container size.
*/
// the interpolation points at @p{t=0.276} and @p{t=0.724}
// (Gauss-Lobatto points). Since at @p{t=0,1} we want a vertex which
// is actually at the boundary, we know that @p{d=0} and @p{a=-b-c},
- // which gives @p{s(0.276)} and @{s(0.726)} in terms of @p{b,c}. As
+ // which gives @p{s(0.276)} and @p{s(0.726)} in terms of @p{b,c}. As
// side-conditions, we want that the derivatives at @p{t=0} and
// @p{t=1}, i.e. at the vertices match those returned by the
// boundary.
In the beginning the Universe was created. This has made a lot of
people very angry and has been widely regarded as a bad move.
Douglas Adams