Searched refs:vect (Results 1 – 3 of 3) sorted by relevance
| /system/update_engine/common/ |
| D | utils.h | 271 inline void HexDumpVector(const brillo::Blob& vect) { in HexDumpVector() argument
272 HexDumpArray(vect.data(), vect.size()); in HexDumpVector()
285 bool VectorContainsValue(const std::vector<T>& vect, const T& value) { in VectorContainsValue() argument
286 return std::find(vect.begin(), vect.end(), value) != vect.end(); in VectorContainsValue()
290 bool VectorIndexOf(const std::vector<T>& vect, const T& value, in VectorIndexOf() argument
292 typename std::vector<T>::const_iterator it = std::find(vect.begin(), in VectorIndexOf()
293 vect.end(), in VectorIndexOf()
295 if (it == vect.end()) { in VectorIndexOf()
298 *out_index = it - vect.begin(); in VectorIndexOf()
|
| /system/update_engine/payload_generator/ |
| D | inplace_generator_unittest.cc | 81 void DumpVect(const vector<T>& vect) { in DumpVect() argument
83 for (typename vector<T>::const_iterator it = vect.begin(), e = vect.end(); in DumpVect()
90 void AppendExtent(vector<Extent>* vect, uint64_t start, uint64_t length) { in AppendExtent() argument
91 vect->resize(vect->size() + 1); in AppendExtent()
92 vect->back().set_start_block(start); in AppendExtent()
93 vect->back().set_num_blocks(length); in AppendExtent()
414 vector<Vertex::Index> vect(graph.size()); in TEST_F() local
416 for (vector<Vertex::Index>::size_type i = 0; i < vect.size(); ++i) { in TEST_F()
417 vect[i] = i; in TEST_F()
419 InplaceGenerator::MoveAndSortFullOpsToBack(&graph, &vect); in TEST_F()
[all …]
|
| D | topological_sort_unittest.cc | 37 bool IndexOf(const vector<T>& vect, in IndexOf() argument
40 for (typename vector<T>::size_type i = 0; i < vect.size(); i++) { in IndexOf()
41 if (vect[i] == value) { in IndexOf()
|