Blender V5.3
BLI_kdtree_new.hh File Reference
#include <algorithm>
#include <concepts>
#include <limits>
#include "BLI_bounds_types.hh"
#include "BLI_index_mask_fwd.hh"
#include "BLI_linear_allocator.hh"
#include "BLI_math_vector.hh"
#include "BLI_span.hh"
#include "BLI_utility_mixins.hh"
#include "BLI_vector.hh"

Go to the source code of this file.

Classes

struct  blender::kdtree::Node< ValueT >
class  blender::KDTreeNew< T >
struct  blender::KDTreeNew< T >::Nearest
class  blender::kdtree::NearestQuery< ValueT >
class  blender::kdtree::FilteredNearestQuery< ValueT, Filter >
class  blender::kdtree::NearestNQuery< NearestT, ValueT >
class  blender::kdtree::RadiusQuery< ValueT, Fn >

Namespaces

namespace  blender
 BMesh Iterators.
namespace  blender::kdtree

Concepts

concept  blender::kdtree::FilterFn
concept  blender::kdtree::QueryType

Functions

template<typename Query, typename ValueT>
bool blender::kdtree::keep_distance (const ValueT distance_sq, const ValueT max_distance_sq)
template<typename T>
int blender::kdtree::calc_duplicates (const KDTreeNew< T > &tree, typename T::base_type range, Span< int > visit_order, MutableSpan< int > duplicates)
template<typename T>
int blender::kdtree::calc_duplicates (const KDTreeNew< T > &tree, typename T::base_type range, const IndexMask &visit_order, MutableSpan< int > duplicates)
template<typename T>
int blender::kdtree::calc_duplicates (const KDTreeNew< T > &tree, const typename T::base_type range, const MutableSpan< int > duplicates)