58 const su2double *pointCoor;
59 const unsigned short splitDirection;
60 const unsigned short nDim;
70 const unsigned short splitDir,
71 const unsigned short nDimADT);
82 bool operator()(
const unsigned long p0,
83 const unsigned long p1)
const;
99 bool childrenAreTerminal[2];
100 unsigned long children[2];
156 vector<su2double> coorMinLeaves;
158 vector<su2double> coorMaxLeaves;
177 void BuildADT(
unsigned short nDim,
178 unsigned long nPoints,
179 const su2double *coor);
186 bool IsEmpty(
void)
const;
208 vector<unsigned long> frontLeaves;
209 vector<unsigned long> frontLeavesNew;
211 vector<su2double> coorPoints;
213 vector<unsigned long> localPointIDs;
215 vector<int> ranksOfPoints;
226 unsigned long nPoints,
227 const su2double *coor,
228 const unsigned long *pointID);
243 void DetermineNearestNode(
const su2double *coor,
245 unsigned long &pointID,
bool isEmpty
Whether or not the ADT is empty.
Definition: adt_structure.hpp:151
unsigned long nLeaves
Number of leaves in the ADT.
Definition: adt_structure.hpp:149
vector< su2_adtNodeClass > leaves
Vector, which contains all the leaves of the ADT.
Definition: adt_structure.hpp:153
Defines classes for referencing options for easy input in CConfig.
In-Line subroutines of the adt_structure.hpp file.
Headers of the mpi interface for generalized datatypes. The subroutines and functions are in the mpi_...
Class for storing an ADT of only points in an arbitrary number of dimensions.
Definition: adt_structure.hpp:206
Functor, used for the sorting of the points when building an ADT.
Definition: adt_structure.hpp:56
unsigned long centralNodeID
ID of a node, which is near the center of the leaf.
Definition: adt_structure.hpp:103
unsigned short nDimADT
Number of dimensions of the ADT.
Definition: adt_structure.hpp:150
Base class for storing an ADT in an arbitrary number of dimensions.
Definition: adt_structure.hpp:147
su2double * xMin
The minimum coordinates of this leaf. It points to a position in the large vector, which contains the coordinates of all leaves.
Definition: adt_structure.hpp:105
Class for storing the information needed in a node of an ADT.
Definition: adt_structure.hpp:97
su2double * xMax
The maximum coordinates of this leaf. It points to a position in the large vector, which contains the coordinates of all leaves.
Definition: adt_structure.hpp:107