This class provides a fully thread‐safe implementation of an efficient, in‐place, indexable, double‐ended queue of (template parameter) TYPE values. Direct access to the underlying bsl::deque<TYPE> object is provided through the nested Proctor and ConstProctor classes. While this class is not value‐semantic, the underlying bsl::deque<TYPE> class is.
Synopsis
Declared in <bdlcc_deque.h>
template<class TYPE>
class Deque;
Types
Name |
Description |
This class defines a proctor type that provides direct const access to the underlying |
|
This class defines a proctor type that provides direct access to the underlying |
Type Aliases
Name |
Description |
Underlying non‐thread‐safe deque type. |
|
Unsigned type used for sizes and indexes. |
Member Functions
Name |
Description |
|
Constructors |
|
Destroy this container. The behavior is undefined unless all access or modification of the container has completed prior to the destruction of this object. |
Return the allocator used by this container for allocating memory. |
|
Return the system clock type used for timing |
|
|
|
|
|
Return the high‐water mark value for this container. |
|
Return the number of elements contained in this container. Note that this method temporarily acquires the mutex, so that this method must not be called while a proctor in the same thread has this container locked, and the value returned is potentially obsolete before it is returned if any other threads are simultaneously modifying this container. To find the length while a proctor has the container locked, call |
|
|
|
|
|
|
|
|
|
|
|
Remove the last item in this container and load that item value into the specified |
|
Remove the first item in this container and load that item value into the specified |
|
|
|
|
|
|
|
|
|
|
|
|