Home
last modified time | relevance | path

Searched refs:l_i (Results 1 – 11 of 11) sorted by relevance

/third_party/musl/libc-test/src/math/gen/
Dfunctions.h182 T(ilogbl, l_i)
185 T(llrintl, l_i)
188 T(lrintl, l_i)
191 T(llroundl, l_i)
194 T(lroundl, l_i)
/third_party/musl/libc-test/src/math/
Dlrintl.c5 static struct l_i t[] = {
22 struct l_i *p; in main()
Dllrintl.c5 static struct l_i t[] = {
22 struct l_i *p; in main()
Dilogbl.c5 static struct l_i t[] = {
22 struct l_i *p; in main()
Dllroundl.c5 static struct l_i t[] = {
22 struct l_i *p; in main()
Dlroundl.c5 static struct l_i t[] = {
22 struct l_i *p; in main()
/third_party/musl/libc-test/src/math/gen/template/
Dl_i.c5 static struct l_i t[] = {
18 struct l_i *p; in main()
/third_party/mesa3d/src/gtest/src/
Dgtest.cc1043 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1044 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1045 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1053 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1055 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1057 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1058 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1062 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1063 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1064 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
/third_party/googletest/googletest/src/
Dgtest.cc1235 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
1236 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1237 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
1245 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
1247 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1249 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1250 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1254 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1255 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1256 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
/third_party/cef/tools/distrib/gtest/
Dgtest-all.cc2726 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local
2727 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
2728 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()
2736 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local
2738 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
2740 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
2741 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
2745 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
2746 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
2747 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
/third_party/musl/libc-test/src/common/
Dmtest.h83 struct l_i {POS int r; long double x; long long i; int e; }; argument