Double-ended queue of bounded size, allowing lock-free atomic access. push_front() and pop_front() must not be called concurrently to each other, while pop_back() can be called concurrently at all times. empty()
, size()
, and top()
are intentionally not provided. Calling them would not make sense in a concurrent setting.
More...
Double-ended queue of bounded size, allowing lock-free atomic access. push_front() and pop_front() must not be called concurrently to each other, while pop_back() can be called concurrently at all times. empty()
, size()
, and top()
are intentionally not provided. Calling them would not make sense in a concurrent setting.
T | Contained element type. |
Definition at line 52 of file queue.h.
__gnu_parallel::RestrictedBoundedConcurrentQueue< T >::RestrictedBoundedConcurrentQueue | ( | sequence_index_t | max_size | ) | [inline] |
__gnu_parallel::RestrictedBoundedConcurrentQueue< T >::~RestrictedBoundedConcurrentQueue | ( | ) | [inline] |
bool __gnu_parallel::RestrictedBoundedConcurrentQueue< T >::pop_back | ( | T & | t | ) | [inline] |
Pops one element from the queue at the front end. Must not be called concurrently with pop_front().
bool __gnu_parallel::RestrictedBoundedConcurrentQueue< T >::pop_front | ( | T & | t | ) | [inline] |
Pops one element from the queue at the front end. Must not be called concurrently with pop_front().
Definition at line 100 of file queue.h.
Referenced by __gnu_parallel::qsb_local_sort_with_helping().
void __gnu_parallel::RestrictedBoundedConcurrentQueue< T >::push_front | ( | const T & | t | ) | [inline] |
Pushes one element into the queue at the front end. Must not be called concurrently with pop_front().
Definition at line 83 of file queue.h.
Referenced by __gnu_parallel::qsb_local_sort_with_helping().