У меня есть реализация Списка и Итератора в нем. Такой вопрос: как разбить на два заголовочных файла интерфейс контейнера и списка? Т.Е. чтобы класс итератора был дружественным для класса список. Разбить на 2 части. Помогите
| C++ |
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
| template<class T>
class List
{
private:
class Node
{
public:
Node *next;
Node *prev;
T val;
Node(T node_val):val(node_val){}
Node(){}
~Node(){}
void print_val(){ cout << val << "" << endl; }
};
public:
class iterator
{
private:
friend class List<T>;
Node *the_node;
public:
iterator():the_node(0){}
iterator(Node *dn):the_node(dn){}
iterator(const iterator & it): the_node(it.the_node) {}
iterator& operator=(const iterator& it)
{
the_node = it.the_node;
return *this;
}
bool operator==(const iterator& it) const
{
return (the_node == it.the_node);
}
bool operator!=(const iterator& it) const
{
return !(it == *this);
}
iterator& operator++()
{
if (the_node == 0)
throw "Incremented an empty iterator!";
if (the_node->next == 0)
throw "Tried to increment too far past the end!";
the_node = the_node->next;
return *this;
}
iterator& operator--()
{
if (the_node == 0)
throw "Decremented an empty iterator";
if (the_node->prev == 0)
throw "tried to decrement past the beginning";
the_node = the_node->prev;
return *this;
}
T& operator*() const
{
if (the_node == 0)
throw "Tried to dereference an empty iterator";
return the_node->val;
}
};
private:
Node *head;
Node *tail;
List & operator=(const List &);
List(const List &);
iterator head_iterator;
iterator tail_iterator;
public:
List()
{
head = tail = new Node;
tail->next = 0;
tail->prev = 0;
head_iterator = iterator(head);
tail_iterator = iterator(tail);
}
List(T node_val)
{
head = tail = new Node;
tail->next = 0;
tail->prev = 0;
head_iterator = iterator(head);
tail_iterator = iterator(tail);
add_front(node_val);
}
~List()
{
Node *node_to_delete = head;
for(Node *sn = head; sn != tail; )
{
sn = sn->next;
delete node_to_delete;
node_to_delete = sn;
}
delete node_to_delete;
}
//add int n for counting notes
//override opertor
bool is_empty()
{
return head == tail;
}
iterator get()
{
return tail_iterator;
}
iterator front()
{
return head_iterator;
}
iterator rear()
{
return tail_iterator;
}
/*Node <T>* get()
{
return head;
}*/
void add_front(T node_val)
{
Node *node_to_add = new Node(node_val);
node_to_add->next = head;
node_to_add->prev = nullptr;
head->prev = node_to_add;
head = node_to_add;
head_iterator = iterator(head);
}
void add_rear(T node_val)
{
if(is_empty())
add_front(node_val);
else
{
Node *node_to_add = new Node(node_val);
node_to_add->next = tail;
node_to_add->prev = tail->prev;
tail->prev->next = node_to_add;
tail->prev = node_to_add;
tail_iterator = iterator(tail);
}
}
bool remove_it(iterator & key_i)
{
for (Node *dn = head; dn != tail; dn = dn->next)
{
if (dn == key_i.the_node && dn == head)
{
Node *temp = head->next;
delete head;
temp->prev = NULL;
head = temp; // удаление узла
key_i.the_node = 0;
return true;
}
if (dn == key_i.the_node) // найден узел для удаления
{
dn->prev->next = dn->next;
dn->next->prev = dn->prev;
delete dn; // удаление узла
key_i.the_node = 0;
return true;
}
}
return false;
}
/*bool remove_it(iterator & key_i)
{
Node *dn = head;
while(dn != NULL || dn != key_i.the_node)
{
dn = dn->next;
if(dn == head)
{
head = head->next;
head->prev = NULL;
}
else if (dn == tail)
{
tail = tail->prev;
tail->next = NULL;
}
else
{
dn->prev->next = dn->next;
dn->next->prev = dn->prev;
}
delete dn;
return true;
}
return false;
}*/
iterator find(string node_val) const
{
for( Node *dn = head; dn != tail; dn = dn->next )
{
if (dn->val == node_val)
return iterator(dn);
}
return tail_iterator;
}
int size() const
{
int count = 0;
for(Node *dn = head; dn != tail; dn = dn->next)
++count;
return count;
}
void print() const
{
for(Node *dn = head; dn != tail; dn = dn->next)
dn->print_val();
cout << endl;
}
}; |
|
Я всё сделал, тема закрыта
(
