Subject: Re: [boost] interprocess with unordered_map
From: Ion GaztaÃ±aga (igaztanaga_at_[hidden])
Date: 2012-03-19 17:28:18
El 18/03/2012 21:07, Joel escribiÃ³:
>> 2012/3/17 Ion GaztaÃ±aga<igaztanaga<at> gmail.com>:
>>> If we want to achieve direct comparison, Boost.Unordered needs to go
>>> Boost.Intrusive or Boost.Multiindex route, and offer additional search
>>> overloads that can find "equivalent keys":
> Olaf van der Spek<ml<at> vdspek.org> writes:
>> That route looks like a good one. Avoiding the need for expensive
>> temps is great.
> Perhaps map and flat_map need this as well? Should bugs be filed?
Yes, please. At least in Boost.Container, as those containers are based
on Boost.Intrusive, implementation should be pretty easy.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk