<< "Global index " << arg1
<< " neither owned nor ghost on proc " << arg2);
- private: /**
- * The global size of the vector over all
- * processors
- */
+ private:
+ /**
+ * The global size of the vector over all processors
+ */
const types::global_dof_index global_size;
/**
* The name must be in the form which is returned by the
* FiniteElement::get_name function, where a few modifications are allowed:
*
- * <ul><li> Dimension template parameters <2> etc. can be
+ * <ul>
+ * <li> Dimension template parameters <2> etc. can be
* omitted. Alternatively, the explicit number can be replaced by
* <tt>dim</tt> or <tt>d</tt>. If a number is given, it <b>must</b> match
* the template parameter of this function.
*
* <li> The powers used for FESystem may either be numbers or can be
- * replaced by <tt>dim</tt> or <tt>d</tt>. </ul>
+ * replaced by <tt>dim</tt> or <tt>d</tt>.
+ * </ul>
*
* If no finite element can be reconstructed from this string, an exception
* of type @p FETools::ExcInvalidFEName is thrown.
* <h3>References</h3>
*
* A general publication on differential geometry and finite elements
- * is the survey <ul><li>Douglas N. Arnold, Richard S. Falk, and
+ * is the survey
+ * <ul>
+ * <li>Douglas N. Arnold, Richard S. Falk, and
* Ragnar Winther. <i>Finite element exterior calculus: from
* Hodge theory to numerical stability.</i>
* Bull. Amer. Math. Soc. (N.S.), 47:281-354, 2010. <a
* href="http://dx.doi.org/10.1090/S0273-0979-10-01278-4">DOI:
- * 10.1090/S0273-0979-10-01278-4</a>.</ul>
+ * 10.1090/S0273-0979-10-01278-4</a>.
+ * </ul>
*
* The description of the Piola transform has been taken from the <a
* href="http://www.math.uh.edu/~rohop/spring_05/downloads/">lecture
* but rather one of the derived classes TriaIterator or
* TriaActiveIterator.
*
- * <ul> <li> TriaRawIterator objects point to lines, cells, etc in the
+ * <ul>
+ * <li> TriaRawIterator objects point to lines, cells, etc in the
* lists whether they are used or not (in the vectors, also
* <i>dead</i> objects are stored, since deletion in vectors is
* expensive and we also do not want to destroy the ordering induced
* parameter), which really does the access to data. An Accessor
* has to fulfil some requirements:
*
- * <ul> <li> It must have two members named <tt>present_level</tt> and
+ * <ul>
+ * <li> It must have two members named <tt>present_level</tt> and
* <tt>present_index</tt> storing the address of the element in the
* triangulation presently pointed to. These data have to be
* accessible by all triangulation iterators listed above.