circular_buffer_space_optimized<T, Alloc>
circular_buffer_space_optimized<T, Alloc> |
|
The circular_buffer_space_optimized container is an adaptor of the
circular_buffer. The
functionality of the circular_buffer_space_optimized is similar to
the base circular_buffer except it does not allocate memory at
once when created rather it allocates memory as needed. (The predictive memory
allocation is similar to typical std::vector implementation.)
Moreover the memory is automatically freed as the size of the container
decreases.
 |
|
| Figure: | The memory allocation process of the space optimized circular
buffer. The min_capacity represents the minimal guaranteed amount
of allocated memory. The allocated memory will never drop under this value. By
default the min_capacity is set to 0.
|
The auto-resizing mode of the space optimized circular buffer can be useful in
situations when the container can possibly store large number of elements but
most of its lifetime the container stores just few of them. The usage of the circular_buffer_space_optimized
will result in decreased memory consumption and can improve the CPU cache
effectiveness.
The circular_buffer_space_optimized is defined in the file
boost/circular_buffer.hpp.
There is also a forward declaration for the circular_buffer_space_optimized in the header file
boost/circular_buffer_fwd.hpp.
Random Access Container, Front Insertion Sequence, Back Insertion Sequence, Assignable (SGI specific), Equality Comparable, LessThan Comparable (SGI specific)
Template parameters, members and friend functions of the circular_buffer_space_optimized
are almost the same as for the base circular_buffer. Refer the circular_buffer
documentation and also its
source code documentation for a detailed description.
The specific methods of the circular_buffer_space_optimized are
listed below.
| Method | Description |
|---|---|
circular_buffer_space_optimized(size_type
capacity, size_type min_capacity = 0, const allocator_type& alloc =
allocator_type())
|
Create an empty space optimized circular buffer with a given capacity. |
circular_buffer_space_optimized
(size_type capacity, size_type min_capacity, const T& item, const
allocator_type& alloc = allocator_type())
|
Create a full space optimized circular buffer filled with copies of item.
|
template<InputIterator>
circular_buffer_space_optimized(size_type capacity, size_type
min_capacity, InputIterator first, InputIterator last, const
allocator_type& alloc = allocator_type())
|
Create a space optimized circular buffer with a copy of a range. |
min_capacity()
const
|
Return the minimal guaranteed amount of allocated memory. |
set_min_capacity()
|
Change the minimal guaranteed amount of allocated memory. |
The behaviour of memory auto-resizing is as follows:
circular_buffer_space_optimized
is created.
circular_buffer_space_optimized
container is created the allocated memory reflects the size of the container.
push_back, push_front, insert and rinsert
will predictively increase the allocated memory if necessary. (The predictive
memory allocation is similar to std::vector.)
set_capacity, resize, assign, insert
(range or n items), rinsert (range or n items), erase
(range) and clear
will accommodate the allocated memory as necessary.
pop_back, pop_front, erase and clear
will predictively decrease the allocated memory.
The semantics of the circular_buffer_space_optimized then follows
the semantics of the base circular_buffer
except the invalidation rules.
The rule for iterator invalidation for circular_buffer_space_optimized
is as follows:
data, set_capacity, resize, operator=,
assign, swap, push_back, push_front,
pop_back, pop_front, insert, rinsert,
erase and clear invalidate all iterators pointing to
the circular_buffer_space_optimized.
boost::circular_buffer,
std::vector
The idea of the space optimized circular buffer has been introduced by Pavel Vozenilek.
| Copyright © 2003-2005 Jan Gaspar |
|