Index: test/libcxx/containers/unord/unord.map/db_local_iterators_7.pass.cpp
===================================================================
--- test/libcxx/containers/unord/unord.map/db_local_iterators_7.pass.cpp
+++ test/libcxx/containers/unord/unord.map/db_local_iterators_7.pass.cpp
@@ -28,8 +28,8 @@
 {
     {
     typedef std::unordered_map<int, std::string> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    C c({{1, std::string()}});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
@@ -38,8 +38,8 @@
     {
     typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
                         min_allocator<std::pair<const int, std::string>>> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    C c({{1, std::string()}});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
Index: test/std/containers/unord/unord.multimap/db_local_iterators_7.pass.cpp
===================================================================
--- test/std/containers/unord/unord.multimap/db_local_iterators_7.pass.cpp
+++ test/std/containers/unord/unord.multimap/db_local_iterators_7.pass.cpp
@@ -28,8 +28,8 @@
 {
     {
     typedef std::unordered_multimap<int, std::string> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    C c({{1, std::string()}});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
@@ -38,8 +38,8 @@
     {
     typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
                         min_allocator<std::pair<const int, std::string>>> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    C c({{1, std::string()}});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
Index: test/std/containers/unord/unord.multiset/db_iterators_7.pass.cpp
===================================================================
--- test/std/containers/unord/unord.multiset/db_iterators_7.pass.cpp
+++ test/std/containers/unord/unord.multiset/db_iterators_7.pass.cpp
@@ -28,7 +28,7 @@
     {
     typedef int T;
     typedef std::unordered_multiset<T> C;
-    C c(1);
+    C c({1});
     C::iterator i = c.begin();
     ++i;
     assert(i == c.end());
@@ -38,8 +38,8 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_multiset<T, min_allocator<T>> C;
-    C c(1);
+    typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
+    C c({1});
     C::iterator i = c.begin();
     ++i;
     assert(i == c.end());
Index: test/std/containers/unord/unord.multiset/db_iterators_8.pass.cpp
===================================================================
--- test/std/containers/unord/unord.multiset/db_iterators_8.pass.cpp
+++ test/std/containers/unord/unord.multiset/db_iterators_8.pass.cpp
@@ -36,7 +36,7 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_multiset<T, min_allocator<T>> C;
+    typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
     C c(1);
     C::iterator i = c.end();
     T j = *i;
Index: test/std/containers/unord/unord.multiset/db_local_iterators_7.pass.cpp
===================================================================
--- test/std/containers/unord/unord.multiset/db_local_iterators_7.pass.cpp
+++ test/std/containers/unord/unord.multiset/db_local_iterators_7.pass.cpp
@@ -28,8 +28,8 @@
     {
     typedef int T;
     typedef std::unordered_multiset<T> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    C c({1});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
@@ -37,9 +37,9 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_multiset<T, min_allocator<T>> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
+    C c({1});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
Index: test/std/containers/unord/unord.multiset/db_local_iterators_8.pass.cpp
===================================================================
--- test/std/containers/unord/unord.multiset/db_local_iterators_8.pass.cpp
+++ test/std/containers/unord/unord.multiset/db_local_iterators_8.pass.cpp
@@ -36,7 +36,7 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_multiset<T, min_allocator<T>> C;
+    typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
     C c(1);
     C::local_iterator i = c.end(0);
     T j = *i;
Index: test/std/containers/unord/unord.set/db_iterators_7.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/db_iterators_7.pass.cpp
+++ test/std/containers/unord/unord.set/db_iterators_7.pass.cpp
@@ -28,7 +28,7 @@
     {
     typedef int T;
     typedef std::unordered_set<T> C;
-    C c(1);
+    C c({1});
     C::iterator i = c.begin();
     ++i;
     assert(i == c.end());
@@ -38,8 +38,8 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_set<T, min_allocator<T>> C;
-    C c(1);
+    typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
+    C c({1});
     C::iterator i = c.begin();
     ++i;
     assert(i == c.end());
Index: test/std/containers/unord/unord.set/db_iterators_8.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/db_iterators_8.pass.cpp
+++ test/std/containers/unord/unord.set/db_iterators_8.pass.cpp
@@ -36,7 +36,7 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_set<T, min_allocator<T>> C;
+    typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
     C c(1);
     C::iterator i = c.end();
     T j = *i;
Index: test/std/containers/unord/unord.set/db_local_iterators_7.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/db_local_iterators_7.pass.cpp
+++ test/std/containers/unord/unord.set/db_local_iterators_7.pass.cpp
@@ -28,8 +28,8 @@
     {
     typedef int T;
     typedef std::unordered_set<T> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    C c({1});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
@@ -37,9 +37,9 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_set<T, min_allocator<T>> C;
-    C c(1);
-    C::local_iterator i = c.begin(0);
+    typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
+    C c({1});
+    C::local_iterator i = c.begin(c.bucket(1));
     ++i;
     ++i;
     assert(false);
Index: test/std/containers/unord/unord.set/db_local_iterators_8.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/db_local_iterators_8.pass.cpp
+++ test/std/containers/unord/unord.set/db_local_iterators_8.pass.cpp
@@ -36,7 +36,7 @@
 #if TEST_STD_VER >= 11
     {
     typedef int T;
-    typedef std::unordered_set<T, min_allocator<T>> C;
+    typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
     C c(1);
     C::local_iterator i = c.end(0);
     T j = *i;
Index: test/std/containers/unord/unord.set/emplace_hint.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/emplace_hint.pass.cpp
+++ test/std/containers/unord/unord.set/emplace_hint.pass.cpp
@@ -38,7 +38,7 @@
         assert(c.size() == 1);
         assert(*r == Emplaceable());
 
-        r = c.emplace_hint(e, Emplaceable(5, 6));
+        r = c.emplace_hint(c.end(), Emplaceable(5, 6));
         assert(c.size() == 2);
         assert(*r == Emplaceable(5, 6));
 
@@ -57,7 +57,7 @@
         assert(c.size() == 1);
         assert(*r == Emplaceable());
 
-        r = c.emplace_hint(e, Emplaceable(5, 6));
+        r = c.emplace_hint(c.end(), Emplaceable(5, 6));
         assert(c.size() == 2);
         assert(*r == Emplaceable(5, 6));
 
Index: test/std/containers/unord/unord.set/insert_hint_const_lvalue.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/insert_hint_const_lvalue.pass.cpp
+++ test/std/containers/unord/unord.set/insert_hint_const_lvalue.pass.cpp
@@ -36,15 +36,15 @@
         assert(c.size() == 1);
         assert(*r == 3.5);
 
-        r = c.insert(e, P(3.5));
+        r = c.insert(c.end(), P(3.5));
         assert(c.size() == 1);
         assert(*r == 3.5);
 
-        r = c.insert(e, P(4.5));
+        r = c.insert(c.end(), P(4.5));
         assert(c.size() == 2);
         assert(*r == 4.5);
 
-        r = c.insert(e, P(5.5));
+        r = c.insert(c.end(), P(5.5));
         assert(c.size() == 3);
         assert(*r == 5.5);
     }
@@ -60,15 +60,15 @@
         assert(c.size() == 1);
         assert(*r == 3.5);
 
-        r = c.insert(e, P(3.5));
+        r = c.insert(c.end(), P(3.5));
         assert(c.size() == 1);
         assert(*r == 3.5);
 
-        r = c.insert(e, P(4.5));
+        r = c.insert(c.end(), P(4.5));
         assert(c.size() == 2);
         assert(*r == 4.5);
 
-        r = c.insert(e, P(5.5));
+        r = c.insert(c.end(), P(5.5));
         assert(c.size() == 3);
         assert(*r == 5.5);
     }
Index: test/std/containers/unord/unord.set/insert_hint_rvalue.pass.cpp
===================================================================
--- test/std/containers/unord/unord.set/insert_hint_rvalue.pass.cpp
+++ test/std/containers/unord/unord.set/insert_hint_rvalue.pass.cpp
@@ -41,11 +41,11 @@
         assert(c.size() == 1);
         assert(*r == 3.5);
 
-        r = c.insert(e, P(4.5));
+        r = c.insert(c.end(), P(4.5));
         assert(c.size() == 2);
         assert(*r == 4.5);
 
-        r = c.insert(e, P(5.5));
+        r = c.insert(c.end(), P(5.5));
         assert(c.size() == 3);
         assert(*r == 5.5);
     }
@@ -64,11 +64,11 @@
         assert(c.size() == 1);
         assert(*r == 3);
 
-        r = c.insert(e, P(4));
+        r = c.insert(c.end(), P(4));
         assert(c.size() == 2);
         assert(*r == 4);
 
-        r = c.insert(e, P(5));
+        r = c.insert(c.end(), P(5));
         assert(c.size() == 3);
         assert(*r == 5);
     }
@@ -89,11 +89,11 @@
         assert(c.size() == 1);
         assert(*r == 3.5);
 
-        r = c.insert(e, P(4.5));
+        r = c.insert(c.end(), P(4.5));
         assert(c.size() == 2);
         assert(*r == 4.5);
 
-        r = c.insert(e, P(5.5));
+        r = c.insert(c.end(), P(5.5));
         assert(c.size() == 3);
         assert(*r == 5.5);
     }
@@ -113,11 +113,11 @@
         assert(c.size() == 1);
         assert(*r == 3);
 
-        r = c.insert(e, P(4));
+        r = c.insert(c.end(), P(4));
         assert(c.size() == 2);
         assert(*r == 4);
 
-        r = c.insert(e, P(5));
+        r = c.insert(c.end(), P(5));
         assert(c.size() == 3);
         assert(*r == 5);
     }