Searched refs:r_i (Results 1 – 5 of 5) sorted by relevance
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 …]
1038 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits() local1039 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()1040 best_move[0][r_i] = kAdd; in CalculateOptimalEdits()1044 for (size_t r_i = 0; r_i < right.size(); ++r_i) { in CalculateOptimalEdits() local1045 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()1047 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()1048 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()1052 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()1053 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()1054 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()[all …]
808 mp_limb_t r_i = in divide() local812 if (r_i > b_i) in divide()814 if (r_i < b_i) in divide()