File size: 9,788 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 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-2019 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::globalIndexAndTransform
Description
Determination and storage of the possible independent transforms
introduced by coupledPolyPatches, as well as all of the possible
permutations of these transforms generated by the presence of
multiple coupledPolyPatches, i.e. more than one cyclic boundary. Note that
any given point can be on maximum 3 transforms only (and these transforms
have to be perpendicular)
Also provides global index encoding and decoding for entity
(i.e. cell) index, processor index and transform index (0 or
positive integer) to a labelPair.
SourceFiles
globalIndexAndTransform.C
\*---------------------------------------------------------------------------*/
#ifndef globalIndexAndTransform_H
#define globalIndexAndTransform_H
#include "labelPair.H"
#include "transformer.H"
#include "HashSet.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
class polyMesh;
/*---------------------------------------------------------------------------*\
Class globalIndexAndTransform Declaration
\*---------------------------------------------------------------------------*/
class globalIndexAndTransform
{
public:
// Public classes
//- Less function class used in sorting encoded transforms and indices
// Minimum of:
// - processor
// - local index
// - transform
class less
{
const globalIndexAndTransform& gi_;
public:
less(const globalIndexAndTransform& gi)
:
gi_(gi)
{}
inline bool operator()(const labelPair&, const labelPair&) const;
};
private:
// Private Data
//- Reference to mesh
const polyMesh& mesh_;
//- The possible independent (non-permuted) transforms of the
// geometry, i.e. for a geometry with two cyclics, this
// stores the two transforms, not the eight permutations.
// Any point can not be on more than three transforms but overall
// the mesh can have more than three.
List<transformer> transforms_;
//- The permutations of the transforms, stored for lookup
// efficiency. If there are n transforms, then there are
// (3^n) permutations, including the no-transformation
// transform.
List<transformer> transformPermutations_;
//- Index of identity transform.
label nullTransformIndex_;
//- Mapping from patch index to which transform it matches (or
// -1 for none) (.first()) and what sign to use for it,
// i.e. +/- 1 (.second()).
List<labelPair> patchTransformSign_;
// Private Member Functions
//- Determine all of the independent basic transforms of the
// geometry by analysing the coupledPolyPatches
void determineTransforms();
//- Generate all of the transformation permutations
void determineTransformPermutations();
//- Determine which patch uses which transform (if any) and which
// sign to use
void determinePatchTransformSign();
//- Test a list of reference transforms to see if the test
// transform matches one. Return +1 or -1 depending on the
// sign of the match, or 0 if none matches.
label matchTransform
(
const List<transformer>& refTransforms,
label& matchedRefTransformI,
const transformer& testTransform,
scalar tolerance,
bool checkBothSigns
) const;
//- Return true if transform is not yet present in trafos. Issues
// warning if too many transforms
bool uniqueTransform
(
const point& pt,
labelPairList& trafos,
const label patchi,
const labelPair& patchTrafo
) const;
public:
// Declare name of the class and its debug switch
ClassName("globalIndexAndTransform");
// Constructors
//- Construct from components
globalIndexAndTransform(const polyMesh& mesh);
//- Disallow default bitwise copy construction
globalIndexAndTransform(const globalIndexAndTransform&) = delete;
// Member Functions
//- Generate a transform index from the permutation indices of
// the independent transforms. Permutations indices must
// only be -1, 0 or +1.
inline label encodeTransformIndex
(
const labelList& permutationIndices
) const;
//- Decode transform index
inline labelList decodeTransformIndex(const label transformIndex) const;
//- Add patch transformation to transformIndex. Return new
// transformIndex. (by default the patch is the sending, not the
// receiving, patch)
inline label addToTransformIndex
(
const label transformIndex,
const label patchi,
const bool isSendingSide = true,
const scalar tol = small
) const;
//- Combine two transformIndices
inline label mergeTransformIndex
(
const label transformIndex0,
const label transformIndex1
) const;
//- Combine two transformIndices
inline label minimumTransformIndex
(
const label transformIndex0,
const label transformIndex1
) const;
//- Subtract two transformIndices
inline label subtractTransformIndex
(
const label transformIndex0,
const label transformIndex1
) const;
//- Encode index and bare index as components on own processor
inline labelPair encode
(
const label index,
const label transformIndex
) const;
//- Encode index and bare index as components on given processor
inline labelPair encode
(
const label proci,
const label index,
const label transformIndex
) const;
//- Index carried by the object
inline label index(const labelPair& globalIAndTransform) const;
//- Which processor does this come from?
inline label processor(const labelPair& globalIAndTransform) const;
//- Transform carried by the object
inline label transformIndex(const labelPair& globalIAndTransform) const;
//- Return the number of independent transforms
inline label nIndependentTransforms() const;
//- Return access to the stored independent transforms
inline const List<transformer>& transforms() const;
//- Return access to the permuted transforms
inline const List<transformer>&
transformPermutations() const;
//- Return the transformIndex (index in transformPermutations)
// of the identity transform
inline label nullTransformIndex() const;
//- Return access to the per-patch transform-sign pairs
inline const List<labelPair>& patchTransformSign() const;
//- Access the overall (permuted) transform corresponding
// to the transformIndex
inline const transformer& transform
(
label transformIndex
) const;
//- Access the all of the indices of the transform
// permutations corresponding the transforms of the
// listed patch indices. This only allows a maximum of three
// transformations (since routine is used to transform points and
// any given point can only be on 3 or less transforms)
inline labelList transformIndicesForPatches
(
const labelHashSet& patchIs
) const;
//- Apply all of the transform permutations
// corresponding the transforms of the listed patch
// indices to the supplied point
inline pointField transformPatches
(
const labelHashSet& patchIs,
const point& pt
) const;
// Member Operators
//- Disallow default bitwise assignment
void operator=(const globalIndexAndTransform&) = delete;
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#include "globalIndexAndTransformI.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************************************************************* //
|