34 template<
class>
class FaceList,
49 Info<<
"labelList PrimitivePatch<Face, FaceList, PointField, PointType>" 51 <<
"calculating labels of patch edges in mesh edge list" 56 const edgeList& PatchEdges = edges();
73 (pp[PatchEdges[edgeI].start()], pp[PatchEdges[edgeI].end()]);
78 const labelList& curFaces = EdgeFaces[edgeI];
83 label curCell = faceCells[curFaces[facei]];
90 if (allEdges[ce[cellEdgeI]] == curEdge)
94 meshEdges[edgeI] = ce[cellEdgeI];
111 template<
class>
class FaceList,
125 Info<<
"labelList PrimitivePatch<Face, FaceList, PointField, PointType>" 126 <<
"::meshEdges() : " 127 <<
"calculating labels of patch edges in mesh edge list" 132 const edgeList& PatchEdges = edges();
144 const label globalPointi = pp[PatchEdges[edgeI].start()];
145 const edge curEdge(globalPointi, pp[PatchEdges[edgeI].end()]);
147 const labelList& pe = pointEdges[globalPointi];
151 if (allEdges[pe[i]] == curEdge)
153 meshEdges[edgeI] = pe[i];
168 template<
class>
class FaceList,
188 if (e == Edges[pe[peI]])
#define forAll(list, i)
Loop across all elements in list.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
void size(const label)
Override size to be inconsistent with allocated storage.
Ostream & endl(Ostream &os)
Add newline and flush stream.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
label start() const
Return start vertex label.
label whichEdge(const edge &) const
Given an edge in local point labels, return its.
labelList meshEdges(const edgeList &allEdges, const labelListList &cellEdges, const labelList &faceCells) const
Return labels of patch edges in the global edge list using.