| /external/eigen/unsupported/Eigen/ |
| D | Polynomials | 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$.
|
| /external/libaom/libaom/third_party/googletest/src/googletest/src/ |
| D | gtest.cc | 1042 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local
1043 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1044 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()
1048 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local
1049 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1051 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1052 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1056 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1057 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1058 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googletest/src/ |
| D | gtest.cc | 1041 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local
1042 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() local
1048 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 …]
|
| /external/mesa3d/src/gtest/src/ |
| D | gtest.cc | 1041 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local
1042 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() local
1048 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 …]
|
| /external/libvpx/libvpx/third_party/googletest/src/src/ |
| D | gtest.cc | 1085 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local
1086 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() local
1092 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 …]
|
| /external/googletest/googletest/src/ |
| D | gtest.cc | 1062 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local
1063 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1064 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()
1068 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local
1069 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
1071 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1072 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
1076 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1077 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1078 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|
| /external/tensorflow/tensorflow/contrib/cudnn_rnn/python/ops/ |
| D | cudnn_rnn_ops.py | 418 w_i, w_f, w_c, w_o, r_i, r_f, r_c, r_o = cu_weights
421 W_i = array_ops.concat([w_i, r_i], axis=1)
447 w_i, r_i = array_ops.split(W_i, [input_weight_width, num_units], axis=1)
451 return w_i, w_f, w_c, w_o, r_i, r_f, r_c, r_o
503 w_i, w_r, w_h, r_i, r_r, r_h = cu_weights
506 W_i = array_ops.concat([w_i, r_i], axis=1)
529 w_i, r_i = array_ops.split(W_i, [input_weight_width, num_units], axis=1)
532 return w_i, w_r, w_h, r_i, r_r, r_h
|
| /external/epid-sdk/ext/gtest/ |
| D | gtest-all.cc | 2489 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local
2490 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
2491 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()
2495 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local
2496 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()
2498 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
2499 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()
2503 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
2504 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
2505 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
[all …]
|