Public Member Functions | Private Attributes
ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare > Class Template Reference

List of all members.

Public Member Functions

 ApproxMVBB_STATIC_ASSERT ((std::is_same< value_type, typename NodeDataType::PointListType::value_type >::value)) using Base
iterator begin ()
void clear ()
iterator end ()
bool full ()
Compare & getComperator ()
Container & getContainer ()
 KNearestPrioQueue (std::size_t maxSize)
std::size_t maxSize ()
void push (const typename Base::value_type &v)
template<typename It >
void push (It beg, It end)
reverse_iterator rbegin ()
reverse_iterator rend ()
template<typename Iterator >
void replace (Iterator begin, Iterator end)

Private Attributes

std::size_t m_maxSize

Detailed Description

template<typename TTraits = TreeTraits<>>
template<typename Container, typename Compare>
class ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >

Priority queue adapter, to let the comperator be changed on the fly! This is usefull if we call getKNearestNeighbours lots of times. and want to update the comperator in between.

Definition at line 2040 of file KdTree.hpp.


Constructor & Destructor Documentation

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::KNearestPrioQueue ( std::size_t  maxSize) [inline]

Definition at line 2076 of file KdTree.hpp.


Member Function Documentation

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::ApproxMVBB_STATIC_ASSERT ( (std::is_same< value_type, typename NodeDataType::PointListType::value_type >::value)  )
template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
iterator ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::begin ( ) [inline]

Definition at line 2062 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
void ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::clear ( ) [inline]

Definition at line 2080 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
iterator ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::end ( ) [inline]

Definition at line 2065 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
bool ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::full ( ) [inline]

Definition at line 2084 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
Compare& ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::getComperator ( ) [inline]

Definition at line 2058 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
Container& ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::getContainer ( ) [inline]

Definition at line 2055 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
std::size_t ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::maxSize ( ) [inline]

Definition at line 2124 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
void ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::push ( const typename Base::value_type &  v) [inline]

Definition at line 2088 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
template<typename It >
void ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::push ( It  beg,
It  end 
) [inline]

Definition at line 2098 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
reverse_iterator ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::rbegin ( ) [inline]

Definition at line 2069 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
reverse_iterator ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::rend ( ) [inline]

Definition at line 2072 of file KdTree.hpp.

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
template<typename Iterator >
void ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::replace ( Iterator  begin,
Iterator  end 
) [inline]

Replace total container with new elements

Definition at line 2118 of file KdTree.hpp.


Member Data Documentation

template<typename TTraits = TreeTraits<>>
template<typename Container , typename Compare >
std::size_t ApproxMVBB::KdTree::Tree< TTraits >::KNearestPrioQueue< Container, Compare >::m_maxSize [private]

Definition at line 2129 of file KdTree.hpp.


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


asr_approx_mvbb
Author(s): Gassner Nikolai
autogenerated on Sat Jun 8 2019 20:21:50