-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathList.h
More file actions
107 lines (59 loc) · 1.17 KB
/
List.h
File metadata and controls
107 lines (59 loc) · 1.17 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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#pragma once
template <typename T>
class Node{
public:
T info;
Node *Next,*Prev;
};
template <typename T>
class List{
public:
Node<T> *Head,*Tail;
class Iterator{
friend List<T>;
Node<T> *P;
public:
Iterator(Node<T> *p = NULL): P(p){};
const T& operator *() const{
return P->info;
};
T& operator *(){
return P->info;
};
Iterator operator ++(){
P = P->Next;
return *this;
};
Iterator operator ++(int){
P = P->Next;
return *this;
};
Iterator operator --(){
P = P->prev;
return *this;
};
Iterator operator --(int){
P = P->Prev;
return *this;
};
Iterator operator-> (){
return P;
}
friend bool operator !=(const Iterator& x, const Iterator& y){
return x.P != y.P;
};
friend bool operator ==(const Iterator& x, const Iterator& y){
return x.P == y.P;
};
};
List():Head(NULL),Tail(NULL){}
~List();
Iterator begin()const{
return Iterator(Head);
};
Iterator end()const{
return Iterator(Tail);
};
void Show();
void Add(T info);
};