Gator Library
An implementation of the Red-Black Tree and Priority queue data structure in C++.
Loading...
Searching...
No Matches
priority_queue.hpp
Go to the documentation of this file.
1
9#pragma once
10
11#include <vector>
12
13#include "reservation.hpp"
14
16 private:
25 void heapify(int index);
26
27 std::vector<reservation> heap;
29 public:
37 void push(reservation newReservation);
38
45 void pop();
46
56
64 bool empty();
65
73 int size();
74
81
88};
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