LimitedHeap< T, PredicateT, ContainerT > Class Template Reference

#include <VisionX/components/pointcloud_processor/EfficientRANSACPrimitiveExtractor/EfficientRANSAC/GfxTL/LimitedHeap.h>

Inheritance diagram for LimitedHeap< T, PredicateT, ContainerT >:

Public Types
typedef ContainerT< T >	BaseType
typedef PredicateT	PredicateType
typedef ContainerT< T >::size_type	size_type
typedef ContainerT< T >::value_type	value_type
Public Types inherited from FlatCopyVector< T >
typedef const T *	const_iterator
typedef const T *	const_pointer
typedef const T &	const_reference
typedef std::reverse_iterator< const T * >	const_reverse_iterator
typedef size_t	difference_type
typedef T *	iterator
typedef T *	pointer
typedef T &	reference
typedef std::reverse_iterator< T * >	reverse_iterator
typedef size_t	size_type
typedef T	value_type

Public Member Functions
void	AssertHeap ()
void	clear ()
size_type	Limit () const
void	Limit (size_type limit)
	LimitedHeap ()
	LimitedHeap (const PredicateType &pred)
	LimitedHeap (size_type limit)
	LimitedHeap (size_type limit, const PredicateType &pred)
void	MakeHeap ()
const PredicateType &	Predicate () const
void	Predicate (const PredicateType &pred)
void	PushHeap (const value_type &t)
void	SortHeap ()
Public Member Functions inherited from FlatCopyVector< T >
T &	at (size_type i)
const T &	at (size_type i) const
T &	back ()
const T &	back () const
T *	begin ()
const T *	begin () const
size_t	capacity () const
void	clear ()
T *	end ()
const T *	end () const
void	erase (T *where)
	FlatCopyVector ()
	FlatCopyVector (const FlatCopyVector< T > &v)
	FlatCopyVector (size_t s)
T &	front ()
const T &	front () const
void	insert (T *where, const T &nn)
	operator const T * () const
	operator T* ()
FlatCopyVector< T > &	operator= (const FlatCopyVector< T > &v)
void	pop_back ()
void	push_back (const T &nn)
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
void	reserve (size_t s)
void	resize (size_t s)
void	resize (size_t s, const value_type &v)
size_t	size () const
	~FlatCopyVector ()

Member Typedef Documentation

BaseType

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

typedef ContainerT<T> BaseType

PredicateType

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

typedef PredicateT PredicateType

size_type

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

typedef ContainerT<T>::size_type size_type

value_type

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

typedef ContainerT<T>::value_type value_type

Constructor & Destructor Documentation

LimitedHeap() [1/4]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

LimitedHeap ( )

inline

LimitedHeap() [2/4]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

LimitedHeap ( size_type limit )

inline

LimitedHeap() [3/4]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

LimitedHeap ( const PredicateType & pred )

inline

LimitedHeap() [4/4]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

LimitedHeap ( size_type limit, const PredicateType & pred )

inline

Member Function Documentation

AssertHeap()

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void AssertHeap ( )

inline

clear()

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void clear ( )

inline

Limit() [1/2]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

size_type Limit ( ) const

inline

Limit() [2/2]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void Limit ( size_type limit )

inline

MakeHeap()

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void MakeHeap ( )

inline

Predicate() [1/2]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

const PredicateType & Predicate ( ) const

inline

Predicate() [2/2]

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void Predicate ( const PredicateType & pred )

inline

PushHeap()

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void PushHeap ( const value_type & t )

inline

SortHeap()

template<class T, class PredicateT = std::less<T>, template< class > class ContainerT = FlatCopyVector>

void SortHeap ( )

inline

---

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

• VisionX/components/pointcloud_processor/EfficientRANSACPrimitiveExtractor/EfficientRANSAC/GfxTL/LimitedHeap.h