27 std::vector<reservation>
heap;
A priority queue implementation for reservations.This class represents a priority queue that stores r...
Definition priority_queue.hpp:15
reservation top()
Get the highest priority reservation from the priority queue.
Definition priority_queue.cpp:101
std::vector< reservation > heap
Definition priority_queue.hpp:27
void heapify(int index)
Heapify the heap starting from the given index.
Definition priority_queue.cpp:8
bool empty()
Check if the priority queue is empty.
Definition priority_queue.cpp:106
void pop()
Remove the highest priority reservation from the priority queue.
Definition priority_queue.cpp:82
void push(reservation newReservation)
Push a new reservation into the priority queue.
Definition priority_queue.cpp:52
~pq_reservation()
Destroy the pq_reservation object.
Definition priority_queue.cpp:121
pq_reservation()
Construct a new pq_reservation object.
Definition priority_queue.cpp:116
int size()
Get the size of the priority queue.
Definition priority_queue.cpp:111
The reservation class stores the priority number, patron id, and the time of reservation.
Definition reservation.hpp:15