Add a flat_map container

base/containers/flat_tree_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 "base/containers/flat_tree.h"
 
 // Following tests are ported and extended tests from libcpp for std::set.
 // They can be found here:
 // https://github.com/llvm-mirror/libcxx/tree/master/test/std/containers/associative/set
 //
 // Not ported tests:
 // * No tests with PrivateConstructor and std::less<> changed to std::less<T>
 //   These tests have to do with C++14 std::less<>
 //   http://en.cppreference.com/w/cpp/utility/functional/less_void
 //   and add support for templated versions of lookup functions.
@@ skipping 18 matching lines @@
 // * No tests for range insertion. Flat sets currently do not support this
 //   functionality.
 
 #include <string>
 #include <vector>
 
 #include "base/macros.h"
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
+namespace base {
+namespace internal {
+
 namespace {
 
 class MoveOnly {
  public:
   explicit MoveOnly(int data = 1) : data_(data) {}
   MoveOnly(MoveOnly&& other) : data_(other.data_) { other.data_ = 0; }
   MoveOnly& operator=(MoveOnly&& other) {
     data_ = other.data_;
     other.data_ = 0;
     return *this;
@@ skipping 82 matching lines @@
   double double_;
 
   DISALLOW_COPY_AND_ASSIGN(Emplaceable);
 };
 
 class NonDefaultConstructibleCompare {
  public:
   explicit NonDefaultConstructibleCompare(int) {}
 
   template <typename T>
-  bool operator()(const T& lhs, const T& rhs) {
+  bool operator()(const T& lhs, const T& rhs) const {
     return std::less<T>()(lhs, rhs);
   }
 };
 
-// Common test sets.
-using IntSet = base::flat_set<int>;
-using MoveOnlySet = base::flat_set<MoveOnly>;
-using EmplaceableSet = base::flat_set<Emplaceable>;
-using ReversedSet = base::flat_set<int, std::greater<int>>;
+template <typename T>
+struct NullKeyExtractor {
+  const T& operator()(const T& t) const { return t; }
+};
 
-// TODO(dyaroshev): replace less<int> with less<>, once we have it
-// crbug.com/682254.
-using SetWithLess = base::flat_set<int, std::less<int>>;
+// Common test trees.
+using IntTree = flat_tree<int, int, NullKeyExtractor<int>, std::less<int>>;
+using MoveOnlyTree = flat_tree<MoveOnly,
+                               MoveOnly,
+                               NullKeyExtractor<MoveOnly>,
+                               std::less<MoveOnly>>;
+using EmplaceableTree = flat_tree<Emplaceable,
+                                  Emplaceable,
+                                  NullKeyExtractor<Emplaceable>,
+                                  std::less<Emplaceable>>;
+using ReversedTree =
+    flat_tree<int, int, NullKeyExtractor<int>, std::greater<int>>;
 
-using SetWithStrangeCompare =
-    base::flat_set<int, NonDefaultConstructibleCompare>;
+using TreeWithStrangeCompare =
+    flat_tree<int, int, NullKeyExtractor<int>, NonDefaultConstructibleCompare>;
 
 using ::testing::ElementsAre;
 
 }  // namespace
 
 // ----------------------------------------------------------------------------
 // Class.
 
-// Check that base::flat_set and its iterators can be instantiated with an
+// Check that flat_tree and its iterators can be instantiated with an
 // incomplete type.
 
-TEST(FlatSet, IncompleteType) {
+TEST(FlatTree, IncompleteType) {
   struct A {
-    using Set = base::flat_set<A>;
+    using Tree = flat_tree<A, A, NullKeyExtractor<A>, std::less<A>>;
     int data;
-    Set set_with_incomplete_type;
-    Set::iterator it;
-    Set::const_iterator cit;
+    Tree set_with_incomplete_type;
+    Tree::iterator it;
+    Tree::const_iterator cit;
 
     // We do not declare operator< because clang complains that it's unused.
   };
 
   A a;
 }
 
-TEST(FlatSet, Stability) {
+TEST(FlatTree, Stability) {
   using Pair = std::pair<int, int>;
 
   struct LessByFirst {
-    bool operator()(const Pair& lhs, const Pair& rhs) {
+    bool operator()(const Pair& lhs, const Pair& rhs) const {
       return lhs.first < rhs.first;
     }
   };
 
-  using Set = base::flat_set<Pair, LessByFirst>;
+  using Tree = flat_tree<Pair, Pair, NullKeyExtractor<Pair>, LessByFirst>;
 
   // Constructors are not stable.
-  Set cont{{0, 0}, {1, 0}, {0, 1}, {2, 0}, {0, 2}, {1, 1}};
+  Tree cont{{0, 0}, {1, 0}, {0, 1}, {2, 0}, {0, 2}, {1, 1}};
 
   auto NoneOfSecondsAreTwo = [&cont] {
     return std::none_of(cont.begin(), cont.end(),
                         [](const Pair& elem) { return elem.second == 2; });
   };
 
   // Should not replace existing.
   cont.insert(Pair(0, 2));
   cont.insert(Pair(1, 2));
   cont.insert(Pair(2, 2));
@@ skipping 19 matching lines @@
 // const_pointer
 // reference
 // const_reference
 // size_type
 // difference_type
 // iterator
 // const_iterator
 // reverse_iterator
 // const_reverse_iterator
 
-TEST(FlatSet, Types) {
+TEST(FlatTree, Types) {
   // These are guaranteed to be portable.
-  static_assert((std::is_same<int, IntSet::key_type>::value), "");
-  static_assert((std::is_same<int, IntSet::value_type>::value), "");
-  static_assert((std::is_same<std::less<int>, IntSet::key_compare>::value), "");
-  static_assert((std::is_same<std::less<int>, IntSet::value_compare>::value),
+  static_assert((std::is_same<int, IntTree::key_type>::value), "");
+  static_assert((std::is_same<int, IntTree::value_type>::value), "");
+  static_assert((std::is_same<std::less<int>, IntTree::key_compare>::value),
                 "");
-  static_assert((std::is_same<int&, IntSet::reference>::value), "");
-  static_assert((std::is_same<const int&, IntSet::const_reference>::value), "");
-  static_assert((std::is_same<int*, IntSet::pointer>::value), "");
-  static_assert((std::is_same<const int*, IntSet::const_pointer>::value), "");
+  static_assert((std::is_same<int&, IntTree::reference>::value), "");
+  static_assert((std::is_same<const int&, IntTree::const_reference>::value),
+                "");
+  static_assert((std::is_same<int*, IntTree::pointer>::value), "");
+  static_assert((std::is_same<const int*, IntTree::const_pointer>::value), "");
 }
 
 // ----------------------------------------------------------------------------
 // Lifetime.
 
-// flat_set()
-// flat_set(const Compare& comp)
+// flat_tree()
+// flat_tree(const Compare& comp)
 
-TEST(FlatSet, DefaultConstructor) {
+TEST(FlatTree, DefaultConstructor) {
   {
-    IntSet cont;
+    IntTree cont;
     EXPECT_THAT(cont, ElementsAre());
   }
 
   {
-    SetWithStrangeCompare cont(NonDefaultConstructibleCompare(0));
+    TreeWithStrangeCompare cont(NonDefaultConstructibleCompare(0));
     EXPECT_THAT(cont, ElementsAre());
   }
 }
 
-// flat_set(InputIterator first,
+// flat_tree(InputIterator first,
 //          InputIterator last,
 //          const Compare& comp = Compare())
 
-TEST(FlatSet, RangeConstructor) {
+TEST(FlatTree, RangeConstructor) {
   {
-    IntSet::value_type input_vals[] = {1, 1, 1, 2, 2, 2, 3, 3, 3};
+    IntTree::value_type input_vals[] = {1, 1, 1, 2, 2, 2, 3, 3, 3};
 
-    IntSet cont(MakeInputIterator(std::begin(input_vals)),
-                MakeInputIterator(std::end(input_vals)));
+    IntTree cont(MakeInputIterator(std::begin(input_vals)),
+                 MakeInputIterator(std::end(input_vals)));
     EXPECT_THAT(cont, ElementsAre(1, 2, 3));
   }
   {
-    SetWithStrangeCompare::value_type input_vals[] = {1, 1, 1, 2, 2,
-                                                      2, 3, 3, 3};
+    TreeWithStrangeCompare::value_type input_vals[] = {1, 1, 1, 2, 2,
+                                                       2, 3, 3, 3};
 
-    SetWithStrangeCompare cont(MakeInputIterator(std::begin(input_vals)),
-                               MakeInputIterator(std::end(input_vals)),
-                               NonDefaultConstructibleCompare(0));
+    TreeWithStrangeCompare cont(MakeInputIterator(std::begin(input_vals)),
+                                MakeInputIterator(std::end(input_vals)),
+                                NonDefaultConstructibleCompare(0));
     EXPECT_THAT(cont, ElementsAre(1, 2, 3));
   }
 }
 
-// flat_set(const flat_set& x)
+// flat_tree(const flat_tree& x)
 
-TEST(FlatSet, CopyConstructor) {
-  IntSet original{1, 2, 3, 4};
-  IntSet copied(original);
+TEST(FlatTree, CopyConstructor) {
+  IntTree original{1, 2, 3, 4};
+  IntTree copied(original);
 
   EXPECT_THAT(copied, ElementsAre(1, 2, 3, 4));
 
   EXPECT_THAT(copied, ElementsAre(1, 2, 3, 4));
   EXPECT_THAT(original, ElementsAre(1, 2, 3, 4));
   EXPECT_EQ(original, copied);
 }
 
-// flat_set(flat_set&& x)
+// flat_tree(flat_tree&& x)
 
-TEST(FlatSet, MoveConstructor) {
+TEST(FlatTree, MoveConstructor) {
   int input_range[] = {1, 2, 3, 4};
 
-  MoveOnlySet original(std::begin(input_range), std::end(input_range));
-  MoveOnlySet moved(std::move(original));
+  MoveOnlyTree original(std::begin(input_range), std::end(input_range));
+  MoveOnlyTree moved(std::move(original));
 
   EXPECT_EQ(1U, moved.count(MoveOnly(1)));
   EXPECT_EQ(1U, moved.count(MoveOnly(2)));
   EXPECT_EQ(1U, moved.count(MoveOnly(3)));
   EXPECT_EQ(1U, moved.count(MoveOnly(4)));
 }
 
-//  flat_set(std::initializer_list<value_type> ilist,
+//  flat_tree(std::initializer_list<value_type> ilist,
 //           const Compare& comp = Compare())
 
-TEST(FlatSet, InitializerListConstructor) {
+TEST(FlatTree, InitializerListConstructor) {
   {
-    IntSet cont{1, 2, 3, 4, 5, 6, 10, 8};
+    IntTree cont{1, 2, 3, 4, 5, 6, 10, 8};
     EXPECT_THAT(cont, ElementsAre(1, 2, 3, 4, 5, 6, 8, 10));
   }
   {
-    SetWithStrangeCompare cont({1, 2, 3, 4, 5, 6, 10, 8},
-                               NonDefaultConstructibleCompare(0));
+    TreeWithStrangeCompare cont({1, 2, 3, 4, 5, 6, 10, 8},
+                                NonDefaultConstructibleCompare(0));
     EXPECT_THAT(cont, ElementsAre(1, 2, 3, 4, 5, 6, 8, 10));
   }
 }
 
 // ----------------------------------------------------------------------------
 // Assignments.
 
-// flat_set& operator=(const flat_set&)
+// flat_tree& operator=(const flat_tree&)
 
-TEST(FlatSet, CopyAssignable) {
-  IntSet original{1, 2, 3, 4};
-  IntSet copied;
+TEST(FlatTree, CopyAssignable) {
+  IntTree original{1, 2, 3, 4};
+  IntTree copied;
   copied = original;
 
   EXPECT_THAT(copied, ElementsAre(1, 2, 3, 4));
   EXPECT_THAT(original, ElementsAre(1, 2, 3, 4));
   EXPECT_EQ(original, copied);
 }
 
-// flat_set& operator=(flat_set&&)
+// flat_tree& operator=(flat_tree&&)
 
-TEST(FlatSet, MoveAssignable) {
+TEST(FlatTree, MoveAssignable) {
   int input_range[] = {1, 2, 3, 4};
 
-  MoveOnlySet original(std::begin(input_range), std::end(input_range));
-  MoveOnlySet moved;
+  MoveOnlyTree original(std::begin(input_range), std::end(input_range));
+  MoveOnlyTree moved;
   moved = std::move(original);
 
   EXPECT_EQ(1U, moved.count(MoveOnly(1)));
   EXPECT_EQ(1U, moved.count(MoveOnly(2)));
   EXPECT_EQ(1U, moved.count(MoveOnly(3)));
   EXPECT_EQ(1U, moved.count(MoveOnly(4)));
 }
 
-// flat_set& operator=(std::initializer_list<value_type> ilist)
+// flat_tree& operator=(std::initializer_list<value_type> ilist)
 
-TEST(FlatSet, InitializerListAssignable) {
-  IntSet cont{0};
+TEST(FlatTree, InitializerListAssignable) {
+  IntTree cont{0};
   cont = {1, 2, 3, 4, 5, 6, 10, 8};
 
   EXPECT_EQ(0U, cont.count(0));
   EXPECT_THAT(cont, ElementsAre(1, 2, 3, 4, 5, 6, 8, 10));
 }
 
 // --------------------------------------------------------------------------
 // Memory management.
 
 // void reserve(size_type new_capacity)
 
-TEST(FlatSet, Reserve) {
-  IntSet cont{1, 2, 3};
+TEST(FlatTree, Reserve) {
+  IntTree cont{1, 2, 3};
 
   cont.reserve(5);
   EXPECT_LE(5U, cont.capacity());
 }
 
 // size_type capacity() const
 
-TEST(FlatSet, Capacity) {
-  IntSet cont{1, 2, 3};
+TEST(FlatTree, Capacity) {
+  IntTree cont{1, 2, 3};
 
   EXPECT_LE(cont.size(), cont.capacity());
   cont.reserve(5);
   EXPECT_LE(cont.size(), cont.capacity());
 }
 
 // void shrink_to_fit()
 
-TEST(FlatSet, ShrinkToFit) {
-  IntSet cont{1, 2, 3};
+TEST(FlatTree, ShrinkToFit) {
+  IntTree cont{1, 2, 3};
 
-  IntSet::size_type capacity_before = cont.capacity();
+  IntTree::size_type capacity_before = cont.capacity();
   cont.shrink_to_fit();
   EXPECT_GE(capacity_before, cont.capacity());
 }
 
 // ----------------------------------------------------------------------------
 // Size management.
 
 // void clear()
 
-TEST(FlatSet, Clear) {
-  IntSet cont{1, 2, 3, 4, 5, 6, 7, 8};
+TEST(FlatTree, Clear) {
+  IntTree cont{1, 2, 3, 4, 5, 6, 7, 8};
   cont.clear();
   EXPECT_THAT(cont, ElementsAre());
 }
 
 // size_type size() const
 
-TEST(FlatSet, Size) {
-  IntSet cont;
+TEST(FlatTree, Size) {
+  IntTree cont;
 
   EXPECT_EQ(0U, cont.size());
   cont.insert(2);
   EXPECT_EQ(1U, cont.size());
   cont.insert(1);
   EXPECT_EQ(2U, cont.size());
   cont.insert(3);
   EXPECT_EQ(3U, cont.size());
   cont.erase(cont.begin());
   EXPECT_EQ(2U, cont.size());
   cont.erase(cont.begin());
   EXPECT_EQ(1U, cont.size());
   cont.erase(cont.begin());
   EXPECT_EQ(0U, cont.size());
 }
 
 // bool empty() const
 
-TEST(FlatSet, Empty) {
-  IntSet cont;
+TEST(FlatTree, Empty) {
+  IntTree cont;
 
   EXPECT_TRUE(cont.empty());
   cont.insert(1);
   EXPECT_FALSE(cont.empty());
   cont.clear();
   EXPECT_TRUE(cont.empty());
 }
 
 // ----------------------------------------------------------------------------
 // Iterators.
 
 // iterator begin()
 // const_iterator begin() const
 // iterator end()
 // const_iterator end() const
 //
 // reverse_iterator rbegin()
 // const_reverse_iterator rbegin() const
 // reverse_iterator rend()
 // const_reverse_iterator rend() const
 //
 // const_iterator cbegin() const
 // const_iterator cend() const
 // const_reverse_iterator crbegin() const
 // const_reverse_iterator crend() const
 
-TEST(FlatSet, Iterators) {
-  IntSet cont{1, 2, 3, 4, 5, 6, 7, 8};
+TEST(FlatTree, Iterators) {
+  IntTree cont{1, 2, 3, 4, 5, 6, 7, 8};
 
-  auto size = static_cast<IntSet::difference_type>(cont.size());
+  auto size = static_cast<IntTree::difference_type>(cont.size());
 
   EXPECT_EQ(size, std::distance(cont.begin(), cont.end()));
   EXPECT_EQ(size, std::distance(cont.cbegin(), cont.cend()));
   EXPECT_EQ(size, std::distance(cont.rbegin(), cont.rend()));
   EXPECT_EQ(size, std::distance(cont.crbegin(), cont.crend()));
 
   {
-    IntSet::iterator it = cont.begin();
-    IntSet::const_iterator c_it = cont.cbegin();
+    IntTree::iterator it = cont.begin();
+    IntTree::const_iterator c_it = cont.cbegin();
     EXPECT_EQ(it, c_it);
     for (int j = 1; it != cont.end(); ++it, ++c_it, ++j) {
       EXPECT_EQ(j, *it);
       EXPECT_EQ(j, *c_it);
     }
   }
   {
-    IntSet::reverse_iterator rit = cont.rbegin();
-    IntSet::const_reverse_iterator c_rit = cont.crbegin();
+    IntTree::reverse_iterator rit = cont.rbegin();
+    IntTree::const_reverse_iterator c_rit = cont.crbegin();
     EXPECT_EQ(rit, c_rit);
     for (int j = static_cast<int>(size); rit != cont.rend();
          ++rit, ++c_rit, --j) {
       EXPECT_EQ(j, *rit);
       EXPECT_EQ(j, *c_rit);
     }
   }
 }
 
 // ----------------------------------------------------------------------------
 // Insert operations.
 
 // pair<iterator, bool> insert(const value_type& val)
 
-TEST(FlatSet, InsertLValue) {
-  IntSet cont;
+TEST(FlatTree, InsertLValue) {
+  IntTree cont;
 
   int value = 2;
-  std::pair<IntSet::iterator, bool> result = cont.insert(value);
+  std::pair<IntTree::iterator, bool> result = cont.insert(value);
   EXPECT_TRUE(result.second);
   EXPECT_EQ(cont.begin(), result.first);
   EXPECT_EQ(1U, cont.size());
   EXPECT_EQ(2, *result.first);
 
   value = 1;
   result = cont.insert(value);
   EXPECT_TRUE(result.second);
   EXPECT_EQ(cont.begin(), result.first);
   EXPECT_EQ(2U, cont.size());
   EXPECT_EQ(1, *result.first);
 
   value = 3;
   result = cont.insert(value);
   EXPECT_TRUE(result.second);
   EXPECT_EQ(std::prev(cont.end()), result.first);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, *result.first);
 
   value = 3;
   result = cont.insert(value);
   EXPECT_FALSE(result.second);
   EXPECT_EQ(std::prev(cont.end()), result.first);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, *result.first);
 }
 
 // pair<iterator, bool> insert(value_type&& val)
 
-TEST(FlatSet, InsertRValue) {
-  MoveOnlySet cont;
+TEST(FlatTree, InsertRValue) {
+  MoveOnlyTree cont;
 
-  std::pair<MoveOnlySet::iterator, bool> result = cont.insert(MoveOnly(2));
+  std::pair<MoveOnlyTree::iterator, bool> result = cont.insert(MoveOnly(2));
   EXPECT_TRUE(result.second);
   EXPECT_EQ(cont.begin(), result.first);
   EXPECT_EQ(1U, cont.size());
   EXPECT_EQ(2, result.first->data());
 
   result = cont.insert(MoveOnly(1));
   EXPECT_TRUE(result.second);
   EXPECT_EQ(cont.begin(), result.first);
   EXPECT_EQ(2U, cont.size());
   EXPECT_EQ(1, result.first->data());
 
   result = cont.insert(MoveOnly(3));
   EXPECT_TRUE(result.second);
   EXPECT_EQ(std::prev(cont.end()), result.first);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, result.first->data());
 
   result = cont.insert(MoveOnly(3));
   EXPECT_FALSE(result.second);
   EXPECT_EQ(std::prev(cont.end()), result.first);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, result.first->data());
 }
 
 // iterator insert(const_iterator position_hint, const value_type& val)
 
-TEST(FlatSet, InsertPositionLValue) {
-  IntSet cont;
+TEST(FlatTree, InsertPositionLValue) {
+  IntTree cont;
 
-  IntSet::iterator result = cont.insert(cont.cend(), 2);
+  IntTree::iterator result = cont.insert(cont.cend(), 2);
   EXPECT_EQ(cont.begin(), result);
   EXPECT_EQ(1U, cont.size());
   EXPECT_EQ(2, *result);
 
   result = cont.insert(cont.cend(), 1);
   EXPECT_EQ(cont.begin(), result);
   EXPECT_EQ(2U, cont.size());
   EXPECT_EQ(1, *result);
 
   result = cont.insert(cont.cend(), 3);
   EXPECT_EQ(std::prev(cont.end()), result);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, *result);
 
   result = cont.insert(cont.cend(), 3);
   EXPECT_EQ(std::prev(cont.end()), result);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, *result);
 }
 
 // iterator insert(const_iterator position_hint, value_type&& val)
 
-TEST(FlatSet, InsertPositionRValue) {
-  MoveOnlySet cont;
+TEST(FlatTree, InsertPositionRValue) {
+  MoveOnlyTree cont;
 
-  MoveOnlySet::iterator result = cont.insert(cont.cend(), MoveOnly(2));
+  MoveOnlyTree::iterator result = cont.insert(cont.cend(), MoveOnly(2));
   EXPECT_EQ(cont.begin(), result);
   EXPECT_EQ(1U, cont.size());
   EXPECT_EQ(2, result->data());
 
   result = cont.insert(cont.cend(), MoveOnly(1));
   EXPECT_EQ(cont.begin(), result);
   EXPECT_EQ(2U, cont.size());
   EXPECT_EQ(1, result->data());
 
   result = cont.insert(cont.cend(), MoveOnly(3));
   EXPECT_EQ(std::prev(cont.end()), result);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, result->data());
 
   result = cont.insert(cont.cend(), MoveOnly(3));
   EXPECT_EQ(std::prev(cont.end()), result);
   EXPECT_EQ(3U, cont.size());
   EXPECT_EQ(3, result->data());
 }
 
 // template <class... Args>
 // pair<iterator, bool> emplace(Args&&... args)
 
-TEST(FlatSet, Emplace) {
+TEST(FlatTree, Emplace) {
   {
-    EmplaceableSet cont;
+    EmplaceableTree cont;
 
-    std::pair<EmplaceableSet::iterator, bool> result = cont.emplace();
+    std::pair<EmplaceableTree::iterator, bool> result = cont.emplace();
     EXPECT_TRUE(result.second);
     EXPECT_EQ(cont.begin(), result.first);
     EXPECT_EQ(1U, cont.size());
     EXPECT_EQ(Emplaceable(), *cont.begin());
 
     result = cont.emplace(2, 3.5);
     EXPECT_TRUE(result.second);
     EXPECT_EQ(std::next(cont.begin()), result.first);
     EXPECT_EQ(2U, cont.size());
     EXPECT_EQ(Emplaceable(2, 3.5), *result.first);
 
     result = cont.emplace(2, 3.5);
     EXPECT_FALSE(result.second);
     EXPECT_EQ(std::next(cont.begin()), result.first);
     EXPECT_EQ(2U, cont.size());
     EXPECT_EQ(Emplaceable(2, 3.5), *result.first);
   }
   {
-    IntSet cont;
+    IntTree cont;
 
-    std::pair<IntSet::iterator, bool> result = cont.emplace(2);
+    std::pair<IntTree::iterator, bool> result = cont.emplace(2);
     EXPECT_TRUE(result.second);
     EXPECT_EQ(cont.begin(), result.first);
     EXPECT_EQ(1U, cont.size());
     EXPECT_EQ(2, *result.first);
   }
 }
 
 // template <class... Args>
 // iterator emplace_hint(const_iterator position_hint, Args&&... args)
 
-TEST(FlatSet, EmplacePosition) {
+TEST(FlatTree, EmplacePosition) {
   {
-    EmplaceableSet cont;
+    EmplaceableTree cont;
 
-    EmplaceableSet::iterator result = cont.emplace_hint(cont.cend());
+    EmplaceableTree::iterator result = cont.emplace_hint(cont.cend());
     EXPECT_EQ(cont.begin(), result);
     EXPECT_EQ(1U, cont.size());
     EXPECT_EQ(Emplaceable(), *cont.begin());
 
     result = cont.emplace_hint(cont.cend(), 2, 3.5);
     EXPECT_EQ(std::next(cont.begin()), result);
     EXPECT_EQ(2U, cont.size());
     EXPECT_EQ(Emplaceable(2, 3.5), *result);
 
     result = cont.emplace_hint(cont.cbegin(), 2, 3.5);
     EXPECT_EQ(std::next(cont.begin()), result);
     EXPECT_EQ(2U, cont.size());
     EXPECT_EQ(Emplaceable(2, 3.5), *result);
   }
   {
-    IntSet cont;
+    IntTree cont;
 
-    IntSet::iterator result = cont.emplace_hint(cont.cend(), 2);
+    IntTree::iterator result = cont.emplace_hint(cont.cend(), 2);
     EXPECT_EQ(cont.begin(), result);
     EXPECT_EQ(1U, cont.size());
     EXPECT_EQ(2, *result);
   }
 }
 
 // ----------------------------------------------------------------------------
 // Erase operations.
 
 // iterator erase(const_iterator position_hint)
 
-TEST(FlatSet, ErasePosition) {
-  IntSet cont{1, 2, 3, 4, 5, 6, 7, 8};
+TEST(FlatTree, ErasePosition) {
+  IntTree cont{1, 2, 3, 4, 5, 6, 7, 8};
 
-  IntSet::iterator it = cont.erase(std::next(cont.cbegin(), 3));
+  IntTree::iterator it = cont.erase(std::next(cont.cbegin(), 3));
   EXPECT_EQ(std::next(cont.begin(), 3), it);
   EXPECT_THAT(cont, ElementsAre(1, 2, 3, 5, 6, 7, 8));
 
   it = cont.erase(std::next(cont.cbegin(), 0));
   EXPECT_EQ(cont.begin(), it);
   EXPECT_THAT(cont, ElementsAre(2, 3, 5, 6, 7, 8));
 
   it = cont.erase(std::next(cont.cbegin(), 5));
   EXPECT_EQ(cont.end(), it);
   EXPECT_THAT(cont, ElementsAre(2, 3, 5, 6, 7));
@@ skipping 14 matching lines @@
   EXPECT_EQ(std::next(cont.begin(), 0), it);
   EXPECT_THAT(cont, ElementsAre(5));
 
   it = cont.erase(cont.cbegin());
   EXPECT_EQ(cont.begin(), it);
   EXPECT_EQ(cont.end(), it);
 }
 
 // iterator erase(const_iterator first, const_iterator last)
 
-TEST(FlatSet, EraseRange) {
-  IntSet cont{1, 2, 3, 4, 5, 6, 7, 8};
+TEST(FlatTree, EraseRange) {
+  IntTree cont{1, 2, 3, 4, 5, 6, 7, 8};
 
-  IntSet::iterator it =
+  IntTree::iterator it =
       cont.erase(std::next(cont.cbegin(), 5), std::next(cont.cbegin(), 5));
   EXPECT_EQ(std::next(cont.begin(), 5), it);
   EXPECT_THAT(cont, ElementsAre(1, 2, 3, 4, 5, 6, 7, 8));
 
   it = cont.erase(std::next(cont.cbegin(), 3), std::next(cont.cbegin(), 4));
   EXPECT_EQ(std::next(cont.begin(), 3), it);
   EXPECT_THAT(cont, ElementsAre(1, 2, 3, 5, 6, 7, 8));
 
   it = cont.erase(std::next(cont.cbegin(), 2), std::next(cont.cbegin(), 5));
   EXPECT_EQ(std::next(cont.begin(), 2), it);
   EXPECT_THAT(cont, ElementsAre(1, 2, 7, 8));
 
   it = cont.erase(std::next(cont.cbegin(), 0), std::next(cont.cbegin(), 2));
   EXPECT_EQ(std::next(cont.begin(), 0), it);
   EXPECT_THAT(cont, ElementsAre(7, 8));
 
   it = cont.erase(cont.cbegin(), cont.cend());
   EXPECT_EQ(cont.begin(), it);
   EXPECT_EQ(cont.end(), it);
 }
 
 // size_type erase(const key_type& key)
 
-TEST(FlatSet, EraseKey) {
-  IntSet cont{1, 2, 3, 4, 5, 6, 7, 8};
+TEST(FlatTree, EraseKey) {
+  IntTree cont{1, 2, 3, 4, 5, 6, 7, 8};
 
   EXPECT_EQ(0U, cont.erase(9));
   EXPECT_THAT(cont, ElementsAre(1, 2, 3, 4, 5, 6, 7, 8));
 
   EXPECT_EQ(1U, cont.erase(4));
   EXPECT_THAT(cont, ElementsAre(1, 2, 3, 5, 6, 7, 8));
 
   EXPECT_EQ(1U, cont.erase(1));
   EXPECT_THAT(cont, ElementsAre(2, 3, 5, 6, 7, 8));
 
@@ skipping 14 matching lines @@
 
   EXPECT_EQ(1U, cont.erase(5));
   EXPECT_THAT(cont, ElementsAre());
 }
 
 // ----------------------------------------------------------------------------
 // Comparators.
 
 // key_compare key_comp() const
 
-TEST(FlatSet, KeyComp) {
-  ReversedSet cont{1, 2, 3, 4, 5};
+TEST(FlatTree, KeyComp) {
+  ReversedTree cont{1, 2, 3, 4, 5};
 
   EXPECT_TRUE(std::is_sorted(cont.begin(), cont.end(), cont.key_comp()));
   int new_elements[] = {6, 7, 8, 9, 10};
   std::copy(std::begin(new_elements), std::end(new_elements),
             std::inserter(cont, cont.end()));
   EXPECT_TRUE(std::is_sorted(cont.begin(), cont.end(), cont.key_comp()));
 }
 
 // value_compare value_comp() const
 
-TEST(FlatSet, ValueComp) {
-  ReversedSet cont{1, 2, 3, 4, 5};
+TEST(FlatTree, ValueComp) {
+  ReversedTree cont{1, 2, 3, 4, 5};
 
   EXPECT_TRUE(std::is_sorted(cont.begin(), cont.end(), cont.value_comp()));
   int new_elements[] = {6, 7, 8, 9, 10};
   std::copy(std::begin(new_elements), std::end(new_elements),
             std::inserter(cont, cont.end()));
   EXPECT_TRUE(std::is_sorted(cont.begin(), cont.end(), cont.value_comp()));
 }
 
 // ----------------------------------------------------------------------------
 // Search operations.
 
 // size_type count(const key_type& key) const
 
-TEST(FlatSet, Count) {
+TEST(FlatTree, Count) {
   {
-    const IntSet cont{5, 6, 7, 8, 9, 10, 11, 12};
+    const IntTree cont{5, 6, 7, 8, 9, 10, 11, 12};
 
     EXPECT_EQ(1U, cont.count(5));
     EXPECT_EQ(1U, cont.count(6));
-    EXPECT_EQ(1U, cont.count(7));
-    EXPECT_EQ(1U, cont.count(8));
-    EXPECT_EQ(1U, cont.count(9));
-    EXPECT_EQ(1U, cont.count(10));
-    EXPECT_EQ(1U, cont.count(11));
-    EXPECT_EQ(1U, cont.count(12));
-    EXPECT_EQ(0U, cont.count(4));
-  }
-  {
-    const SetWithLess cont{5, 6, 7, 8, 9, 10, 11, 12};
-
-    EXPECT_EQ(1U, cont.count(5));
-    EXPECT_EQ(1U, cont.count(6));
     EXPECT_EQ(1U, cont.count(7));
     EXPECT_EQ(1U, cont.count(8));
     EXPECT_EQ(1U, cont.count(9));
     EXPECT_EQ(1U, cont.count(10));
     EXPECT_EQ(1U, cont.count(11));
     EXPECT_EQ(1U, cont.count(12));
     EXPECT_EQ(0U, cont.count(4));
   }
 }
 
 // iterator find(const key_type& key)
 // const_iterator find(const key_type& key) const
 
-TEST(FlatSet, Find) {
+TEST(FlatTree, Find) {
   {
-    IntSet cont{5, 6, 7, 8, 9, 10, 11, 12};
+    IntTree cont{5, 6, 7, 8, 9, 10, 11, 12};
 
     EXPECT_EQ(cont.begin(), cont.find(5));
     EXPECT_EQ(std::next(cont.begin()), cont.find(6));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.find(7));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.find(8));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.find(9));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.find(10));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.find(11));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.find(12));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.find(4));
   }
   {
-    const IntSet cont{5, 6, 7, 8, 9, 10, 11, 12};
+    const IntTree cont{5, 6, 7, 8, 9, 10, 11, 12};
 
     EXPECT_EQ(cont.begin(), cont.find(5));
     EXPECT_EQ(std::next(cont.begin()), cont.find(6));
-    EXPECT_EQ(std::next(cont.begin(), 2), cont.find(7));
-    EXPECT_EQ(std::next(cont.begin(), 3), cont.find(8));
-    EXPECT_EQ(std::next(cont.begin(), 4), cont.find(9));
-    EXPECT_EQ(std::next(cont.begin(), 5), cont.find(10));
-    EXPECT_EQ(std::next(cont.begin(), 6), cont.find(11));
-    EXPECT_EQ(std::next(cont.begin(), 7), cont.find(12));
-    EXPECT_EQ(std::next(cont.begin(), 8), cont.find(4));
-  }
-  {
-    SetWithLess cont{5, 6, 7, 8, 9, 10, 11, 12};
-
-    EXPECT_EQ(cont.begin(), cont.find(5));
-    EXPECT_EQ(std::next(cont.begin()), cont.find(6));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.find(7));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.find(8));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.find(9));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.find(10));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.find(11));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.find(12));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.find(4));
   }
 }
 
 // pair<iterator, iterator> equal_range(const key_type& key)
 // pair<const_iterator, const_iterator> equal_range(const key_type& key) const
 
-TEST(FlatSet, EqualRange) {
+TEST(FlatTree, EqualRange) {
   {
-    IntSet cont{5, 7, 9, 11, 13, 15, 17, 19};
+    IntTree cont{5, 7, 9, 11, 13, 15, 17, 19};
 
-    std::pair<IntSet::iterator, IntSet::iterator> result = cont.equal_range(5);
-    EXPECT_EQ(std::next(cont.begin(), 0), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 1), result.second);
-    result = cont.equal_range(7);
-    EXPECT_EQ(std::next(cont.begin(), 1), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 2), result.second);
-    result = cont.equal_range(9);
-    EXPECT_EQ(std::next(cont.begin(), 2), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 3), result.second);
-    result = cont.equal_range(11);
-    EXPECT_EQ(std::next(cont.begin(), 3), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 4), result.second);
-    result = cont.equal_range(13);
-    EXPECT_EQ(std::next(cont.begin(), 4), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 5), result.second);
-    result = cont.equal_range(15);
-    EXPECT_EQ(std::next(cont.begin(), 5), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 6), result.second);
-    result = cont.equal_range(17);
-    EXPECT_EQ(std::next(cont.begin(), 6), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 7), result.second);
-    result = cont.equal_range(19);
-    EXPECT_EQ(std::next(cont.begin(), 7), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 8), result.second);
-    result = cont.equal_range(4);
-    EXPECT_EQ(std::next(cont.begin(), 0), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 0), result.second);
-    result = cont.equal_range(6);
-    EXPECT_EQ(std::next(cont.begin(), 1), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 1), result.second);
-    result = cont.equal_range(8);
-    EXPECT_EQ(std::next(cont.begin(), 2), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 2), result.second);
-    result = cont.equal_range(10);
-    EXPECT_EQ(std::next(cont.begin(), 3), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 3), result.second);
-    result = cont.equal_range(12);
-    EXPECT_EQ(std::next(cont.begin(), 4), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 4), result.second);
-    result = cont.equal_range(14);
-    EXPECT_EQ(std::next(cont.begin(), 5), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 5), result.second);
-    result = cont.equal_range(16);
-    EXPECT_EQ(std::next(cont.begin(), 6), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 6), result.second);
-    result = cont.equal_range(18);
-    EXPECT_EQ(std::next(cont.begin(), 7), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 7), result.second);
-    result = cont.equal_range(20);
-    EXPECT_EQ(std::next(cont.begin(), 8), result.first);
-    EXPECT_EQ(std::next(cont.begin(), 8), result.second);
-  }
-  {
-    const IntSet cont{5, 7, 9, 11, 13, 15, 17, 19};
-
-    std::pair<IntSet::const_iterator, IntSet::const_iterator> result =
+    std::pair<IntTree::iterator, IntTree::iterator> result =
         cont.equal_range(5);
     EXPECT_EQ(std::next(cont.begin(), 0), result.first);
     EXPECT_EQ(std::next(cont.begin(), 1), result.second);
     result = cont.equal_range(7);
     EXPECT_EQ(std::next(cont.begin(), 1), result.first);
     EXPECT_EQ(std::next(cont.begin(), 2), result.second);
     result = cont.equal_range(9);
     EXPECT_EQ(std::next(cont.begin(), 2), result.first);
     EXPECT_EQ(std::next(cont.begin(), 3), result.second);
     result = cont.equal_range(11);
@@ skipping 33 matching lines @@
     EXPECT_EQ(std::next(cont.begin(), 6), result.first);
     EXPECT_EQ(std::next(cont.begin(), 6), result.second);
     result = cont.equal_range(18);
     EXPECT_EQ(std::next(cont.begin(), 7), result.first);
     EXPECT_EQ(std::next(cont.begin(), 7), result.second);
     result = cont.equal_range(20);
     EXPECT_EQ(std::next(cont.begin(), 8), result.first);
     EXPECT_EQ(std::next(cont.begin(), 8), result.second);
   }
   {
-    SetWithLess cont{5, 7, 9, 11, 13, 15, 17, 19};
+    const IntTree cont{5, 7, 9, 11, 13, 15, 17, 19};
 
-    std::pair<SetWithLess::iterator, SetWithLess::iterator> result =
+    std::pair<IntTree::const_iterator, IntTree::const_iterator> result =
         cont.equal_range(5);
     EXPECT_EQ(std::next(cont.begin(), 0), result.first);
     EXPECT_EQ(std::next(cont.begin(), 1), result.second);
     result = cont.equal_range(7);
     EXPECT_EQ(std::next(cont.begin(), 1), result.first);
     EXPECT_EQ(std::next(cont.begin(), 2), result.second);
     result = cont.equal_range(9);
     EXPECT_EQ(std::next(cont.begin(), 2), result.first);
     EXPECT_EQ(std::next(cont.begin(), 3), result.second);
     result = cont.equal_range(11);
@@ skipping 37 matching lines @@
     EXPECT_EQ(std::next(cont.begin(), 7), result.second);
     result = cont.equal_range(20);
     EXPECT_EQ(std::next(cont.begin(), 8), result.first);
     EXPECT_EQ(std::next(cont.begin(), 8), result.second);
   }
 }
 
 //       iterator lower_bound(const key_type& key);
 // const_iterator lower_bound(const key_type& key) const;
 
-TEST(FlatSet, LowerBound) {
+TEST(FlatTree, LowerBound) {
   {
-    IntSet cont{5, 7, 9, 11, 13, 15, 17, 19};
+    IntTree cont{5, 7, 9, 11, 13, 15, 17, 19};
 
     EXPECT_EQ(cont.begin(), cont.lower_bound(5));
     EXPECT_EQ(std::next(cont.begin()), cont.lower_bound(7));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.lower_bound(9));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.lower_bound(11));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.lower_bound(13));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.lower_bound(15));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.lower_bound(17));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.lower_bound(19));
     EXPECT_EQ(std::next(cont.begin(), 0), cont.lower_bound(4));
     EXPECT_EQ(std::next(cont.begin(), 1), cont.lower_bound(6));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.lower_bound(8));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.lower_bound(10));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.lower_bound(12));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.lower_bound(14));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.lower_bound(16));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.lower_bound(18));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.lower_bound(20));
   }
   {
-    const IntSet cont{5, 7, 9, 11, 13, 15, 17, 19};
+    const IntTree cont{5, 7, 9, 11, 13, 15, 17, 19};
 
     EXPECT_EQ(cont.begin(), cont.lower_bound(5));
     EXPECT_EQ(std::next(cont.begin()), cont.lower_bound(7));
-    EXPECT_EQ(std::next(cont.begin(), 2), cont.lower_bound(9));
-    EXPECT_EQ(std::next(cont.begin(), 3), cont.lower_bound(11));
-    EXPECT_EQ(std::next(cont.begin(), 4), cont.lower_bound(13));
-    EXPECT_EQ(std::next(cont.begin(), 5), cont.lower_bound(15));
-    EXPECT_EQ(std::next(cont.begin(), 6), cont.lower_bound(17));
-    EXPECT_EQ(std::next(cont.begin(), 7), cont.lower_bound(19));
-    EXPECT_EQ(std::next(cont.begin(), 0), cont.lower_bound(4));
-    EXPECT_EQ(std::next(cont.begin(), 1), cont.lower_bound(6));
-    EXPECT_EQ(std::next(cont.begin(), 2), cont.lower_bound(8));
-    EXPECT_EQ(std::next(cont.begin(), 3), cont.lower_bound(10));
-    EXPECT_EQ(std::next(cont.begin(), 4), cont.lower_bound(12));
-    EXPECT_EQ(std::next(cont.begin(), 5), cont.lower_bound(14));
-    EXPECT_EQ(std::next(cont.begin(), 6), cont.lower_bound(16));
-    EXPECT_EQ(std::next(cont.begin(), 7), cont.lower_bound(18));
-    EXPECT_EQ(std::next(cont.begin(), 8), cont.lower_bound(20));
-  }
-  {
-    SetWithLess cont{5, 7, 9, 11, 13, 15, 17, 19};
-
-    EXPECT_EQ(cont.begin(), cont.lower_bound(5));
-    EXPECT_EQ(std::next(cont.begin()), cont.lower_bound(7));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.lower_bound(9));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.lower_bound(11));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.lower_bound(13));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.lower_bound(15));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.lower_bound(17));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.lower_bound(19));
     EXPECT_EQ(std::next(cont.begin(), 0), cont.lower_bound(4));
     EXPECT_EQ(std::next(cont.begin(), 1), cont.lower_bound(6));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.lower_bound(8));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.lower_bound(10));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.lower_bound(12));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.lower_bound(14));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.lower_bound(16));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.lower_bound(18));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.lower_bound(20));
   }
 }
 
 // iterator upper_bound(const key_type& key)
 // const_iterator upper_bound(const key_type& key) const
 
