title: Is there a sorted_vector class, which supports insert() etc.?
body: <p>Often, it is more efficient to use a sorted <code>std::vector</code> instead of a <code>std::set</code>. Does anyone know a library class <code>sorted_vector</code>, which basically has a similar interface to <code>std::set</code>, but inserts elements into the sorted vector (so that there are no duplicates), uses binary search to <code>find</code> elements, etc.?</p>
  
  <p>I know it's not hard to write, but probably better not to waste time and use an existing implementation anyway.</p>
  
  <p><strong>Update:</strong> The reason to use a sorted vector instead of a set is: If you have hundreds of thousands of little sets that contain only 10 or so members each, it is more memory-efficient to just use sorted vectors instead.</p>