30 template<
class FaceList1,
class Po
intField1,
class FaceList2,
class Po
intField2>
56 p1PointLabels[nMatches] = pointi;
57 p2PointLabels[nMatches] = iter();
61 p1PointLabels.
setSize(nMatches);
62 p2PointLabels.
setSize(nMatches);
66 template<
class FaceList1,
class Po
intField1,
class FaceList2,
class Po
intField2>
93 edgeToIndex.
insert(meshE, edgeI);
103 if (iter != edgeToIndex.
end())
105 p1EdgeLabels[nMatches] = iter();
106 p2EdgeLabels[nMatches] = edgeI;
107 sameOrientation[nMatches] = (meshE[0] == iter.key()[0]);
111 p1EdgeLabels.
setSize(nMatches);
112 p2EdgeLabels.
setSize(nMatches);
113 sameOrientation.
setSize(nMatches);
#define forAll(list, i)
Loop across all elements in list.
bool insert(const Key &, const T &newElmt)
Insert a new hashedEntry.
iterator find(const Key &)
Find and return an iterator set at the hashedEntry.
void setSize(const label)
Reset size of List.
A HashTable to objects of type <T> with a label key.
void setSize(const label, const unsigned int &val=0u)
Alias for resize()
A list of faces which address into the list of points.
label nEdges() const
Return number of edges in patch.
label nPoints() const
Return number of points supporting patch faces.
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
const Map< label > & meshPointMap() const
Mesh point map. Given the global point index find its.
const labelList & meshPoints() const
Return labelList of mesh points in patch. They are constructed.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
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 iteratorEnd end()
iteratorEnd set to beyond the end of any HashTable