OLD | NEW |
1 // Copyright (c) 2010 The Chromium OS Authors. All rights reserved. | 1 // Copyright (c) 2010 The Chromium OS Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include <set> | 5 #include <set> |
6 #include <string> | 6 #include <string> |
7 #include <utility> | 7 #include <utility> |
8 #include <vector> | 8 #include <vector> |
9 #include <gtest/gtest.h> | 9 #include <gtest/gtest.h> |
10 #include "chromeos/obsolete_logging.h" | 10 #include "base/logging.h" |
11 #include "update_engine/cycle_breaker.h" | 11 #include "update_engine/cycle_breaker.h" |
12 #include "update_engine/graph_types.h" | 12 #include "update_engine/graph_types.h" |
13 #include "update_engine/utils.h" | 13 #include "update_engine/utils.h" |
14 | 14 |
15 using std::make_pair; | 15 using std::make_pair; |
16 using std::pair; | 16 using std::pair; |
17 using std::set; | 17 using std::set; |
18 using std::string; | 18 using std::string; |
19 using std::vector; | 19 using std::vector; |
20 | 20 |
(...skipping 199 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
220 | 220 |
221 set<Edge> broken_edges; | 221 set<Edge> broken_edges; |
222 breaker.BreakCycles(graph, &broken_edges); | 222 breaker.BreakCycles(graph, &broken_edges); |
223 | 223 |
224 // These are required to be broken: | 224 // These are required to be broken: |
225 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_a, n_b))); | 225 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_a, n_b))); |
226 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_a, n_c))); | 226 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_a, n_c))); |
227 } | 227 } |
228 | 228 |
229 } // namespace chromeos_update_engine | 229 } // namespace chromeos_update_engine |
OLD | NEW |