List of all members | Public Types | Public Member Functions
AssumeUniqueLimitedHeap< T, ContainerT > Class Template Reference

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

Additional Inherited Members

- Public Attributes inherited from FlatCopyVector< T >
const typedef T * const_iterator
 
const typedef T * const_pointer
 
const typedef T & const_reference
 

Detailed Description

template<class T, template< class > class ContainerT = FlatCopyVector>
class GfxTL::AssumeUniqueLimitedHeap< T, ContainerT >

Definition at line 227 of file LimitedHeap.h.

Member Typedef Documentation

◆ BaseType

typedef ContainerT< T > BaseType

Definition at line 233 of file LimitedHeap.h.

◆ size_type

typedef ContainerT< T >::size_type size_type

Definition at line 232 of file LimitedHeap.h.

◆ value_type

typedef ContainerT< T >::value_type value_type

Definition at line 231 of file LimitedHeap.h.

Constructor & Destructor Documentation

◆ AssumeUniqueLimitedHeap() [1/2]

AssumeUniqueLimitedHeap ( )
inline

Definition at line 235 of file LimitedHeap.h.

◆ AssumeUniqueLimitedHeap() [2/2]

AssumeUniqueLimitedHeap ( size_type  limit)
inline

Definition at line 239 of file LimitedHeap.h.

Member Function Documentation

◆ AssertHeap()

void AssertHeap ( )
inline

Definition at line 280 of file LimitedHeap.h.

+ Here is the call graph for this function:

◆ Limit() [1/2]

size_type Limit ( ) const
inline

Definition at line 251 of file LimitedHeap.h.

◆ Limit() [2/2]

void Limit ( size_type  limit)
inline

Definition at line 245 of file LimitedHeap.h.

◆ MakeHeap()

void MakeHeap ( )
inline

Definition at line 256 of file LimitedHeap.h.

◆ PushHeap()

void PushHeap ( const value_type &  t)
inline

Definition at line 288 of file LimitedHeap.h.

+ Here is the call graph for this function:

◆ SortHeap()

void SortHeap ( )
inline

Definition at line 265 of file LimitedHeap.h.

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