33     if (fabs(A[i * N + j]) > fabs(A[i * N + j_max])) j_max = j;  in MaxEntryRow()
50     if (fabs(A[i * N + j]) > max_entry) {  in MaxEntry()
70   if (A_jj_ii != 0.0) {  in CalcRot()
75     if (A_ij != 0.0) {  in CalcRot()
80       if (kappa < 0.0) rotmat_cst[2] = -rotmat_cst[2];  in CalcRot()
127 /// If so, then update max_idx_row for that row.
171     if (i == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
172     else if (fabs(A[w * N + i]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = i;  in ApplyRot()
189     if (j == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
190     else if (fabs(A[w * N + j]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = j;  in ApplyRot()
194     if (j == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
195     else if (fabs(A[w * N + j]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = j;  in ApplyRot()
230   if (sort_criteria == SORT_NONE) return;  in SortRows()
238           if (eval[j] > eval[i_max]) i_max = j;  in SortRows()
241           if (eval[j] < eval[i_max]) i_max = j;  in SortRows()
244           if (fabs(eval[j]) > fabs(eval[i_max])) i_max = j;  in SortRows()
247           if (fabs(eval[j]) < fabs(eval[i_max])) i_max = j;  in SortRows()
262 ///          If the return value is not strictly > 0 then convergence failed.
281   if (calc_evec)  in Diagonalize()
294     // If A[i][j] is small compared to A[i][i] and A[j][j], set it to 0.  in Diagonalize()
295 …if ((A[i * N + i] + A[i * N + j] == A[i * N + i]) && (A[j * N + j] + A[i * N + j] == A[j * N + j])…  in Diagonalize()
300     if (A[i * N + j] == 0.0) break;  in Diagonalize()
304     if (calc_evec) ApplyRotLeft(evec, N, i, j, rotmat_cst);  in Diagonalize()
312   if ((n_iters > max_num_iters) && (N > 1))  // If we exceeded max_num_iters,  in Diagonalize()