HomeSort by relevance Sort by last modified time
    Searched refs:op_indexes (Results 1 - 3 of 3) sorted by null

  /system/update_engine/payload_generator/
inplace_generator.h 103 // Takes |op_indexes|, which is effectively a mapping from order in
105 // reverse: a mapping from graph vertex index -> op_indexes index.
107 const std::vector<Vertex::Index>& op_indexes,
111 // determined by the order of elements in op_indexes.
113 const std::vector<Vertex::Index>& op_indexes,
116 // Given a topologically sorted graph |op_indexes| and |graph|, alters
117 // |op_indexes| to move all the full operations to the end of the vector.
120 std::vector<Vertex::Index>* op_indexes);
128 // will be performed (in |op_indexes|) and the reverse (in
137 std::vector<Vertex::Index>* op_indexes,
    [all...]
inplace_generator.cc 250 const vector<Vertex::Index>& op_indexes,
252 vector<vector<Vertex::Index>::size_type> table(op_indexes.size());
253 for (vector<Vertex::Index>::size_type i = 0, e = op_indexes.size();
255 Vertex::Index node = op_indexes[i];
265 const vector<Vertex::Index>& op_indexes,
269 GenerateReverseTopoOrderMap(op_indexes, &table);
276 vector<Vertex::Index>* op_indexes) {
279 ret.reserve(op_indexes->size());
280 for (auto op_index : *op_indexes) {
295 op_indexes->swap(ret)
    [all...]
inplace_generator_unittest.cc 373 vector<Vertex::Index> op_indexes; local
374 op_indexes.push_back(2);
375 op_indexes.push_back(0);
376 op_indexes.push_back(1);
377 op_indexes.push_back(6);
378 op_indexes.push_back(3);
379 op_indexes.push_back(7);
380 op_indexes.push_back(4);
381 op_indexes.push_back(5);
382 op_indexes.push_back(8)
    [all...]

Completed in 71 milliseconds