Download data/src/conversion/meshReader/createPolyBoundary.C from introvoyz042/OpenFOAM-dev: direct link, hf CLI and curl.
- Browser
- Download file 13.1 kB
-
https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/src/conversion/meshReader/createPolyBoundary.C
- Command line
-
hf download hf://datasets/introvoyz042/OpenFOAM-dev/data/src/conversion/meshReader/createPolyBoundary.C
-
curl -L -o createPolyBoundary.C https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/src/conversion/meshReader/createPolyBoundary.C
13.1 kB
| /*---------------------------------------------------------------------------*\ | |
| ========= | | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox | |
| \\ / O peration | Website: https://openfoam.org | |
| \\ / A nd | Copyright (C) 2011-2026 OpenFOAM Foundation | |
| \\/ M anipulation | | |
| ------------------------------------------------------------------------------- | |
| License | |
| This file is part of OpenFOAM. | |
| OpenFOAM is free software: you can redistribute it and/or modify it | |
| under the terms of the GNU General Public License as published by | |
| the Free Software Foundation, either version 3 of the License, or | |
| (at your option) any later version. | |
| OpenFOAM is distributed in the hope that it will be useful, but WITHOUT | |
| ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| for more details. | |
| You should have received a copy of the GNU General Public License | |
| along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>. | |
| Description | |
| boundary faces | |
| - use pointCells when searching for connectivity | |
| - initialise the cell connectivity with '-1' | |
| - find both cell faces corresponding to the baffles and mark them | |
| to prevent a connection | |
| - standard connectivity checks | |
| - added baffle and monitoring support | |
| \*---------------------------------------------------------------------------*/ | |
| // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // | |
| void Foam::meshReader::addPolyBoundaryFace | |
| ( | |
| const label cellId, | |
| const label cellFaceId, | |
| const label nCreatedFaces | |
| ) | |
| { | |
| Info<< nCreatedFaces | |
| << " add bnd for cell " << cellId | |
| << " face " << cellFaceId | |
| << " (original cell " << origCellId_[cellId] << ")" | |
| << endl; | |
| // standard case: volume cells | |
| const face& thisFace = cellFaces_[cellId][cellFaceId]; | |
| // Debugging | |
| if (cellPolys_[cellId][cellFaceId] > nInternalFaces_) | |
| { | |
| InfoInFunction | |
| << "Problem with face: " << thisFace << endl | |
| << "Probably multiple definitions " | |
| << "of a single boundary face." << endl | |
| << endl; | |
| } | |
| else if (cellPolys_[cellId][cellFaceId] >= 0) | |
| { | |
| InfoInFunction | |
| << "Problem with face: " << thisFace << endl | |
| << "Probably trying to define a boundary face " | |
| << "on a previously matched internal face." << endl | |
| << "Internal face: " | |
| << meshFaces_[cellPolys_[cellId][cellFaceId]] | |
| << endl; | |
| } | |
| meshFaces_[nCreatedFaces] = thisFace; | |
| cellPolys_[cellId][cellFaceId] = nCreatedFaces; | |
| } | |
| void Foam::meshReader::addPolyBoundaryFace | |
| ( | |
| const cellFaceIdentifier& identifier, | |
| const label nCreatedFaces | |
| ) | |
| { | |
| addPolyBoundaryFace(identifier.cell, identifier.face, nCreatedFaces); | |
| } | |
| // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // | |
| void Foam::meshReader::createPolyBoundary() | |
| { | |
| label nBoundaryFaces = 0; | |
| label nMissingFaces = 0; | |
| label nInterfaces = 0; | |
| const faceListList& cFaces = cellFaces(); | |
| // determine number of non-patched faces: | |
| forAll(cellPolys_, celli) | |
| { | |
| cell& curCell = cellPolys_[celli]; | |
| forAll(curCell, fI) | |
| { | |
| if (curCell[fI] < 0) | |
| { | |
| nMissingFaces++; | |
| } | |
| } | |
| } | |
| forAll(boundaryIds_, patchi) | |
| { | |
| nBoundaryFaces += boundaryIds_[patchi].size(); | |
| } | |
| Info<< nl | |
| << "There are " << nMissingFaces | |
| << " faces to be patched and " << nBoundaryFaces | |
| << " specified - collect missed boundaries to final patch" << endl; | |
| patchStarts_.setSize(boundaryIds_.size()); | |
| patchSizes_.setSize(boundaryIds_.size()); | |
| label nCreatedFaces = nInternalFaces_; | |
| label baffleOffset = cFaces.size(); | |
| interfaces_.setSize(baffleIds_.size()); | |
| nBoundaryFaces = 0; | |
| forAll(boundaryIds_, patchi) | |
| { | |
| const List<cellFaceIdentifier>& idList = boundaryIds_[patchi]; | |
| patchStarts_[patchi] = nCreatedFaces; | |
| // write each baffle side separately | |
| if (patchPhysicalTypes_[patchi] == "baffle") | |
| { | |
| label count = 0; | |
| for (label side = 0; side < 2; ++side) | |
| { | |
| label position = nInterfaces; | |
| forAll(idList, bndI) | |
| { | |
| label baffleI = idList[bndI].cell - baffleOffset; | |
| if | |
| ( | |
| baffleI >= 0 | |
| && baffleI < baffleFaces_.size() | |
| && baffleIds_[baffleI].size() | |
| ) | |
| { | |
| addPolyBoundaryFace | |
| ( | |
| baffleIds_[baffleI][side], | |
| nCreatedFaces | |
| ); | |
| // remove applied boundaries (2nd pass) | |
| if (side == 1) | |
| { | |
| baffleIds_[baffleI].clear(); | |
| } | |
| interfaces_[position][side] = nCreatedFaces; | |
| nBoundaryFaces++; | |
| nCreatedFaces++; | |
| position++; | |
| count++; | |
| } | |
| } | |
| } | |
| nInterfaces += (count - (count % 2)) / 2; | |
| } | |
| else if (patchPhysicalTypes_[patchi] == "monitoring") | |
| { | |
| // translate the "monitoring" pseudo-boundaries to face sets | |
| List<label> monitoring(idList.size()); | |
| label monitorI = 0; | |
| forAll(idList, bndI) | |
| { | |
| label cellId = idList[bndI].cell; | |
| label faceId = idList[bndI].face; | |
| // standard case: volume cells | |
| if (cellId < baffleOffset) | |
| { | |
| label faceNr = cellPolys_[cellId][faceId]; | |
| if (faceNr >= 0) | |
| { | |
| monitoring[monitorI++] = faceNr; | |
| } | |
| } | |
| } | |
| monitoringSets_.insert(patchNames_[patchi], monitoring); | |
| } | |
| else | |
| { | |
| forAll(idList, bndI) | |
| { | |
| // standard case: volume cells | |
| if (idList[bndI].cell < baffleOffset) | |
| { | |
| addPolyBoundaryFace | |
| ( | |
| idList[bndI], | |
| nCreatedFaces | |
| ); | |
| nBoundaryFaces++; | |
| nCreatedFaces++; | |
| } | |
| } | |
| } | |
| patchSizes_[patchi] = nCreatedFaces - patchStarts_[patchi]; | |
| } | |
| // add in missing faces | |
| Info<< "Missing faces added to patch after face " | |
| << nCreatedFaces << ":" <<endl; | |
| nMissingFaces = 0; | |
| // look for baffles first - keep them together at the start of the patch | |
| for (label side = 0; side < 2; ++side) | |
| { | |
| label position = nInterfaces; | |
| forAll(baffleIds_, baffleI) | |
| { | |
| if (baffleIds_[baffleI].size()) | |
| { | |
| // add each side for each baffle | |
| addPolyBoundaryFace | |
| ( | |
| baffleIds_[baffleI][side], | |
| nCreatedFaces | |
| ); | |
| interfaces_[position][side] = nCreatedFaces; | |
| // remove applied boundaries (2nd pass) | |
| if (side == 1) | |
| { | |
| baffleIds_[baffleI].clear(); | |
| } | |
| nMissingFaces++; | |
| nCreatedFaces++; | |
| position++; | |
| } | |
| } | |
| } | |
| nInterfaces += (nMissingFaces - (nMissingFaces % 2)) / 2; | |
| // scan for any other missing faces | |
| forAll(cellPolys_, celli) | |
| { | |
| const labelList& curFaces = cellPolys_[celli]; | |
| forAll(curFaces, cellFacei) | |
| { | |
| if (curFaces[cellFacei] < 0) | |
| { | |
| // just report the first few | |
| if (nMissingFaces < 4) | |
| { | |
| const face& thisFace = cFaces[celli][cellFacei]; | |
| Info<< " cell " << celli << " face " << cellFacei | |
| << " (original cell " << origCellId_[celli] << ")" | |
| << " face: " << thisFace | |
| << endl; | |
| } | |
| else if (nMissingFaces == 5) | |
| { | |
| Info<< " ..." << nl << endl; | |
| } | |
| addPolyBoundaryFace(celli, cellFacei, nCreatedFaces); | |
| nMissingFaces++; | |
| nCreatedFaces++; | |
| } | |
| } | |
| } | |
| Info<< "Added " << nMissingFaces << " unmatched faces" << endl; | |
| // Add missing faces to last patch ('Default_Empty' etc.) | |
| if (nMissingFaces > 0) | |
| { | |
| patchSizes_.last() = nMissingFaces; | |
| } | |
| // reset the size of the face list | |
| meshFaces_.setSize(nCreatedFaces); | |
| // check the mesh for face mismatch | |
| // (faces addressed once or more than twice) | |
| labelList markupFaces(meshFaces_.size(), 0); | |
| forAll(cellPolys_, celli) | |
| { | |
| const labelList& curFaces = cellPolys_[celli]; | |
| forAll(curFaces, facei) | |
| { | |
| markupFaces[curFaces[facei]]++; | |
| } | |
| } | |
| for (label i = nInternalFaces_; i < markupFaces.size(); i++) | |
| { | |
| markupFaces[i]++; | |
| } | |
| label nProblemFaces = 0; | |
| forAll(markupFaces, facei) | |
| { | |
| if (markupFaces[facei] != 2) | |
| { | |
| const face& problemFace = meshFaces_[facei]; | |
| InfoInFunction | |
| << "Problem with face " << facei << ": addressed " | |
| << markupFaces[facei] << " times (should be 2!). Face: " | |
| << problemFace << endl; | |
| nProblemFaces++; | |
| } | |
| } | |
| if (nProblemFaces > 0) | |
| { | |
| Info<< "Number of incorrectly matched faces: " | |
| << nProblemFaces << endl; | |
| } | |
| // adjust for missing members | |
| if (nInterfaces < interfaces_.size()) | |
| { | |
| interfaces_.setSize(nInterfaces); | |
| } | |
| Info<< "Number of boundary faces: " << nBoundaryFaces << nl | |
| << "Total number of faces: " << nCreatedFaces << nl | |
| << "Number of interfaces: " << nInterfaces << endl; | |
| } | |
| // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // | |
| Foam::List<Foam::polyPatch*> | |
| Foam::meshReader::polyBoundaryPatches(const polyMesh& mesh) | |
| { | |
| label nUsed = 0, nEmpty = 0; | |
| label nPatches = patchStarts_.size(); | |
| // avoid empty patches - move to the end of the lists and truncate | |
| labelList oldToNew = identityMap(nPatches); | |
| forAll(patchSizes_, patchi) | |
| { | |
| if (patchSizes_[patchi] > 0) | |
| { | |
| oldToNew[patchi] = nUsed++; | |
| } | |
| else | |
| { | |
| nEmpty++; | |
| oldToNew[patchi] = nPatches - nEmpty; | |
| } | |
| } | |
| nPatches = nUsed; | |
| if (nEmpty) | |
| { | |
| Info<< "Removing " << nEmpty << " empty patches" << endl; | |
| inplaceReorder(oldToNew, patchTypes_); | |
| inplaceReorder(oldToNew, patchNames_); | |
| inplaceReorder(oldToNew, patchStarts_); | |
| inplaceReorder(oldToNew, patchSizes_); | |
| } | |
| patchTypes_.setSize(nPatches); | |
| patchNames_.setSize(nPatches); | |
| patchStarts_.setSize(nPatches); | |
| patchSizes_.setSize(nPatches); | |
| List<polyPatch*> p(nPatches); | |
| // All patch dictionaries | |
| PtrList<dictionary> patchDicts(patchNames_.size()); | |
| // Default boundary patch types | |
| word defaultFacesType(emptyPolyPatch::typeName); | |
| // we could consider dropping this entirely | |
| preservePatchTypes | |
| ( | |
| mesh, | |
| mesh.instance(), | |
| mesh.meshDir(), | |
| patchNames_, | |
| patchDicts, | |
| "defaultFaces", | |
| defaultFacesType | |
| ); | |
| forAll(patchDicts, patchi) | |
| { | |
| if (!patchDicts.set(patchi)) | |
| { | |
| patchDicts.set(patchi, new dictionary()); | |
| } | |
| dictionary& patchDict = patchDicts[patchi]; | |
| // add but not overwrite type | |
| patchDict.add("type", patchTypes_[patchi], false); | |
| if (patchPhysicalTypes_.size() && patchPhysicalTypes_[patchi].size()) | |
| { | |
| patchDict.add("startFace", patchPhysicalTypes_[patchi], false); | |
| } | |
| // overwrite sizes and start | |
| patchDict.add("nFaces", patchSizes_[patchi], true); | |
| patchDict.add("startFace", patchStarts_[patchi], true); | |
| } | |
| forAll(patchStarts_, patchi) | |
| { | |
| p[patchi] = polyPatch::New | |
| ( | |
| patchNames_[patchi], | |
| patchDicts[patchi], | |
| patchi, | |
| mesh.boundary() | |
| ).ptr(); | |
| } | |
| return p; | |
| } | |
| // ************************************************************************* // | |