Partial specialization of DequePrimitives for one element per block.
Declared in <bslalg_dequeprimitives.h>
template<class VALUE_TYPE>
struct DequePrimitives<VALUE_TYPE, 1>;This is a partial specialization of DequePrimitives for the case when there is a single element per block.
| Name | Description |
|---|---|
ImpUtil | Implementation utilities for a single-element-per-block deque. |
Iterator | Iterator type used to traverse elements in a deque. |
size_type | Unsigned size type used by deque primitive operations. |
| Name | Description |
|---|---|
destruct | Destroy each element in the specified deque range. |
erase | Erase a range of elements from a deque and close the gap. |
insertAndMoveToBack | insertAndMoveToBack overloads |
insertAndMoveToFront | insertAndMoveToFront overloads |
uninitializedFillNBack | uninitializedFillNBack overloads |
uninitializedFillNFront | uninitializedFillNFront overloads |
valueInititalizeN | valueInititalizeN overloads |