33 template<
class>
class FaceList1,
37 template<
class>
class FaceList2,
66 p1PointLabels[nMatches] = pointI;
67 p2PointLabels[nMatches] = iter();
71 p1PointLabels.
setSize(nMatches);
72 p2PointLabels.
setSize(nMatches);
79 template<
class>
class FaceList1,
83 template<
class>
class FaceList2,
113 edgeToIndex.insert(meshE, edgeI);
123 if (iter != edgeToIndex.end())
125 p1EdgeLabels[nMatches] = iter();
126 p2EdgeLabels[nMatches] = edgeI;
127 sameOrientation[nMatches] = (meshE[0] == iter.key()[0]);
131 p1EdgeLabels.
setSize(nMatches);
132 p2EdgeLabels.
setSize(nMatches);
133 sameOrientation.
setSize(nMatches);
static void matchEdges(const PrimitivePatch< Face1, FaceList1, PointField1, PointType1 > &p1, const PrimitivePatch< Face2, FaceList2, PointField2, PointType2 > &p2, labelList &p1EdgeLabels, labelList &p2EdgeLabels, PackedBoolList &sameOrientation)
Find corresponding edges on patches sharing the same points.
const Map< label > & meshPointMap() const
Mesh point map. Given the global point index find its.
A HashTable to objects of type <T> with a label key.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
static void matchPoints(const PrimitivePatch< Face1, FaceList1, PointField1, PointType1 > &p1, const PrimitivePatch< Face2, FaceList2, PointField2, PointType2 > &p2, labelList &p1PointLabels, labelList &p2PointLabels)
Find corresponding points on patches sharing the same points.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
label nPoints() const
Return number of points supporting patch faces.
void setSize(const label)
Reset size of List.
void setSize(const label, const unsigned int &val=0u)
Alias for resize()
const dimensionedScalar e
Elementary charge.
const labelList & meshPoints() const
Return labelList of mesh points in patch. They are constructed.
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
A list of faces which address into the list of points.
static iteratorEnd end()
iteratorEnd set to beyond the end of any HashTable
iterator find(const Key &)
Find and return an iterator set at the hashedEntry.
label nEdges() const
Return number of edges in patch.