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);
label nPoints() const
Return number of points supporting patch faces.
#define forAll(list, i)
Loop across all elements in list.
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.
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 Map< label > & meshPointMap() const
Mesh point map. Given the global point index find its.
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.
Map from edge (expressed as its endpoints) to value.
void setSize(const label)
Reset size of List.
const dimensionedScalar e
Elementary charge.
A HashTable to objects of type <T> with a label key.