density
C++11 library for paged memory management, function queues, heterogeneous queues and lifo memory management
sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE > Member List

This is the complete list of members for sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >, including all inherited members.

cancel() noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
commit() noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
complete_type() const noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
element() const noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
element_ptr() const noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
empty() const noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
operator bool() const noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inlineexplicit
operator=(const put_transaction &)=deletesp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >
operator=(put_transaction< OTHERTYPE > &&i_source) noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
put_transaction (defined in sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >)sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >friend
put_transaction() noexcept=defaultsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >
put_transaction(const put_transaction &)=deletesp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >
put_transaction(put_transaction< OTHERTYPE > &&i_source) noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
put_transaction(PrivateType, sp_heter_queue *i_queue, const Allocation &i_put) noexcept (defined in sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >)sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
queue() const noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
raw_allocate(size_t i_size, size_t i_alignment)sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
raw_allocate_copy(INPUT_ITERATOR i_begin, INPUT_ITERATOR i_end)sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
raw_allocate_copy(const INPUT_RANGE &i_source_range) -> decltype(std::declval< put_transaction >().raw_allocate_copy( std::begin(i_source_range), std::end(i_source_range))) sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
swap(put_transaction &i_first, put_transaction &i_second) noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >friend
try_raw_allocate(progress_guarantee i_progress_guarantee, size_t i_size, size_t i_alignment) noexceptsp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
try_raw_allocate_copy(progress_guarantee i_progress_guarantee, INPUT_ITERATOR i_begin, INPUT_ITERATOR i_end) noexcept(std:: is_nothrow_copy_constructible< typename std::iterator_traits< INPUT_ITERATOR >::value_type >::value)sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
try_raw_allocate_copy(progress_guarantee i_progress_guarantee, const INPUT_RANGE &i_source_range) noexcept(noexcept(std::declval< put_transaction >() .try_raw_allocate_copy( i_progress_guarantee, std::begin(i_source_range), std::end(i_source_range)))) -> decltype(std::declval< put_transaction >().try_raw_allocate_copy( i_progress_guarantee, std::begin(i_source_range), std::end(i_source_range))) sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline
~put_transaction()sp_heter_queue< RUNTIME_TYPE, ALLOCATOR_TYPE, PROD_CARDINALITY, CONSUMER_CARDINALITY, BUSY_WAIT_FUNC >::put_transaction< ELEMENT_COMPLETE_TYPE >inline