#include <Page_Reduced_Reader.hh>
Public Methods | |
bool | operator() (const task_reader_pair_t *const x, const task_reader_pair_t *const y) |
The definition of an STL priority queue is that it uses a function like this one to return true if x < y, and then return the largest element in the queue. By defining this function to return true if x > y, we force the priority queue to return the smallest element in the queue.
Definition at line 53 of file Page_Reduced_Reader.hh.
|
Definition at line 54 of file Page_Reduced_Reader.hh.
00055 {
00056 return (x->second->next_cycle_timestamp() >
00057 y->second->next_cycle_timestamp());
00058 }
|