Go to the documentation of this file.
71 #ifndef edgeFaceCirculator_H
72 #define edgeFaceCirculator_H
106 bool isBoundaryEdge_;
110 label startFaceLabel_;
119 inline void setEnd();
122 inline void setFace(
const label facei,
const label celli);
125 inline void otherFace(
const label celli);
142 const bool isBoundaryEdge
168 inline label
index()
const;
176 inline bool sameOrder(
const label v0,
const label v1)
const;
void operator=(const edgeFaceCirculator &iter)
bool operator!=(const edgeFaceCirculator &iter) const
edgeFaceCirculator & operator++()
Step to next face. Uses no edge addressing!
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.
Walks from starting face around edge.
void setCanonical()
Set edge to a unique state so different ones can be compared.
bool sameOrder(const label v0, const label v1) const
Helper: return true if normal of generated face points along.
bool operator==(const edgeFaceCirculator &iter) const
edgeFaceCirculator cbegin() const
label cellLabel() const
Helper: get the neighbouring cell according to the ownerSide.
A face is a list of labels corresponding to mesh vertices.
Various functions to operate on Lists.
bool isInternalFace() const
Return true if the face label corresponds to an internal face.
const edgeFaceCirculator cend() const
edgeFaceCirculator begin() const
Iterator set to the beginning face. For internal edges this is.
label faceLabel() const
Return the face label, -1 for end iterator.
const edgeFaceCirculator end() const
Iterator set to beyond the end of the walk.
Cell-face mesh analysis engine.