Home
last modified time | relevance | path

Searched refs:n_c (Results 1 – 3 of 3) sorted by relevance

/system/update_engine/payload_generator/
Dcycle_breaker_unittest.cc52 const Vertex::Index n_c = counter++; in TEST() local
66 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
70 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
89 EXPECT_TRUE(base::ContainsKey(broken_edges, make_pair(n_c, n_d)) || in TEST()
91 base::ContainsKey(broken_edges, make_pair(n_e, n_c))); in TEST()
183 const Vertex::Index n_c = counter++; in TEST() local
200 graph[n_b].out_edges.insert(EdgeWithWeight(n_c, 4)); in TEST()
201 graph[n_c].out_edges.insert(EdgeWithWeight(n_b, 5)); in TEST()
202 graph[n_c].out_edges.insert(EdgeWithWeight(n_d, 3)); in TEST()
222 EXPECT_TRUE(base::ContainsKey(broken_edges, make_pair(n_b, n_c))); in TEST()
[all …]
Dtarjan_unittest.cc39 const Vertex::Index n_c = 2; in TEST() local
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
71 EXPECT_TRUE(base::ContainsValue(vertex_indexes, n_c)); in TEST()
Dtopological_sort_unittest.cc56 const Vertex::Index n_c = counter++; in TEST() local
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()