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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
// Copyright 2013 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 "chrome/browser/profiles/dependency_graph.h"
#include "chrome/browser/profiles/dependency_node.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace {
class DependencyGraphTest : public testing::Test {
};
class DummyNode : public DependencyNode {
public:
explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) {
dependency_graph_->AddNode(this);
}
~DummyNode() {
dependency_graph_->RemoveNode(this);
}
private:
DependencyGraph* dependency_graph_;
DISALLOW_COPY_AND_ASSIGN(DummyNode);
};
// Tests that we can deal with a single component.
TEST_F(DependencyGraphTest, SingleCase) {
DependencyGraph graph;
DummyNode node(&graph);
std::vector<DependencyNode*> construction_order;
EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
ASSERT_EQ(1U, construction_order.size());
EXPECT_EQ(&node, construction_order[0]);
std::vector<DependencyNode*> destruction_order;
EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
ASSERT_EQ(1U, destruction_order.size());
EXPECT_EQ(&node, destruction_order[0]);
}
// Tests that we get a simple one component depends on the other case.
TEST_F(DependencyGraphTest, SimpleDependency) {
DependencyGraph graph;
DummyNode parent(&graph);
DummyNode child(&graph);
graph.AddEdge(&parent, &child);
std::vector<DependencyNode*> construction_order;
EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
ASSERT_EQ(2U, construction_order.size());
EXPECT_EQ(&parent, construction_order[0]);
EXPECT_EQ(&child, construction_order[1]);
std::vector<DependencyNode*> destruction_order;
EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
ASSERT_EQ(2U, destruction_order.size());
EXPECT_EQ(&child, destruction_order[0]);
EXPECT_EQ(&parent, destruction_order[1]);
}
// Tests two children, one parent.
TEST_F(DependencyGraphTest, TwoChildrenOneParent) {
DependencyGraph graph;
DummyNode parent(&graph);
DummyNode child1(&graph);
DummyNode child2(&graph);
graph.AddEdge(&parent, &child1);
graph.AddEdge(&parent, &child2);
std::vector<DependencyNode*> construction_order;
EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
ASSERT_EQ(3U, construction_order.size());
EXPECT_EQ(&parent, construction_order[0]);
EXPECT_EQ(&child1, construction_order[1]);
EXPECT_EQ(&child2, construction_order[2]);
std::vector<DependencyNode*> destruction_order;
EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
ASSERT_EQ(3U, destruction_order.size());
EXPECT_EQ(&child2, destruction_order[0]);
EXPECT_EQ(&child1, destruction_order[1]);
EXPECT_EQ(&parent, destruction_order[2]);
}
// Tests an M configuration.
TEST_F(DependencyGraphTest, MConfiguration) {
DependencyGraph graph;
DummyNode parent1(&graph);
DummyNode parent2(&graph);
DummyNode child_of_1(&graph);
graph.AddEdge(&parent1, &child_of_1);
DummyNode child_of_12(&graph);
graph.AddEdge(&parent1, &child_of_12);
graph.AddEdge(&parent2, &child_of_12);
DummyNode child_of_2(&graph);
graph.AddEdge(&parent2, &child_of_2);
std::vector<DependencyNode*> construction_order;
EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
ASSERT_EQ(5U, construction_order.size());
EXPECT_EQ(&parent1, construction_order[0]);
EXPECT_EQ(&parent2, construction_order[1]);
EXPECT_EQ(&child_of_1, construction_order[2]);
EXPECT_EQ(&child_of_12, construction_order[3]);
EXPECT_EQ(&child_of_2, construction_order[4]);
std::vector<DependencyNode*> destruction_order;
EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
ASSERT_EQ(5U, destruction_order.size());
EXPECT_EQ(&child_of_2, destruction_order[0]);
EXPECT_EQ(&child_of_12, destruction_order[1]);
EXPECT_EQ(&child_of_1, destruction_order[2]);
EXPECT_EQ(&parent2, destruction_order[3]);
EXPECT_EQ(&parent1, destruction_order[4]);
}
// Tests that it can deal with a simple diamond.
TEST_F(DependencyGraphTest, DiamondConfiguration) {
DependencyGraph graph;
DummyNode parent(&graph);
DummyNode middle1(&graph);
graph.AddEdge(&parent, &middle1);
DummyNode middle2(&graph);
graph.AddEdge(&parent, &middle2);
DummyNode bottom(&graph);
graph.AddEdge(&middle1, &bottom);
graph.AddEdge(&middle2, &bottom);
std::vector<DependencyNode*> construction_order;
EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
ASSERT_EQ(4U, construction_order.size());
EXPECT_EQ(&parent, construction_order[0]);
EXPECT_EQ(&middle1, construction_order[1]);
EXPECT_EQ(&middle2, construction_order[2]);
EXPECT_EQ(&bottom, construction_order[3]);
std::vector<DependencyNode*> destruction_order;
EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
ASSERT_EQ(4U, destruction_order.size());
EXPECT_EQ(&bottom, destruction_order[0]);
EXPECT_EQ(&middle2, destruction_order[1]);
EXPECT_EQ(&middle1, destruction_order[2]);
EXPECT_EQ(&parent, destruction_order[3]);
}
} // namespace
|
