cpp-tour/template_specialization.cpp at master · chenthillrulz/cpp-tour · 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
#include <iostream>
#include <stdlib.h>
#include <time.h>
#include <string>

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;
}

template<typename T>
class DLinkedList<T*>
{
	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<string *> dList;

	// Initialize random seed
	srand(time(NULL));

	for (int i = 1; i < NumElements; i++) {
		int val = rand () % dataLimit;
		string *s = new string(to_string(val)); // to_string -> c++11
		dList.push_back (s);
	}

	dList.display();

	std::cout << "Demonstrating class templates" << std::endl;
}