-TEST(FlatSet, UpperBound) {
+TEST(FlatTree, UpperBound) {
   {
-    IntSet cont{5, 7, 9, 11, 13, 15, 17, 19};
+    IntTree cont{5, 7, 9, 11, 13, 15, 17, 19};
 
     EXPECT_EQ(std::next(cont.begin(), 1), cont.upper_bound(5));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.upper_bound(7));
-    EXPECT_EQ(std::next(cont.begin(), 3), cont.upper_bound(9));
-    EXPECT_EQ(std::next(cont.begin(), 4), cont.upper_bound(11));
-    EXPECT_EQ(std::next(cont.begin(), 5), cont.upper_bound(13));
-    EXPECT_EQ(std::next(cont.begin(), 6), cont.upper_bound(15));
-    EXPECT_EQ(std::next(cont.begin(), 7), cont.upper_bound(17));
-    EXPECT_EQ(std::next(cont.begin(), 8), cont.upper_bound(19));
-    EXPECT_EQ(std::next(cont.begin(), 0), cont.upper_bound(4));
-    EXPECT_EQ(std::next(cont.begin(), 1), cont.upper_bound(6));
-    EXPECT_EQ(std::next(cont.begin(), 2), cont.upper_bound(8));
-    EXPECT_EQ(std::next(cont.begin(), 3), cont.upper_bound(10));
-    EXPECT_EQ(std::next(cont.begin(), 4), cont.upper_bound(12));
-    EXPECT_EQ(std::next(cont.begin(), 5), cont.upper_bound(14));
-    EXPECT_EQ(std::next(cont.begin(), 6), cont.upper_bound(16));
-    EXPECT_EQ(std::next(cont.begin(), 7), cont.upper_bound(18));
-    EXPECT_EQ(std::next(cont.begin(), 8), cont.upper_bound(20));
-  }
-  {
-    const IntSet cont{5, 7, 9, 11, 13, 15, 17, 19};
-
-    EXPECT_EQ(std::next(cont.begin(), 1), cont.upper_bound(5));
-    EXPECT_EQ(std::next(cont.begin(), 2), cont.upper_bound(7));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.upper_bound(9));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.upper_bound(11));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.upper_bound(13));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.upper_bound(15));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.upper_bound(17));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.upper_bound(19));
     EXPECT_EQ(std::next(cont.begin(), 0), cont.upper_bound(4));
     EXPECT_EQ(std::next(cont.begin(), 1), cont.upper_bound(6));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.upper_bound(8));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.upper_bound(10));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.upper_bound(12));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.upper_bound(14));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.upper_bound(16));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.upper_bound(18));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.upper_bound(20));
   }
   {
-    SetWithLess cont{5, 7, 9, 11, 13, 15, 17, 19};
+    const IntTree cont{5, 7, 9, 11, 13, 15, 17, 19};
 
     EXPECT_EQ(std::next(cont.begin(), 1), cont.upper_bound(5));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.upper_bound(7));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.upper_bound(9));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.upper_bound(11));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.upper_bound(13));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.upper_bound(15));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.upper_bound(17));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.upper_bound(19));
     EXPECT_EQ(std::next(cont.begin(), 0), cont.upper_bound(4));
     EXPECT_EQ(std::next(cont.begin(), 1), cont.upper_bound(6));
     EXPECT_EQ(std::next(cont.begin(), 2), cont.upper_bound(8));
     EXPECT_EQ(std::next(cont.begin(), 3), cont.upper_bound(10));
     EXPECT_EQ(std::next(cont.begin(), 4), cont.upper_bound(12));
     EXPECT_EQ(std::next(cont.begin(), 5), cont.upper_bound(14));
     EXPECT_EQ(std::next(cont.begin(), 6), cont.upper_bound(16));
     EXPECT_EQ(std::next(cont.begin(), 7), cont.upper_bound(18));
     EXPECT_EQ(std::next(cont.begin(), 8), cont.upper_bound(20));
   }
 }
 
 // ----------------------------------------------------------------------------
 // General operations.
 
