diff --git a/doc/unordered/unordered_map.adoc b/doc/unordered/unordered_map.adoc
index 121e3cc8..1ba03803 100644
--- a/doc/unordered/unordered_map.adoc
+++ b/doc/unordered/unordered_map.adoc
@@ -69,6 +69,9 @@ namespace boost {
     template<class InputIterator>
       xref:#unordered_map_iterator_range_constructor_with_bucket_count_and_hasher[unordered_map](InputIterator f, InputIterator l, size_type n, const hasher& hf,
                     const allocator_type& a);
+    xref:#unordered_map_initializer_list_constructor_with_bucket_count_and_allocator[unordered_map](std::initializer_list<value_type> il, size_type n, const allocator_type& a);
+    xref:#unordered_map_initializer_list_constructor_with_bucket_count_and_hasher_and_allocator[unordered_map](std::initializer_list<value_type> il, size_type n, const hasher& hf,
+                  const allocator_type& a);
     xref:#unordered_map_destructor[~unordered_map]();
     unordered_map& xref:#unordered_map_copy_assignment[operator++=++](const unordered_map& other);
     unordered_map& xref:#unordered_map_move_assignment[operator++=++](unordered_map&& other)
@@ -550,6 +553,33 @@ Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/
 
 ---
 
+==== initializer_list Constructor with Bucket Count and Allocator
+
+```c++
+unordered_map(std::initializer_list<value_type> il, size_type n, const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, 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 Hasher and Allocator
+
+```c++
+unordered_map(std::initializer_list<value_type> il, size_type n, const hasher& hf,
+              const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
+
+[horizontal]
+Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
+
+---
+
 === Destructor
 
 ```c++
diff --git a/doc/unordered/unordered_multimap.adoc b/doc/unordered/unordered_multimap.adoc
index 59dc81a7..08189570 100644
--- a/doc/unordered/unordered_multimap.adoc
+++ b/doc/unordered/unordered_multimap.adoc
@@ -68,7 +68,8 @@ namespace boost {
     template<class InputIterator>
       xref:#unordered_multimap_iterator_range_constructor_with_bucket_count_and_hasher[unordered_multimap](InputIterator f, InputIterator l, size_type n, const hasher& hf,
                          const allocator_type& a);
-    xref:#unordered_multimap_initializer_list_constructor[unordered_multimap](std::initializer_list<value_type> il, size_type n, const hasher& hf,
+    xref:#unordered_multimap_initializer_list_constructor_with_bucket_count_and_allocator[unordered_multimap](std::initializer_list<value_type> il, size_type n, const allocator_type& a);
+    xref:#unordered_multimap_initializer_list_constructor_with_bucket_count_and_hasher_and_allocator[unordered_multimap](std::initializer_list<value_type> il, size_type n, const hasher& hf,
                        const allocator_type& a);
     xref:#unordered_multimap_destructor[~unordered_multimap]();
     unordered_multimap& xref:#unordered_multimap_copy_assignment[operator++=++](const unordered_multimap& other);
@@ -517,6 +518,33 @@ Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/
 
 ---
 
+==== initializer_list Constructor with Bucket Count and Allocator
+
+```c++
+unordered_multimap(std::initializer_list<value_type> il, size_type n, const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, 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 Hasher and Allocator
+
+```c++
+unordered_multimap(std::initializer_list<value_type> il, size_type n, const hasher& hf,
+                   const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
+
+[horizontal]
+Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
+
+---
+
 === Destructor
 
 ```c++
diff --git a/doc/unordered/unordered_multiset.adoc b/doc/unordered/unordered_multiset.adoc
index 9309d32b..5539b080 100644
--- a/doc/unordered/unordered_multiset.adoc
+++ b/doc/unordered/unordered_multiset.adoc
@@ -66,6 +66,9 @@ namespace boost {
     template<class InputIterator>
       xref:#unordered_multiset_iterator_range_constructor_with_bucket_count_and_hasher[unordered_multiset](InputIterator f, InputIterator l, size_type n, const hasher& hf,
                          const allocator_type& a);
+    xref:#unordered_multiset_initializer_list_constructor_with_bucket_count_and_allocator[unordered_multiset](std::initializer_list<value_type> il, size_type n, const allocator_type& a)
+    xref:#unordered_multiset_initializer_list_constructor_with_bucket_count_and_hasher_and_allocator[unordered_multiset](std::initializer_list<value_type> il, size_type n, const hasher& hf,
+                       const allocator_type& a);
     xref:#unordered_multiset_destructor[~unordered_multiset()];
     unordered_multiset& xref:#unordered_multiset_copy_assignment[operator++=++](const unordered_multiset& other);
     unordered_multiset& xref:#unordered_multiset_move_assignment[operator++=++](unordered_multiset&& other)
@@ -509,6 +512,33 @@ Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/
 
 ---
 
+==== initializer_list Constructor with Bucket Count and Allocator
+
+```c++
+unordered_multiset(std::initializer_list<value_type> il, size_type n, const allocator_type& a)
+```
+
+Constructs an empty container with at least `n` buckets, 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 Hasher and Allocator
+
+```c++
+    unordered_multiset(std::initializer_list<value_type> il, size_type n, const hasher& hf,
+                       const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
+
+[horizontal]
+Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
+
+---
+
 === Destructor
 
 ```c++
diff --git a/doc/unordered/unordered_set.adoc b/doc/unordered/unordered_set.adoc
index 84748351..88645126 100644
--- a/doc/unordered/unordered_set.adoc
+++ b/doc/unordered/unordered_set.adoc
@@ -67,6 +67,9 @@ 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_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);
     xref:#unordered_set_destructor[~unordered_set]();
     unordered_set& xref:#unordered_set_copy_assignment[operator++=++](const unordered_set& other);
     unordered_set& xref:#unordered_set_move_assignment[operator++=++](unordered_set&& other)
@@ -520,6 +523,33 @@ Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/
 
 ---
 
+==== initializer_list Constructor with Bucket Count and Allocator
+
+```c++
+unordered_set(std::initializer_list<value_type> il, size_type n, const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, 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 Hasher and Allocator
+
+```c++
+unordered_set(std::initializer_list<value_type> il, size_type n, const hasher& hf,
+              const allocator_type& a);
+```
+
+Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
+
+[horizontal]
+Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
+
+---
+
 === Destructor
 
 ```c++