std::multiset::multiset

(1)
explicit multiset( const Compare& comp = Compare(), 
                   const Allocator& alloc = Allocator() );
(until C++14)
multiset() : multiset( Compare() ) {}
explicit multiset( const Compare& comp, 
                   const Allocator& alloc = Allocator() );
(since C++14)
explicit multiset( const Allocator& alloc );
(1) (since C++11)
(2)
template< class InputIterator >
multiset( InputIterator first, InputIterator last,
          const Compare& comp = Compare(),
          const Allocator& alloc = Allocator() );
template< class InputIterator >
multiset( InputIterator first, InputIterator last,
          const Allocator& alloc );
(since C++14)
multiset( const multiset& other );
(3)
multiset( const multiset& other, const Allocator& alloc );
(3) (since C++11)
multiset( multiset&& other );
(4) (since C++11)
multiset( multiset&& other, const Allocator& alloc );
(4) (since C++11)
(5)
multiset( std::initializer_list<value_type> init,
          const Compare& comp = Compare(),
          const Allocator& alloc = Allocator() );
(since C++11)
multiset( std::initializer_list<value_type> init,
          const Allocator& );
(since C++14)

Constructs new container from a variety of data sources and optionally using user supplied allocator alloc or comparison function object comp.

1) Default constructor. Constructs empty container.
2) Constructs the container with the contents of the range [first, last).
3) Copy constructor. Constructs the container with the copy of the contents of other. If alloc is not provided, allocator is obtained by calling std::allocator_traits<allocator_type>::select_on_container_copy_construction(other.get_allocator()).
4) Move constructor. Constructs the container with the contents of other using move semantics. If alloc is not provided, allocator is obtained by move-construction from the allocator belonging to other.
5) Constructs the container with the contents of the initializer list init.

Parameters

alloc - allocator to use for all memory allocations of this container
comp - comparison function object to use for all comparisons of keys
first, last - the range to copy the elements from
other - another container to be used as source to initialize the elements of the container with
init - initializer list to initialize the elements of the container with
Type requirements
- InputIterator must meet the requirements of InputIterator.
- Compare must meet the requirements of Compare.
- Allocator must meet the requirements of Allocator.

Complexity

1) Constant
2) N log(N) where N = std::distance(first, last) in general, linear in N if the range is already sorted by value_comp().
3) Linear in size of other
4) Constant. If alloc is given and alloc != other.get_allocator(), then linear.
5) N log(N) where N = init.size()) in general, linear in N if init is already sorted by value_comp().

Example

See also

operator=
assigns values to the container
(public member function)
doc_CPP
2016-10-11 10:05:05
Comments
Leave a Comment

Please login to continue.