From: Caleb Epstein (caleb.epstein_at_[hidden])
Date: 2005-11-15 00:16:22
On 11/14/05, Joaquín Mª López Muñoz <joaquin_at_[hidden]> wrote:
> you can start playing with them very easily. My requests:
> * Do you find these indices worth including in Boost.MultiIndex?
I have yet to use Boost.MultiIndex, but I have enjoyed reading the excellent
documentation and have meant to find a use for it in my own code. This might
just be the feature I need to try it.
* If so, do you have comments on the specification? Things you'd
> change/add? There's a list of concrete issues at the end of the
> specification page,
Re: capacity/reserve. I think it might be useful to include these methods
and have them operate on the key array as you suggest. Your argument against
them is that they are only used to ensure iterator validity. But wouldn't
these methods also be useful in optimizing container load time, as they are
for std::vector and friends? I know I always call "reserve" on a vector when
I know how much data I'm going to load into it ahead of time.
* Do you envision any interesting use case for random access indices?
> Have you experimented with them?
I have an insertion-order traversal hash table that I use in a situation
where MultiIndex + Random Access Iterators might provide a very compelling
replacement, and I am eager to try it.
Thank you very much for your feddback,
Hope this helps,
-- Caleb Epstein caleb dot epstein at gmail dot com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk