Iterator of Deque
Reverse iterator of Deque
Default Constructor.
Initializer Constructor.
Items to assign.
Copy Constructor
Object to copy.
Fill Constructor.
Initial size.
Value to fill.
Range Constructor.
Input iterator of the first position.
Input iterator of the last position.
Expansion ratio.
Minimum Deque.capacity.
Although a Deque has few elements, even no element is belonged to, the Deque keeps the minimum Deque.capacity at least.
Row size of the {@link Deque.matrix_ matrix} which contains elements.
Note that the ROW_SIZE affects on time complexity of accessing and inserting element. Accessing element is ROW_SIZE times slower than ordinary Vector and inserting element in middle position is ROW_SIZE times faster than ordinary Vector.
When the ROW_SIZE returns 8, time complexity of accessing element is O(8) and inserting element in middle position is O(N/8). (Vector's time complexity of accessement is O(1) and inserting element is O(N)).
Range Assigner.
Input iteartor of the first position.
Input iterator of the last position.
Get element at specific position.
Specific position.
The element at the index.
Get the last element.
The last element.
The capacity to store elements.
The capacity.
Get the first element.
The first element.
Get iterator at specific position.
Specific position.
The iterator at the index.
Erase the last element.
Reserve capacity enable to store n elements.
The capacity to reserve.
Resize this Vector forcibly.
New container size.
Change element at specific position.
Specific position.
The new value to change.
Native function for JSON.stringify().
An array containing children elements.
Generated using TypeDoc
Double ended queue.
Jeongho Nam - https://github.com/samchon