Searched refs:EdgeProperties (Results 1 – 9 of 9) sorted by relevance
| /system/update_engine/payload_generator/ |
| D | tarjan_unittest.cc | 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()
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
57 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
58 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
[all …]
|
| D | topological_sort_unittest.cc | 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()
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST()
74 graph[n_e].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
75 graph[n_e].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
76 graph[n_g].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
77 graph[n_g].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
[all …]
|
| D | cycle_breaker_unittest.cc | 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()
66 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST()
67 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST()
68 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
69 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST()
70 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST()
71 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST()
72 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST()
[all …]
|
| D | graph_types.h | 37 struct EdgeProperties { struct
48 bool operator==(const EdgeProperties& that) const { argument
57 typedef std::map<std::vector<Vertex>::size_type, EdgeProperties> EdgeMap;
|
| D | graph_utils_unittest.cc | 38 graph[0].out_edges.insert(make_pair(1, EdgeProperties())); in TEST()
|
| D | graph_utils.cc | 55 src->out_edges.insert(make_pair(dst, EdgeProperties())); in AddReadBeforeDep()
|
| D | inplace_generator_unittest.cc | 69 EdgeProperties EdgeWithReadDep(const vector<Extent>& extents) { in EdgeWithReadDep()
70 EdgeProperties ret; in EdgeWithReadDep()
75 EdgeProperties EdgeWithWriteDep(const vector<Extent>& extents) { in EdgeWithWriteDep()
76 EdgeProperties ret; in EdgeWithWriteDep()
|
| D | cycle_breaker.cc | 209 make_pair(vertex, EdgeProperties())); in Circuit()
|
| D | inplace_generator.cc | 161 EdgeProperties& cut_edge_properties = in CutEdges()
194 EdgeProperties write_before_edge_properties; in CutEdges()
221 make_pair(blocks[i].reader, EdgeProperties())); in CreateEdges()
|