Searched refs:l_i (Results 1 – 2 of 2) sorted by relevance
193 Vector l_i(num_rows); in IncompleteLQFactorization() local198 l_i.setZero(); in IncompleteLQFactorization()200 l_i(j) = RowDotProduct(matrix, i, q, j); in IncompleteLQFactorization()202 DropEntriesAndAddRow(l_i, in IncompleteLQFactorization()
997 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() local998 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()999 best_move[l_i][0] = kRemove; in CalculateOptimalEdits()1007 for (size_t l_i = 0; l_i < left.size(); ++l_i) { in CalculateOptimalEdits() local1009 if (left[l_i] == right[r_i]) { in CalculateOptimalEdits()1011 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()1012 best_move[l_i + 1][r_i + 1] = kMatch; in CalculateOptimalEdits()1016 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()1017 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()1018 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()[all …]