/usr/include/freefoam/meshTools/octreeLine.H 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 181 182 183 184 185 186 187 188 189 190 191 192 193 194 | /*---------------------------------------------------------------------------*\
========= |
\\ / 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/>.
Class
Foam::octreeLine
Description
Iterates over intersections of line with octree leaf elements.
Used as in
@code
octree<octreeDataFace> oc( .. );
octreeLine<octreeDataFace> lineSearch(oc, pStart, pEnd);
while (lineSearch.getIntersection())
{
const point& pt = lineSearch.hitInfo().hitPoint();
..
}
@endcode
SourceFiles
octreeLine.C
\*---------------------------------------------------------------------------*/
#ifndef octreeLine_H
#define octreeLine_H
#include <OpenFOAM/boolList.H>
#include <OpenFOAM/point.H>
#include "pointHitSort.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
// Forward declaration of classes
template<class Type> class octree;
template<class Type> class treeLeaf;
/*---------------------------------------------------------------------------*\
Class octreeLine Declaration
\*---------------------------------------------------------------------------*/
template <class Type>
class octreeLine
{
// Private data
//- Octree reference
const octree<Type>& tree_;
//- Start of segment
const point startPoint_;
//- End of segment
const point endPoint_;
//- Start moved into bb
point realStartPoint_;
//- Exit point of intersection with current treeLeaf
point leafExitPoint_;
//- Current treeLeaf to be searched in.
const treeLeaf<Type>* currentLeaf_;
//- Sorted list of intersections
List<pointHitSort> sortedIntersections_;
//- index of last hit in previous treeLeaf. Used so if shape double
// it does not get counted twice. Note is not ok for concave shapes
label lastElem_;
//- Current hit: index in sortedIntersections_
label sortedI_;
// Private Member Functions
//- Calculate sorted list of intersections
void calcSortedIntersections();
//- Searches for leaf with intersected elements.
// Return true if found; false otherwise.
// Sets currentLeaf_ and sortedIntersections_
bool getNextLeaf();
public:
// Constructors
//- Construct from components
octreeLine
(
const octree<Type>& tree,
const point& startPoint,
const point& endPoint
);
// Destructor
~octreeLine();
// Member Functions
const octree<Type>& tree() const
{
return tree_;
}
const point& leafExitPoint() const
{
return leafExitPoint_;
}
const point& endPoint() const
{
return endPoint_;
}
const point& startPoint() const
{
return startPoint_;
}
const treeLeaf<Type>* currentLeaf() const
{
return currentLeaf_;
}
const List<pointHitSort>& sortedIntersections() const
{
return sortedIntersections_;
}
label hitIndex() const
{
return sortedIntersections_[sortedI_].index();
}
const pointHit& hitInfo() const
{
return sortedIntersections_[sortedI_].inter();
}
//- go to next intersection. Return false if no intersections.
bool getIntersection();
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#ifdef NoRepository
# include "octreeLine.C"
#endif
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************ vim: set sw=4 sts=4 et: ************************ //
|