documented ctors added in #160

This commit is contained in:
joaquintides committed 2022-11-05 12:38:03 +01:00
1 parent 3e4546465b
commit 0d8c02ba0e
6 files changed
+178 -2

No files matched your search

+29
View File
@@ -52,6 +52,8 @@ namespace boost {
const allocator_type& a = allocator_type());
xref:#unordered_set_copy_constructor[unordered_set](const unordered_set& other);
xref:#unordered_set_move_constructor[unordered_set](unordered_set&& other);
template<class InputIterator>
xref:#unordered_set_iterator_range_constructor_with_allocator[unordered_set](InputIterator f, InputIterator l, const allocator_type& a);
explicit xref:#unordered_set_allocator_constructor[unordered_set](const Allocator& a);
xref:#unordered_set_copy_constructor_with_allocator[unordered_set](const unordered_set& other, const Allocator& a);
xref:#unordered_set_move_constructor_with_allocator[unordered_set](unordered_set&& other, const Allocator& a);
@@ -67,6 +69,7 @@ namespace boost {
template<class InputIterator>
xref:#unordered_set_iterator_range_constructor_with_bucket_count_and_hasher[unordered_set](InputIterator f, InputIterator l, size_type n, const hasher& hf,
const allocator_type& a);
xref:#unordered_set_initializer_list_constructor_with_allocator[unordered_set](std::initializer_list<value_type> il, const allocator_type& a);
xref:#unordered_set_initializer_list_constructor_with_bucket_count_and_allocator[unordered_set](std::initializer_list<value_type> il, size_type n, const allocator_type& a);
xref:#unordered_set_initializer_list_constructor_with_bucket_count_and_hasher_and_allocator[unordered_set](std::initializer_list<value_type> il, size_type n, const hasher& hf,
const allocator_type& a);
@@ -420,6 +423,19 @@ So, for example, you can't return the container from a function.
---
==== Iterator Range Constructor with Allocator
```c++
template<class InputIterator>
unordered_set(InputIterator f, InputIterator l, const allocator_type& a);
```
Constructs an empty container using `a` as the allocator, with the default hash function and key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.
[horizontal]
Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== Allocator Constructor
```c++
explicit unordered_set(const Allocator& a);
@@ -523,6 +539,19 @@ Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/
---
==== initializer_list Constructor with Allocator
```c++
unordered_set(std::initializer_list<value_type> il, const allocator_type& a);
```
Constructs an empty container using `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
[horizontal]
Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== initializer_list Constructor with Bucket Count and Allocator
```c++