/*---------------------------------------------------------------------------*\ ========= | \\ / F ield | foam-extend: Open Source CFD \\ / O peration | \\ / A nd | For copyright notice see file Copyright \\/ M anipulation | ------------------------------------------------------------------------------- License This file is part of foam-extend. foam-extend 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. foam-extend 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 foam-extend. If not, see . \*---------------------------------------------------------------------------*/ #include "tetPointFieldReconstructor.H" // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // namespace Foam { // * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * // // Calculate point addressing labelList tetPointFieldReconstructor::procAddressing ( const label procNo ) const { // Allocate the addressing labelList addr(procMeshes_[procNo].nPoints(), -1); const labelList& pointAddr = pointProcAddressing_[procNo]; const labelList& cellAddr = cellProcAddressing_[procNo]; label nAddr = 0; // Insert point addressing // Use only live points. HJ, 14/Apr/2009 for (label pointI = 0; pointI < procMeshes_[procNo]().nPoints(); pointI++) { addr[nAddr] = pointAddr[pointI]; nAddr++; } // Insert face addressing. Only for face decomposition const labelList& faceAddr = faceProcAddressing_[procNo]; const label faceOffset = mesh_.faceOffset(); // Use only live faces. HJ, 14/Apr/2009 for (label faceI = 0; faceI < procMeshes_[procNo]().nFaces(); faceI++) { // Remember to decrement the index by one (turning index) addr[nAddr] = faceOffset + mag(faceAddr[faceI]) - 1; nAddr++; } // Insert cell addressing const label cellOffset = mesh_.cellOffset(); forAll (cellAddr, cellI) { addr[nAddr] = cellOffset + cellAddr[cellI]; nAddr++; } return addr; } labelList tetPointFieldReconstructor::procPatchAddressing ( const labelList& procToGlobalAddr, const label procNo, const label patchNo ) const { labelList addr(procMeshes_[procNo].boundary()[patchNo].size(), -1); // Algorithm: // Go to the global patch, create a lookup list the size of all // points in the mesh and then gather the points for the current // patch. labelList pointLookup(mesh_.nPoints(), -1); const labelList& globalPatchPoints = mesh_.boundary()[boundaryProcAddressing_[procNo][patchNo]].meshPoints(); forAll (globalPatchPoints, pointI) { pointLookup[globalPatchPoints[pointI]] = pointI; } // Gather the information const labelList& procPatchPoints = procMeshes_[procNo].boundary()[patchNo].meshPoints(); forAll (procPatchPoints, pointI) { addr[pointI] = pointLookup[procToGlobalAddr[procPatchPoints[pointI]]]; } if (addr.size() && min(addr) < 0) { FatalErrorIn ( "labelList tetPointFieldReconstructor::" "patchProcAddressing\n" "(\n" " const labelList& procToGlobalAddr,\n" " const label procNo,\n" " const label patchNo\n" ") const" ) << "error in addressing" << abort(FatalError); } return addr; } // * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * // // Construct from components tetPointFieldReconstructor::tetPointFieldReconstructor ( tetPolyMesh& mesh, const PtrList& procMeshes, const PtrList& pointProcAddressing, const PtrList& faceProcAddressing, const PtrList& cellProcAddressing, const PtrList& boundaryProcAddressing ) : mesh_(mesh), procMeshes_(procMeshes), pointProcAddressing_(pointProcAddressing), faceProcAddressing_(faceProcAddressing), cellProcAddressing_(cellProcAddressing), boundaryProcAddressing_(boundaryProcAddressing) {} // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // } // End namespace Foam // ************************************************************************* //