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