item_buffer with reservable front-end. NOTE: if reserving, do not
More...
#include <_flow_graph_item_buffer_impl.h>
|
void | reset () |
|
| item_buffer () |
| Constructor.
|
|
void | reset () |
|
|
bool | reserve_front (T &v) |
|
void | consume_front () |
|
void | release_front () |
|
bool | buffer_empty () |
|
buffer_item_type & | item (size_type i) |
|
bool | my_item_valid (size_type i) |
|
bool | my_item_reserved (size_type i) |
|
const item_type & | get_my_item (size_t i) |
|
void | set_my_item (size_t i, const item_type &o) |
|
void | fetch_item (size_t i, item_type &o) |
|
void | move_item (size_t to, size_t from) |
|
bool | place_item (size_t here, const item_type &me) |
|
void | swap_items (size_t i, size_t j) |
|
void | destroy_item (size_type i) |
|
const item_type & | front () |
|
const item_type & | back () |
|
void | reserve_item (size_type i) |
|
void | release_item (size_type i) |
|
void | destroy_front () |
|
void | destroy_back () |
|
size_type | size (size_t new_tail=0) |
|
size_type | capacity () |
|
bool | buffer_full () |
|
void | grow_my_array (size_t minimum_size) |
| Grows the internal array.
|
|
bool | push_back (item_type &v) |
|
bool | pop_back (item_type &v) |
|
bool | pop_front (item_type &v) |
|
void | clean_up_buffer (bool reset_pointers) |
|
|
bool | my_reserved |
|
buffer_item_type * | my_array |
|
size_type | my_array_size |
|
size_type | my_head |
|
size_type | my_tail |
|
|
enum | buffer_item_state { no_item =0,
has_item =1,
reserved_item =2
} |
|
typedef T | item_type |
|
typedef size_t | size_type |
|
typedef aligned_pair< item_type, buffer_item_state >::type | buffer_item_type |
|
typedef A::template rebind< buffer_item_type >::other | allocator_type |
|
static const size_type | initial_buffer_size = 4 |
|
template<typename T, typename A = cache_aligned_allocator<T>>
class internal::reservable_item_buffer< T, A >
item_buffer with reservable front-end. NOTE: if reserving, do not
The documentation for this class was generated from the following file: