Boost logo

Boost :

From: Stefan Slapeta (stefan_at_[hidden])
Date: 2004-09-06 04:47:54

Hi all,

I'm looking for an associative container which is optimized for one-time
insertion and avoids much of the overhead of std::map therefore. IIRC
Andrei once published something like this: a vector of pairs that was
sorted once and accessed by binary search.

Is there something similar in boost?


Boost list run by bdawes at, gregod at, cpdaniel at, john at