File size: 4,620 Bytes
5a600cf | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-2025 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 "primitiveMesh.H"
#include "cell.H"
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
void Foam::primitiveMesh::calcPointCells() const
{
// Loop through cells and mark up points
if (debug)
{
Pout<< "primitiveMesh::calcPointCells() : "
<< "calculating pointCells"
<< endl;
if (debug == -1)
{
// For checking calls:abort so we can quickly hunt down
// origin of call
FatalErrorInFunction
<< abort(FatalError);
}
}
// It is an error to attempt to recalculate pointCells
// if the pointer is already set
if (pcPtr_)
{
FatalErrorInFunction
<< "pointCells already calculated"
<< abort(FatalError);
}
else
{
const cellList& cf = cells();
// Count number of cells per point
labelList npc(nPoints(), 0);
forAll(cf, celli)
{
const labelList curPoints = cf[celli].labels(faces());
forAll(curPoints, pointi)
{
label ptI = curPoints[pointi];
npc[ptI]++;
}
}
// Size and fill cells per point
pcPtr_ = new labelListList(npc.size());
labelListList& pointCellAddr = *pcPtr_;
forAll(pointCellAddr, pointi)
{
pointCellAddr[pointi].setSize(npc[pointi]);
}
npc = 0;
forAll(cf, celli)
{
const labelList curPoints = cf[celli].labels(faces());
forAll(curPoints, pointi)
{
label ptI = curPoints[pointi];
pointCellAddr[ptI][npc[ptI]++] = celli;
}
}
}
}
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
const Foam::labelListList& Foam::primitiveMesh::pointCells() const
{
if (!pcPtr_)
{
calcPointCells();
}
return *pcPtr_;
}
const Foam::labelList& Foam::primitiveMesh::pointCells
(
const label pointi,
DynamicList<label>& storage
) const
{
if (pcPtr_)
{
return pointCells()[pointi];
}
else
{
const labelList& own = faceOwner();
const labelList& nei = faceNeighbour();
const labelList& pFaces = pointFaces()[pointi];
storage.clear();
forAll(pFaces, i)
{
const label facei = pFaces[i];
// Append owner
storage.append(own[facei]);
// Append neighbour
if (facei < nInternalFaces())
{
storage.append(nei[facei]);
}
}
// Filter duplicates
if (storage.size() > 1)
{
sort(storage);
label n = 1;
for (label i = 1; i < storage.size(); i++)
{
if (storage[i-1] != storage[i])
{
storage[n++] = storage[i];
}
}
// truncate addressed list
storage.setSize(n);
}
return storage;
}
}
const Foam::labelList& Foam::primitiveMesh::pointCells(const label pointi) const
{
return pointCells(pointi, labels_);
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
// ************************************************************************* //
|