Visualization for Code

Hello everyone,

I am having trouble how the code in line number 98 is used in this program.
Can anyone show visualization for this code after instantiation?

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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323

// File: List.h
#ifndef LIST_H // // multiple inclusion guard
#define LIST_H

template <typename Object>
class List
{
private:
	struct Node // private member structure (could be class instead)
	{
		Object data;
		Node* prev;
		Node* next;
		Node(const Object& d = Object(), Node* p = NULL, Node* n = NULL) // constructor
			: data(d), prev(p), next(n) {}
		Node(Object&& d, Node* p = NULL, Node* n = NULL) // move constructor (C++11)
			: data(move(d)), prev(p), next(n) {}
	};

public:
	class const_iterator // **********************************************
	{
	public:
		const_iterator() : current(NULL) {} // default constructor

		const Object& operator*() const // const de-referencing
		{
			return retrieve();
		}

		const_iterator& operator++() // pre-increment
		{
			current = current->next;
			return *this;
		}

		const_iterator operator++(int) // post-increment
		{
			const_iterator old = *this;
			++(*this);
			return old;
		}

		const_iterator& operator--() // pre-decrement
		{
			current = current->prev;
			return *this;
		}

		const_iterator operator--(int) // post-decrement
		{
			const_iterator old = *this;
			--(*this);
			return old;
		}

		bool operator== (const const_iterator& rhs) const
		{
			return current == rhs.current;
		}

		bool operator != (const const_iterator& rhs) const
		{
			return !(*this == rhs);
		}

	protected:
		Node* current;

		Object& retrieve() const
		{
			return current->data;
		}

		const_iterator(Node* p) : current(p) {} // constructor

		friend class List<Object>;
	}; // end class const_iterator // **********************************************

	class iterator : public const_iterator // **************************************
	{
	public:
		iterator() : current(NULL) {} // default constructor

		Object& operator*() // de-referencing
		{
			return retrieve();
		}

		const Object& operator*() const // const de-referencing
		{
			return const_iterator::operator*();
		}

		iterator& operator++() // pre-increment
		{
			current = current->next;
			return *this;
		}

		iterator operator++(int) // post-increment
		{
			iterator old = *this;
			++(*this);
			return old;
		}

		iterator& operator--() // pre-decrement
		{
			current = current->prev;
			return *this;
		}

		iterator operator--(int) // post-decrement
		{
			iterator old = *this;
			--(*this);
			return old;
		}

	private: // we are not expecting to derive from iterator...
		iterator(Node* p) : const_iterator(p) {} // constructor

		friend class List<Object>;
	};// end class iterator // **********************************************

	// back to class List:
public:
	// constructors
	List() // default
	{
		init();
	}

	List(const List& rhs) // copy constructor
	{
		init();
		for (const Object& x : rhs) // range-based for loop (C++11)
			push_back(x);
	}

	List(List&& rhs) // move constructor (C++11)
		: theSize(rhs.theSize), head(rhs.head), tail(rhs.tail)
	{
		rhs.theSize = 0;
		rhs.head = NULL;
		rhs.tail = NULL;
	}

	// destructor
	~List()
	{
		clear();
		delete head;
		head = NULL;
		delete tail;
		tail = NULL;
	}

	// public assignment operator
	List& operator=(const List& rhs)
	{
		if (this != &rhs) // prevent assignment to itself
		{
			this->clear();
			for (const_iterator itr = rhs.begin(); itr != rhs.end(); ++itr)
				this->push_back(*itr);
		}
		return *this;
	}

	iterator begin()
	{
		return iterator(head->next);
	}

	const_iterator begin() const
	{
		return const_iterator(head->next);
	}

	iterator end()
	{
		return iterator(tail);
	}

	const_iterator end() const
	{
		return const_iterator(tail);
	}

	size_t size() const
	{
		return theSize;
	}

	bool empty() const
	{
		return size() == 0;
	}

	void clear()
	{
		while (!empty())
			pop_front();
	}

	Object& front()
	{
		return *begin();
	}

	const Object& front() const
	{
		return *begin();
	}

	Object& back()
	{
		return *--end();
	}

	const Object& back() const
	{
		return *--end();
	}

	void push_front(const Object& x)
	{
		insert(begin(), x);
	}

	void push_back(const Object& x)
	{
		insert(end(), x);
	}

	void pop_front()
	{
		erase(begin());
	}

	void pop_back()
	{
		erase(--end());
	}

	// Insert copy of x on the free store before itr:
	iterator insert(iterator itr, const Object& x)
	{
		Node* p = itr.current;
		theSize++;
		try
		{
			// new Node allocated on the freestore
			p->prev = p->prev->next = new Node(x, p->prev, p);
		}
		// if memory allocation failed:
		catch (...) // executes in case of exception (error)
		{
			cout << "Error encountered... quitting, sorry!\n";
			system("pause");
			exit(EXIT_FAILURE); // quit
		}
		return iterator(p->prev);
	}

	// Erase item at itr:
	iterator erase(iterator itr)
	{
		if (!empty())
		{
			Node* p = itr.current;
			iterator retVal(p->next);
			p->prev->next = p->next;
			p->next->prev = p->prev;
			delete p;
			p = NULL;
			theSize--;
			return retVal;
		}
		else
		{
			cout << "List empty!\n";
			return NULL;
		}
	}

	// Erase items from start to end:
	iterator erase(iterator start, iterator end)
	{
		for (iterator itr = start; itr != end;)
			itr = erase(itr);
		return end;
	}

private:
	size_t theSize;
	Node* head;
	Node* tail;

	void init()
	{
		theSize = 0;
		try
		{
			head = new Node; // on the free store
			tail = new Node; // on the free store
		}
		// if memory allocation failed:
		catch (...) // executes in case of exception (error)
		{
			cout << "Error encountered... quitting, sorry!\n";
			system("pause");
			exit(EXIT_FAILURE); // quit
		}
		head->next = tail;
		tail->prev = head;
	}
};// end class List

#endif 
Last edited on
Hi MiiNiPaa,

thank you so much for your help!

Topic archived. No new replies allowed.