<div dir="ltr">2008/10/16 Benson Margulies <span dir="ltr">&lt;<a href="mailto:bimargulies@gmail.com">bimargulies@gmail.com</a>&gt;</span><br><div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
I&#39;m looking for a fast sparse array that permits ordered traversal of<br>
the occupied slots. std::map is much too slow. boost multi-index with<br>
a sequenced index on an unsigned int is significantly slower even that<br>
the std::map, which isn&#39;t too surprising given the writeup. Is there<br>
something else in boost that fills this space?</blockquote><div><br>Boost.uBLAS has sparse vectors.<br>
<a href="http://www.boost.org/doc/libs/1_36_0/libs/numeric/ublas/doc/vector_sparse.htm">http://www.boost.org/doc/libs/1_36_0/libs/numeric/ublas/doc/vector_sparse.htm</a><br>
<br>
Roman.<br></div></div></div>

