HomeSort by relevance Sort by last modified time
    Searched refs:setFromTriplets (Results 1 - 6 of 6) sorted by null

  /external/eigen/doc/special_examples/
Tutorial_sparse_example.cpp 23 A.setFromTriplets(coefficients.begin(), coefficients.end());
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
ConstrainedConjGrad.h 94 CINV.setFromTriplets(tripletList.begin(), tripletList.end());
  /external/eigen/Eigen/src/SparseCore/
SparseMatrix.h 443 void setFromTriplets(const InputIterators& begin, const InputIterators& end);
446 void setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func);
    [all...]
  /external/eigen/test/
sparse_basic.cpp 359 // 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/
MarketIO.h 184 mat.setFromTriplets(elements.begin(), elements.end());
BlockSparseMatrix.h 44 * In any of the previous case, the matrix can be filled by calling setFromTriplets().
631 void setFromTriplets(const InputIterator& begin, const InputIterator& end)
637 * The best approach is like in SparseMatrix::setFromTriplets()
    [all...]

Completed in 456 milliseconds