SERVER-38249 Implement stdx unordered_map and unordered_set as absl node hash map/set.

Remove stdx::unordered_multimap and multiset.

Custom hashers to stdx::unordered_map are not trusted by default, we
will rehash the produced hash with absl again to ensure we have a good
hash function.

1 files changed, 0 insertions, 15 deletions

diff --git a/src/mongo/bson/simple_bsonobj_comparator_test.cpp b/src/mongo/bson/simple_bsonobj_comparator_test.cpp
index ca94968a483..a6d9ab85631 100644
--- a/src/mongo/bson/simple_bsonobj_comparator_test.cpp
+++ b/src/mongo/bson/simple_bsonobj_comparator_test.cpp
@@ -86,14 +86,6 @@ TEST(SimpleBSONObjContainerTest, UnorderedSetIsDefaultConstructible) {
     ASSERT_EQ(uset.size(), 2UL);
 }
 
-TEST(SimpleBSONObjContainerTest, UnorderedMultiSetIsDefaultConstructible) {
-    SimpleBSONObjUnorderedMultiset umultiset;
-    umultiset.insert(BSON("x" << 1));
-    umultiset.insert(BSON("x" << 1));
-    umultiset.insert(BSON("y" << 1));
-    ASSERT_EQ(umultiset.size(), 3UL);
-}
-
 /**
  * Asserts that the key-value pair 'pair' can be successfully inserted into 'map'.
  */
@@ -141,12 +133,5 @@ TEST(SimpleBSONObjContainerTest, UnorderedMapIsDefaultConstructible) {
     ASSERT_EQ(umap.size(), 2UL);
 }
 
-TEST(SimpleBSONObjContainerTest, UnorderedMultiMapIsDefaultConstructible) {
-    SimpleBSONObjUnorderedMultiMap<std::string> umultimap;
-    umultimap.insert(std::make_pair(BSON("_id" << 0), "anica"));
-    umultimap.insert(std::make_pair(BSON("_id" << 0), "raj"));
-    umultimap.insert(std::make_pair(BSON("_id" << 1), "ian"));
-    ASSERT_EQ(umultimap.size(), 3UL);
-}
 }  // namespace
 }  // namespace mongo