Re: [Boost-users] Collections versus std::map

Subject: Re: [Boost-users] Collections versus std::map
From: Benson Margulies (bimargulies_at_[hidden])
Date: 2008-10-17 09:51:30

I'm looking at this, and I'm a little bit confused.

Does the mapped_vector iterator visit only the occupied slots, or all
the virtual zeros? If the former, how do I ask it where it is? If the
later, how would I efficiently do the former?

On Thu, Oct 16, 2008 at 4:17 AM, Roman Perepelitsa
<roman.perepelitsa_at_[hidden]> wrote:
> 2008/10/16 Benson Margulies <bimargulies_at_[hidden]>
>>
>> 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.htm
>
> Roman.
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>