| /external/eigen/Eigen/src/SparseCore/ |
| SparseSelfAdjointView.h | 216 typedef typename _Lhs::InnerIterator LhsInnerIterator;
310 for(typename MatrixType::InnerIterator it(mat,j); it; ++it)
340 for(typename MatrixType::InnerIterator it(mat,j); it; ++it)
397 for(typename MatrixType::InnerIterator it(mat,j); it; ++it)
417 for(typename MatrixType::InnerIterator it(mat,j); it; ++it)
|
| ConservativeSparseSparseProduct.h | 48 for (typename Rhs::InnerIterator rhsIt(rhs, j); rhsIt; ++rhsIt)
52 for (typename Lhs::InnerIterator lhsIt(lhs, k); lhsIt; ++lhsIt)
|
| SparseMatrix.h | 227 class InnerIterator;
642 for (typename _OtherCopy::InnerIterator it(otherCopy, j); it; ++it)
661 for (typename _OtherCopy::InnerIterator it(otherCopy, j); it; ++it)
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 66 typename MatType::InnerIterator it(mat,j);
|
| IncompleteLUT.h | 285 typename FactorType::InnerIterator j_it(mat, ii); // Iterate through the current row ii
344 typename FactorType::InnerIterator ki_it(m_lu, minrow);
|
| /external/eigen/test/ |
| sparse_vector.cpp | 47 for (typename SparseVectorType::InnerIterator it(v1); it; ++it,++j)
|
| sparse_product.cpp | 158 for (typename SparseMatrixType::InnerIterator it(mS,k); it; ++it)
|
| /external/eigen/doc/ |
| I16_TemplateKeyword.dox | 104 for (SparseMatrixType::InnerIterator it(mat,k); it; ++it)
117 for (typename SparseMatrix<T>::InnerIterator it(mat,k); it; ++it)
|
| C09_TutorialSparse.dox | 172 In most cases, one only wants to iterate over the non-zeros elements. This is achieved by a standard loop over the outer dimension, and then by iterating over the non-zeros of the current inner vector via an InnerIterator. Thus, the non-zero entries have to be visited in the same order than the storage order.
179 for (SparseMatrix<double>::InnerIterator it(mat,k); it; ++it)
190 for (SparseVector<double>::InnerIterator it(vec); it; ++it)
200 required to indicate that \c InnerIterator denotes a type; see \ref TopicTemplateKeyword for details.
|
| Doxyfile.in | 633 EXCLUDE_SYMBOLS = internal::* Flagged* *InnerIterator* DenseStorage<*
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 91 for (typename SparseMatrixType::InnerIterator it(mS,k); it; ++it)
|
| eigen2_sparse_basic.cpp | 192 for (typename SparseMatrixType::InnerIterator i(m1,j); i; ++i)
|
| /external/eigen/unsupported/test/ |
| sparse_extra.cpp | 125 for (typename SparseMatrixType::InnerIterator i(m1,j); i; ++i)
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 149 for (typename CMatrix::InnerIterator it(C,i); it; ++it)
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| MarketIO.h | 239 for(typename SparseMatrixType::InnerIterator it(mat,j); it; ++it)
|
| RandomSetter.h | 204 for (typename SparseMatrixType::InnerIterator it(*mp_target,j); it; ++it)
|
| /external/nist-sip/java/gov/nist/javax/sip/message/ |
| SIPMessage.java | 293 ListIterator< ? > innerIterator = myHeaders.listIterator();
295 while (innerIterator.hasNext()) {
296 SIPHeader myHeader = (SIPHeader) innerIterator.next();
307 ListIterator<SIPHeader> innerIterator = myHeaders.listIterator();
309 while (innerIterator.hasNext()) {
310 SIPHeader myHeader = (SIPHeader) innerIterator.next();
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Block.h | 105 class InnerIterator;
|
| DenseBase.h | 43 class InnerIterator;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 712 for(typename CholMatrixType::InnerIterator it(ap,k); it; ++it)
773 for(typename MatrixType::InnerIterator it(ap,k); it; ++it)
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 529 for(typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it)
|
