OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:nonZeros
(Results
1 - 25
of
42
) sorted by null
1
2
/external/eigen/doc/snippets/
SparseMatrix_coeffs.cpp
7
cout << "it has " << A.
nonZeros
() << " stored non zero coefficients that are: " << A.coeffs().transpose() << endl;
/external/eigen/Eigen/src/SparseCore/
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
();
SparseTranspose.h
31
inline Index
nonZeros
() const { return derived().nestedExpression().
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
();
AmbiVector.h
39
Index
nonZeros
() const;
129
Index AmbiVector<_Scalar,_StorageIndex>::
nonZeros
() const
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
();
SparsePermutation.h
48
sizes[((Side==OnTheLeft) ^ Transposed) ? jp : j] = StorageIndex(mat.innerVector(((Side==OnTheRight) ^ Transposed) ? jp : j).
nonZeros
());
/external/eigen/test/
sparse_basic.cpp
164
Index m1_nnz = m1.
nonZeros
();
172
VERIFY_IS_EQUAL(m4.
nonZeros
(), m1_nnz);
218
VERIFY_IS_EQUAL(m1.
nonZeros
(), m1_nnz);
220
VERIFY_IS_EQUAL(m1.
nonZeros
(), m1_nnz);
236
VERIFY_IS_EQUAL(m1.
nonZeros
(), m1_nnz);
239
VERIFY_IS_EQUAL(m1.
nonZeros
(), m1_nnz);
242
VERIFY_IS_EQUAL(m1.
nonZeros
(), m1_nnz);
245
VERIFY_IS_EQUAL(m1.
nonZeros
(), m1_nnz);
269
VERIFY_IS_EQUAL(mb3.
nonZeros
(), (refM1.real().template cast<bool>() && refM2.real().template cast<bool>()).count());
351
VERIFY(countFalseNonZero+countTrueNonZero == m2.
nonZeros
());
[
all
...]
sparse_product.cpp
110
VERIFY_IS_EQUAL( (As*As.transpose()).eval().
nonZeros
(), 4);
111
VERIFY_IS_EQUAL( (Ad*Ad.transpose()).eval().sparseView().eval().
nonZeros
(), 2);
112
VERIFY_IS_EQUAL( (As*As.transpose()).pruned(1e-6).eval().
nonZeros
(), 2);
175
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count());
177
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count());
181
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count());
183
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count());
187
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count());
191
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count());
193
VERIFY_IS_EQUAL(m4.
nonZeros
(), (refMat4.array()!=0).count())
[
all
...]
sparse_block.cpp
165
VERIFY(j==numext::real(m3.innerVector(j).
nonZeros
()));
172
VERIFY(j==numext::real(m3.innerVector(j).
nonZeros
()));
177
VERIFY(m3.innerVector(j0).
nonZeros
() == m3.transpose().innerVector(j0).
nonZeros
());
206
VERIFY(m2.innerVectors(j0,n0).
nonZeros
() == m2.transpose().innerVectors(j0,n0).
nonZeros
());
262
if(m2.
nonZeros
()>0)
285
if(m3.
nonZeros
()>0)
sparse_solvers.cpp
65
MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.
nonZeros
(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
sparse_vector.cpp
45
VERIFY(int(nonzerocoords.size()) == v1.
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
134
StorageIndex nnz = StorageIndex(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/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
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
(); }
/external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h
145
s << " L: " << ((total+=(m_matrix.cols()+1) * sizeof(int) + m_matrix.
nonZeros
()*(sizeof(int)+sizeof(Scalar))) >> 20) << "Mb" << "\n";
148
s << "
nonzeros
: " << ((total+=m_nonZerosPerCol.size() * sizeof(int)) >> 20) << "Mb" << "\n";
169
if(m_matrix.
nonZeros
()>0) // otherwise L==I
175
if (m_matrix.
nonZeros
()>0) // otherwise U==I
602
if(Base::m_matrix.
nonZeros
()>0) // otherwise L==I
613
if (Base::m_matrix.
nonZeros
()>0) // otherwise I==I
/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/PaStiXSupport/
PaStiXSupport.h
104
for(i = 0; i < mat.
nonZeros
(); ++i)
119
for(i = 0; i < mat.
nonZeros
(); ++i)
Completed in 621 milliseconds
1
2