school-database-project/ListInterface.h at main · jwheller/school-database-project · 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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
// Jaden Heller
// 2328279
// jaheller@chapman.edu
// CPSC-350-01
// Assignment 6

//Abstract Interface for the doubleLinkedList class
#ifndef LISTINTERFACE_H
#define LISTINTERFACE_H

#include "DoubleLinkedList.h"


template <class T>
class ListInterface{

    public:
    virtual void Append(T data) = 0;
    virtual void Prepend(T data) = 0;
    virtual void InsertAfter(T existingData,T insertData) = 0;
    virtual void Remove(T data) = 0;
    virtual bool Search(T data) = 0;
    virtual void Print() = 0;
    virtual void PrintReverse() = 0;
    virtual void Sort() = 0; //!
    virtual bool IsEmpty() = 0;
    virtual int GetLength() = 0;
};


//implementation of ListInterface
template <class T>
class myList : public ListInterface<T>{

    public:
    myList();
    ~myList();
    DoubleLinkedList<T> *doubleList;
    void Append(T data);
    void Prepend(T data);
    void InsertAfter(T existingData,T insertData);
    void Remove(T data);
    void RemoveFront();
    void RemoveBack();
    bool Search(T data);
    void Print();
    T ReturnAll();
    T ReturnFront();
    T ReturnBack();
    T PopFront();
    void PrintReverse();
    void Sort();
    bool IsEmpty();
    int GetLength();
};

template<class T>
myList<T>::myList(){
    doubleList = new DoubleLinkedList<T>();
}

template<class T>
myList<T>::~myList(){
    delete doubleList;
}

template<class T>
void myList<T>::Append(T data){
    doubleList->insertBack(data);
}

template<class T>
void myList<T>::Prepend(T data){
    doubleList->insertFront(data);
}

template<class T>
void myList<T>::RemoveFront(){
    doubleList->removeFront();
}

template<class T>
void myList<T>::RemoveBack(){
    doubleList->removeBack();
}

template<class T>
T myList<T>::ReturnFront(){
    return doubleList->returnFront();
}

template<class T>
T myList<T>::ReturnBack(){
    return doubleList->returnBack();
}

template<class T>
T myList<T>::PopFront(){
    T frontNode = ReturnFront();
    RemoveFront();
    return frontNode;
}

template<class T>
bool myList<T>::IsEmpty(){
    return doubleList->isEmpty();
}

template<class T>
int myList<T>::GetLength(){
    return doubleList->getSize();
}

template<class T>
void myList<T>::Print(){
    doubleList->print();
}

template<class T>
T myList<T>::ReturnAll(){
    doubleList->returnEachNode();
}

template<class T>
void myList<T>::InsertAfter(T existingData, T insertData){
    doubleList->insertAfter(existingData, insertData);
}

template<class T>
void myList<T>::Remove(T data){
    doubleList->remove(data);
}

template<class T>
bool myList<T>::Search(T data){
    return doubleList->find(data);
}

template<class T>
void myList<T>::PrintReverse(){
    doubleList->printReverse();
}

template<class T>
void myList<T>::Sort(){
    doubleList->sort();
}

#endif