Michael Marcin wrote:

I have a need for a low memory set. Essentially I want an always sorted unique vector. Is such a wrapper around vector and/or deque available in Boost?

Boost.Interprocess has a sorted vector family (although implements it's own vector to make the container shared memory friendly). Interprocess offers 4 containers: flat_map, flat_multimap, flat_set and flat_multiset. You can download Interprocess from the SVN repository. You can see the code here: http://svn.boost.org/svn/boost/trunk/boost/interprocess/containers/flat_set.... Having an adaptor class that converts a sequence providing random access iterators in an associative container would be a nice addition to Boost, no doubt. Regards, Ion