35 class FaceList1,
class PointField1,
36 class FaceList2,
class PointField2
54 const label meshPointi = p1.
meshPoints()[pointi];
60 p1PointLabels[nMatches] = pointi;
61 p2PointLabels[nMatches] = iter.val();
66 p1PointLabels.
resize(nMatches);
67 p2PointLabels.
resize(nMatches);
73 class FaceList1,
class PointField1,
74 class FaceList2,
class PointField2
89 sameOrientation =
false;
97 edgeToIndex.insert(p1.
meshEdge(edgei), edgei);
104 const auto iter = edgeToIndex.cfind(meshEdge2);
108 p1EdgeLabels[nMatches] = iter.val();
109 p2EdgeLabels[nMatches] = edgei;
110 sameOrientation.
set(nMatches, (meshEdge2[0] == iter.key()[0]));
115 p1EdgeLabels.
resize(nMatches);
116 p2EdgeLabels.
resize(nMatches);
117 sameOrientation.
resize(nMatches);
label nPoints() const
Number of points supporting patch faces.
void set(const bitSet &bitset)
Set specified bits from another bitset.
void resize(const label len)
Adjust allocated size of list.
const labelList & meshPoints() const
Return labelList of mesh points in patch.
void resize(const label numElem, const unsigned int val=0u)
Reset addressable list size, does not shrink the allocated size.
#define forAll(list, i)
Loop across all elements in list.
A list of faces which address into the list of points.
const Map< label > & meshPointMap() const
Mesh point map.
const_iterator cfind(const Key &key) const
Find and return an const_iterator set at the hashed entry.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
label nEdges() const
Number of edges in patch.
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
edge meshEdge(const label edgei) const
From patch edge to global edge using meshPoints.