File size: 9,553 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 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2016-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 "demandDrivenData.H"
// * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * * //
inline void Foam::binaryTree::insertNode
(
chemPointISAT*& phi0,
binaryNode*& newNode
)
{
if (phi0 == phi0->node()->leafRight())// phi0 is on the right
{
phi0->node()->leafRight() = nullptr;
phi0->node()->nodeRight() = newNode;
return;
}
else if (phi0 == phi0->node()->leafLeft())// phi0 is on the left
{
phi0->node()->leafLeft() = nullptr;
phi0->node()->nodeLeft() = newNode;
return;
}
// if we reach this point, there is an issue with the addressing
FatalErrorInFunction
<< "trying to insert a node with a wrong pointer to a chemPoint"
<< exit(FatalError);
}
inline void Foam::binaryTree::deleteSubTree(binaryNode* subTreeRoot)
{
if (subTreeRoot != nullptr)
{
deleteDemandDrivenData(subTreeRoot->leafLeft());
deleteDemandDrivenData(subTreeRoot->leafRight());
deleteSubTree(subTreeRoot->nodeLeft());
deleteSubTree(subTreeRoot->nodeRight());
deleteDemandDrivenData(subTreeRoot);
}
}
inline void Foam::binaryTree::deleteSubTree()
{
deleteSubTree(root_);
}
inline void Foam::binaryTree::transplant(binaryNode* u, binaryNode* v)
{
if (v != nullptr)
{
// u is root_
if (u->parent() == nullptr)
{
root_ = v;
}
// u is on the left of its parent
else if (u == u->parent()->nodeLeft())
{
u->parent()->nodeLeft() = v;
}
// u is ont the right of its parent
else if (u == u->parent()->nodeRight())
{
u->parent()->nodeRight() = v;
}
else
{
FatalErrorInFunction
<< "wrong addressing of the initial node"
<< exit(FatalError);
}
v->parent() = u->parent();
}
else
{
FatalErrorInFunction
<< "trying to transplant a nullptr node"
<< exit(FatalError);
}
}
inline Foam::chemPointISAT* Foam::binaryTree::chemPSibling(binaryNode* y)
{
if (y->parent() != nullptr)
{
if (y == y->parent()->nodeLeft())// y is on the left, return right side
{
// might return nullptr if the right side is a node
return y->parent()->leafRight();
}
else if (y == y->parent()->nodeRight())
{
return y->parent()->leafLeft();
}
else
{
FatalErrorInFunction
<< "wrong addressing of the initial node"
<< exit(FatalError);
return nullptr;
}
}
// the binaryNode is root_ and has no sibling
return nullptr;
}
inline Foam::chemPointISAT* Foam::binaryTree::chemPSibling(chemPointISAT* x)
{
if (size_>1)
{
if (x == x->node()->leafLeft())
{
// x is on the left, return right side
// might return nullptr if the right side is a node
return x->node()->leafRight();
}
else if (x == x->node()->leafRight())
{
// x is on the right, return left side
return x->node()->leafLeft();
}
else
{
FatalErrorInFunction
<< "wrong addressing of the initial leaf"
<< exit(FatalError);
return nullptr;
}
}
// there is only one leaf attached to the root_, no sibling
return nullptr;
}
inline Foam::binaryNode* Foam::binaryTree::nodeSibling(binaryNode* y)
{
if (y->parent()!=nullptr)
{
if (y == y->parent()->nodeLeft())
{
// y is on the left, return right side
return y->parent()->nodeRight();
}
else if (y == y->parent()->nodeRight())
{
return y->parent()->nodeLeft();
}
else
{
FatalErrorInFunction
<< "wrong addressing of the initial node"
<< exit(FatalError);
return nullptr;
}
}
return nullptr;
}
Foam::binaryNode* Foam::binaryTree::nodeSibling(chemPointISAT* x)
{
if (size_>1)
{
if (x == x->node()->leafLeft())
{
// x is on the left, return right side
return x->node()->nodeRight();
}
else if (x == x->node()->leafRight())
{
// x is on the right, return left side
return x->node()->nodeLeft();
}
else
{
FatalErrorInFunction
<< "wrong addressing of the initial leaf"
<< exit(FatalError);
return nullptr;
}
}
return nullptr;
}
inline void Foam::binaryTree::deleteAllNode(binaryNode* subTreeRoot)
{
if (subTreeRoot != nullptr)
{
deleteAllNode(subTreeRoot->nodeLeft());
deleteAllNode(subTreeRoot->nodeRight());
deleteDemandDrivenData(subTreeRoot);
}
}
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
inline Foam::label Foam::binaryTree::size() const
{
return size_;
}
inline Foam::label Foam::binaryTree::depth(binaryNode* subTreeRoot) const
{
// when we reach the leaf, we return 0
if (subTreeRoot == nullptr)
{
return 0;
}
else
{
return
1
+ max
(
depth(subTreeRoot->nodeLeft()),
depth(subTreeRoot->nodeRight())
);
}
}
inline Foam::label Foam::binaryTree::depth() const
{
return depth(root_);
}
inline Foam::binaryNode* Foam::binaryTree::root()
{
return root_;
}
inline Foam::label Foam::binaryTree::maxNLeafs() const
{
return maxNLeafs_;
}
inline void Foam::binaryTree::binaryTreeSearch
(
const scalarField& phiq,
binaryNode* node,
chemPointISAT*& nearest
)
{
if (size_ > 1)
{
scalar vPhi=0.0;
const scalarField& v = node->v();
const scalar& a = node->a();
// compute v*phi
for (label i=0; i<phiq.size(); i++) vPhi += phiq[i]*v[i];
if (vPhi > a) // on right side (side of the newly added point)
{
if (node->nodeRight()!=nullptr)
{
binaryTreeSearch(phiq, node->nodeRight(), nearest);
}
else // the terminal node is reached, store leaf on the right
{
nearest = node->leafRight();
return;
}
}
else // on left side (side of the previously stored point)
{
if (node->nodeLeft()!=nullptr)
{
binaryTreeSearch(phiq, node->nodeLeft(), nearest);
}
else // the terminal node is reached, return element on right
{
nearest = node->leafLeft();
return;
}
}
}
// only one point stored (left element of the root)
else if (size_ == 1)
{
nearest = root_->leafLeft();
}
else // no point stored
{
nearest = nullptr;
}
}
inline Foam::chemPointISAT* Foam::binaryTree::treeMin(binaryNode* subTreeRoot)
{
if (subTreeRoot!=nullptr)
{
while(subTreeRoot->nodeLeft() != nullptr)
{
subTreeRoot = subTreeRoot->nodeLeft();
}
return subTreeRoot->leafLeft();
}
else
{
return nullptr;
}
}
inline void Foam::binaryTree::clear()
{
// Recursively delete the element in the subTree
deleteSubTree();
// Reset root node (should already be nullptr)
root_ = nullptr;
// Reset size_
size_ = 0;
}
inline bool Foam::binaryTree::isFull()
{
return size_ >= maxNLeafs_;
}
inline void Foam::binaryTree::resetNumRetrieve()
{
// Has to go along each chemPointISAT of the tree
if (size_ > 0)
{
// First finds the first leaf
chemPointISAT* chP0 = treeMin();
chP0->resetNumRetrieve();
// Then go to each successor
chemPointISAT* nextChP = treeSuccessor(chP0);
while (nextChP != nullptr)
{
nextChP->resetNumRetrieve();
nextChP = treeSuccessor(nextChP);
}
}
}
// ************************************************************************* //
|