Queueing

I am working on making a fifo and i've been using 2-d vectors as my storage but recently i have been thinking that queue's would be better but i feel like they are lacking some essential features that vectors have. If I were to use queues I would want to be able to make them 2-d and I would want to be able to look at their content without deleting the content i.e
1
2
cout << " " << myqueue.front();
    myqueue.pop();
Standard container std::queue is a container adapter. Maybe you need std::list?
Lists seem more like what i need. Although 2d lists seems more complicated to fill and printout than 2d vectors. Is there any information on using 2d lists. or a list nested in a vector.
Topic archived. No new replies allowed.