Lines Matching refs:vector
103 // Joins a vector of strings as if they are fields of a tuple; returns
146 // a vector<int> called 'left_' whose elements are initialized to the
172 // As an optimization, there is a second vector<int> called right_ which
209 ::std::vector<char> seen;
223 // Reset the path-marking vector and try to find a path from
245 // right vector elements corresponding each segment of the path.
247 // flow was added to the network. The 'seen' vector elements correspond
259 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
288 // Each element of the left_ vector represents a left hand side node
290 // node (i.e. a matcher). The values in the left_ vector indicate
295 // be redundantly represented in the right_ vector as right_[1] == 3.
299 ::std::vector<size_t> left_;
300 ::std::vector<size_t> right_;
445 const ::std::vector<string>& element_printouts,
449 ::std::vector<char> element_matched(matrix.LhsSize(), 0);
450 ::std::vector<char> matcher_matched(matrix.RhsSize(), 0);