Gator Library
An implementation of the Red-Black Tree and Priority queue data structure in C++.
Loading...
Searching...
No Matches
reservation.hpp
Go to the documentation of this file.
1
2#pragma once
3
4#include <string>
5#include <queue>
6
7using namespace std;
8
15{
16private:
17 /* data */
18public:
29 reservation(int patronId, int priorityNumber);
30};
31
36{
37private:
38 /* data */
39public:
48 {
50 {
51 return true;
52 }
53 else if (a.PriorityNumber == b.PriorityNumber)
54 {
56 {
57 return true;
58 }
59 else
60 {
61 return false;
62 }
63 }
64 else
65 {
66 return false;
67 }
68 }
69};
The Compare class is used as a comparison function for the reservation class.
Definition reservation.hpp:36
bool operator()(reservation a, reservation b)
Overloaded function call operator to compare two reservations.
Definition reservation.hpp:47
The reservation class stores the priority number, patron id, and the time of reservation.
Definition reservation.hpp:15
int PatronId
Definition reservation.hpp:19
int PriorityNumber
Definition reservation.hpp:20
string TimeOfReservation
Definition reservation.hpp:21