nanoflann::KNNResultSet< DistanceType, IndexType, CountType > Class Template Reference

#include <nanoflann.hpp>

Collaboration diagram for nanoflann::KNNResultSet< DistanceType, IndexType, CountType >:

Public Member Functions
	KNNResultSet (CountType capacity_)
void	init (IndexType *indices_, DistanceType *dists_)
CountType	size () const
bool	full () const
void	addPoint (DistanceType dist, IndexType index)
DistanceType	worstDist () const

Detailed Description

template<typename DistanceType, typename IndexType = size_t, typename CountType = size_t>
class nanoflann::KNNResultSet< DistanceType, IndexType, CountType >

Definition at line 64 of file nanoflann.hpp.

Constructor & Destructor Documentation

KNNResultSet()

template<typename DistanceType , typename IndexType = size_t, typename CountType = size_t>

nanoflann::KNNResultSet< DistanceType, IndexType, CountType >::KNNResultSet ( CountType capacity_ )

inline

Definition at line 71 of file nanoflann.hpp.

      : indices(0),
        dists(0),
        capacity(capacity_),
        count(0) {
  }

Member Function Documentation

addPoint()

template<typename DistanceType , typename IndexType = size_t, typename CountType = size_t>

void nanoflann::KNNResultSet< DistanceType, IndexType, CountType >::addPoint ( DistanceType dist, IndexType index )

inline

Definition at line 93 of file nanoflann.hpp.

                                                           {
    CountType i;
    for (i = count; i > 0; --i) {
#ifdef NANOFLANN_FIRST_MATCH   // If defined and two poins have the same distance, the one with the lowest-index will be returned first.
      if ( (dists[i-1]>dist) || ((dist==dists[i-1])&&(indices[i-1]>index)) ) {
#else
      if (dists[i - 1] > dist) {
#endif
        if (i < capacity) {
          dists[i] = dists[i - 1];
          indices[i] = indices[i - 1];
        }
      } else
        break;
    }
    if (i < capacity) {
      dists[i] = dist;
      indices[i] = index;
    }
    if (count < capacity)
      count++;
  }

full()

template<typename DistanceType , typename IndexType = size_t, typename CountType = size_t>

bool nanoflann::KNNResultSet< DistanceType, IndexType, CountType >::full ( ) const

inline

Definition at line 89 of file nanoflann.hpp.

                           {
    return count == capacity;
  }

init()

template<typename DistanceType , typename IndexType = size_t, typename CountType = size_t>

void nanoflann::KNNResultSet< DistanceType, IndexType, CountType >::init ( IndexType * indices_, DistanceType * dists_ )

inline

Definition at line 78 of file nanoflann.hpp.

                                                              {
    indices = indices_;
    dists = dists_;
    count = 0;
    dists[capacity - 1] = (std::numeric_limits<DistanceType>::max)();
  }

Here is the caller graph for this function:

size()

template<typename DistanceType , typename IndexType = size_t, typename CountType = size_t>

CountType nanoflann::KNNResultSet< DistanceType, IndexType, CountType >::size ( ) const

inline

Definition at line 85 of file nanoflann.hpp.

                                {
    return count;
  }

Here is the caller graph for this function:

worstDist()

template<typename DistanceType , typename IndexType = size_t, typename CountType = size_t>

DistanceType nanoflann::KNNResultSet< DistanceType, IndexType, CountType >::worstDist ( ) const

inline

Definition at line 116 of file nanoflann.hpp.

                                        {
    return dists[capacity - 1];
  }

---

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

• src/particles/subgrid3DLegacyFramework/contactDetection/nanoflann.hpp