Home
last modified time | relevance | path

Searched refs:best_path (Results 1 - 5 of 5) sorted by relevance

/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dquant_enc.c601 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous in TrellisQuantizeBlock() local
711 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()
729 // best_prev for non-terminal. So we patch best_path[2] in. 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()
/third_party/ffmpeg/libavcodec/
H A Dmlpenc.c1883 char *best_path; in set_best_codebook() local
1934 best_path = path_counter[NUM_CODEBOOKS].path + 1; in set_best_codebook()
1940 best_codebook = *best_path++; in set_best_codebook()
/third_party/googletest/googletest/src/
H A Dgtest.cc1337 std::vector<EditType> best_path;
1340 best_path.push_back(move);
1344 std::reverse(best_path.begin(), best_path.end());
1345 return best_path;
/third_party/mesa3d/src/gtest/src/
H A Dgtest.cc1081 std::vector<EditType> best_path; in CalculateOptimalEdits() local
1084 best_path.push_back(move); in CalculateOptimalEdits()
1088 std::reverse(best_path.begin(), best_path.end()); in CalculateOptimalEdits()
1089 return best_path; in CalculateOptimalEdits()
/third_party/node/deps/googletest/src/
H A Dgtest.cc1354 std::vector<EditType> best_path;
1357 best_path.push_back(move);
1361 std::reverse(best_path.begin(), best_path.end());
1362 return best_path;

Completed in 37 milliseconds