A thread safe queue that supports both synchronous pop and asynchronous pop. It's not allowed to use pop and async_pop together.  
 More...
#include <ConcurrentQueue.hpp>
|  | 
| void | push (const T &element) | 
|  | Pushes element into the queue.  More... 
 | 
|  | 
| void | push (T &&element) | 
|  | Pushes element into the queue.  More... 
 | 
|  | 
| T | pop () | 
|  | Remove the oldest element from the queue. Blocks if no element is available.  More... 
 | 
|  | 
| void | async_pop (const std::function< void(const T &)> &handler) | 
|  | Asynchronously pop an element from the queue.  More... 
 | 
|  | 
| bool | empty () const | 
|  | Check whether the queue is empty.  More... 
 | 
|  | 
| std::size_t | size () const | 
|  | Return how many elements are currently in the queue.  More... 
 | 
|  | 
template<class T>
class HLR::Kinematics::ConcurrentQueue< T >
A thread safe queue that supports both synchronous pop and asynchronous pop. It's not allowed to use pop and async_pop together. 
- Template Parameters
- 
  
    | T | The type to be placed in the queue. |  
 
Asynchronously pop an element from the queue. 
- Parameters
- 
  
    | handler | handler The function that will be called when the element is popped. |  
 
 
 
Check whether the queue is empty. 
- Returns
- true If empty. 
- 
false If not empty. 
 
 
Remove the oldest element from the queue. Blocks if no element is available. 
- Returns
- The removed element. 
 
 
Pushes element into the queue. 
- Parameters
- 
  
    | element | The element to insert. |  
 
 
 
Pushes element into the queue. 
- Parameters
- 
  
    | element | The element to insert. |  
 
 
 
Return how many elements are currently in the queue. 
- Returns
- The amount of elements in the queue 
 
 
The documentation for this class was generated from the following file: