|
131 | 131 | #endif |
132 | 132 |
|
133 | 133 | /* ---------------------------------------------------------------------- */ |
134 | | -/// TIMING- AND STAT-CONTEXT FOR OVERLAP EXCHANGE |
| 134 | +/* TIMING- AND STAT-CONTEXT FOR OVERLAP EXCHANGE */ |
135 | 135 | /* ---------------------------------------------------------------------- */ |
136 | 136 | /* Context and auxiliary functions for in-depth timing of exchange. */ |
137 | 137 |
|
@@ -417,7 +417,7 @@ sc_stats_print_x (int category, int package_id, int log_priority, int nvars, |
417 | 417 | } |
418 | 418 |
|
419 | 419 | /* ---------------------------------------------------------------------- */ |
420 | | -/// OVERLAP EXCHANGE |
| 420 | +/* OVERLAP EXCHANGE */ |
421 | 421 | /* ---------------------------------------------------------------------- */ |
422 | 422 | /* Abstract exchange routine for unknown point type (passed around as void |
423 | 423 | * pointer and handeĺed only by user-defined callbacks). */ |
@@ -1723,7 +1723,7 @@ overlap_exchange (p4est_t *pro4est, sc_array_t *points, sc_MPI_Comm concomm, |
1723 | 1723 | } |
1724 | 1724 |
|
1725 | 1725 | /* ---------------------------------------------------------------------- */ |
1726 | | -/// Application Producer and Consumer |
| 1726 | +/* APPLICATION PRODUCER AND CONSUMER */ |
1727 | 1727 | /* ---------------------------------------------------------------------- */ |
1728 | 1728 | /* Structs to handle the producer and the consumer mesh of a rather general |
1729 | 1729 | * overlap setting. Used both for the simple and the adaptive example. */ |
@@ -1800,7 +1800,7 @@ typedef struct global |
1800 | 1800 | global_t; |
1801 | 1801 |
|
1802 | 1802 | /* ---------------------------------------------------------------------- */ |
1803 | | -/// Mappings and Intersections |
| 1803 | +/* MAPPINGS AND INTERSECTIONS */ |
1804 | 1804 | /* ---------------------------------------------------------------------- */ |
1805 | 1805 | /* A general point struct and its intersect callback. Various mappings as well |
1806 | 1806 | * as corresponding inverse mappings are supplied as well. Used as a basis for |
@@ -2284,7 +2284,7 @@ coordinate_get_quadrant_corner (p4est_quadrant_t *q, int cid, double qxyz[3]) |
2284 | 2284 | } |
2285 | 2285 |
|
2286 | 2286 | /* ---------------------------------------------------------------------- */ |
2287 | | -/// Simple Example |
| 2287 | +/* SIMPLE EXAMPLE */ |
2288 | 2288 | /* ---------------------------------------------------------------------- */ |
2289 | 2289 | /* Simple example of a overlap_exchange application. It computes artificial |
2290 | 2290 | * solution data on the producer side and queries it for the center of every |
@@ -2646,7 +2646,7 @@ simple_verify (global_t *g) |
2646 | 2646 | } |
2647 | 2647 |
|
2648 | 2648 | /* ---------------------------------------------------------------------- */ |
2649 | | -/// VTK-Output of Simple Example |
| 2649 | +/* VTK-OUTPUT OF SIMPLE EXAMPLE */ |
2650 | 2650 | /* ---------------------------------------------------------------------- */ |
2651 | 2651 | /* Visualiziation of the results of the overlap_exchange. */ |
2652 | 2652 |
|
@@ -2831,7 +2831,7 @@ simple_output_results (global_t *g, int text, int vtk) |
2831 | 2831 | } |
2832 | 2832 |
|
2833 | 2833 | /* ---------------------------------------------------------------------- */ |
2834 | | -/// Refinement Methods |
| 2834 | +/* REFINEMENT METHODS */ |
2835 | 2835 | /* ---------------------------------------------------------------------- */ |
2836 | 2836 | /* Several refinement methods for the general example setup. */ |
2837 | 2837 |
|
@@ -3027,7 +3027,7 @@ refine_polygon_fn (p4est_t *p4est, p4est_topidx_t which_tree, |
3027 | 3027 | } |
3028 | 3028 |
|
3029 | 3029 | /* ---------------------------------------------------------------------- */ |
3030 | | -/// Adaptive Refinement |
| 3030 | +/* ADAPTIVE REFINEMENT */ |
3031 | 3031 | /* ---------------------------------------------------------------------- */ |
3032 | 3032 | /* Adaptive refinement method based on overlap_exchange. Every consumer query |
3033 | 3033 | * point is discretized by a 3x3(x3) tensor of query points. These are used to |
@@ -3350,7 +3350,7 @@ adaptive_refine_fn (p4est_t *p4est, p4est_topidx_t which_tree, |
3350 | 3350 | } |
3351 | 3351 |
|
3352 | 3352 | /* ---------------------------------------------------------------------- */ |
3353 | | -/// Example Applications |
| 3353 | +/* EXAMPLE APPLICATIONS */ |
3354 | 3354 | /* ---------------------------------------------------------------------- */ |
3355 | 3355 | /* General example workflow creating a consumer and a producer mesh, refining |
3356 | 3356 | * them and performing a simple overlap before evaluating the results. */ |
|
0 commit comments