HomeSort by relevance Sort by last modified time
    Searched refs:nonZeros (Results 1 - 25 of 41) sorted by null

1 2

  /external/eigen/Eigen/src/SparseCore/
SparseTranspose.h 26 inline Index nonZeros() const { return derived().nestedExpression().nonZeros(); }
SparseBlock.h 72 Index nonZeros() const;
132 // and/or it is not at the end of the nonzeros of the underlying matrix.
138 Index nnz = tmp.nonZeros();
181 matrix.innerNonZeroPtr()[m_outerStart+j] = tmp.innerVector(j).nonZeros();
188 p += tmp.innerVector(k).nonZeros();
219 Index nonZeros() const
233 eigen_assert(nonZeros()>0);
306 Index nonZeros() const
320 eigen_assert(nonZeros()>0);
SparseSparseProductWithPruning.h 42 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
AmbiVector.h 39 Index nonZeros() const;
125 _Index AmbiVector<_Scalar,_Index>::nonZeros() const
ConservativeSparseSparseProduct.h 38 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
SparseMatrixBase.h 158 inline Index nonZeros() const { return derived().nonZeros(); }
SparseVector.h 119 * This insertion might be very costly if the number of nonzeros above \a i is large.
135 inline Index nonZeros() const { return static_cast<Index>(m_data.size()); }
274 for (Index i=0; i<m.nonZeros(); ++i)
MappedSparseMatrix.h 106 inline Index nonZeros() const { return m_nnz; }
SparsePermutation.h 64 sizes[((Side==OnTheLeft) ^ Transposed) ? jp : j] = m_matrix.innerVector(((Side==OnTheRight) ^ Transposed) ? jp : j).nonZeros();
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineMatrixBase.h 122 inline Index nonZeros() const {
123 return derived().nonZeros();
  /external/eigen/Eigen/src/OrderingMethods/
Ordering.h 131 Index nnz = mat.nonZeros();
  /external/eigen/bench/
sparse_randomsetter.cpp 57 << " nnz=" << set1->nonZeros() << std::flush;
100 // << " nnz=" << set1.nonZeros() << "\n";getchar();
109 // << " nnz=" << set1.nonZeros() << "\n";getchar();
118 // << " nnz=" << set1.nonZeros() << "\n";getchar();
sparse_transpose.cpp 59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
sparse_cholesky.cpp 73 std::cout << " nnz: " << sm1.nonZeros() << " => " << chol.matrixL().nonZeros() << "\n";
sparse_product.cpp 155 std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * "
156 << sm2.nonZeros()/(float(sm2.rows())*float(sm2.cols()))*100 << "%\n";
189 std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/(float(m1.rows())*float(m1.cols()))*100 << "% * "
190 << m2.nonZeros()/(float(m2.rows())*float(m2.cols()))*100 << "%\n";
203 // std::cout << sm4.nonZeros() << " == " << sm1.nonZeros() << "\n";
sparse_dense_product.cpp 93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
  /external/eigen/test/eigen2/
eigen2_sparse_vector.cpp 45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
eigen2_sparse_basic.cpp 300 VERIFY(countFalseNonZero+countTrueNonZero == m2.nonZeros());
303 VERIFY(countTrueNonZero==m2.nonZeros());
  /external/eigen/unsupported/Eigen/src/SparseExtra/
BlockOfDynamicSparseMatrix.h 86 Index nonZeros() const
RandomSetter.h 124 * To reach optimal performance, this value should be adjusted according to the average number of nonzeros
216 mp_target->reserve(nonZeros());
308 Index nonZeros() const
  /external/eigen/unsupported/test/
kronecker_product.cpp 31 VERIFY_IS_EQUAL(ab.nonZeros(), 36);
76 VERIFY_IS_EQUAL(ab.nonZeros(), 3*2);
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 142 s << " L: " << ((total+=(m_matrix.cols()+1) * sizeof(int) + m_matrix.nonZeros()*(sizeof(int)+sizeof(Scalar))) >> 20) << "Mb" << "\n";
145 s << " nonzeros: " << ((total+=m_nonZerosPerCol.size() * sizeof(int)) >> 20) << "Mb" << "\n";
166 if(m_matrix.nonZeros()>0) // otherwise L==I
172 if (m_matrix.nonZeros()>0) // otherwise U==I
576 if(Base::m_matrix.nonZeros()>0) // otherwise L==I
587 if (Base::m_matrix.nonZeros()>0) // otherwise I==I
  /external/eigen/test/
sparse_vector.cpp 45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
sparse_basic.cpp 190 VERIFY(j==numext::real(m3.innerVector(j).nonZeros()));
197 VERIFY(j==numext::real(m3.innerVector(j).nonZeros()));
365 VERIFY(countFalseNonZero+countTrueNonZero == m2.nonZeros());
368 VERIFY(countTrueNonZero==m2.nonZeros());
  /external/eigen/unsupported/Eigen/src/KroneckerProduct/
KroneckerTensorProduct.h 131 dst.reserve(m_A.nonZeros() * m_B.nonZeros());

Completed in 615 milliseconds

1 2