Searched defs:out_edges (Results 1 - 3 of 3) sorted by relevance

/system/update_engine/payload_generator/
H A Dgraph_types.h61 EdgeMap out_edges; member in struct:chromeos_update_engine::Vertex
H A Dgraph_utils.cc41 graph[edge.first].out_edges.find(edge.second)->second.extents;
53 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst);
54 if (edge_it == src->out_edges.end()) {
57 src->out_edges.insert(make_pair(dst, EdgeProperties()));
99 it->out_edges.erase(index);
113 void DumpOutEdges(const Vertex::EdgeMap& out_edges) { argument
114 for (Vertex::EdgeMap::const_iterator it = out_edges.begin(),
115 e = out_edges.end(); it != e; ++it) {
136 DumpOutEdges(graph[i].out_edges);
H A Dinplace_generator.cc125 for (auto& edge_prop_pair : vertex->out_edges) {
150 (*graph)[edge.first].out_edges[edge.second].extents;
162 (*graph)[edge.first].out_edges.find(edge.second)->second;
171 (*graph)[edge.first].out_edges.insert(make_pair(graph->size() - 1,
187 (*graph)[edge.first].out_edges[edge.second].extents,
192 (*graph)[edge.first].out_edges.erase(edge.second));
197 (*graph)[edge.second].out_edges.insert(
221 (*graph)[blocks[i].writer].out_edges.find(blocks[i].reader);
222 if (edge_it == (*graph)[blocks[i].writer].out_edges.end()) {
224 (*graph)[blocks[i].writer].out_edges
561 Vertex::EdgeMap out_edges = (*graph)[cut.old_dst].out_edges; local
[all...]

Completed in 93 milliseconds