Re: [boost] interest in sorted vector containers?

Though I suppose the sorting could be made lazy without changing the interface. OTOH, for interleaved insertion and lookup would turn to nlogn instead of just n for the insertions in the lazy method, but for that case perhaps the ordinary map's logn is better anyways.

I think that std::map is well suited to the interleaved insertion and lookup use-case, but I think the advantage of having a vmap for the query-intensive situation is an attactive option in many situations. Nigel