ListStackQueue/Queue.hpp at main · ShabazzKing/ListStackQueue · GitHub

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
#ifndef QUEUE_HPP
#define QUEUE_HPP
#include "List.hpp"

template <typename T>
class Queue
{
private:
    List<T> internal_list;
public:
    class NoElement {};
    void clear();
    bool is_empty() const;
    unsigned long size() const;
    T front() const;
    void enqueue(const T &);
    void dequeue();
    void print() const;
};

template <typename T>
void Queue<T>::clear()
{
    internal_list.clear();
}

template <typename T>
bool Queue<T>::is_empty() const
{
    return internal_list.is_empty();
}

template <typename T>
unsigned long Queue<T>::size() const
{
    return internal_list.size();
}

template <typename T>
T Queue<T>::front() const
{
    T value;
    try
    {
        value = internal_list.front();
    }
    catch (typename List<T>::NoElement)
    {
        throw NoElement();
    }
    return value;
}

template <typename T>
void Queue<T>::enqueue(const T & value)
{
    internal_list.push_back(value);
}

template <typename T>
void Queue<T>::dequeue()
{
    try
    {
        internal_list.pop_front();
    }
    catch (typename List<T>::NoElement)
    {
        throw NoElement();
    }
}

template <typename T>
void Queue<T>::print() const
{
    internal_list.print_forwards();
}

#endif