Searched refs:r_i (Results 1 – 7 of 7) sorted by relevance
368 for (int r_i = begin; r_i < end; ++r_i) { in CalculateRowSoftmax() local369 row_max = Eigen::numext::maxi(row_max, ldg(logits + r_i)); in CalculateRowSoftmax()372 for (int r_i = begin; r_i < end; ++r_i) { in CalculateRowSoftmax() local373 const T exp_i = Eigen::numext::exp(ldg(logits + r_i) - row_max); in CalculateRowSoftmax()374 softmax[r_i] = exp_i; in CalculateRowSoftmax()377 for (int r_i = begin; r_i < end; ++r_i) { in CalculateRowSoftmax() local378 softmax[r_i] = softmax[r_i] / sum_exp; in CalculateRowSoftmax()
82 \f$ \forall r_i \f$ root of \f$ p(x) = \sum_{k=0}^d a_k x^k \f$,83 \f$ |r_i| \le C(p) = \sum_{k=0}^{d} \left | \frac{a_k}{a_d} \right | \f$92 \f$ \forall r_i \neq 0 \f$ root of \f$ p(x) = \sum_{k=0}^d a_k x^k \f$,93 \f$ |r_i| \ge c(p) = \left( \sum_{k=0}^{d} \left | \frac{a_k}{a_0} \right | \right)^{-1} \f$116 \f$ \forall i,j \in [1;d],~ \| r_i \| \neq \| r_j \| \f$.
1041 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local1042 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()1043 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()1047 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local1048 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()1050 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()1051 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()1055 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()1056 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()1057 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()[all …]
1085 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local1086 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()1087 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()1091 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local1092 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()1094 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()1095 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()1099 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()1100 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()1101 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()[all …]
1048 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local1049 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()1050 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()1054 for (size_t r_i = 0; r_i < right.size(); ++r_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 …]
1180 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local1181 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()1182 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()1186 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local1187 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()1189 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()1190 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()1194 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()1195 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()1196 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()[all …]
1170 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local1171 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()1172 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()1176 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local1177 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()1179 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()1180 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()1184 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()1185 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()1186 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()[all …]