-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue ADT.h
40 lines (34 loc) · 1.53 KB
/
Queue ADT.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// This is an updated version of code originally
// created by Frank M. Carrano and Timothy M. Henry.
// Copyright (c) 2017 Pearson Education, Hoboken, New Jersey.
/** @file QueueADT.h */
#ifndef QUEUE_ADT_
#define QUEUE_ADT_
template<class T>
class QueueADT
{
public:
/** Sees whether this queue is empty.
@return True if the queue is empty, or false if not. */
virtual bool isEmpty() const = 0;
/** Adds a new entry to the back of this queue.
@post If the operation was successful, newEntry is at the
back of the queue.
@param newEntry The object to be added as a new entry.
@return True if the addition is successful or false if not. */
virtual bool enqueue(const T& newEntry) = 0;
/** Copies the front item of the queue to the passed parameter and removes it from queue
@post If the operation was successful, the front of the queue
would be copied to FrontEntry parameter and removed from the queue.
@return True if the removal is successful or false if not. */
virtual bool dequeue(T& FrontEntry) = 0;
/** Copies the front item of the queue to the passed parameter without removing it from queue
@pre The queue is not empty.
@post The front of the queue has been copied to FrontEntry param , and the
queue is unchanged.
@return The front of the queue. */
virtual bool peek(T& FrontEntry) const = 0;
/** Destroys this queue and frees its memory. */
virtual ~QueueADT() { }
}; // end QueueADT
#endif