- The bitSet class replaces the old PackedBoolList class. The redesign provides better block-wise access and reduced method calls. This helps both in cases where the bitSet may be relatively sparse, and in cases where advantage of contiguous operations can be made. This makes it easier to work with a bitSet as top-level object. In addition to the previously available count() method to determine if a bitSet is being used, now have simpler queries: - all() - true if all bits in the addressable range are empty - any() - true if any bits are set at all. - none() - true if no bits are set. These are faster than count() and allow early termination. The new test() method tests the value of a single bit position and returns a bool without any ambiguity caused by the return type (like the get() method), nor the const/non-const access (like operator[] has). The name corresponds to what std::bitset uses. The new find_first(), find_last(), find_next() methods provide a faster means of searching for bits that are set. This can be especially useful when using a bitSet to control an conditional: OLD (with macro): forAll(selected, celli) { if (selected[celli]) { sumVol += mesh_.cellVolumes()[celli]; } } NEW (with const_iterator): for (const label celli : selected) { sumVol += mesh_.cellVolumes()[celli]; } or manually for ( label celli = selected.find_first(); celli != -1; celli = selected.find_next() ) { sumVol += mesh_.cellVolumes()[celli]; } - When marking up contiguous parts of a bitset, an interval can be represented more efficiently as a labelRange of start/size. For example, OLD: if (isA<processorPolyPatch>(pp)) { forAll(pp, i) { ignoreFaces.set(i); } } NEW: if (isA<processorPolyPatch>(pp)) { ignoreFaces.set(pp.range()); }
262 lines
8.0 KiB
C++
262 lines
8.0 KiB
C++
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 2011-2016 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/>.
|
|
|
|
Class
|
|
Foam::meshDualiser
|
|
|
|
Description
|
|
Creates dual of polyMesh. Every point becomes a cell (or multiple cells
|
|
for feature points), a walk around every edge creates faces between them.
|
|
|
|
Put all points you want in the final mesh into featurePoints; all edge(mid)s
|
|
you want in the final mesh into featureEdges; all face(centre)s in
|
|
faceFaces.
|
|
|
|
Usually to preserve boundaries:
|
|
- all boundary faces are featureFaces
|
|
- all edges and points inbetween different patches are
|
|
featureEdges/points.
|
|
|
|
In same way you can also preserve internal faces (e.g. faceZones)
|
|
|
|
SourceFiles
|
|
Foam::meshDualiser.C
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#ifndef meshDualiser_H
|
|
#define meshDualiser_H
|
|
|
|
#include "DynamicList.H"
|
|
#include "bitSet.H"
|
|
#include "boolList.H"
|
|
#include "typeInfo.H"
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
namespace Foam
|
|
{
|
|
|
|
class polyMesh;
|
|
class polyTopoChange;
|
|
|
|
/*---------------------------------------------------------------------------*\
|
|
Class meshDualiser Declaration
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
class meshDualiser
|
|
{
|
|
// Private data
|
|
|
|
const polyMesh& mesh_;
|
|
|
|
//- From point on cell to dual cell. Either single entry or
|
|
// one entry per pointCells
|
|
labelListList pointToDualCells_;
|
|
|
|
//- From point to dual point (or -1 if not feature point).
|
|
labelList pointToDualPoint_;
|
|
|
|
//- From cell to dual point. All cells become point
|
|
labelList cellToDualPoint_;
|
|
|
|
//- From face to dual point (or -1 if not feature face)
|
|
labelList faceToDualPoint_;
|
|
|
|
//- From edge to dual point (or -1 if not feature edge)
|
|
labelList edgeToDualPoint_;
|
|
|
|
|
|
// Private Member Functions
|
|
|
|
static void checkPolyTopoChange(const polyTopoChange&);
|
|
|
|
static void dumpPolyTopoChange(const polyTopoChange&, const fileName&);
|
|
|
|
//- Find dual cell given point and cell
|
|
label findDualCell(const label celli, const label pointi) const;
|
|
|
|
//- Helper function to generate dualpoints on all boundary edges
|
|
// emanating from (boundary & feature) point
|
|
void generateDualBoundaryEdges
|
|
(
|
|
const bitSet& isBoundaryEdge,
|
|
const label pointi,
|
|
polyTopoChange& meshMod
|
|
);
|
|
|
|
//- Check that owner and neighbour of face have same dual cell
|
|
bool sameDualCell
|
|
(
|
|
const label facei,
|
|
const label pointi
|
|
) const;
|
|
|
|
//- Add internal face
|
|
label addInternalFace
|
|
(
|
|
const label masterPointi,
|
|
const label masterEdgeI,
|
|
const label masterFacei,
|
|
|
|
const bool edgeOrder,
|
|
const label dualCell0,
|
|
const label dualCell1,
|
|
const DynamicList<label>& verts,
|
|
polyTopoChange& meshMod
|
|
) const;
|
|
|
|
//- Add boundary face
|
|
label addBoundaryFace
|
|
(
|
|
const label masterPointi,
|
|
const label masterEdgeI,
|
|
const label masterFacei,
|
|
|
|
const label dualCelli,
|
|
const label patchi,
|
|
const DynamicList<label>& verts,
|
|
polyTopoChange& meshMod
|
|
) const;
|
|
|
|
//- Create internal faces walking around edge
|
|
void createFacesAroundEdge
|
|
(
|
|
const bool splitFace,
|
|
const bitSet& isBoundaryEdge,
|
|
const label edgeI,
|
|
const label startFacei,
|
|
polyTopoChange& meshMod,
|
|
boolList& doneEFaces
|
|
) const;
|
|
|
|
//- Create single internal face from internal face
|
|
void createFaceFromInternalFace
|
|
(
|
|
const label facei,
|
|
label& fp,
|
|
polyTopoChange&
|
|
) const;
|
|
|
|
//- Creates boundary faces walking around point on patchi.
|
|
void createFacesAroundBoundaryPoint
|
|
(
|
|
const label patchi,
|
|
const label patchPointi,
|
|
const label startFacei,
|
|
polyTopoChange&,
|
|
boolList& donePFaces // pFaces visited
|
|
) const;
|
|
|
|
//- Disallow default bitwise copy construct
|
|
meshDualiser(const meshDualiser&);
|
|
|
|
//- Disallow default bitwise assignment
|
|
void operator=(const meshDualiser&);
|
|
|
|
|
|
public:
|
|
|
|
//- Runtime type information
|
|
ClassName("meshDualiser");
|
|
|
|
|
|
// Constructors
|
|
|
|
//- Construct from mesh
|
|
meshDualiser(const polyMesh&);
|
|
|
|
|
|
// Member Functions
|
|
|
|
// Access
|
|
|
|
//- From point on cell to dual cell. Either single entry or
|
|
// one entry per pointCells.
|
|
const labelListList& pointToDualCells() const
|
|
{
|
|
return pointToDualCells_;
|
|
}
|
|
|
|
//- From point to dual point (or -1 if not feature point).
|
|
const labelList& pointToDualPoint() const
|
|
{
|
|
return pointToDualPoint_;
|
|
}
|
|
|
|
//- From cell to dual point (at cell centre). All cells become
|
|
// points.
|
|
const labelList& cellToDualPoint() const
|
|
{
|
|
return cellToDualPoint_;
|
|
}
|
|
|
|
//- From face to dual point (at face centre; or -1 if not
|
|
// feature face).
|
|
const labelList& faceToDualPoint() const
|
|
{
|
|
return faceToDualPoint_;
|
|
}
|
|
|
|
//- From edge to dual point (at edge mid; or -1 if not feature
|
|
// edge).
|
|
const labelList& edgeToDualPoint() const
|
|
{
|
|
return edgeToDualPoint_;
|
|
}
|
|
|
|
|
|
// Edit
|
|
|
|
|
|
//- Insert all changes into meshMod to convert the polyMesh into
|
|
// its dual.
|
|
// featureFaces : faces where we want a point at the face centre
|
|
// featureEdges : edges ,, edge mid
|
|
// featurePoints : points ,, point. Two variants:
|
|
// singleCellFeaturePoints : point becomes one dualcell.
|
|
// Use this for e.g. convex boundary points.
|
|
// multiCellFeaturePoints : one dualcell per original cell
|
|
// around point. Use this for e.g. concave boundary points
|
|
// since it prevents big concave boundary cells.
|
|
void setRefinement
|
|
(
|
|
const bool splitFace,
|
|
const labelList& featureFaces,
|
|
const labelList& featureEdges,
|
|
const labelList& singleCellFeaturePoints,
|
|
const labelList& multiCellFeaturePoints,
|
|
polyTopoChange& meshMod
|
|
);
|
|
};
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
} // End namespace Foam
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
#endif
|
|
|
|
// ************************************************************************* //
|