*
* internal::copy(initial_guess_and_solution, solution);
* // Free the vectors which are no longer used.
- *# ifdef DEAL_II_WITH_MPI
+ * #ifdef DEAL_II_WITH_MPI
* if (is_serial_vector<VectorType>::value == false)
* {
* N_VDestroy_Parallel(solution);
* N_VDestroy_Parallel(f_scale);
* }
* else
- *# endif
+ * #endif
* {
* N_VDestroy_Serial(solution);
* N_VDestroy_Serial(u_scale);
* | |
* | 0 1 2 |
* |___________|
- *@endverbatim
+ * @endverbatim
*
* We have for a local <code>face_dof_index=i+n*j</code> with index
* <code>i</code> in x-direction and index <code>j</code> in y-direction
* orientation. The flip axis is the diagonal from the lower left to the upper
* right corner of the face. With these flags the configuration above becomes:
*
- *@verbatim
+ * @verbatim
* ___________
* | |
* | 2 5 8 |
* A triangulation offers one bit per subobject for user flags. This field can
* be accessed as all other data using iterators. Normally, this user flag is
* used if an algorithm walks over all cells and needs information whether
- * another cell, e.g. a neighbor, has already been processed. See @ref
- * GlossUserFlags "the glossary for more information".
+ * another cell, e.g. a neighbor, has already been processed.
+ * See @ref GlossUserFlags "the glossary for more information".
*
* There is another set of user data, which can be either an <tt>unsigned
* int</tt> or a <tt>void *</tt>, for each subobject. You can access
* That means that if Kokkos was configured with a GPU backend, the data is
* allocated on a GPU. The operations on the vector are performed on the
* chosen memory space. From the host, there are two methods to access the
- * elements of the Vector when using the Default memory space: <ul>
+ * elements of the Vector when using the Default memory space:
+ * <ul>
* <li> use get_values():
* @code
* Vector<double, MemorySpace::Default> vector(local_range, comm);