__gnu_para...rrentQueue(3)
π __gnu_para...rrentQueue(3) π
okay so bestie, welcome to the Library Functions Manual page for __gnu_para...rrentQueue(3). This one is lowkey a deep cut: __gnu_parallel::RestrictedBoundedConcurrentQueue is a template class, and it's giving bounded double-ended queue with lock-free atomic access. Let's get into it. π
β¨ NAME β¨
__gnu_parallel::RestrictedBoundedConcurrentQueue β a 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. π«Ά
πΈ SYNOPSIS πΈ
π Public Member Functions π
bool pop_back (T &t)
bool pop_front (T &t)
void push_front (const T &t)
RestrictedBoundedConcurrentQueue (sequence_index_t max_size)
~RestrictedBoundedConcurrentQueue ()
π¦ Detailed Description π¦
template<typename T> class __gnu_parallel::RestrictedBoundedConcurrentQueue< T >
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. π
Parameters:
Tβ Contained element type.
Definition at line 52 of file queue.h.
π§ Constructor & Destructor Documentation π§
πΈ Constructor πΈ
template<typename T> __gnu_parallel::RestrictedBoundedConcurrentQueue< T >::RestrictedBoundedConcurrentQueue (sequence_index_t max_size) [inline]
Constructor. Not to be called concurrent, of course. π
Parameters:
max_sizeβ Maximal number of elements to be contained.
Definition at line 68 of file queue.h.
π¦ Destructor π¦
template<typename T> __gnu_parallel::RestrictedBoundedConcurrentQueue< T >::~RestrictedBoundedConcurrentQueue () [inline]
Destructor. Not to be called concurrent, of course. π
Definition at line 77 of file queue.h.
π Member Function Documentation π
π pop_back π
template<typename T> 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(). π
Definition at line 124 of file queue.h.
π pop_front π
template<typename T> 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().
π¦ push_front π¦
template<typename T> 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().
π Author π
Generated automatically by Doxygen for libstdc++ from the source code. β¨
and that's the whole page, bestie! Signed off by libstdc++, dated 21 Apr 2009, page __gnu_para...rrentQueue(3) ππ
π¦ where this page comes from
- nixpkgs unstable: std-man-pages 4.4.0
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms