16 Oct
2008
16 Oct
'08
8:17 a.m.
2008/10/16 Benson Margulies
I'm looking for a fast sparse array that permits ordered traversal of the occupied slots. std::map is much too slow. boost multi-index with a sequenced index on an unsigned int is significantly slower even that the std::map, which isn't too surprising given the writeup. Is there something else in boost that fills this space?
Boost.uBLAS has sparse vectors. http://www.boost.org/doc/libs/1_36_0/libs/numeric/ublas/doc/vector_sparse.ht... Roman.