TwiceAsNice  2019-02-18
Public Member Functions | Private Attributes | List of all members
Nice::priority_queue< T, Container, Compare > Class Template Reference

#include <Queue.h>

Collaboration diagram for Nice::priority_queue< T, Container, Compare >:
Collaboration graph

Public Member Functions

 priority_queue (const Compare &x=Compare(), const Container &y=Container())
 
template<class InputIterator >
 priority_queue (InputIterator first, InputIterator last, const Compare &x=Compare(), const Container &y=Container())
 
bool empty (void) const
 
size_t size (void) const
 
T & top (void)
 
const T & top (void) const
 
void push (const T &u)
 
void pop (void)
 
 operator std::priority_queue< T, Container, Compare > ()
 

Private Attributes

std::priority_queue< T, Container, Compare > storage
 
boost::mutex mutex
 

Constructor & Destructor Documentation

◆ priority_queue() [1/2]

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
Nice::priority_queue< T, Container, Compare >::priority_queue ( const Compare &  x = Compare(),
const Container &  y = Container() 
)
inlineexplicit

◆ priority_queue() [2/2]

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
template<class InputIterator >
Nice::priority_queue< T, Container, Compare >::priority_queue ( InputIterator  first,
InputIterator  last,
const Compare &  x = Compare(),
const Container &  y = Container() 
)
inline

Member Function Documentation

◆ empty()

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
bool Nice::priority_queue< T, Container, Compare >::empty ( void  ) const
inline

◆ operator std::priority_queue< T, Container, Compare >()

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
Nice::priority_queue< T, Container, Compare >::operator std::priority_queue< T, Container, Compare > ( )
inline

◆ pop()

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
void Nice::priority_queue< T, Container, Compare >::pop ( void  )
inline

◆ push()

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
void Nice::priority_queue< T, Container, Compare >::push ( const T &  u)
inline

◆ size()

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
size_t Nice::priority_queue< T, Container, Compare >::size ( void  ) const
inline

◆ top() [1/2]

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
T& Nice::priority_queue< T, Container, Compare >::top ( void  )
inline

◆ top() [2/2]

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
const T& Nice::priority_queue< T, Container, Compare >::top ( void  ) const
inline

Member Data Documentation

◆ mutex

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
boost::mutex Nice::priority_queue< T, Container, Compare >::mutex
mutableprivate

◆ storage

template<class T , class Container = std::vector<T>, class Compare = std::less<typename Container::value_type>>
std::priority_queue< T, Container, Compare > Nice::priority_queue< T, Container, Compare >::storage
private

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