37#ifndef nearestFaceAMI_H
38#define nearestFaceAMI_H
74 else if (
y.second() <
x.second())
bool reverseTarget() const noexcept
Access to the reverseTarget flag.
AMIInterpolation(const dictionary &dict, const bool reverseTarget=false)
Construct from dictionary.
bool requireMatch() const noexcept
Return the requireMatch flag.
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...
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
A 2-tuple for storing two objects of dissimilar types. The container is similar in purpose to std::pa...
Pointer management similar to std::unique_ptr, with some additional methods and type checking.
A list of keyword definitions, which are a keyword followed by a number of values (eg,...
Helper class for finding nearest.
void operator()(nearestAndDist &x, const nearestAndDist &y) const
Nearest-face Arbitrary Mesh Interface (AMI) method.
virtual autoPtr< AMIInterpolation > clone() const
Construct and return a clone.
TypeName("nearestFaceAMI")
Runtime type information.
virtual ~nearestFaceAMI()=default
Destructor.
virtual bool calculate(const primitivePatch &srcPatch, const primitivePatch &tgtPatch, const autoPtr< searchableSurface > &surfPtr=nullptr)
Update addressing and weights.
Tuple2< pointIndexHit, scalar > nearestAndDist
nearestFaceAMI(const dictionary &dict, const bool reverseTarget=false)
Construct from dictionary.
OBJstream os(runTime.globalPath()/outputName)
List< scalarList > scalarListList
List of scalarList.
List< labelList > labelListList
List of labelList.
PrimitivePatch< SubList< face >, const pointField & > primitivePatch
A PrimitivePatch with a SubList addressing for the faces, const reference for the point field.
#define TypeName(TypeNameString)
Declare a ClassName() with extra virtual type info.