Searched refs:best_path (Results 1 – 7 of 7) sorted by relevance
601 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous in TrellisQuantizeBlock() local711 best_path[0] = n; // best eob position in TrellisQuantizeBlock()712 best_path[1] = m; // best node index in TrellisQuantizeBlock()713 best_path[2] = best_prev; // best predecessor in TrellisQuantizeBlock()722 if (best_path[0] == -1) { in TrellisQuantizeBlock()731 int best_node = best_path[1]; in TrellisQuantizeBlock()732 n = best_path[0]; in TrellisQuantizeBlock()733 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal in TrellisQuantizeBlock()
1075 std::vector<EditType> best_path; in CalculateOptimalEdits() local1078 best_path.push_back(move); in CalculateOptimalEdits()1082 std::reverse(best_path.begin(), best_path.end()); in CalculateOptimalEdits()1083 return best_path; in CalculateOptimalEdits()
1074 std::vector<EditType> best_path; in CalculateOptimalEdits() local1077 best_path.push_back(move); in CalculateOptimalEdits()1081 std::reverse(best_path.begin(), best_path.end()); in CalculateOptimalEdits()1082 return best_path; in CalculateOptimalEdits()
1118 std::vector<EditType> best_path; in CalculateOptimalEdits() local1121 best_path.push_back(move); in CalculateOptimalEdits()1125 std::reverse(best_path.begin(), best_path.end()); in CalculateOptimalEdits()1126 return best_path; in CalculateOptimalEdits()
1095 std::vector<EditType> best_path; in CalculateOptimalEdits() local1098 best_path.push_back(move); in CalculateOptimalEdits()1102 std::reverse(best_path.begin(), best_path.end()); in CalculateOptimalEdits()1103 return best_path; in CalculateOptimalEdits()
2522 std::vector<EditType> best_path; in CalculateOptimalEdits() local2525 best_path.push_back(move); in CalculateOptimalEdits()2529 std::reverse(best_path.begin(), best_path.end()); in CalculateOptimalEdits()2530 return best_path; in CalculateOptimalEdits()