-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathclass_templates.cpp
More file actions
88 lines (69 loc) · 1.3 KB
/
class_templates.cpp
File metadata and controls
88 lines (69 loc) · 1.3 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
84
85
86
87
88
#include <iostream>
#include <stdlib.h>
#include <time.h>
using namespace std;
//Use const instead of macros
const int NumElements = 27;
const int dataLimit = 97;
template<typename T>
class DLinkedList;
template<typename T>
ostream & operator<< (ostream &out, DLinkedList<T> &dList);
template <typename T>
struct Node
{
T data;
Node *next;
Node *prev;
Node ():next(NULL), prev(NULL), data(0)
{
}
Node (T cdata):prev(NULL), next(NULL), data(cdata)
{
}
};
template<typename T>
class DLinkedList
{
public:
DLinkedList ():head(NULL), tail(NULL)
{}
void push_back (T data);
void display ();
private:
Node<T> *head;
Node<T> *tail;
};
template<typename T>
void DLinkedList<T>::push_back (T data)
{
Node<T> *toIns = new Node<T> (data);
if (head == NULL)
head = tail = toIns;
else {
tail->next = toIns;
tail = tail->next;
}
}
template<typename T>
void DLinkedList<T>::display ()
{
cout << "Printing the Linked List " << endl;
Node<T> *current = head;
while (current) {
cout << current->data << " ";
current = current->next;
}
cout << endl << "Done " << endl;
}
int main ()
{
DLinkedList<int> dList;
// Initialize random seed
srand(time(NULL));
for (int i = 1; i < NumElements; i++) {
int val = rand () % dataLimit;
dList.push_back (val);
}
dList.display ();
}