|
Boost Users : |
From: Joaquín Mª López Muñoz (joaquin_at_[hidden])
Date: 2006-06-09 05:55:54
Prashant Thakre ha escrito:
> Hi,
> > Excuse me, but I don't get what your suggestion or question is.
> > Would you mind rephrasing or elaborating some more?
> > Thank you.
> Wrong choice of words I would say, wasn't trying to suggest anything :(
> I actually wanted to know the type of container best suited in terms of
> performance, insert/lookup operations and memory requirements from the two
> listed below (keys are known only at run-time):
> 1. Composite keys and hashed indices.
> 2. Hashed indices.
>
I don't think composite keys introduce any run-time penalty, so both
scenarios should be pretty much equivalent. On the other hand, scenario
#2 is the only one we have more or less developed in this thread, so
I'd say go for it.
> Regards,
> Prashant Thakre
Thanks for using Boost.MultiIndex,
Joaquín M López Muñoz
Telefónica, Investigación y Desarrollo
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net