El 22/08/2011 13:37, Lars Viklund escribió:
Hi list.
I was asked today why the std::map container didn't have templated versions of functions like find, lower_bound, and so on. I could not give a good answer on why there could not exist such a thing, assuming that the comparator had sufficient symmetric overloads for the real Key type and the FauxKey that the query would be performed with.
Because no-one has requested it ;-)
Would something like this be possible to add to Boost.Containers, considering that going through the typical standard routes would have a latency of a couple years at best? I'm told that the Boost.Intrusive containers already supports this.
I plan to implement extensions if they are useful. Boost.Container associative containers lie above Boost.Intrusive, which already supports this, so it wouldn't be difficult to implement. Best, Ion