33 template<
class>
class FaceList,
58 const labelList& pEdges = pointEdges[pointi];
62 label edgeI = pEdges[0];
64 label prevFacei = edgeFaces[edgeI][0];
69 label nVisitedEdges = 0;
76 const labelList& eFaces = edgeFaces[edgeI];
78 if (eFaces.
size() != 2)
83 label facei = eFaces[0];
84 if (facei == prevFacei)
90 const labelList& fEdges = faceEdges[facei];
94 const label nextEdgeI = fEdges[feI];
95 const edge& nextEdge = edges[nextEdgeI];
100 && (nextEdge.
start() == pointi || nextEdge.
end() == pointi)
111 if (nVisitedEdges > nPointEdges)
114 <<
"Unable to order pointEdges as the face connections " 115 <<
"are not circular" <<
nl 116 <<
" Original pointEdges = " << pEdges <<
nl 117 <<
" New pointEdges = " << newEdgeList
120 newEdgeList = pEdges;
125 }
while (edgeI != pEdges[0]);
127 if (newEdgeList.
size() == nPointEdges)
131 if (
findIndex(newEdgeList, pEdges[eI]) == -1)
134 <<
"Cannot find all original edges in the new list" 136 <<
" Original pointEdges = " << pEdges <<
nl 137 <<
" New pointEdges = " << newEdgeList
140 newEdgeList = pEdges;
146 sortedPointEdges[pointi] = newEdgeList;
150 return sortedPointEdges;
const labelListList & pointEdges() const
Return point-edge addressing.
#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.
A list of faces which address into the list of points.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
void setCapacity(const label)
Alter the size of the underlying storage.
DynamicList< T, SizeInc, SizeMult, SizeDiv > & append(const T &)
Append an element at the end of the list.
const labelListList & edgeFaces() const
Return edge-face addressing.
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
label findIndex(const ListType &, typename ListType::const_reference, const label start=0)
Find first occurrence of given element and return index,.
#define WarningInFunction
Report a warning using Foam::Warning.
label end() const
Return end vertex label.
const labelListList & faceEdges() const
Return face-edge addressing.
void clear()
Clear the addressed list, i.e. set the size to zero.
label start() const
Return start vertex label.