need STL set in insertion order

Question

How to store elements in set in insertion order. for example.

setmyset;

myset.insert(\"stack\");
myset.insert(\"overflow\");

Answer 1

One way is to use two containers, a std::deque to store the elements in insertion order, and another std::set to make sure there are no duplicates.

When inserting an element, check if it's in the set first, if yes, throw it out; if it's not there, insert it both in the deque and the set.

One common scenario is to insert all elements first, then process(no more inserting), if this is the case, the set can be freed after the insertion process.