title: C+11 Associative Container that keeps insertion order?
body: <p>is there, in the c++ "Standard Library", any "Associative" (i.e. "Key-Value") Container/Data Structure, that has the ability, to preserve order, by order of insertion?</p>
  
  <p>I have seen several topics on this, however, it seems, most before C++11.</p>
  
  <p>Some suggest using "boost::multi_index", but, if at all possible, I would "rather" use standard containers/structures.</p>
  
  <p>I see that C++11 has several, apparently, "unordered" associative containers :<a href="http://en.wikipedia.org/wiki/Unordered_associative_containers_%28C%2B%2B%29">link</a>.</p>
  
  <p>Are any of these, by some way, "configurable", such that they are only sorted by insertion order?</p>
  
  <p>Thanks!</p>
  
  <p>C</p>