-
Notifications
You must be signed in to change notification settings - Fork 0
/
list_iterator.hh
80 lines (62 loc) · 1.35 KB
/
list_iterator.hh
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
#include "list_node.hh"
#ifndef LIST_ITERATOR_HH
#define LIST_ITERATOR_HH
template <class T>
class ListIterator
{
ListNode<T> *node;
public:
ListIterator(ListNode<T> *node);
T *item();
void next();
void previous();
bool in_range();
template <class t>
friend bool operator==(const ListIterator<t> &p, const ListIterator<t> &q);
template <class t>
friend bool operator!=(const ListIterator<t> &p, const ListIterator<t> &q);
};
template <class T>
ListIterator<T>::ListIterator(ListNode<T> *node)
{
this->node = node;
}
template <class T>
T *ListIterator<T>::item()
{
if (this->node)
{
return this->node->get_data();
}
return nullptr;
}
template <class T>
void ListIterator<T>::next()
{
this->node and (this->node = this->node->get_next());
}
template <class T>
void ListIterator<T>::previous()
{
this->node and (this->node = this->node->get_previous());
}
template <class T>
bool ListIterator<T>::in_range()
{
return this->node != nullptr;
}
template <class t>
bool operator==(const ListIterator<t> &p, const ListIterator<t> &q)
{
if (not p.node and not q.node)
{
return true;
}
return not p.node or not q.node ? false : *p.node == *q.node;
}
template <class t>
bool operator!=(const ListIterator<t> &n, const ListIterator<t> &p)
{
return not(n == p);
}
#endif