Is there a sorted_vector class, which supports insert() etc.?
- by Frank
Often, it is more efficient to use a sorted std::vector instead of a std::set. Does anyone know a library class sorted_vector, which basically has a similar interface to std::set, but inserts elements into the sorted vector (so that there are no duplicates), uses binary search to find elements, etc.?
I know it's not hard to write, but probably better not to waste time and use an existing implementation anyway.
