Thread‐safe, indexable, double‐ended queue of TYPE values.
Synopsis
Declared in <bdlcc_deque.h>
template<class TYPE>
class Deque;
Description
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.
Types
Name |
Description |
This class defines a proctor type that provides direct const access to the underlying |
|
Proctor granting locked, 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. |
|
|
|
|
|
|
|
|
|
|
|
Timed removal of the last item into |
|
Timed removal of the first item into |
|
|
|
|
|
|
|
|
|
|
|
|