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 "base/ranges/algorithm.h"
8 #include "base/strings/string_piece.h"
9 #include "base/test/gtest_util.h"
10 #include "testing/gmock/include/gmock/gmock.h"
11 #include "testing/gtest/include/gtest/gtest.h"
12
13 namespace base {
14
TEST(FixedFlatSetTest,MakeFixedFlatSet_SortedInput)15 TEST(FixedFlatSetTest, MakeFixedFlatSet_SortedInput) {
16 constexpr auto kSet = MakeFixedFlatSet<int>({1, 2, 3, 4});
17 static_assert(ranges::is_sorted(kSet), "Error: Set is not sorted.");
18 static_assert(ranges::adjacent_find(kSet) == kSet.end(),
19 "Error: Set contains repeated elements.");
20 EXPECT_THAT(kSet, ::testing::ElementsAre(1, 2, 3, 4));
21 }
22
TEST(FixedFlatSetTest,MakeFixedFlatSet_UnsortedInput)23 TEST(FixedFlatSetTest, MakeFixedFlatSet_UnsortedInput) {
24 constexpr auto kSet = MakeFixedFlatSet<StringPiece>({"foo", "bar", "baz"});
25 static_assert(ranges::is_sorted(kSet), "Error: Set is not sorted.");
26 static_assert(ranges::adjacent_find(kSet) == kSet.end(),
27 "Error: Set contains repeated elements.");
28 EXPECT_THAT(kSet, ::testing::ElementsAre("bar", "baz", "foo"));
29 }
30
31 // Verifies that passing repeated keys to MakeFixedFlatSet results in a CHECK
32 // failure.
TEST(FixedFlatSetTest,RepeatedKeys)33 TEST(FixedFlatSetTest, RepeatedKeys) {
34 EXPECT_CHECK_DEATH(MakeFixedFlatSet<int>({1, 2, 3, 1}));
35 }
36
37 } // namespace base
38