1 files changed, 0 insertions, 161 deletions
diff --git a/chromium/components/browser_context_keyed_service/dependency_graph_unittest.cc b/chromium/components/browser_context_keyed_service/dependency_graph_unittest.cc
deleted file mode 100644
index 541ada720a6..00000000000
--- a/chromium/components/browser_context_keyed_service/dependency_graph_unittest.cc
+++ /dev/null
@@ -1,161 +0,0 @@
-// 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 "components/browser_context_keyed_service/dependency_graph.h"
-#include "components/browser_context_keyed_service/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