-
Notifications
You must be signed in to change notification settings - Fork 0
/
List.cs
240 lines (208 loc) · 5.3 KB
/
List.cs
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
using System;
namespace DoubleLinkedListLab
{
public class List:ICloneable
{
Node head;
public List()
{
head = new Node();
head.Prev = head;
head.Next = head;
}
public bool isEmpty{
get{
if (this.Count == 0) return true;
return false;
}
}
public void Add(Node pointer){
Node q = Head.Next;
while (q!=Head){
q=q.Next;
}
q.Next = pointer;
pointer.Prev = q;
}
public void Add(int value){
Node q = new Node(value,Head.Prev,Head);
Head.Prev = q;
if (Head.Next = null) Head.Next =q;
}
public void Create(int[] values)
{
if (head != null && values != null)
{
Node node;
for (int i = values.Length - 1; i >= 0; i--)
{
node = new Node(values[i], head, head.Next);
head.Next.Prev = node;
head.Next = node;
}
}
}
public void Create(int[] values, string[] strValues)
{
if (head != null && values != null)
{
Node node;
for (int i = values.Length - 1; i >= 0; i--)
{
node = new Node(values[i], head, head.Next);
head.Next.Prev = node;
head.Next = node;
}
}
}
public void Destroy()
{
head.Next = head;
head.Prev = head;
}
public int Count
{
get
{
if (head != null)
{
Node node = head.Next;
int i = 0;
while (node != head)
{
i++;
node = node.Next;
}
return i;
}
else
return 0;
}
}
public Node Head
{
get
{
return head;
}
}
public Node this[int t]
{
get
{
Node node = head;
for (int i = 0; i <=t; i++)
node = node.Next;
return node;
}
set
{
Node node = head;
for (int i = 0; i <= t; i++)
node = node.Next;
if (node != head)
node = value;
}
}
public System.Collections.Generic.IEnumerator<Node> GetEnumerator()
{
Node buf = head.Next;
while (buf != head)
{
yield return buf;
buf = buf.Next;
}
}
public int IndexOf(Node node)
{
Node buf = head.Next;
int i = 0;
while (buf != head && buf != node)
{
buf = buf.Next;
i++;
}
if (buf == head)
i = -1;
return i;
}
public int IndexOf(int value)
{
Node buf = head.Next;
int i = 0;
while (buf != head && !buf.Info.Equals(value))
{
buf = buf.Next;
i++;
}
if (buf == head)
i = -1;
return i;
}
public void Remove(Node node)
{
Node fnode = head.Next.Next;
while (node != head && fnode != node)
fnode = fnode.Next;
if (fnode == node)
{
fnode.Next.Prev = fnode.Prev;
fnode.Prev.Next = fnode.Next;
}
else
throw new InvalidOperationException("Çàäàííûé óçåë íå ïðèíàäëåæèò ýòîìó ñïèñêó");
}
public void RemoveAt(int index)
{
Node fnode = head;
for (int i = 0; i <= index; i++)
fnode = fnode.Next;
if (fnode != head)
{
fnode.Next.Prev = fnode.Prev;
fnode.Prev.Next = fnode.Next;
}
}
public override string ToString()
{
string s = "";
foreach(Node n in this){
if (n!=null && n!=Head)
s+=n.Info+" ";
else break;
}
if (this.isEmpty){
s = "empty";
}
return s;
}
public virtual object Clone()
{
List listClone = new List();
for (Node node = Head.Next; node != Head; node = node.Next)
listClone.Add(node);
return listClone;
}
public List Clone(bool attemptDeepCopy)
{
List listClone = new List();
if (attemptDeepCopy)
{
Node prev = listClone.Head; // new Head
Node c = Head.Next;
Node q = null;
while (c!=Head){
q = new Node(c.Info,null,null);
q.Prev = prev;
prev.Next = q;
c = c.Next;
prev = prev.Next;
}
q.Next = listClone.Head;
}
else
listClone = (List)this.Clone();
return listClone;
}
}
}