Go to the documentation of this file.
72 scalar minDist = GREAT;
75 for (
const label patchFacei : wallFaces)
82 minFacei =
patch.start() + patchFacei;
96 const label patchFacei,
103 neighbours.
append(patchFacei);
108 for (
const label nbr : faceNeighbours)
110 if (!neighbours.found(nbr))
120 const face&
f =
patch.localFaces()[patchFacei];
124 label pointi =
f[fp];
128 for (
const label facei : pointNbs)
131 if (!neighbours.found(facei))
149 nbs.insert(pointNbs);
153 for (
const label nb : neighbours)
158 <<
"getPointNeighbours : patchFacei:" << patchFacei
159 <<
" verts:" <<
f <<
endl;
164 <<
"point:" <<
f[fp] <<
" pointFaces:"
168 for (
const label facei : neighbours)
171 <<
"fast nbr:" << facei
176 <<
"Problem: fast pointNeighbours routine included " << nb
177 <<
" which is not in proper neighbour list " << nbs.toc()
186 <<
"Problem: fast pointNeighbours routine did not find "
203 if (patchIDs.
found(patchi))
225 if (patchIDs.
found(patchi))
253 if (patchIDs.
found(patchi))
260 getPointNeighbours(
patch, patchFacei, neighbours);
262 label celli = faceOwner[
patch.start() + patchFacei];
266 wallDistCorrected[celli] = smallestDist
275 nearestFace.insert(celli, minFacei);
296 if (patchIDs.
found(patchi))
303 forAll(meshPoints, meshPointi)
305 const label vertI = meshPoints[meshPointi];
309 for (
const label celli : neighbours)
311 if (!nearestFace.found(celli))
313 const labelList& wallFaces = pointFaces[meshPointi];
317 wallDistCorrected[celli] = smallestDist
326 nearestFace.insert(celli, minFacei);
int debug
Static debugging option.
Describes the interaction of a face and a point. It carries the info of a successful hit and (if succ...
label maxPatchSize(const labelHashSet &patchIDs) const
Size of largest patch (out of supplied subset of patches)
scalar distance() const noexcept
Return distance to hit.
const polyBoundaryMesh & boundaryMesh() const
Return boundary mesh.
Ostream & endl(Ostream &os)
Add newline and flush stream.
Mesh consisting of general polyhedral cells.
#define forAll(list, i)
Loop across all elements in list.
void correctBoundaryPointCells(const labelHashSet &patchIDs, scalarField &wallDistCorrected, Map< label > &nearestFace) const
Correct all cells connected to wall (via point). Sets values in.
labelHashSet getPatchIDs() const
Get patchIDs of/derived off certain type (e.g. 'processorPolyPatch')
A patch is a list of labels that address the faces in the global face list.
DynamicList< T, SizeMin > & append(const T &val)
Append an element to the end of this list.
void clear()
Clear the addressed list, i.e. set the size to zero.
virtual const labelList & faceOwner() const
Return face owner.
label sumPatchSize(const labelHashSet &patchIDs) const
Sum of patch sizes (out of supplied subset of patches).
#define SeriousErrorInFunction
Report an error message using Foam::SeriousError.
wordList patchNames(nPatches)
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
errorManip< error > abort(error &err)
const vectorField & cellCentres() const
scalar smallestDist(const point &p, const polyPatch &patch, const labelUList &wallFaces, label &meshFacei) const
Calculate smallest true distance (and face index)
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
const std::string patch
OpenFOAM patch number as a std::string.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
labelHashSet patchSet(const UList< wordRe > &patchNames, const bool warnNotFound=true, const bool useGroups=true) const
Return the set of patch IDs corresponding to the given names.
const labelListList & pointCells() const
dimensioned< Type > sum(const DimensionedField< Type, GeoMesh > &df)
Addressing for all faces on surface of mesh. Can either be read from polyMesh or from triSurface....
A face is a list of labels corresponding to mesh vertices.
void correctBoundaryFaceCells(const labelHashSet &patchIDs, scalarField &wallDistCorrected, Map< label > &nearestFace) const
Correct all cells connected to boundary (via face). Sets values in.
bool found(const Key &key) const
Return true if hashed entry is found in table.
void getPointNeighbours(const primitivePatch &, const label patchFacei, DynamicList< label > &) const
Get faces sharing point with face on patch.
defineTypeNameAndDebug(combustionModel, 0)
A list of faces which address into the list of points.