Searched refs:l_i (Results 1 – 13 of 13) sorted by relevance
5 static struct l_i t[] = {22 struct l_i *p; in main()
5 static struct l_i t[] = {18 struct l_i *p; in main()
42 for (int l_i = 0; l_i < l_len_; l_i++) { in Compute() local
182 T(ilogbl, l_i)185 T(llrintl, l_i)188 T(lrintl, l_i)191 T(llroundl, l_i)194 T(lroundl, l_i)
1043 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local1044 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() local1055 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 …]
1235 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local1236 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() local1247 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 …]
2726 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local2727 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() local2738 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 …]
83 struct l_i {POS int r; long double x; long long i; int e; }; argument
249 for (auto l_i : l) { in GenLabelWithBlank() local251 (*label_with_blank)[b].push_back(l_i); in GenLabelWithBlank()