Information about one side of a corner in the forest. More...
#include <p4est_iterate.h>
Collaboration diagram for p4est_iter_corner_side:
Data Fields | |
| p4est_topidx_t | treeid |
| the tree that contains quad | |
| int8_t | corner |
| which of the quadrant's corners touches this corner | |
| int8_t | is_ghost |
| boolean: local (0) or ghost (1) | |
| p4est_quadrant_t * | quad |
| p4est_locidx_t | quadid |
| the index in the tree or ghost array | |
| int8_t | faces [2] |
| internal work data | |
Detailed Description
Information about one side of a corner in the forest.
If a quad is local (is_ghost is false), then its quadid indexes the tree's quadrant array; otherwise, it indexes the ghosts array. If a quadrant should be present, but it is not included in the ghost layer, then quad = NULL, is_ghost is true, and quadid = -1.
the faces field provides some additional information about the local topology: if side[i]->faces[j] == side[k]->faces[l], this indicates that there is a common face between these two sides of the corner.
The documentation for this struct was generated from the following file:
- src/p4est_iterate.h