Add the OpenFOAM source tree

applications/utilities/parallelProcessing/decomposePar/pointFieldDecomposer.C

@@ -0,0 +1,128 @@
+/*---------------------------------------------------------------------------*\
+  =========                 |
+  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
+   \\    /   O peration     |
+    \\  /    A nd           | Copyright (C) 2011-2013 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/>.
+
+\*---------------------------------------------------------------------------*/
+
+#include "pointFieldDecomposer.H"
+
+// * * * * * * * * * * * * * * * * Constructors  * * * * * * * * * * * * * * //
+
+Foam::pointFieldDecomposer::patchFieldDecomposer::patchFieldDecomposer
+(
+    const pointPatch& completeMeshPatch,
+    const pointPatch& procMeshPatch,
+    const labelList& directAddr
+)
+:
+    pointPatchFieldMapperPatchRef
+    (
+        completeMeshPatch,
+        procMeshPatch
+    ),
+    directAddressing_(procMeshPatch.size(), -1),
+    hasUnmapped_(false)
+{
+    // Create the inverse-addressing of the patch point labels.
+    labelList pointMap(completeMeshPatch.boundaryMesh().mesh().size(), -1);
+
+    const labelList& completeMeshPatchPoints = completeMeshPatch.meshPoints();
+
+    forAll(completeMeshPatchPoints, pointi)
+    {
+        pointMap[completeMeshPatchPoints[pointi]] = pointi;
+    }
+
+    // Use the inverse point addressing to create the addressing table for this
+    // patch
+    const labelList& procMeshPatchPoints = procMeshPatch.meshPoints();
+
+    forAll(procMeshPatchPoints, pointi)
+    {
+        directAddressing_[pointi] =
+            pointMap[directAddr[procMeshPatchPoints[pointi]]];
+    }
+
+    // Check that all the patch point addresses are set
+    if (directAddressing_.size() && min(directAddressing_) < 0)
+    {
+        hasUnmapped_ = true;
+
+        FatalErrorIn
+        (
+            "pointFieldDecomposer::patchFieldDecomposer()"
+        )   << "Incomplete patch point addressing"
+            << abort(FatalError);
+    }
+}
+
+
+Foam::pointFieldDecomposer::pointFieldDecomposer
+(
+    const pointMesh& completeMesh,
+    const pointMesh& procMesh,
+    const labelList& pointAddressing,
+    const labelList& boundaryAddressing
+)
+:
+    completeMesh_(completeMesh),
+    procMesh_(procMesh),
+    pointAddressing_(pointAddressing),
+    boundaryAddressing_(boundaryAddressing),
+    patchFieldDecomposerPtrs_
+    (
+        procMesh_.boundary().size(),
+        static_cast<patchFieldDecomposer*>(NULL)
+    )
+{
+    forAll(boundaryAddressing_, patchi)
+    {
+        if (boundaryAddressing_[patchi] >= 0)
+        {
+            patchFieldDecomposerPtrs_[patchi] = new patchFieldDecomposer
+            (
+                completeMesh_.boundary()[boundaryAddressing_[patchi]],
+                procMesh_.boundary()[patchi],
+                pointAddressing_
+            );
+        }
+    }
+}
+
+
+// * * * * * * * * * * * * * * * * Destructor  * * * * * * * * * * * * * * * //
+
+Foam::pointFieldDecomposer::~pointFieldDecomposer()
+{
+    forAll(patchFieldDecomposerPtrs_, patchi)
+    {
+        if (patchFieldDecomposerPtrs_[patchi])
+        {
+            delete patchFieldDecomposerPtrs_[patchi];
+        }
+    }
+}
+
+
+// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
+
+// ************************************************************************* //