boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 03:17:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Add missing std:: qualification to usages of pair in the reference docs

Browse Source
This commit is contained in:
Christian Mazakas
2022-03-01 07:50:29 -08:00
parent ceba60831c
commit d676ad814b
3 changed files with 25 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
doc/unordered/unordered_map.adoc
View File

@ -154,12 +154,12 @@ namespace boost {
bool xref:#unordered_map_contains[contains](const key_type& k) const; bool xref:#unordered_map_contains[contains](const key_type& k) const;
template<class K> template<class K>
bool xref:#unordered_map_contains[contains](const K& k) const; bool xref:#unordered_map_contains[contains](const K& k) const;
pair<iterator, iterator> xref:#unordered_map_equal_range[equal_range](const key_type& k); std::pair<iterator, iterator> xref:#unordered_map_equal_range[equal_range](const key_type& k);
pair<const_iterator, const_iterator> xref:#unordered_map_equal_range[equal_range](const key_type& k) const; std::pair<const_iterator, const_iterator> xref:#unordered_map_equal_range[equal_range](const key_type& k) const;
template<class K> template<class K>
pair<iterator, iterator> xref:#unordered_map_equal_range[equal_range](const K& k); std::pair<iterator, iterator> xref:#unordered_map_equal_range[equal_range](const K& k);
template<class K> template<class K>
pair<const_iterator, const_iterator> xref:#unordered_map_equal_range[equal_range](const K& k) const; std::pair<const_iterator, const_iterator> xref:#unordered_map_equal_range[equal_range](const K& k) const;
// element access // element access
mapped_type& xref:#unordered_map_operator[operator[+]+](const key_type& k); mapped_type& xref:#unordered_map_operator[operator[+]+](const key_type& k);
@ -1205,12 +1205,12 @@ Notes:;; The `template <typename K>` overload only participates in overload reso
==== equal_range ==== equal_range
```c++ ```c++
pair<iterator, iterator> equal_range(const key_type& k); std::pair<iterator, iterator> equal_range(const key_type& k);
pair<const_iterator, const_iterator> equal_range(const key_type& k) const; std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
template<class K> template<class K>
pair<iterator, iterator> equal_range(const K& k); std::pair<iterator, iterator> equal_range(const K& k);
template<class K> template<class K>
pair<const_iterator, const_iterator> equal_range(const K& k) const; std::pair<const_iterator, const_iterator> equal_range(const K& k) const;
``` ```
[horizontal] [horizontal]

16
doc/unordered/unordered_multimap.adoc
View File

@ -155,12 +155,12 @@ namespace boost {
bool xref:#unordered_multimap_contains[contains](const key_type& k) const; bool xref:#unordered_multimap_contains[contains](const key_type& k) const;
template<class K> template<class K>
bool xref:#unordered_multimap_contains[contains](const K& k) const; bool xref:#unordered_multimap_contains[contains](const K& k) const;
pair<iterator, iterator> xref:#unordered_multimap_equal_range[equal_range](const key_type& k); std::pair<iterator, iterator> xref:#unordered_multimap_equal_range[equal_range](const key_type& k);
pair<const_iterator, const_iterator> xref:#unordered_multimap_equal_range[equal_range](const key_type& k) const; std::pair<const_iterator, const_iterator> xref:#unordered_multimap_equal_range[equal_range](const key_type& k) const;
template<class K> template<class K>
pair<iterator, iterator> xref:#unordered_multimap_equal_range[equal_range](const K& k); std::pair<iterator, iterator> xref:#unordered_multimap_equal_range[equal_range](const K& k);
template<class K> template<class K>
pair<const_iterator, const_iterator> xref:#unordered_multimap_equal_range[equal_range](const K& k) const; std::pair<const_iterator, const_iterator> xref:#unordered_multimap_equal_range[equal_range](const K& k) const;
// bucket interface // bucket interface
size_type xref:#unordered_multimap_bucket_count[bucket_count]() const noexcept; size_type xref:#unordered_multimap_bucket_count[bucket_count]() const noexcept;
@ -1173,12 +1173,12 @@ Notes:;; The `template <typename K>` overload only participates in overload reso
==== equal_range ==== equal_range
```c++ ```c++
pair<iterator, iterator> equal_range(const key_type& k); std::pair<iterator, iterator> equal_range(const key_type& k);
pair<const_iterator, const_iterator> equal_range(const key_type& k) const; std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
template<class K> template<class K>
pair<iterator, iterator> equal_range(const K& k); std::pair<iterator, iterator> equal_range(const K& k);
template<class K> template<class K>
pair<const_iterator, const_iterator> equal_range(const K& k) const; std::pair<const_iterator, const_iterator> equal_range(const K& k) const;
``` ```
[horizontal] [horizontal]

18
doc/unordered/unordered_set.adoc
View File

@ -150,12 +150,12 @@ namespace boost {
bool xref:#unordered_set_contains[contains](const key_type& k) const; bool xref:#unordered_set_contains[contains](const key_type& k) const;
template<class K> template<class K>
bool xref:#unordered_set_contains[contains](const K& k) const; bool xref:#unordered_set_contains[contains](const K& k) const;
pair<iterator, iterator> xref:#unordered_set_equal_range[equal_range](const key_type& k); std::pair<iterator, iterator> xref:#unordered_set_equal_range[equal_range](const key_type& k);
pair<const_iterator, const_iterator> xref:#unordered_set_equal_range[equal_range](const key_type& k) const; std::pair<const_iterator, const_iterator> xref:#unordered_set_equal_range[equal_range](const key_type& k) const;
template<class K> template<class K>
pair<iterator, iterator> xref:#unordered_set_equal_range[equal_range](const K& k); std::pair<iterator, iterator> xref:#unordered_set_equal_range[equal_range](const K& k);
template<class K> template<class K>
pair<const_iterator, const_iterator> xref:#unordered_set_equal_range[equal_range](const K& k) const; std::pair<const_iterator, const_iterator> xref:#unordered_set_equal_range[equal_range](const K& k) const;
// bucket interface // bucket interface
size_type xref:#unordered_set_bucket_count[bucket_count]() const noexcept; size_type xref:#unordered_set_bucket_count[bucket_count]() const noexcept;
@ -660,7 +660,7 @@ Returns:;; `size()` of the largest possible container.
==== emplace ==== emplace
```c++ ```c++
template<class... Args> pair<iterator, bool> emplace(Args&&... args); template<class... Args> std::pair<iterator, bool> emplace(Args&&... args);
``` ```
Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent value. Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent value.
@ -1156,12 +1156,12 @@ Notes:;; The `template <typename K>` overload only participates in overload reso
==== equal_range ==== equal_range
```c++ ```c++
pair<iterator, iterator> equal_range(const key_type& k); std::pair<iterator, iterator> equal_range(const key_type& k);
pair<const_iterator, const_iterator> equal_range(const key_type& k) const; std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
template<class K> template<class K>
pair<iterator, iterator> equal_range(const K& k); std::pair<iterator, iterator> equal_range(const K& k);
template<class K> template<class K>
pair<const_iterator, const_iterator> equal_range(const K& k) const; std::pair<const_iterator, const_iterator> equal_range(const K& k) const;
``` ```
[horizontal] [horizontal]