title: Which STL container should I use for a FIFO?
body: <p>Which STL container would fit my needs best? I basically have a 10 elements wide container in which I continually <code>push_back</code> new elements while <code>pop_front</code> ing the oldest element (about a million time). </p>
  
  <p>I am currently using a <code>std::deque</code> for the task but was wondering if a <code>std::list</code> would be more efficient since I wouldn't need to reallocate itself (or maybe I'm mistaking a <code>std::deque</code> for a <code>std::vector</code>?). Or is there an even more efficient container for my need?</p>
  
  <p>P.S. I don't need random access</p>