Namespace for primitive algorithms that operate on deques.
Synopsis
Declared in <bslalg_dequeprimitives.h>
template<
class VALUE_TYPE,
int BLOCK_LENGTH>
struct DequePrimitives;
Description
This struct provides a namespace for a suite of utility functions that operate on deques parameterized by the VALUE_TYPE and BLOCK_LENGTH. Depending on the traits of VALUE_TYPE, the default and copy constructors, destructor, assignment operators, etcetera may not be invoked, and instead the operation can be optimized using a no‐op, bitwise move, or bitwise copy.
Type Aliases
Name |
Description |
Iterator type used to traverse elements in a deque. |
|
Unsigned size type used by deque primitive operations. |
Static Member Functions
Name |
Description |
|
|
Emplace a value, shifting existing elements toward the back. |
|
|
|
Emplace a value, shifting existing elements toward the front. |
|
|
|
|
|
|
|
|
|
Move elements backward with |
|
Move elements forward with |
|
|
|
|
|
Append copies of a value to the back of an uninitialized deque range. |
|
Prepend copies of a value to the front of an uninitialized deque range. |
|
Append value‐initialized elements to the back of a deque. |
Specializations
Name |
Description |
Partial specialization of |
Created with MrDocs