From: Neil Hunt (boost_at_[hidden])
Date: 2005-12-23 19:30:19
Joaquín Mª López Muñoz wrote:
>>I don't understand how the random access part of the index helps with
> The idea is that a sorted random access index can serve as a manual
> replacement for an ordered index, much like sorted std::vectors are
> sometimes suggested as an alternative to std::multisets. Random access
> allows you to efficiently lookup elements with binary search (once the
> index is sorted, of course.) Colum change can be implemented in a
> straightforward manner just by appropriately resorting the ra-index.
> Alas you lose autoupdate --or more precisely, autosort..
Ah, I see. Thanks again for an excellent answer.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk