HomeSort by relevance Sort by last modified time
    Searched defs:nonZeros (Results 1 - 10 of 10) sorted by null

  /external/eigen/Eigen/src/SparseCore/
SparseTranspose.h 31 inline Index nonZeros() const { return derived().nestedExpression().nonZeros(); }
AmbiVector.h 39 Index nonZeros() const;
129 Index AmbiVector<_Scalar,_StorageIndex>::nonZeros() const
SparseCompressedBase.h 56 inline Index nonZeros() const
59 return derived().nonZeros();
114 const Map<const Array<Scalar,Dynamic,1> > coeffs() const { eigen_assert(isCompressed()); return Array<Scalar,Dynamic,1>::Map(valuePtr(),nonZeros()); }
126 Map<Array<Scalar,Dynamic,1> > coeffs() { eigen_assert(isCompressed()); return Array<Scalar,Dynamic,1>::Map(valuePtr(),nonZeros()); }
163 m_end = mat.nonZeros();
176 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_id(0), m_end(mat.nonZeros())
223 m_id = mat.nonZeros();
236 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_start(0), m_id(mat.nonZeros())
292 return m_matrix->nonZeros();
SparseMap.h 86 /** \copydoc SparseCompressedBase::nonZeros */
87 inline Index nonZeros() const { return m_zero_nnz[1]; }
SparseBlock.h 42 Index nonZeros() const
125 // and/or it is not at the end of the nonzeros of the underlying matrix.
132 Index nnz = tmp.nonZeros();
194 StorageIndex nnz_k = internal::convert_index<StorageIndex>(tmp.innerVector(k).nonZeros());
259 eigen_assert(Base::nonZeros()>0);
437 Index nonZeros() const { return Dynamic; }
489 Index nnz = m_block.nonZeros();
SparseVector.h 123 * This insertion might be very costly if the number of nonzeros above \a i is large.
140 inline Index nonZeros() const { return m_data.size(); }
334 for (Index i=0; i<m.nonZeros(); ++i)
431 return m_matrix->nonZeros();
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineMatrixBase.h 122 inline Index nonZeros() const {
123 return derived().nonZeros();
  /external/eigen/Eigen/src/Core/
DenseBase.h 210 inline Index nonZeros() const { return size(); }
  /external/eigen/unsupported/Eigen/src/SparseExtra/
DynamicSparseMatrix.h 29 * decrease as the number of nonzeros per inner-vector increase. In practice, we observed very good performance
30 * till about 100 nonzeros/vector, and the performance remains relatively good till 500 nonzeros/vectors.
122 Index nonZeros() const
190 /** Suppress all nonzeros which are smaller than \a reference under the tolerence \a epsilon */
383 Index nonZerosEstimate() const { return m_matrix->nonZeros(); }
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

Completed in 73 milliseconds