Ponca  84886bac0b52a686e88046a375da13f12f2b87d2
Point Cloud Analysis library
Loading...
Searching...
No Matches
Ponca::KdTreeKNearestIterator< Index, DataPoint > Class Template Reference

Input iterator to read the KdTreeKNearestQueryBase object. More...

#include <kdTreeKNearestIterator.h>

+ Collaboration diagram for Ponca::KdTreeKNearestIterator< Index, DataPoint >:

Public Types

using iterator_category = PONCA_MULTIARCH_CU_STD_NAMESPACE(input_iterator_tag)
 
using difference_type = std::ptrdiff_t
 
using value_type = Index
 
using pointer = Index *
 
using reference = const Index &
 
using Scalar = typename DataPoint::Scalar
 
using Iterator = typename limited_priority_queue< IndexSquaredDistance< Index, Scalar > >::iterator
 

Public Member Functions

 KdTreeKNearestIterator (const Iterator &iterator)
 
bool operator!= (const KdTreeKNearestIterator &other) const
 Inequality operand.
 
bool operator== (const KdTreeKNearestIterator &other) const
 Equality operand.
 
KdTreeKNearestIteratoroperator++ ()
 Prefix increment.
 
KdTreeKNearestIterator operator++ (int)
 Postfix increment.
 
void operator+= (int i)
 Value increment.
 
reference operator* () const
 Dereference operator.
 

Protected Attributes

Iterator m_iterator
 

Detailed Description

template<typename Index, typename DataPoint>
class Ponca::KdTreeKNearestIterator< Index, DataPoint >

Input iterator to read the KdTreeKNearestQueryBase object.

As this is an input iterator, we don't guarantee anything other than reading the values with it. If you need to operate on the values of this iterator with algorithms that relies on forward iterator functionalities, you should copy the index values in an STL-like container.

Note
This iterator object can be duplicated with no issues.
See also
KdTreeKNearestQueryBase

Definition at line 26 of file kdTreeKNearestIterator.h.

Member Typedef Documentation

◆ difference_type

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::difference_type = std::ptrdiff_t

Definition at line 30 of file kdTreeKNearestIterator.h.

◆ Iterator

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::Iterator = typename limited_priority_queue<IndexSquaredDistance<Index, Scalar> >::iterator

Definition at line 36 of file kdTreeKNearestIterator.h.

◆ iterator_category

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::iterator_category = PONCA_MULTIARCH_CU_STD_NAMESPACE(input_iterator_tag)

Definition at line 29 of file kdTreeKNearestIterator.h.

◆ pointer

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::pointer = Index*

Definition at line 32 of file kdTreeKNearestIterator.h.

◆ reference

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::reference = const Index&

Definition at line 33 of file kdTreeKNearestIterator.h.

◆ Scalar

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::Scalar = typename DataPoint::Scalar

Definition at line 35 of file kdTreeKNearestIterator.h.

◆ value_type

template<typename Index , typename DataPoint >
using Ponca::KdTreeKNearestIterator< Index, DataPoint >::value_type = Index

Definition at line 31 of file kdTreeKNearestIterator.h.

Constructor & Destructor Documentation

◆ KdTreeKNearestIterator()

template<typename Index , typename DataPoint >
Ponca::KdTreeKNearestIterator< Index, DataPoint >::KdTreeKNearestIterator ( const Iterator &  iterator)
inline

Definition at line 39 of file kdTreeKNearestIterator.h.

Member Function Documentation

◆ operator!=()

template<typename Index , typename DataPoint >
bool Ponca::KdTreeKNearestIterator< Index, DataPoint >::operator!= ( const KdTreeKNearestIterator< Index, DataPoint > &  other) const
inline

Inequality operand.

Definition at line 44 of file kdTreeKNearestIterator.h.

◆ operator*()

template<typename Index , typename DataPoint >
reference Ponca::KdTreeKNearestIterator< Index, DataPoint >::operator* ( ) const
inline

Dereference operator.

Definition at line 67 of file kdTreeKNearestIterator.h.

◆ operator++() [1/2]

template<typename Index , typename DataPoint >
KdTreeKNearestIterator & Ponca::KdTreeKNearestIterator< Index, DataPoint >::operator++ ( )
inline

Prefix increment.

Definition at line 54 of file kdTreeKNearestIterator.h.

◆ operator++() [2/2]

template<typename Index , typename DataPoint >
KdTreeKNearestIterator Ponca::KdTreeKNearestIterator< Index, DataPoint >::operator++ ( int  )
inline

Postfix increment.

Definition at line 57 of file kdTreeKNearestIterator.h.

◆ operator+=()

template<typename Index , typename DataPoint >
void Ponca::KdTreeKNearestIterator< Index, DataPoint >::operator+= ( int  i)
inline

Value increment.

Definition at line 64 of file kdTreeKNearestIterator.h.

◆ operator==()

template<typename Index , typename DataPoint >
bool Ponca::KdTreeKNearestIterator< Index, DataPoint >::operator== ( const KdTreeKNearestIterator< Index, DataPoint > &  other) const
inline

Equality operand.

Definition at line 49 of file kdTreeKNearestIterator.h.

Member Data Documentation

◆ m_iterator

template<typename Index , typename DataPoint >
Iterator Ponca::KdTreeKNearestIterator< Index, DataPoint >::m_iterator
protected

Definition at line 72 of file kdTreeKNearestIterator.h.