Blender V5.3
blender::kdtree::NearestNQuery< NearestT, ValueT > Class Template Reference

#include <BLI_kdtree_new.hh>

Public Member Functions

 NearestNQuery (MutableSpan< NearestT > nearest)
int count () const
bool add_point (const ValueT distance_sq, const int index)
ValueT max_distance_sq () const

Static Public Attributes

static constexpr bool inclusive = false

Detailed Description

template<typename NearestT, typename ValueT>
class blender::kdtree::NearestNQuery< NearestT, ValueT >

Keeps the closest points, in order, up to the size of the span it was given.

Definition at line 351 of file BLI_kdtree_new.hh.

Constructor & Destructor Documentation

◆ NearestNQuery()

template<typename NearestT, typename ValueT>
blender::kdtree::NearestNQuery< NearestT, ValueT >::NearestNQuery ( MutableSpan< NearestT > nearest)
inlineexplicit

Definition at line 359 of file BLI_kdtree_new.hh.

Member Function Documentation

◆ add_point()

template<typename NearestT, typename ValueT>
bool blender::kdtree::NearestNQuery< NearestT, ValueT >::add_point ( const ValueT distance_sq,
const int index )
inline

Definition at line 366 of file BLI_kdtree_new.hh.

References capacity.

◆ count()

template<typename NearestT, typename ValueT>
int blender::kdtree::NearestNQuery< NearestT, ValueT >::count ( ) const
inline

Definition at line 361 of file BLI_kdtree_new.hh.

Referenced by blender::KDTreeNew< T >::find_nearest_n().

◆ max_distance_sq()

template<typename NearestT, typename ValueT>
ValueT blender::kdtree::NearestNQuery< NearestT, ValueT >::max_distance_sq ( ) const
inline

Definition at line 388 of file BLI_kdtree_new.hh.

Member Data Documentation

◆ inclusive

template<typename NearestT, typename ValueT>
bool blender::kdtree::NearestNQuery< NearestT, ValueT >::inclusive = false
staticconstexpr

Definition at line 357 of file BLI_kdtree_new.hh.


The documentation for this class was generated from the following file: