feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Add missing std:: qualification to initializer_list

Browse Source
This commit is contained in:
Christian Mazakas
2022-03-01 11:08:07 -08:00
parent d676ad814b
commit 5772941057
4 changed files with 25 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doc/unordered/unordered_multiset.adoc
+6 -6
View File
@@ -54,7 +54,7 @@ namespace boost {
explicit xref:#unordered_multiset_allocator_constructor[unordered_multiset](const Allocator& a);
xref:#unordered_multiset_copy_constructor_with_allocator[unordered_multiset](const unordered_multiset& other, const Allocator& a);
xref:#unordered_multiset_move_constructor_with_allocator[unordered_multiset](unordered_multiset&& other, const Allocator& a);
xref:#unordered_multiset_initializer_list_constructor[unordered_multiset](initializer_list<value_type> il,
xref:#unordered_multiset_initializer_list_constructor[unordered_multiset](std::initializer_list<value_type> il,
size_type n = _implementation-defined_,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
@@ -72,7 +72,7 @@ namespace boost {
noexcept(boost::allocator_traits<Allocator>::is_always_equal::value &&
boost::is_nothrow_move_assignable_v<Hash> &&
boost::is_nothrow_move_assignable_v<Pred>);
unordered_multiset& xref:#unordered_multiset_initializer_list_assignment[operator++=++](initializer_list<value_type> il);
unordered_multiset& xref:#unordered_multiset_initializer_list_assignment[operator++=++](std::initializer_list<value_type> il);
allocator_type xref:#unordered_multiset_get_allocator[get_allocator]() const noexcept;
// iterators
@@ -96,7 +96,7 @@ namespace boost {
iterator xref:#unordered_multiset_copy_insert_with_hint[insert](const_iterator hint, const value_type& obj);
iterator xref:#unordered_multiset_move_insert_with_hint[insert](const_iterator hint, value_type&& obj);
template<class InputIterator> void xref:#unordered_multiset_insert_iterator_range[insert](InputIterator first, InputIterator last);
void xref:#unordered_multiset_insert_initializer_list[insert](initializer_list<value_type> il);
void xref:#unordered_multiset_insert_initializer_list[insert](std::initializer_list<value_type> il);
node_type xref:#unordered_multiset_extract_by_iterator[extract](const_iterator position);
node_type xref:#unordered_multiset_extract_by_value[extract](const key_type& k);
@@ -440,7 +440,7 @@ Requires:;; `value_type` is move insertable.
==== Initializer List Constructor
[source,c++,subs="+quotes"]
----
unordered_multiset(initializer_list<value_type> il,
unordered_multiset(std::initializer_list<value_type> il,
size_type n = _implementation-defined_,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
@@ -556,7 +556,7 @@ Requires:;; `value_type` is move constructible.
==== Initializer List Assignment
```c++
unordered_multiset& operator=(initializer_list<value_type> il);
unordered_multiset& operator=(std::initializer_list<value_type> il);
```
Assign from values in initializer list. All existing elements are either overwritten by the new elements or destroyed.
@@ -787,7 +787,7 @@ Pointers and references to elements are never invalidated.
==== Insert Initializer List
```c++
void insert(initializer_list<value_type> il);
void insert(std::initializer_list<value_type> il);
```
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.