1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
// Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/first_party_sets/addition_overlaps_union_find.h"
#include "base/test/gtest_util.h"
#include "testing/gmock/include/gmock/gmock.h"
namespace net {
namespace {
TEST(AdditionOverlapsUnionFindUnittest, InvalidNumSets) {
EXPECT_CHECK_DEATH(AdditionOverlapsUnionFind(-1));
}
TEST(AdditionOverlapsUnionFindUnittest, EmptyUnionFind_Union_BoundsCheckFails) {
AdditionOverlapsUnionFind union_find(0);
EXPECT_CHECK_DEATH(union_find.Union(0, 0));
}
TEST(AdditionOverlapsUnionFindUnittest, Union_BoundsCheckFails) {
AdditionOverlapsUnionFind union_find(3);
// Test lower bound of [0, |num_sets|)
EXPECT_CHECK_DEATH(union_find.Union(-1, 0));
EXPECT_CHECK_DEATH(union_find.Union(0, -1));
// Test upper bound of [0, |num_sets|)
EXPECT_CHECK_DEATH(union_find.Union(0, 3));
EXPECT_CHECK_DEATH(union_find.Union(3, 0));
}
TEST(AdditionOverlapsUnionFindUnittest, SetsAreTheirInitRepresentatives) {
EXPECT_THAT(
AdditionOverlapsUnionFind(4).SetsMapping(),
AdditionOverlapsUnionFind::SetsMap({{0, {}}, {1, {}}, {2, {}}, {3, {}}}));
}
TEST(AdditionOverlapsUnionFindUnittest, Union_ChoosesLesserSetIndex) {
AdditionOverlapsUnionFind union_find(3);
union_find.Union(1, 2);
EXPECT_THAT(union_find.SetsMapping(),
AdditionOverlapsUnionFind::SetsMap({{0, {}}, {1, {2}}}));
union_find.Union(0, 1);
EXPECT_THAT(union_find.SetsMapping(), AdditionOverlapsUnionFind::SetsMap({
{0, {1, 2}},
}));
}
TEST(AdditionOverlapsUnionFindUnittest, Union_NoOp_SameSet) {
AdditionOverlapsUnionFind uf(4);
for (int i = 0; i < 4; i++) {
uf.Union(i, i);
}
EXPECT_THAT(
AdditionOverlapsUnionFind(4).SetsMapping(),
AdditionOverlapsUnionFind::SetsMap({{0, {}}, {1, {}}, {2, {}}, {3, {}}}));
}
TEST(AdditionOverlapsUnionFindUnittest, Union_NoOp_SharedRepresentative) {
AdditionOverlapsUnionFind union_find(4);
union_find.Union(0, 2);
EXPECT_THAT(union_find.SetsMapping(),
AdditionOverlapsUnionFind::SetsMap({{0, {2}}, {1, {}}, {3, {}}}));
union_find.Union(0, 2);
EXPECT_THAT(union_find.SetsMapping(),
AdditionOverlapsUnionFind::SetsMap({{0, {2}}, {1, {}}, {3, {}}}));
union_find.Union(2, 0);
EXPECT_THAT(union_find.SetsMapping(),
AdditionOverlapsUnionFind::SetsMap({{0, {2}}, {1, {}}, {3, {}}}));
}
} // namespace
} // namespace net
|
