1 // Copyright 2020 The Chromium Authors
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
4
5 #include "base/containers/fixed_flat_set.h"
6
7 #include <string_view>
8
9 #include "base/ranges/algorithm.h"
10 #include "base/test/gtest_util.h"
11 #include "testing/gmock/include/gmock/gmock.h"
12 #include "testing/gtest/include/gtest/gtest.h"
13
14 namespace base {
15
TEST(FixedFlatSetTest,MakeFixedFlatSet_SortedInput)16 TEST(FixedFlatSetTest, MakeFixedFlatSet_SortedInput) {
17 constexpr auto kSet = MakeFixedFlatSet<int>({1, 2, 3, 4});
18 static_assert(ranges::is_sorted(kSet), "Error: Set is not sorted.");
19 static_assert(ranges::adjacent_find(kSet) == kSet.end(),
20 "Error: Set contains repeated elements.");
21 EXPECT_THAT(kSet, ::testing::ElementsAre(1, 2, 3, 4));
22 }
23
TEST(FixedFlatSetTest,MakeFixedFlatSet_UnsortedInput)24 TEST(FixedFlatSetTest, MakeFixedFlatSet_UnsortedInput) {
25 constexpr auto kSet =
26 MakeFixedFlatSet<std::string_view>({"foo", "bar", "baz"});
27 static_assert(ranges::is_sorted(kSet), "Error: Set is not sorted.");
28 static_assert(ranges::adjacent_find(kSet) == kSet.end(),
29 "Error: Set contains repeated elements.");
30 EXPECT_THAT(kSet, ::testing::ElementsAre("bar", "baz", "foo"));
31 }
32
33 } // namespace base
34