-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinkedqueue.h
More file actions
83 lines (69 loc) · 1.73 KB
/
linkedqueue.h
File metadata and controls
83 lines (69 loc) · 1.73 KB
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
//
// linkedqueue.h
// CSS342A Assignment4
//
// Created by Jayda on 11/15/25.
//
#include <iostream>
#include "clinkedlist.h"
#ifndef _LINKEDQUEUE_H_
#define _LINKEDQUEUE_H_
using namespace std;
using namespace clinkedlist;
namespace lqueue {
template <typename T>
class LinkedQueue{
private:
CircleList<T> C;
int n;
public:
LinkedQueue();
~LinkedQueue();
int size() const;
bool empty() const;
const T& front() const; //throw (QueueEmpty);
void enqueue(const T& e);
void dequeue(); // throw (QueueEmpty);
void printQueue() const;
};
template <typename T>
LinkedQueue<T>::LinkedQueue(): C(), n(0) {}
template <typename T>
LinkedQueue<T>::~LinkedQueue(){}
template <typename T>
int LinkedQueue<T>::size() const{
return n;
}
template <typename T>
bool LinkedQueue<T>::empty() const{
return n == 0;
}
template <typename T>
const T& LinkedQueue<T>::front() const{
if (empty()){
cerr << "Front of the queue empty error" << endl;
} //throw QueueEmpty("front of the queue empty");
return C.front();
}
template <typename T>
void LinkedQueue<T>::enqueue(const T& e){
C.add(e);
C.advance();
n++;
}
template <typename T>
void LinkedQueue<T>::dequeue(){
if (empty()){
cerr << "Front of the queue empty error" << endl;
}
C.remove();
n--;
}
template <typename T>
void LinkedQueue<T>::printQueue() const{
if (!empty()){
C.printList();
}
}
} // end of namespace linkedqueue
#endif