69 #ifndef edgeFaceCirculator_H 70 #define edgeFaceCirculator_H 110 bool isBoundaryEdge_;
114 label startFaceLabel_;
120 inline void setEnd();
123 inline void setFace(
const label facei,
const label celli);
127 inline void otherFace(
const label celli);
141 const bool isBoundaryEdge
const edgeFaceCirculator & end() const
Iterator set to beyond the end of the walk.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
A face is a list of labels corresponding to mesh vertices.
Cell-face mesh analysis engine.
static label getMinIndex(const face &f, const label v0, const label v1)
Helper: find index in face of edge or -1. Index is such that edge is.
void operator=(const edgeFaceCirculator &iter)
bool sameOrder(const label v0, const label v1) const
Helper: return true if normal of generated face points along.
Various functions to operate on Lists.
bool operator!=(const edgeFaceCirculator &iter) const
edgeFaceCirculator & operator++()
Step to next face. Uses no edge addressing!
const edgeFaceCirculator & cend() const
edgeFaceCirculator(const primitiveMesh &mesh, const label faceLabel, const bool ownerSide, const label index, const bool isBoundaryEdge)
Construct from components.
edgeFaceCirculator begin() const
Iterator set to the beginning face. For internal edges this is.
bool operator==(const edgeFaceCirculator &iter) const
Walks from starting face around edge.
void setCanonical()
Set edge to a unique state so different ones can be compared.
edgeFaceCirculator cbegin() const
label cellLabel() const
Helper: get the neighbouring cell according to the ownerSide.