/usr/include/freefoam/meshTools/octreeLine.C is in libfreefoam-dev 0.1.0+dfsg-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 1991-2010 OpenCFD Ltd.
\\/ 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 "octreeLine.H"
#include "octree.H"
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
// Calculate sorted list of intersections
template <class Type>
void Foam::octreeLine<Type>::calcSortedIntersections()
{
// Determine intersections and sort acc. to distance to start
const labelList& indices = currentLeaf_->indices();
sortedIntersections_.setSize(indices.size());
const vector direction = endPoint_ - realStartPoint_;
label nHits = 0;
forAll(indices, elemI)
{
point pt;
bool hit = tree_.shapes().intersects
(
indices[elemI],
realStartPoint_,
direction,
pt
);
if (hit && (indices[elemI] != lastElem_))
{
sortedIntersections_[nHits++] = pointHitSort
(
pointHit
(
true,
pt,
Foam::magSqr(pt - leafExitPoint_),
false
),
indices[elemI]
);
}
}
sortedIntersections_.setSize(nHits);
Foam::sort(sortedIntersections_);
//// After sorting
//forAll(sortedIntersections_, i)
//{
// Pout<< "calcSortedIntersections: After sorting:"
// << i << " distance:"
// << sortedIntersections_[i].inter().distance()
// << " index:" << sortedIntersections_[i].index()
// << endl;
//}
lastElem_ = -1;
if (nHits > 0)
{
lastElem_ = sortedIntersections_[nHits - 1].index();
//Pout<< "Storing lastElem_:" << lastElem_ << endl;
}
// Reset index into sortedIntersections_
sortedI_ = -1;
}
// Searches for leaf with intersected elements. Return true if found; false
// otherwise. Sets currentLeaf_ and sortedIntersections_.
template <class Type>
bool Foam::octreeLine<Type>::getNextLeaf()
{
do
{
// No current leaf. Find first one.
// Note: search starts from top every time
point start(leafExitPoint_);
currentLeaf_ = tree_.findLeafLine(start, endPoint_, leafExitPoint_);
if (!currentLeaf_)
{
// No leaf found. Give up.
return false;
}
// Get intersections and sort.
calcSortedIntersections();
}
while (sortedIntersections_.empty());
return true;
}
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
template <class Type>
Foam::octreeLine<Type>::octreeLine
(
const octree<Type>& tree,
const point& startPoint,
const point& endPoint
)
:
tree_(tree),
startPoint_(startPoint),
endPoint_(endPoint),
realStartPoint_(startPoint),
leafExitPoint_(startPoint_),
currentLeaf_(NULL),
sortedIntersections_(0),
lastElem_(-1),
sortedI_(-1)
{}
// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
template <class Type>
Foam::octreeLine<Type>::~octreeLine()
{}
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
template <class Type>
bool Foam::octreeLine<Type>::getIntersection()
{
// Go to next element in sortedIntersections
sortedI_++;
if (sortedI_ >= sortedIntersections_.size())
{
// Past all sortedIntersections in current leaf. Go to next one.
if (!getNextLeaf())
{
// No valid leaf found
return false;
}
sortedI_ = 0;
}
return true;
}
// ************************ vim: set sw=4 sts=4 et: ************************ //
|