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

Inheritance diagram for AssumeUniqueLimitedHeap< T, ContainerT >:

Public Types
typedef ContainerT< T >	BaseType

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 ()

	AssumeUniqueLimitedHeap ()

	AssumeUniqueLimitedHeap (size_type limit)

size_type	Limit () const

void	Limit (size_type limit)

void	MakeHeap ()

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 ()