I want to implement a FIFO memory so I need a queue. Sometimes I need to iterate over the FIFO to remove a subset of elements. The queue of STL does not allow to use iterators. So I think about a list or a set. I want that the elements in the memory are stored by maintaining the arrival order.
Do you have a better suggestions?