File size: 15,726 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 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-2026 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 "polyMesh.H"
#include "SubField.H"
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
bool Foam::globalIndexAndTransform::less::operator()
(
const labelPair& a,
const labelPair& b
) const
{
label procA = gi_.processor(a);
label procB = gi_.processor(b);
if (procA < procB)
{
return true;
}
else if (procA > procB)
{
return false;
}
else
{
// Equal proc.
label indexA = gi_.index(a);
label indexB = gi_.index(b);
if (indexA < indexB)
{
return true;
}
else if (indexA > indexB)
{
return false;
}
else
{
// Equal index
label transformA = gi_.transformIndex(a);
label transformB = gi_.transformIndex(b);
return transformA < transformB;
}
}
}
Foam::label Foam::globalIndexAndTransform::encodeTransformIndex
(
const labelList& permutationIndices
) const
{
if (permutationIndices.size() != transforms_.size())
{
FatalErrorInFunction
<< "permutationIndices " << permutationIndices
<< "are of a different size to the number of independent transforms"
<< abort(FatalError);
}
label transformIndex = 0;
label w = 1;
forAll(transforms_, b)
{
if (mag(permutationIndices[b]) > 1)
{
FatalErrorInFunction
<< "permutationIndices " << permutationIndices
<< "are illegal, they must all be only -1, 0 or +1"
<< abort(FatalError);
}
transformIndex += (permutationIndices[b] + 1)*w;
w *= 3;
}
return transformIndex;
}
Foam::labelList Foam::globalIndexAndTransform::decodeTransformIndex
(
const label transformIndex
) const
{
labelList permutation(transforms_.size(), 0);
label t = transformIndex;
forAll(permutation, i)
{
permutation[i] = (t%3)-1;
t /= 3;
}
return permutation;
}
Foam::label Foam::globalIndexAndTransform::addToTransformIndex
(
const label transformIndex,
const label patchi,
const bool isSendingSide,
const scalar tol
) const
{
const labelPair& transSign = patchTransformSign_[patchi];
label matchTransI = transSign.first();
if (matchTransI >= transforms_.size())
{
FatalErrorInFunction
<< "patch:" << mesh_.boundary()[patchi].name()
<< " transform:" << matchTransI
<< " out of possible transforms:" << transforms_
<< exit(FatalError);
return labelMin;
}
else if (matchTransI == -1)
{
// No additional transformation for this patch
return transformIndex;
}
else
{
// Decode current set of transforms
labelList permutation(decodeTransformIndex(transformIndex));
// Add patch transform
// ~~~~~~~~~~~~~~~~~~~
label sign = transSign.second();
if (!isSendingSide)
{
sign = -sign;
}
// If this transform been found already by a patch?
if (permutation[matchTransI] != 0)
{
if (sign == 0)
{
// sent from patch without a transformation. Do nothing.
FatalErrorInFunction
<< "patch:" << mesh_.boundary()[patchi].name()
<< " transform:" << matchTransI << " sign:" << sign
<< " current transforms:" << permutation
<< exit(FatalError);
}
else if (sign == permutation[matchTransI])
{
// This is usually illegal. The only exception is for points
// on the axis of a 180 degree cyclic wedge when the
// transformation is going to be (-1 0 0 0 -1 0 0 0 +1)
// (or a different permutation but always two times -1 and
// once +1)
bool antiCyclic = false;
const transformer& vt = transforms_[matchTransI];
if (vt.transforms())
{
const tensor& T = vt.T();
scalar sumDiag = tr(T);
scalar sumMagDiag = mag(T.xx()) + mag(T.yy()) + mag(T.zz());
if (mag(sumMagDiag-3) < tol && mag(sumDiag+1) < tol)
{
antiCyclic = true;
}
}
if (antiCyclic)
{
// 180 degree rotational. Reset transformation.
permutation[matchTransI] = 0;
}
else
{
FatalErrorInFunction
<< "More than one patch accessing the same transform "
<< "but not of the same sign." << endl
<< "patch:" << mesh_.boundary()[patchi].name()
<< " transform:" << matchTransI << " sign:" << sign
<< " current transforms:" << permutation
<< exit(FatalError);
}
}
else
{
permutation[matchTransI] = 0;
}
}
else
{
permutation[matchTransI] = sign;
}
// Re-encode permutation
// ~~~~~~~~~~~~~~~~~~~~~
return encodeTransformIndex(permutation);
}
}
Foam::label Foam::globalIndexAndTransform::minimumTransformIndex
(
const label transformIndex0,
const label transformIndex1
) const
{
if (transformIndex0 == transformIndex1)
{
return transformIndex0;
}
// Count number of transforms
labelList permutation0(decodeTransformIndex(transformIndex0));
label n0 = 0;
forAll(permutation0, i)
{
if (permutation0[i] != 0)
{
n0++;
}
}
labelList permutation1(decodeTransformIndex(transformIndex1));
label n1 = 0;
forAll(permutation1, i)
{
if (permutation1[i] != 0)
{
n1++;
}
}
if (n0 <= n1)
{
return transformIndex0;
}
else
{
return transformIndex1;
}
}
Foam::label Foam::globalIndexAndTransform::subtractTransformIndex
(
const label transformIndex0,
const label transformIndex1
) const
{
labelList permutation0(decodeTransformIndex(transformIndex0));
labelList permutation1(decodeTransformIndex(transformIndex1));
forAll(permutation0, i)
{
permutation0[i] -= permutation1[i];
}
return encodeTransformIndex(permutation0);
}
Foam::labelPair Foam::globalIndexAndTransform::encode
(
const label index,
const label transformIndex
) const
{
return encode(Pstream::myProcNo(), index, transformIndex);
}
Foam::labelPair Foam::globalIndexAndTransform::encode
(
const label proci,
const label index,
const label transformIndex
) const
{
if (transformIndex < 0 || transformIndex >= transformPermutations_.size())
{
FatalErrorInFunction
<< "TransformIndex " << transformIndex
<< " is outside allowed range of 0 to "
<< transformPermutations_.size() - 1
<< abort(FatalError);
}
if (proci > labelMax/transformPermutations_.size())
{
FatalErrorInFunction
<< "Overflow : encoding processor " << proci
<< " in base " << transformPermutations_.size()
<< " exceeds capability of label (" << labelMax
<< "). Please recompile with larger datatype for label."
<< exit(FatalError);
}
return labelPair
(
index,
transformIndex + proci*transformPermutations_.size()
);
}
Foam::label Foam::globalIndexAndTransform::index
(
const labelPair& globalIAndTransform
) const
{
return globalIAndTransform.first();
}
Foam::label Foam::globalIndexAndTransform::processor
(
const labelPair& globalIAndTransform
) const
{
return globalIAndTransform.second()/transformPermutations_.size();
}
Foam::label Foam::globalIndexAndTransform::transformIndex
(
const labelPair& globalIAndTransform
) const
{
return globalIAndTransform.second()%transformPermutations_.size();
}
Foam::label Foam::globalIndexAndTransform::nIndependentTransforms() const
{
return transforms_.size();
}
const Foam::List<Foam::transformer>&
Foam::globalIndexAndTransform::transforms() const
{
return transforms_;
}
const Foam::List<Foam::transformer>&
Foam::globalIndexAndTransform::transformPermutations() const
{
return transformPermutations_;
}
Foam::label Foam::globalIndexAndTransform::nullTransformIndex() const
{
return nullTransformIndex_;
}
const Foam::labelPairList&
Foam::globalIndexAndTransform::patchTransformSign() const
{
return patchTransformSign_;
}
const Foam::transformer& Foam::globalIndexAndTransform::transform
(
label transformIndex
) const
{
return transformPermutations_[transformIndex];
}
Foam::labelList Foam::globalIndexAndTransform::transformIndicesForPatches
(
const labelHashSet& patchis
) const
{
labelList permutation(transforms_.size(), 0);
labelList selectedTransformIs(0);
if (patchis.empty() || transforms_.empty())
{
return selectedTransformIs;
}
forAllConstIter(labelHashSet, patchis, iter)
{
label patchi = iter.key();
const labelPair& transSign = patchTransformSign_[patchi];
label matchTransI = transSign.first();
if (matchTransI > -1)
{
label sign = transSign.second();
// If this transform been found already by a patch?
if (permutation[matchTransI] != 0)
{
// If so, if they have opposite signs, then this is
// considered an error. They are allowed to be the
// same sign, but this only results in a single
// transform.
if (permutation[matchTransI] != sign)
{
FatalErrorInFunction
<< "More than one patch accessing the same transform "
<< "but not of the same sign."
<< exit(FatalError);
}
}
else
{
permutation[matchTransI] = sign;
}
}
}
label nUsedTrans = round(sum(mag(SubField<label>(permutation))));
if (nUsedTrans == 0)
{
return selectedTransformIs;
}
// Number of selected transformations
label nSelTrans = pow(label(2), nUsedTrans) - 1;
// Pout<< nl << permutation << nl << endl;
selectedTransformIs.setSize(nSelTrans);
switch (nUsedTrans)
{
case 1:
{
selectedTransformIs[0] = encodeTransformIndex(permutation);
break;
}
case 2:
{
labelList tempPermutation = permutation;
label a = 0;
label b = 1;
// When there are two selected transforms out of three, we
// need to choose which of them are being permuted
if (transforms_.size() > nUsedTrans)
{
if (permutation[0] == 0)
{
a = 1;
b = 2;
}
else if (permutation[1] == 0)
{
a = 0;
b = 2;
}
else if (permutation[2] == 0)
{
a = 0;
b = 1;
}
}
tempPermutation[a] = a;
tempPermutation[b] = permutation[b];
selectedTransformIs[0] = encodeTransformIndex(tempPermutation);
tempPermutation[a] = permutation[a];
tempPermutation[b] = a;
selectedTransformIs[1] = encodeTransformIndex(tempPermutation);
tempPermutation[a] = permutation[a];
tempPermutation[b] = permutation[b];
selectedTransformIs[2] = encodeTransformIndex(tempPermutation);
break;
}
case 3:
{
labelList tempPermutation = permutation;
tempPermutation[0] = 0;
tempPermutation[1] = 0;
tempPermutation[2] = permutation[2];
selectedTransformIs[0] = encodeTransformIndex(tempPermutation);
tempPermutation[0] = 0;
tempPermutation[1] = permutation[1];
tempPermutation[2] = 0;
selectedTransformIs[1] = encodeTransformIndex(tempPermutation);
tempPermutation[0] = 0;
tempPermutation[1] = permutation[1];
tempPermutation[2] = permutation[2];
selectedTransformIs[2] = encodeTransformIndex(tempPermutation);
tempPermutation[0] = permutation[0];
tempPermutation[1] = 0;
tempPermutation[2] = 0;
selectedTransformIs[3] = encodeTransformIndex(tempPermutation);
tempPermutation[0] = permutation[0];
tempPermutation[1] = 0;
tempPermutation[2] = permutation[2];
selectedTransformIs[4] = encodeTransformIndex(tempPermutation);
tempPermutation[0] = permutation[0];
tempPermutation[1] = permutation[1];
tempPermutation[2] = 0;
selectedTransformIs[5] = encodeTransformIndex(tempPermutation);
tempPermutation[0] = permutation[0];
tempPermutation[1] = permutation[1];
tempPermutation[2] = permutation[2];
selectedTransformIs[6] = encodeTransformIndex(tempPermutation);
break;
}
default:
{
FatalErrorInFunction
<< "Only 1-3 transforms are possible."
<< exit(FatalError);
}
}
return selectedTransformIs;
}
Foam::pointField Foam::globalIndexAndTransform::transformPatches
(
const labelHashSet& patchis,
const point& pt
) const
{
labelList transIs = transformIndicesForPatches(patchis);
pointField transPts(transIs.size());
forAll(transIs, tII)
{
transPts[tII] =
transformPermutations_[transIs[tII]].transformPosition(pt);
}
return transPts;
}
// ************************************************************************* //
|