Home
last modified time | relevance | path

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

/system/update_engine/payload_generator/
Dcycle_breaker_unittest.cc50 const Vertex::Index n_a = counter++; in TEST() local
63 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
64 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
86 EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(n_a, n_e)) || in TEST()
88 utils::SetContainsKey(broken_edges, make_pair(n_b, n_a))); in TEST()
180 const Vertex::Index n_a = counter++; in TEST() local
195 graph[n_a].out_edges.insert(EdgeWithWeight(n_b, 4)); in TEST()
196 graph[n_a].out_edges.insert(EdgeWithWeight(n_f, 3)); in TEST()
197 graph[n_a].out_edges.insert(EdgeWithWeight(n_h, 2)); in TEST()
[all …]
Dtarjan_unittest.cc37 const Vertex::Index n_a = 0; in TEST() local
49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
64 for (Vertex::Index i = n_a; i <= n_e; i++) { in TEST()
69 EXPECT_TRUE(utils::VectorContainsValue(vertex_indexes, n_a)); in TEST()
Dtopological_sort_unittest.cc54 const Vertex::Index n_a = counter++; in TEST() local
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
78 graph[n_d].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()