diff options
author | 2009-05-18 17:26:01 +0200 | |
---|---|---|
committer | 2009-05-18 17:26:01 +0200 | |
commit | e0832d5d9312d722f488704f1571b7b9780d463e (patch) | |
tree | a44d6fc97797f9d68308f996aacd66d1a5b6028c /Eigen/src/Sparse | |
parent | e3d64cb418c905aa4921cd4391838d11fd24e7dc (diff) |
fix bug reported by Moritz Lenz about random setter
Diffstat (limited to 'Eigen/src/Sparse')
-rw-r--r-- | Eigen/src/Sparse/RandomSetter.h | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/Eigen/src/Sparse/RandomSetter.h b/Eigen/src/Sparse/RandomSetter.h index 839d18449..5f9cbed09 100644 --- a/Eigen/src/Sparse/RandomSetter.h +++ b/Eigen/src/Sparse/RandomSetter.h @@ -45,7 +45,7 @@ template<typename Scalar> struct StdMapTraits * * To use it you need to both define EIGEN_UNORDERED_MAP_SUPPORT and include the unordered_map header file * yourself making sure that unordered_map is defined in the std namespace. - * + * * For instance, with current version of gcc you can either enable C++0x standard (-std=c++0x) or do: * \code * #include <tr1/unordered_map> @@ -151,7 +151,7 @@ template<typename Scalar> struct GoogleSparseHashMapTraits * - \#include <google/dense_hash_map> yourself \b before Eigen/Sparse header * - define EIGEN_GOOGLEHASH_SUPPORT * In the later case the inclusion of <google/dense_hash_map> is made for you. - * + * * \see http://code.google.com/p/google-sparsehash/ */ template<typename SparseMatrixType, @@ -229,7 +229,6 @@ class RandomSetter int prevOuter = -1; for (int k=0; k<m_outerPackets; ++k) { - mp_target->startVec(k); const int outerOffset = (1<<OuterPacketBits) * k; typename HashMapType::iterator end = m_hashmaps[k].end(); for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it!=end; ++it) @@ -314,7 +313,7 @@ class RandomSetter return m_hashmaps[outerMajor][key].value; } - /** \returns the number of non zero coefficients + /** \returns the number of non zero coefficients * * \note According to the underlying map/hash_map implementation, * this function might be quite expensive. |