#include <Queue.h>
◆ queue()
template<class T , class Container = std::deque<T>>
◆ back() [1/2]
template<class T , class Container = std::deque<T>>
◆ back() [2/2]
template<class T , class Container = std::deque<T>>
◆ empty()
template<class T , class Container = std::deque<T>>
◆ front() [1/2]
template<class T , class Container = std::deque<T>>
◆ front() [2/2]
template<class T , class Container = std::deque<T>>
◆ operator std::queue< T, Container >()
template<class T , class Container = std::deque<T>>
Nice::queue< T, Container >::operator std::queue< T, Container > |
( |
| ) |
|
|
inline |
◆ pop()
template<class T , class Container = std::deque<T>>
◆ push()
template<class T , class Container = std::deque<T>>
◆ size()
template<class T , class Container = std::deque<T>>
size_t Nice::queue< T, Container >::size |
( |
void |
| ) |
const |
|
inline |
◆ mutex
template<class T , class Container = std::deque<T>>
◆ storage
template<class T , class Container = std::deque<T>>
std::queue<T, Container> Nice::queue< T, Container >::storage |
|
private |
The documentation for this class was generated from the following file:
- TwiceAsNice/nice/src/libNice/Nice/Util/Queue.h