priority queue with time limit

[charian0920]

hi c++ guru. i need your help... i'm new in hardcore c++ and currently working on a c++ container namely the priority_queue. i don't have problem using the priority_queue itself but i have this additional requirement to also consider the age of the items in the queue. my current implementation only deals with the priority of the items in the queue by overloading the "<" operator. i don't know yet what to do when considering the age of the items in the priority_queue. any help is greatly appreciated... PS: sample code would be a great help... charian

[Paul Conrad]

Try googling...

[Michael Sadlon]

You can make another priority_queue that stores the priority as the time you added the item to the priority_queue. Store a pointer to the same item in both queues? Of course, this is kind of an ugly way of doing it. I recently made a priority_queue that stores pointers to Event objects. Each Event stores the time the event should run, as well as other important information it needs when it runs. I overloaded operator() and operator< to handle comparing the Event->_nTime to another Event->_nTime. Basically I pop the next Event to run (smallest time) and run it when it's time has come. Unfortunately, i don't think that approach will help you. Sounds to me like you want to extend the priority_queue itself to track age of items as well as priorities, which is pretty difficult. Easiest method might be to use two of them like I mentioned above. Maybe some more details on what your program does?