Improving flat containers interface.

base/containers/flat_set_unittest.cc

 // Copyright 2017 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "base/containers/flat_set.h"
 
+#include <memory>
 #include <string>
 #include <vector>
 
 #include "base/containers/container_test_utils.h"
 #include "base/macros.h"
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 // A flat_set is basically a interface to flat_tree. So several basic
 // operations are tested to make sure things are set up properly, but the bulk
@@ skipping 66 matching lines @@
 
   copy.erase(copy.begin());
   copy.insert(10);
   EXPECT_THAT(copy, ElementsAre(2, 10));
 
   original.swap(copy);
   EXPECT_THAT(original, ElementsAre(2, 10));
   EXPECT_THAT(copy, ElementsAre(1, 2));
 }
 
+TEST(FlatSet, UniquePtrs) {
+  base::flat_set<std::unique_ptr<int>> s;
+  const auto& s1 = s;
+  int x = 0;
+  s.count(&x);
+  s1.count(&x);
+  s.find(&x);
+  s1.find(&x);
+  s.equal_range(&x);
+  s1.equal_range(&x);
+  s.lower_bound(&x);
+  s1.lower_bound(&x);
+  s.upper_bound(&x);
+  s1.upper_bound(&x);
+  s.erase(&x);
+
+  // Check if we broke overload resolution.
+  s.emplace(new int(0));
+  s.emplace(new int(1));
+  s.erase(s.begin());
+  s.erase(s.cbegin());
+}
+
 }  // namespace base