Lines Matching defs:left
1028 std::vector<EditType> CalculateOptimalEdits(const std::vector<size_t>& left,
1031 left.size() + 1, std::vector<double>(right.size() + 1));
1033 left.size() + 1, std::vector<EditType>(right.size() + 1));
1040 // Populate for empty left.
1046 for (size_t l_i = 0; l_i < left.size(); ++l_i) {
1048 if (left[l_i] == right[r_i]) {
1075 for (size_t l_i = left.size(), r_i = right.size(); l_i > 0 || r_i > 0;) {
1105 const std::vector<std::string>& left,
1110 for (size_t i = 0; i < left.size(); ++i) {
1111 left_ids.push_back(intern_table.GetId(left[i]));
1174 // where the left/right parts are ommitted if unnecessary.
1203 std::string CreateUnifiedDiff(const std::vector<std::string>& left,
1206 const std::vector<EditType> edits = CalculateOptimalEdits(left, right);
1222 hunk.PushLine(' ', left[l_i - i].c_str());
1244 hunk.PushLine(edit == kMatch ? ' ' : '-', left[l_i].c_str());
1938 wint_t left, right;
1940 left = towlower(*lhs++);
1942 } while (left && left == right);
1943 return left == right;
4207 // premature-exit file will be left undeleted, causing a test runner
4731 << ", but have left " << kTestTotalShards << " unset.\n";
4739 << ", but have left " << kTestShardIndex << " unset.\n";
5305 // Shift the remainder of the argv list left by one. Note