-// void swap(flat_set& other)
-// void swap(flat_set& lhs, flat_set& rhs)
+// void swap(flat_tree& other)
+// void swap(flat_tree& lhs, flat_tree& rhs)
 
-TEST(FlatSetOurs, Swap) {
-  IntSet x{1, 2, 3};
-  IntSet y{4};
+TEST(FlatTreeOurs, Swap) {
+  IntTree x{1, 2, 3};
+  IntTree y{4};
   swap(x, y);
   EXPECT_THAT(x, ElementsAre(4));
   EXPECT_THAT(y, ElementsAre(1, 2, 3));
 
   y.swap(x);
   EXPECT_THAT(x, ElementsAre(1, 2, 3));
   EXPECT_THAT(y, ElementsAre(4));
 }
 
-// bool operator==(const flat_set& lhs, const flat_set& rhs)
-// bool operator!=(const flat_set& lhs, const flat_set& rhs)
-// bool operator<(const flat_set& lhs, const flat_set& rhs)
-// bool operator>(const flat_set& lhs, const flat_set& rhs)
-// bool operator<=(const flat_set& lhs, const flat_set& rhs)
-// bool operator>=(const flat_set& lhs, const flat_set& rhs)
+// bool operator==(const flat_tree& lhs, const flat_tree& rhs)
+// bool operator!=(const flat_tree& lhs, const flat_tree& rhs)
+// bool operator<(const flat_tree& lhs, const flat_tree& rhs)
+// bool operator>(const flat_tree& lhs, const flat_tree& rhs)
+// bool operator<=(const flat_tree& lhs, const flat_tree& rhs)
+// bool operator>=(const flat_tree& lhs, const flat_tree& rhs)
 
-TEST(FlatSet, Comparison) {
+TEST(FlatTree, Comparison) {
   // Provided comparator does not participate in comparison.
-  ReversedSet biggest{3};
-  ReversedSet smallest{1};
-  ReversedSet middle{1, 2};
+  ReversedTree biggest{3};
+  ReversedTree smallest{1};
+  ReversedTree middle{1, 2};
 
   EXPECT_EQ(biggest, biggest);
   EXPECT_NE(biggest, smallest);
   EXPECT_LT(smallest, middle);
   EXPECT_LE(smallest, middle);
   EXPECT_LE(middle, middle);
   EXPECT_GT(biggest, middle);
   EXPECT_GE(biggest, middle);
   EXPECT_GE(biggest, biggest);
 }
+
+}  // namespace internal
+}  // namespace base