| /external/eigen/test/ |
| D | sparse_block.cpp | 79 VERIFY_IS_APPROX(m.middleRows(i,h), refMat.middleRows(i,h)); in sparse_block()
83 VERIFY_IS_APPROX(m.middleRows(i,h).row(r), refMat.middleRows(i,h).row(r)); in sparse_block()
90 VERIFY_IS_APPROX(m.middleRows(i,h).coeff(r,c), refMat.middleRows(i,h).coeff(r,c)); in sparse_block()
95 if(m.middleRows(i,h).coeff(r,c) != Scalar(0)) in sparse_block()
97 VERIFY_IS_APPROX(m.middleRows(i,h).coeff(r,c), refMat.middleRows(i,h).coeff(r,c)); in sparse_block()
104 VERIFY_IS_APPROX(m.middleRows(i,h).col(c), refMat.middleRows(i,h).col(c)); in sparse_block()
199 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0)); in sparse_block()
210 refMat2.middleRows(j0,n0) = (refMat2.middleRows(j0,n0) + refMat2.middleRows(j1,n0)).eval(); in sparse_block()
|
| D | corners.cpp | 39 COMPARE_CORNER(middleRows(sr,nr), block(sr,0,nr,cols)); in corners()
76 VERIFY_IS_EQUAL((matrix.template middleRows<r>(sr)), (matrix.template block<r,cols>(sr,0))); in corners_fixedsize()
98 …VERIFY_IS_EQUAL((const_matrix.template middleRows<r>(sr)), (const_matrix.template block<r,cols>(sr… in corners_fixedsize()
|
| D | sparse_product.cpp | 192 …VERIFY_IS_APPROX( m4=m2.middleRows(r,1).transpose()*dm5.col(c1).transpose(), refMat4=refMat2.row(r… in sparse_product()
198 VERIFY_IS_APPROX( m4=dm5.col(c1)*m2.middleRows(r,1), refMat4=dm5.col(c1)*refMat2.row(r)); in sparse_product()
|
| /external/eigen/doc/examples/ |
| D | DenseBase_middleRows_int.cpp | 13 cout << "A(2..3,:) =\n" << A.middleRows(2,2) << endl; in main()
|
| D | DenseBase_template_int_middleRows.cpp | 13 cout << "A(1..3,:) =\n" << A.middleRows<3>(1) << endl; in main()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | clustering_ops.cc | 397 auto points_shard = points.middleRows(start_row, num_rows); in Compute()
401 nearest_center_indices.middleRows(start_row, num_rows); in Compute()
403 nearest_center_distances.middleRows(start_row, num_rows); in Compute()
527 centers.middleRows(centers_start, centers_block_size), in FindKNearestCentersBlockwise()
|
| /external/eigen/Eigen/src/plugins/ |
| D | BlockMethods.h | 545 inline RowsBlockXpr middleRows(Index startRow, Index n) in middleRows() function
552 inline ConstRowsBlockXpr middleRows(Index startRow, Index n) const in middleRows() function
575 inline typename NRowsBlockXpr<N>::Type middleRows(Index startRow, Index n = N)
583 inline typename ConstNRowsBlockXpr<N>::Type middleRows(Index startRow, Index n = N) const
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | RealQZ.h | 486 …m_S.template middleRows<3>(k).rightCols(dim-fc).applyHouseholderOnTheLeft(essential2, tau, m_works… in step()
487 …m_T.template middleRows<3>(k).rightCols(dim-fc).applyHouseholderOnTheLeft(essential2, tau, m_works… in step()
515 tmp = essential2.adjoint()*(m_Z.template middleRows<2>(k)); in step()
518 m_Z.template middleRows<2>(k) -= essential2 * (tau*tmp); in step()
|
| /external/eigen/doc/ |
| D | AsciiQuickReference.txt | 72 P.middleRows<rows>(i) // P(i+1:i+rows, :)
73 P.middleRows(i, rows) // P(i+1:i+rows, :)
|
| D | SparseQuickReference.dox | 209 sm1.middleRows(start, numRows); // RO because sm1 is column-major
|
| D | TutorialSparse.dox | 328 sm2.middleRows(i,nrows) = ...;
332 … the col/middleCols methods for a column-major storage, and to the row/middleRows methods for a ro…
|
| /external/eigen/Eigen/src/QR/ |
| D | CompleteOrthogonalDecomposition.h | 479 rhs.middleRows(rank - 1, cols - rank + 1)
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| D | BlockSparseMatrix.h | 185 return m_vec.middleRows(startRow, rowSize);
225 return m_vec.middleRows(startRow, rowSize);
|
| /external/eigen/Eigen/src/SVD/ |
| D | BDCSVD.h | 994 if (m_compU) m_naiveU.middleRows(firstCol, size+1).applyOnTheRight(firstCol, firstCol+i, J);
1036 …if (m_compU) m_naiveU.middleRows(firstColu, size+1).applyOnTheRight(firstColu + i, firstColu + j,…
1038 …if (m_compV) m_naiveV.middleRows(firstRowW, size).applyOnTheRight(firstColW + i, firstColW + j, J…
|