Class for storing an ADT of (linear) elements in an arbitrary number of dimensions.
More...
#include <CADTElemClass.hpp>
|
| | CADTElemClass (unsigned short val_nDim, vector< su2double > &val_coor, vector< unsigned long > &val_connElem, vector< unsigned short > &val_VTKElem, vector< unsigned short > &val_markerID, vector< unsigned long > &val_elemID, const bool globalTree) |
| | Constructor of the class.
|
| |
| bool | DetermineContainingElement (const su2double *coor, unsigned short &markerID, unsigned long &elemID, int &rankID, su2double *parCoor, su2double *weightsInterpol) |
| | Function, which determines the element that contains the given coordinate.
|
| |
| void | DetermineNearestElement (const su2double *coor, su2double &dist, unsigned short &markerID, unsigned long &elemID, int &rankID) |
| | Function, which determines the nearest element in the ADT for the given coordinate.
|
| |
| bool | IsEmpty (void) const |
| | Function, which returns whether or not the ADT is empty.
|
| |
Class for storing an ADT of (linear) elements in an arbitrary number of dimensions.
- Author
- E. van der Weide
- Version
- 8.5.0 "Harrier"
◆ CADTElemClass()
| CADTElemClass::CADTElemClass |
( |
unsigned short |
val_nDim, |
|
|
vector< su2double > & |
val_coor, |
|
|
vector< unsigned long > & |
val_connElem, |
|
|
vector< unsigned short > & |
val_VTKElem, |
|
|
vector< unsigned short > & |
val_markerID, |
|
|
vector< unsigned long > & |
val_elemID, |
|
|
const bool |
globalTree |
|
) |
| |
Constructor of the class.
- Parameters
-
| [in] | val_nDim | Number of spatial dimensions of the problem. |
| [in] | val_coor | Coordinates of the local points to be stored in the ADT. |
| [in,out] | val_connElem | Local connectivity of the elements to be stored in the ADT. In parallel mode the connectivities are corrected for the offset in node numbers of the rank. |
| [in] | val_VTKElem | Type of the elements using the VTK convention. |
| [in] | val_markerID | Markers of the local elements. |
| [in] | val_elemID | Local element IDs of the elements. |
| [in] | globalTree | Whether or not a global tree must be built. If false a local ADT is built. |
◆ DetermineContainingElement()
| bool CADTElemClass::DetermineContainingElement |
( |
const su2double * |
coor, |
|
|
unsigned short & |
markerID, |
|
|
unsigned long & |
elemID, |
|
|
int & |
rankID, |
|
|
su2double * |
parCoor, |
|
|
su2double * |
weightsInterpol |
|
) |
| |
|
inline |
Function, which determines the element that contains 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 which the element must contain. |
| [out] | markerID | Local marker ID of the element containing the coordinate. |
| [out] | elemID | Local element ID of the element containing the coordinate. |
| [out] | rankID | Rank on which element containing the coordinate is stored. |
| [out] | parCoor | Parametric coordinates of coor inside the element, which contains the coordinate. |
| [out] | weightsInterpol | Interpolation weights of coor inside the element, which contains the coordinate. |
- Returns
- True if an element is found, false if not.
◆ DetermineNearestElement()
| void CADTElemClass::DetermineNearestElement |
( |
const su2double * |
coor, |
|
|
su2double & |
dist, |
|
|
unsigned short & |
markerID, |
|
|
unsigned long & |
elemID, |
|
|
int & |
rankID |
|
) |
| |
|
inline |
Function, which determines the nearest element 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 element in the ADT must be determined. |
| [out] | dist | Distance to the nearest element in the ADT. |
| [out] | markerID | Local marker ID of the nearest element in the ADT. |
| [out] | elemID | Local element ID of the nearest element in the ADT. |
| [out] | rankID | Rank on which the nearest element in the ADT is stored. |
The documentation for this class was generated from the following files: