std::multiset<Key,Compare,Allocator>::insert_range

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Tables

Iterator invalidation

Member function table

Non-member function table

 

std::multiset

Member functions

multiset::multiset multiset::~multiset         multiset::operator= multiset::get_allocator

Iterators multiset::beginmultiset::cbegin (C++11) multiset::endmultiset::cend (C++11) multiset::rbeginmultiset::crbegin (C++11)     multiset::rendmultiset::crend (C++11) Capacity multiset::size multiset::max_size multiset::empty Observers multiset::key_comp multiset::value_comp Modifiers multiset::clear multiset::erase multiset::swap multiset::extract (C++17) multiset::merge (C++17) multiset::insert multiset::insert_range (C++23) multiset::emplace (C++11) multiset::emplace_hint (C++11) Lookup multiset::count multiset::find multiset::contains (C++20) multiset::equal_range multiset::lower_bound multiset::upper_bound

Non-member functions

std::swap(std::multiset) erase_if(std::multiset) (C++20)   operator==operator<=> (C++20) operator!=operator<operator>operator<=operator>= (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)

Deduction guides(C++17)

 

template< container-compatible-range<value_type> R > void insert_range( R&& rg );		(since C++23)

Inserts a copy of each element in the range rg.

Each iterator in the range rg is dereferenced exactly once. The behavior is undefined if rg overlaps with the container.

No iterators or references are invalidated.

Parameters

rg	-	a container compatible range, that is, an input_range whose elements are convertible to T
Type requirements
- value_type must be EmplaceConstructible into multiset from *ranges::begin(rg). Otherwise, the behavior is undefined.

Return value

(none)

Complexity

N·log(a.size() + N), where N is ranges::distance(rg).

Notes

Feature-test macro	Value	Std	Feature
__cpp_lib_containers_ranges	202202L	(C++23)	Ranges-aware construction and insertion

Example

Run this code

#include <iostream>
#include <set>
 
void println(auto, auto const& container)
{
    for (const auto& elem : container)
        std::cout << elem << ' ';
    std::cout << '\n';
}
 
int main()
{
    auto container = std::multiset{1, 3, 2, 4};
    const auto rg = {-1, 3, -2};
#ifdef __cpp_lib_containers_ranges
    container.insert_range(rg);
#else
    container.insert(rg.begin(), rg.end());
#endif
    println("{}", container);
}

Output:

-2 -1 1 2 3 3 4

See also

insert

inserts elements or nodes(since C++17) (public member function)