Home
last modified time | relevance | path

Searched refs:innerVector (Results 1 – 9 of 9) sorted by relevance

/external/eigen/test/
Dsparse_block.cpp131 VERIFY_IS_APPROX(m2.innerVector(j0), innervec(refMat2,j0)); in sparse_block()
132 …VERIFY_IS_APPROX(m2.innerVector(j0)+m2.innerVector(j1), innervec(refMat2,j0)+innervec(refMat2,j1)); in sparse_block()
134 m2.innerVector(j0) *= Scalar(2); in sparse_block()
165 VERIFY(j==numext::real(m3.innerVector(j).nonZeros())); in sparse_block()
167 VERIFY(j==numext::real(m3.innerVector(j).lastCoeff())); in sparse_block()
172 VERIFY(j==numext::real(m3.innerVector(j).nonZeros())); in sparse_block()
174 VERIFY(j==numext::real(m3.innerVector(j).lastCoeff())); in sparse_block()
177 VERIFY(m3.innerVector(j0).nonZeros() == m3.transpose().innerVector(j0).nonZeros()); in sparse_block()
239 m2.innerVector(i) = m2.innerVector(i) * s1; in sparse_block()
243 m2.innerVector(i) = m2.innerVector(i) * s1; in sparse_block()
[all …]
Dsparse_basic.cpp175 VERIFY_IS_APPROX(m1.innerVector(0).dot(refM2.row(0)), refM1.row(0).dot(refM2.row(0))); in sparse_basic()
177 VERIFY_IS_APPROX(m1.innerVector(0).dot(refM2.col(0)), refM1.col(0).dot(refM2.col(0))); in sparse_basic()
227 VERIFY_RAISES_ASSERT( m1 += m1.innerVector(0) ); in sparse_basic()
228 VERIFY_RAISES_ASSERT( m1 -= m1.innerVector(0) ); in sparse_basic()
229 VERIFY_RAISES_ASSERT( refM1 -= m1.innerVector(0) ); in sparse_basic()
230 VERIFY_RAISES_ASSERT( refM1 += m1.innerVector(0) ); in sparse_basic()
599 VERIFY( static_array[0] || m2.innerVector(static_array[0].outer()).nonZeros() == 0 ); in sparse_basic()
600 VERIFY( static_array[1] || m2.innerVector(static_array[1].outer()).nonZeros() == 0 ); in sparse_basic()
/external/eigen/unsupported/Eigen/src/SparseExtra/
DBlockOfDynamicSparseMatrix.h74 SparseVector<Scalar,IsRowMajor ? RowMajorBit : 0> aux(other.innerVector(j));
/external/eigen/Eigen/src/SparseCore/
DSparseMatrixBase.h356 InnerVectorReturnType innerVector(Index outer);
357 const ConstInnerVectorReturnType innerVector(Index outer) const;
DSparseBlock.h194 StorageIndex nnz_k = internal::convert_index<StorageIndex>(tmp.innerVector(k).nonZeros());
333 typename SparseMatrixBase<Derived>::InnerVectorReturnType SparseMatrixBase<Derived>::innerVector(In… in innerVector() function
340 …ixBase<Derived>::ConstInnerVectorReturnType SparseMatrixBase<Derived>::innerVector(Index outer) co… in innerVector() function
DSparsePermutation.h48 …sizes[((Side==OnTheLeft) ^ Transposed) ? jp : j] = StorageIndex(mat.innerVector(((Side==OnTheRight…
/external/eigen/Eigen/src/IterativeLinearSolvers/
DBasicPreconditioners.h171 RealScalar sum = mat.innerVector(j).squaredNorm(); in factorize()
/external/eigen/doc/
DSparseQuickReference.dox205 sm1.innerVector(outer); // RW
DTutorialSparse.dox332 In addition, sparse matrices expose the SparseMatrixBase::innerVector() and SparseMatrixBase::inner…