Searched refs:setFromTriplets (Results 1 - 6 of 6) sorted by relevance

/external/eigen/doc/special_examples/
H A DTutorial_sparse_example.cpp23 A.setFromTriplets(coefficients.begin(), coefficients.end());
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DConstrainedConjGrad.h94 CINV.setFromTriplets(tripletList.begin(), tripletList.end());
/external/eigen/Eigen/src/SparseCore/
H A DSparseMatrix.h443 void setFromTriplets(const InputIterators& begin, const InputIterators& end);
446 void setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func);
983 m.setFromTriplets(tripletList.begin(), tripletList.end());
993 void SparseMatrix<Scalar,_Options,_StorageIndex>::setFromTriplets(const InputIterators& begin, const InputIterators& end) function in class:Eigen::SparseMatrix
998 /** The same as setFromTriplets but when duplicates are met the functor \a dup_func is applied:
1004 * mat.setFromTriplets(triplets.begin(), triplets.end(), [] (const Scalar&,const Scalar &b) { return b; });
1009 void SparseMatrix<Scalar,_Options,_StorageIndex>::setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func) function in class:Eigen::SparseMatrix
/external/eigen/test/
H A Dsparse_basic.cpp359 // test setFromTriplets
383 m.setFromTriplets(triplets.begin(), triplets.end());
386 m.setFromTriplets(triplets.begin(), triplets.end(), std::multiplies<Scalar>());
389 m.setFromTriplets(triplets.begin(), triplets.end(), [] (Scalar,Scalar b) { return b; });
638 m.setFromTriplets(triplets.begin(), triplets.end());
/external/eigen/unsupported/Eigen/src/SparseExtra/
H A DMarketIO.h184 mat.setFromTriplets(elements.begin(), elements.end());
H A DBlockSparseMatrix.h44 * In any of the previous case, the matrix can be filled by calling setFromTriplets().
631 void setFromTriplets(const InputIterator& begin, const InputIterator& end) function in class:Eigen::BlockSparseMatrix
637 * The best approach is like in SparseMatrix::setFromTriplets()

Completed in 272 milliseconds