Lines Matching defs:right
1029 const std::vector<size_t>& right) {
1031 left.size() + 1, std::vector<double>(right.size() + 1));
1033 left.size() + 1, std::vector<EditType>(right.size() + 1));
1035 // Populate for empty right.
1047 for (size_t r_i = 0; r_i < right.size(); ++r_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;) {
1106 const std::vector<std::string>& right) {
1113 for (size_t i = 0; i < right.size(); ++i) {
1114 right_ids.push_back(intern_table.GetId(right[i]));
1174 // where the left/right parts are ommitted if unnecessary.
1204 const std::vector<std::string>& right,
1206 const std::vector<EditType> edits = CalculateOptimalEdits(left, right);
1247 hunk.PushLine('+', right[r_i].c_str());
1746 // shifted to the right by n bits.
1938 wint_t left, right;
1941 right = towlower(*rhs++);
1942 } while (left && left == right);
1943 return left == right;
4998 // If *pstr starts with the given prefix, modifies *pstr to be right