24 Containers library [containers]

24.6 Container adaptors [container.adaptors]

24.6.12 Class template flat_multiset [flat.multiset]

24.6.12.4 Modifiers [flat.multiset.modifiers]

🔗
template<class... Args> iterator emplace(Args&&... args);
1
#
Constraints: is_constructible_v<value_type, Args...> is true.
2
#
Effects: First, initializes an object t of type value_type with std​::​forward<Args>(args)..., then inserts t as if by: auto it = ranges::upper_bound(c, t, compare); c.insert(it, std::move(t));
3
#
Returns: An iterator that points to the inserted element.
🔗
template<class InputIterator> void insert(InputIterator first, InputIterator last);
4
#
Effects: Adds elements to c as if by: c.insert(c.end(), first, last);
Then, sorts the range of newly inserted elements with respect to compare, and merges the resulting sorted range and the sorted range of pre-existing elements into a single sorted range.
5
#
Complexity: N + , where N is size() before the operation and M is distance(first, last).
6
#
Remarks: Since this operation performs an in-place merge, it may allocate memory.
🔗
template<class InputIterator> void insert(sorted_equivalent_t, InputIterator first, InputIterator last);
7
#
Effects: Equivalent to insert(first, last).
8
#
Complexity: Linear.
🔗
void swap(flat_multiset& y) noexcept;
9
#
Effects: Equivalent to: ranges::swap(compare, y.compare); ranges::swap(c, y.c);
🔗
container_type extract() &&;
10
#
Postconditions: *this is emptied, even if the function exits via an exception.
11
#
Returns: std​::​move(c).
🔗
void replace(container_type&& cont);
12
#
Preconditions: The elements of cont are sorted with respect to compare.
13
#
Effects: Equivalent to: c = std​::​move(cont);