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

/system/update_engine/payload_generator/
H A Dtopological_sort_unittest.cc34 // Returns true if the value is found in vect. If found, the index is stored
37 bool IndexOf(const vector<T>& vect, argument
40 for (typename vector<T>::size_type i = 0; i < vect.size(); i++) {
41 if (vect[i] == value) {
H A Dinplace_generator_unittest.cc81 void DumpVect(const vector<T>& vect) { argument
83 for (typename vector<T>::const_iterator it = vect.begin(), e = vect.end();
90 void AppendExtent(vector<Extent>* vect, uint64_t start, uint64_t length) { argument
91 vect->resize(vect->size() + 1);
92 vect->back().set_start_block(start);
93 vect->back().set_num_blocks(length);
414 vector<Vertex::Index> vect(graph.size());
416 for (vector<Vertex::Index>::size_type i = 0; i < vect
[all...]
/system/update_engine/common/
H A Dutils.h227 inline void HexDumpVector(const brillo::Blob& vect) { argument
228 HexDumpArray(vect.data(), vect.size());
241 bool VectorContainsValue(const std::vector<T>& vect, const T& value) { argument
242 return std::find(vect.begin(), vect.end(), value) != vect.end();
246 bool VectorIndexOf(const std::vector<T>& vect, const T& value, argument
248 typename std::vector<T>::const_iterator it = std::find(vect.begin(),
249 vect
[all...]

Completed in 93 milliseconds