O models OutputIterator

Replace an element.

Insert an element before the specified position. ! \pre <code>pos</code> is a valid iterator pointing to the <code>circular_buffer</code> or i

Insert an element at the specified position. ! \pre <code>pos</code> is a valid iterator pointing to the <code>circular_buffer_space_optimized

Get the minimal capacity of the space optimized circular buffer.

Get the capacity of the space optimized circular buffer.

Insert an element at the specified position. ! \pre <code>pos</code> is a valid iterator pointing to the <code>circular_buffer</code> or its e

Destroy an item.

Construct or replace an element. ! <code>construct</code> has to be set to <code>true</code> if and only if <code>pos</code> points to

Deallocate memory.

Initialize the internal buffer.

Remove an element at the specified position. ! \pre <code>pos</code> is a valid iterator pointing to the <code>circular_buffer</code> (but not

Remove an element at the specified position. ! \pre <code>pos</code> is a valid iterator pointing to the <code>circular_buffer_space_optimized

Remove an element at the specified position. ! \pre <code>pos</code> is a valid iterator pointing to the <code>circular_buffer</code> (but not

Allocate memory.

Does the pointer point to the uninitialized memory?

<b>Returns</b>: <code>a.allocate(n)</code>

Insert a new element at the end of the <code>circular_buffer</code> using rvalue references or rvalues references emulation. ! \post if <code>

Insert a new element at the beginning of the <code>circular_buffer</code>. ! \post if <code>capacity() > 0</code> then <code>front() == item</

Destroy the whole content of the circular buffer.

Destroy an item only if it has been constructed.

Map the null pointer to virtual end of circular buffer.

Insert a new element at the end of the space optimized circular buffer. ! \post if <code>capacity().%capacity() > 0</code> then <code>back() =

Reset the circular buffer.

Swap the contents of two <code>circular_buffer</code>s. ! \post <code>this</code> contains elements of <code>cb</code> and vice versa; the cap

Remove the last element from the <code>circular_buffer</code>. ! \pre <code>!empty()</code> \post The last element is removed from the

Remove the first element from the <code>circular_buffer</code>. ! \pre <code>!empty()</code> \post The first element is removed from t

Insert a new element at the beginning of the space optimized circular buffer. ! \post if <code>capacity().%capacity() > 0</code> then <code>fr

Get the last element. ! \pre <code>!empty()</code> \return A reference to the last element of the <code>circular_buffer</code>.

<b>Returns</b>: <code>a.deallocate(p, n)</code> <b>Throws</b>: Nothing

Get the first element. ! \pre <code>!empty()</code> \return A reference to the first element of the <code>circular_buffer</code>.

Invalidate all iterators.

F models ForwardIterator

Remove the last element from the space optimized circular buffer. ! \pre <code>!empty()</code> \post The last element is removed from

Remove the first element from the space optimized circular buffer. ! \pre <code>!empty()</code> \post The first element is removed fro

Register an iterator into the list of valid iterators. ! \note The method is const in order to register iterators into const containers, too.

! \brief Get the maximum number of elements which can be inserted into the <code>circular_buffer_space_optimized</code> without overwri

Specialized method for swapping the allocator.

F models ForwardIterator

F models ForwardIterator

Unregister an iterator from the list of valid iterators. ! \note The method is const in order to unregister iterators from const containers, t