/**
* @name Creating meshes for basic geometries
*/
- //** @{ */
+ /** @{ */
/**
* Initialize the given triangulation with a hypercube (line in 1d, square
Triangulation<3> & vol_tria,
const CGALWrappers::AdditionalData<3> &data =
CGALWrappers::AdditionalData<3>{});
- //** @} */
+ /** @} */
/**
* @name Creating meshes from other meshes
*/
- //** @{ */
+ /** @{ */
/**
* Given the two triangulations specified as the first two arguments, create
const double p2 = 1.0,
const bool colorize = false);
- //** @} */
+ /** @} */
/**
* @name Creating lower-dimensional meshes
*
* Created from parts of higher-dimensional meshes.
*/
- //** @{ */
+ /** @{ */
#ifdef _MSC_VER
// Microsoft's VC++ has a bug where it doesn't want to recognize that
const std::set<types::boundary_id> &boundary_ids =
std::set<types::boundary_id>());
- //** @} */
+ /** @} */
/**
* @name Exceptions
*/
- //** @{ */
+ /** @{ */
/**
DeclExceptionMsg(ExcInvalidInputOrientation,
"The input to this function is oriented in a way that will"
" cause all cells to have negative measure.");
- //** @} */
+ /** @} */
#ifndef DOXYGEN
// These functions are only implemented with specializations; declare them
/** @} */
- /**
- * @name Keeping up with what happens to a triangulation
- * @{
- */
-
/**
* Alias for backward compatibility.
*
};
/**
+ * @name Keeping up with what happens to a triangulation
+ * @{
+ */
+
+ /**
* Signals for the various actions that a triangulation can do to itself.
*/
mutable Signals signals;
std::pair<std::pair<cell_iterator, unsigned int>, std::bitset<3>>>
periodic_face_map;
- /**
- * @name Cell iterator functions for internal use
- * @{
- */
-
/**
* Declare a number of iterator types for raw iterators, i.e., iterators
* that also iterate over holes in the list of cells left by cells that have
using raw_quad_iterator = typename IteratorSelector::raw_quad_iterator;
using raw_hex_iterator = typename IteratorSelector::raw_hex_iterator;
+ /**
+ * @name Cell iterator functions for internal use
+ * @{
+ */
+
/**
* Iterator to the first cell, used or not, on level @p level. If a level
* has no cells, a past-the-end iterator is returned.