Accessing Struct Data in a Queue

[oudavid1]

I have a queue of structs. I would like to access one of the two pieces of data at the front of the queue that each struct maintains.

Here is some of my code:

#include <iostream>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <queue> 
using namespace std;

struct Customer
{
	int time;
	int priority;
}cust;

queue <Customer> lane1;
queue <Customer> lane2;

What I am asking is how do I get the priority of the struct item at the front (lane1.front()), in this case?

[xkcd83]

Create a linked list, and access tail pointer as front if you add to head, or head pointer as front if you add to tail.
I don't know if your question meant something different though.

[oudavid1]

There is no way to do it without using a linked list?

[xkcd83]

A dynamic array should work too.

[oudavid1]

Im still confused. You mean keep a parallel list to the queue and use that?

[xkcd83]

Sorry, I did not realize you were already using the std::queue.

To access an element, use
lane1.front()->priority

[oudavid1]

Ok, that makes sense. But I got this error on that code:

expression must have pointer type

[Michaela Elise]

all you did, at least in the above code, is declare the queue. You must add things to it before you can access them.

Oh and if your queue is Customer then use . else Customer* then use ->

lane1[0].priority; //me thinks

[oudavid1]

I think that works. I could have sworn I tried that originally but I mist have spelled something wrong. Thank you. Have a great day!