Go to the documentation of this file.
41 nbrPatchIDs_(nbrPatchIDs),
62 label nbrPatchI = iter.key();
73 label nbrPatchI = iter.key();
85 const edge meshE =
edge(nbrMp[
e[0]], nbrMp[
e[1]]);
86 nbrEdges.
insert(meshE, nbrPatchI);
94 patch_.boundaryMesh().mesh(),
105 label nBndEdges = patch_.nEdges() - patch_.nInternalEdges();
116 label edgeI = patch_.nInternalEdges();
117 edgeI < patch_.nEdges();
121 const edge&
e = patch_.edges()[edgeI];
124 if (edgeFnd != nbrEdges.end())
126 initialEdges.
append(edgeI);
131 e.centre(patch_.localPoints()),
146 patch_.boundaryMesh().mesh(),
159 forAll(allFaceInfo, faceI)
161 if (allFaceInfo[faceI].valid(
calc.data()))
163 operator[](faceI) =
Foam::sqrt(allFaceInfo[faceI].distSqr());
points setSize(newPointi)
virtual ~patchPatchDist()
Destructor.
const dimensionedScalar mp
Proton mass.
T returnReduce(const T &Value, const BinaryOp &bop, const int tag=Pstream::msgType(), const label comm=UPstream::worldComm)
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
#define forAll(list, i)
Loop across all elements in list.
Wave propagation of information along patch. Every iteration information goes through one layer of fa...
label nEdges() const
Return number of edges in patch.
void calc(const argList &args, const Time &runTime, const fvMesh &mesh)
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
bool insert(const Key &, const T &newElmt)
Insert a new hashedEntry.
PrimitivePatch< face, SubList, const pointField & > primitivePatch
Foam::primitivePatch.
virtual void correct()
Correct for mesh geom/topo changes.
forAllConstIter(PtrDictionary< phaseModel >, mixture.phases(), phase)
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
const polyBoundaryMesh & boundaryMesh() const
Return boundaryMesh reference.
A patch is a list of labels that address the faces in the global face list.
patchPatchDist(const polyPatch &pp, const labelHashSet &nbrPatchIDs)
Construct from patch and neighbour patches.
const double e
Elementary charge.
iterator find(const Key &)
Find and return an iterator set at the hashedEntry.
DynamicList< T, SizeInc, SizeMult, SizeDiv > & append(const T &)
Append an element at the end of the list.
label nInternalEdges() const
Number of internal edges.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
dimensionedScalar sqrt(const dimensionedScalar &ds)
const labelList & meshPoints() const
Return labelList of mesh points in patch.