Go to the documentation of this file.
37 #ifndef nearestFaceAMI_H
38 #define nearestFaceAMI_H
74 else if (
y.second() <
x.second())
virtual ~nearestFaceAMI()=default
Destructor.
virtual bool calculate(const primitivePatch &srcPatch, const primitivePatch &tgtPatch, const autoPtr< searchableSurface > &surfPtr=nullptr)
Update addressing and weights.
nearestFaceAMI(const dictionary &dict, const bool reverseTarget=false)
Construct from dictionary.
virtual autoPtr< AMIInterpolation > clone() const
Construct and return a clone.
void operator()(nearestAndDist &x, const nearestAndDist &y) const
TypeName("nearestFaceAMI")
Runtime type information.
bool requireMatch() const
Access to the requireMatch flag.
A list of keyword definitions, which are a keyword followed by a number of values (eg,...
Pointer management similar to std::unique_ptr, with some additional methods and type checking.
Tuple2< pointIndexHit, scalar > nearestAndDist
scalar lowWeightCorrection() const
Threshold weight below which interpolation is deactivated.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
Interpolation class dealing with transfer of data between two primitive patches with an arbitrary mes...
bool reverseTarget() const
Access to the reverseTarget flag.
Helper class for finding nearest.
A 2-tuple for storing two objects of dissimilar types. The container is similar in purpose to std::pa...
A list of faces which address into the list of points.
Nearest-face Arbitrary Mesh Interface (AMI) method.