Embedded Template Library 1.0
etl::priority_queue< T, SIZE, TContainer, TCompare > Class Template Reference

#include <priority_queue.h>

Public Types

typedef TContainer::size_type size_type
 
typedef TContainer container_type
 
- Public Types inherited from etl::ipriority_queue< T, etl::vector< T, SIZE >, etl::less< typename TContainer::value_type > >
typedef T value_type
 The type stored in the queue.
 
typedef etl::vector< T, SIZE > container_type
 The container type used for priority queue.
 
typedef etl::less< typename TContainer::value_type > compare_type
 The comparison type.
 
typedef T & reference
 A reference to the type used in the queue.
 
typedef const T & const_reference
 A const reference to the type used in the queue.
 
typedef TContainer::size_type size_type
 The type used for determining the size of the queue.
 
typedef etl::iterator_traits< typenameTContainer::iterator >::difference_type difference_type
 

Public Member Functions

 priority_queue ()
 Default constructor.
 
 priority_queue (const priority_queue &rhs)
 Copy constructor.
 
template<typename TIterator >
 priority_queue (TIterator first, TIterator last)
 
 ~priority_queue ()
 Destructor.
 
priority_queueoperator= (const priority_queue &rhs)
 Assignment operator.
 
- Public Member Functions inherited from etl::ipriority_queue< T, etl::vector< T, SIZE >, etl::less< typename TContainer::value_type > >
reference top ()
 
const_reference top () const
 
void push (const_reference value)
 
void emplace (const T1 &value1)
 
void emplace (const T1 &value1, const T2 &value2)
 
void emplace (const T1 &value1, const T2 &value2, const T3 &value3)
 
void emplace (const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4)
 
void assign (TIterator first, TIterator last)
 
void pop ()
 
void pop_into (reference destination)
 
size_type size () const
 Returns the current number of items in the priority queue.
 
size_type max_size () const
 Returns the maximum number of items that can be queued.
 
bool empty () const
 
bool full () const
 
size_type available () const
 
void clear ()
 Clears the queue to the empty state.
 
ipriority_queueoperator= (const ipriority_queue &rhs)
 Assignment operator.
 

Static Public Attributes

static ETL_CONSTANT size_type MAX_SIZE = size_type(SIZE)
 

Additional Inherited Members

- Protected Member Functions inherited from etl::ipriority_queue< T, etl::vector< T, SIZE >, etl::less< typename TContainer::value_type > >
void clone (const ipriority_queue &other)
 Make this a clone of the supplied priority queue.
 
 ipriority_queue ()
 The constructor that is called from derived classes.
 

Detailed Description

template<typename T, const size_t SIZE, typename TContainer = etl::vector<T, SIZE>, typename TCompare = etl::less<typename TContainer::value_type>>
class etl::priority_queue< T, SIZE, TContainer, TCompare >

A fixed capacity priority queue. This queue does not support concurrent access by different threads.

Template Parameters
TThe type this queue should support.
SIZEThe maximum capacity of the queue.

Constructor & Destructor Documentation

◆ priority_queue()

template<typename T , const size_t SIZE, typename TContainer = etl::vector<T, SIZE>, typename TCompare = etl::less<typename TContainer::value_type>>
template<typename TIterator >
etl::priority_queue< T, SIZE, TContainer, TCompare >::priority_queue ( TIterator  first,
TIterator  last 
)
inline

Constructor, from an iterator range.

Template Parameters
TIteratorThe iterator type.
Parameters
firstThe iterator to the first element.
lastThe iterator to the last element + 1.

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