Searched refs:n_i (Results 1 – 2 of 2) sorted by relevance
| /system/update_engine/payload_generator/ |
| D | topological_sort_unittest.cc | 62 const Vertex::Index n_i = counter++; in TEST() local
68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties())); in TEST()
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties())); in TEST()
|
| D | cycle_breaker_unittest.cc | 189 const Vertex::Index n_i = counter++; in TEST() local
210 graph[n_h].out_edges.insert(EdgeWithWeight(n_i, 8)); in TEST()
211 graph[n_i].out_edges.insert(EdgeWithWeight(n_e, 4)); in TEST()
212 graph[n_i].out_edges.insert(EdgeWithWeight(n_h, 9)); in TEST()
213 graph[n_i].out_edges.insert(EdgeWithWeight(n_j, 6)); in TEST()
225 EXPECT_TRUE(base::ContainsKey(broken_edges, make_pair(n_h, n_i))); in TEST()
|