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);
label nPoints() const
Return number of points supporting patch faces.
#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.
static iteratorEnd end()
iteratorEnd set to beyond the end of any HashTable
const labelList & meshPoints() const
Return labelList of mesh points in patch. They are constructed.
const Map< label > & meshPointMap() const
Mesh point map. Given the global point index find its.
iterator find(const Key &)
Find and return an iterator set at the hashedEntry.
A list of faces which address into the list of points.
const dimensionedScalar e
Elementary charge.
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.
void setSize(const label, const unsigned int &val=0u)
Alias for resize()
label nEdges() const
Return number of edges in patch.
void setSize(const label)
Reset size of List.
A HashTable to objects of type <T> with a label key.