Blender V5.3
blender::kdtree::RadiusQuery< ValueT, Fn > Class Template Reference

#include <BLI_kdtree_new.hh>

Public Member Functions

 RadiusQuery (const ValueT radius_sq, Fn fn)
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 = true

Detailed Description

template<typename ValueT, typename Fn>
class blender::kdtree::RadiusQuery< ValueT, Fn >

Passes every point in the radius to a callback.

Note
The radius is inclusive, matching blender::kdtree_range_search_cb.

Definition at line 401 of file BLI_kdtree_new.hh.

Constructor & Destructor Documentation

◆ RadiusQuery()

template<typename ValueT, typename Fn>
blender::kdtree::RadiusQuery< ValueT, Fn >::RadiusQuery ( const ValueT radius_sq,
Fn fn )
inline

Definition at line 410 of file BLI_kdtree_new.hh.

Member Function Documentation

◆ add_point()

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

Definition at line 417 of file BLI_kdtree_new.hh.

◆ count()

template<typename ValueT, typename Fn>
int blender::kdtree::RadiusQuery< ValueT, Fn >::count ( ) const
inline

Definition at line 412 of file BLI_kdtree_new.hh.

◆ max_distance_sq()

template<typename ValueT, typename Fn>
ValueT blender::kdtree::RadiusQuery< ValueT, Fn >::max_distance_sq ( ) const
inline

The search never narrows, since every point within the radius is wanted.

Definition at line 425 of file BLI_kdtree_new.hh.

Member Data Documentation

◆ inclusive

template<typename ValueT, typename Fn>
bool blender::kdtree::RadiusQuery< ValueT, Fn >::inclusive = true
staticconstexpr

Definition at line 408 of file BLI_kdtree_new.hh.


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