Class for storing an ADT of only points in an arbitrary number of dimensions.
More...
#include <CADTPointsOnlyClass.hpp>
|
| | CADTPointsOnlyClass (unsigned short nDim, unsigned long nPoints, const su2double *coor, const unsigned long *pointID, const bool globalTree) |
| | Constructor of the class.
|
| |
| void | DetermineNearestNode (const su2double *coor, su2double &dist, unsigned long &pointID, int &rankID) |
| | Function, which determines the nearest node in the ADT for the given coordinate.
|
| |
| | CADTPointsOnlyClass ()=delete |
| | Default constructor of the class, disabled.
|
| |
| bool | IsEmpty (void) const |
| | Function, which returns whether or not the ADT is empty.
|
| |
Class for storing an ADT of only points in an arbitrary number of dimensions.
- Author
- E. van der Weide
◆ CADTPointsOnlyClass() [1/2]
| CADTPointsOnlyClass::CADTPointsOnlyClass |
( |
unsigned short |
nDim, |
|
|
unsigned long |
nPoints, |
|
|
const su2double * |
coor, |
|
|
const unsigned long * |
pointID, |
|
|
const bool |
globalTree |
|
) |
| |
Constructor of the class.
- Parameters
-
| [in] | nDim | Number of spatial dimensions of the problem. |
| [in] | nPoints | Number of local points to be stored in the ADT. |
| [in] | coor | Coordinates of the local points. |
| [in] | pointID | Local point IDs of the local points. |
| [in] | globalTree | Whether or not a global tree must be built. If false a local ADT is built. |
◆ CADTPointsOnlyClass() [2/2]
| CADTPointsOnlyClass::CADTPointsOnlyClass |
( |
| ) |
|
|
delete |
Default constructor of the class, disabled.
◆ DetermineNearestNode()
| void CADTPointsOnlyClass::DetermineNearestNode |
( |
const su2double * |
coor, |
|
|
su2double & |
dist, |
|
|
unsigned long & |
pointID, |
|
|
int & |
rankID |
|
) |
| |
|
inline |
Function, which determines the nearest node in the ADT for the given coordinate.
- Note
- This simply forwards the call to the implementation function selecting the right working variables for the current thread.
- Parameters
-
| [in] | coor | Coordinate for which the nearest node in the ADT must be determined. |
| [out] | dist | Distance to the nearest node in the ADT. |
| [out] | pointID | Local point ID of the nearest node in the ADT. |
| [out] | rankID | Rank on which the nearest node in the ADT is stored. |
The documentation for this class was generated from the following files: