Lines Matching refs:idx
120 const int idx = index[i];
121 ++rows_[m.rows()[idx] + 1];
122 cols_[i] = m.cols()[idx];
123 values_[i] = m.values()[idx];
167 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
168 y[r] += values_[idx] * x[cols_[idx]];
178 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
179 y[cols_[idx]] += values_[idx] * x[r];
188 for (int idx = 0; idx < rows_[num_rows_]; ++idx) {
189 x[cols_[idx]] += values_[idx] * values_[idx];
196 for (int idx = 0; idx < rows_[num_rows_]; ++idx) {
197 values_[idx] *= scale[cols_[idx]];
207 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
208 (*dense_matrix)(r, cols_[idx]) = values_[idx];
266 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
270 cols_[idx],
271 values_[idx]);
299 for (int idx = rows_[r]; idx < rows_[r + 1] - 1; ++idx) {
300 solution[r] -= values_[idx] * solution[cols_[idx]];
310 for (int idx = rows_[r + 1] - 2; idx >= rows_[r]; --idx) {
311 solution[cols_[idx]] -= values_[idx] * solution[r];
365 for (int idx = 0; idx < num_nonzeros(); ++idx) {
366 ++transpose_rows[cols_[idx] + 1];
374 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
375 const int c = cols_[idx];
378 transpose_values[transpose_idx] = values_[idx];