Construction, destruction, copying
Contents
Construction, destruction, copying#
Empty container constructors#
concurrent_bounded_queue(); explicit concurrent_bounded_queue( const allocator_type& alloc );Constructs an empty
concurrent_bounded_queue
with an unbounded capacity. If provided, uses the allocatoralloc
to allocate the memory.
Constructors from the sequence of elements#
template <typename InputIterator> concurrent_bounded_queue( InputIterator first, InputIterator last, const allocator_type& alloc = allocator_type() );Constructs a
concurrent_bounded_queue
with an unbounded capacity and containing all elements from the half-open interval[first, last)
using the allocatoralloc
to allocate the memory.Requirements: the type
InputIterator
must meet the InputIterator requirements from the[input.iterators]
ISO C++ Standard section.concurrent_bounded_queue( std::initializer_list<value_type> init, const allocator_type& alloc = allocator_type() );Equivalent to
concurrent_bounded_queue(init.begin(), init.end(), alloc)
.
Copying constructors#
concurrent_bounded_queue( const concurrent_bounded_queue& other ); concurrent_bounded_queue( const concurrent_bounded_queue& other, const allocator_type& alloc );Constructs a copy of
other
.If the allocator argument is not provided, it is obtained by
std::allocator_traits<allocator_type>::select_on_container_copy_construction(other.get_allocator())
.The behavior is undefined in case of concurrent operations with
other
.
Moving constructors#
concurrent_bounded_queue( concurrent_bounded_queue&& other ); concurrent_bounded_queue( concurrent_bounded_queue&& other, const allocator_type& alloc );Constructs a
concurrent_bounded_queue
with the content ofother
using move semantics.
other
is left in a valid, but unspecified state.If the allocator argument is not provided, it is obtained by
std::move(other.get_allocator())
.The behavior is undefined in case of concurrent operations with
other
.
Destructor#
~concurrent_bounded_queue();Destroys the
concurrent_bounded_queue
. Calls destructors of the stored elements and deallocates the used storage.The behavior is undefined in case of concurrent operations with
*this
.
Assignment operators#
concurrent_bounded_queue& operator=( const concurrent_bounded_queue& other );Replaces all elements in
*this
by the copies of the elements inother
.Copy-assigns allocators if
std::allocator_traits<allocator_type>::propagate_on_container_copy_assignment::value
istrue
.The behavior is undefined in case of concurrent operations with
*this
andother
.Returns: a reference to
*this
.concurrent_bounded_queue& operator=( concurrent_bounded_queue&& other );Replaces all elements in
*this
by the elements inother
using move semantics.
other
is left in a valid, but unspecified state.Move-assigns allocators if
std::allocator_traits<allocator_type>::propagate_on_container_move_assignment::value
istrue
.The behavior is undefined in case of concurrent operations with
*this
andother
.Returns: a reference to
*this
.concurrent_bounded_queue& operator=( std::initializer_list<value_type> init );Replaces all elements in
*this
by the elements ininit
.The behavior is undefined in case of concurrent operations with
*this
.Returns: a reference to
*this
.
assign#
template <typename InputIterator> void assign( InputIterator first, InputIterator last );Replaces all elements in
*this
be the elements in the half-open interval[first, last)
.The behavior is undefined in case of concurrent operations with
*this
.Requirements: the type
InputIterator
must meet the InputIterator requirements from the[input.iterators]
ISO C++ Standard section.void assign( std::initializer_list<value_type> init );Equivalent to
assign(init.begin(), init.end())
.