Searched refs:rrow (Results 1 – 5 of 5) sorted by relevance
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) { in compute() local140 typename MatrixType::InnerUpperIterator uIt(m_lu, rrow); in compute()143 uItPivot += (rrow - row - 1); in compute()157 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) { in compute() local162 for (Index i = 0; i < rrow - row - 1; i++) { in compute()163 m_lu.coeffRefLower(rrow, row + i + 1) -= uItPivot.value() * coef; in compute()170 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) { in compute() local173 typename MatrixType::InnerUpperIterator uIt(m_lu, rrow); in compute()176 uItPivot += (rrow - row - 1); in compute()177 m_lu.coeffRefDiag(rrow) -= uItPivot.value() * coef; in compute()[all …]
311 #define rrow(j) _rrow##j in EigenContractionKernelInternal() macro312 Scalar rrow(0); in EigenContractionKernelInternal()313 Scalar rrow(1); in EigenContractionKernelInternal()314 Scalar rrow(2); in EigenContractionKernelInternal()315 Scalar rrow(3); in EigenContractionKernelInternal()316 Scalar rrow(4); in EigenContractionKernelInternal()317 Scalar rrow(5); in EigenContractionKernelInternal()318 Scalar rrow(6); in EigenContractionKernelInternal()319 Scalar rrow(7); in EigenContractionKernelInternal()330 rrow(0) = rhs_element(i, 0); \ in EigenContractionKernelInternal()[all …]
208 typedef struct rrow { struct216 } rrow; typedef229 struct rrow re[1]; /* variable: actual size set by calling malloc */
135 if ((f = (fa *) calloc(1, sizeof(fa) + poscnt*sizeof(rrow))) == NULL) in mkdfa()
430 ltype int to long in struct rrow to reduce some 64-bit804 changed struct rrow (awk.h) to use long instead of int for lval,