| 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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
| ///////////////////////////////////////////////////////////////////////////
// //
// Copyright (c) 2015 by Charta Software B.V. //
// All rights reserved //
// //
// Version: 1.7.0.83525 //
// Web site: https://pascal.chartasoftware.com/ //
// //
// This code and information are provided "as is" without warranty of //
// any kind. Dissemination of this information or reproduction of //
// this material is strictly forbidden unless prior written permission //
// is obtained from Charta Software B.V.. //
// //
///////////////////////////////////////////////////////////////////////////
unit Collection.List;
interface
uses
Boolean,
Collection,
Condition,
Integer._32,
Integer._32.Interval,
Iterator;
type
EList = class(ECollection);
TList<TElement> = class(TCollection<TElement>)
protected
function GetElements(Index: TInteger32): TElement; virtual; abstract;
procedure SetElements(Index: TInteger32; const Value: TElement); virtual; abstract;
function GetFirst(): TElement; virtual;
function GetLast(): TElement; virtual;
// TODO: The following functions are here because FPC currently does not know which version of IndexOf() to call when calling from TObjectList implementation, from outside it goes OK
function IndexOfElement(Element: TElement): TInteger32; virtual; deprecated 'Should be removed once FPC supports the overloaded version of IndexOf()';
function IndexOfCondition(Condition: TCondition<TElement>): TInteger32; virtual; deprecated 'Should be removed once FPC supports the overloaded version of IndexOf()';
public
function Extract(Element: TElement): TElement; overload; override;
function Extract(Condition: TCondition<TElement>): TElement; overload; override;
function Dequeue(): TElement; override;
function Remove(Element: TElement): TBoolean; override;
function Contains(Element: TElement): TBoolean; override;
function CreateIterator(): TIterator<TElement>; override;
procedure AddAt(Index: TInteger32; Element: TElement); virtual; abstract;
function ExtractAt(Index: TInteger32): TElement; virtual; abstract;
function CreateReverseIterator(): TIterator<TElement>; virtual;
procedure AddAllAt(Index: TInteger32; Elements: TCollection<TElement>); virtual;
procedure RemoveAt(Index: TInteger32); virtual;
procedure ExchangeAt(Index1: TInteger32; Index2: TInteger32); virtual;
function CreateSublist(const Range: TInteger32Interval): TList<TElement>;
procedure AddFirst(Element: TElement); virtual;
procedure AddLast(Element: TElement); virtual;
function ExtractFirst(): TElement; virtual;
function ExtractLast(): TElement; virtual;
function RemoveFirst(): TElement; virtual;
function RemoveLast(): TElement; virtual;
procedure RemoveRange(const Range: TInteger32Interval); virtual;
function IndexOf(Element: TElement): TInteger32; overload;
function IndexOf(Condition: TCondition<TElement>): TInteger32; overload;
property First: TElement read GetFirst;
property Last: TElement read GetLast;
property Elements[Index: TInteger32]: TElement read GetElements write SetElements; default;
end;
type
TListIterator<TElement> = class(TIterator<TElement>)
protected
Elements: TList<TElement>;
Index: TInteger32;
function GetCurrent(): TElement; override;
public
constructor Create(Elements: TList<TElement>); virtual;
function IsValid(): TBoolean; override;
procedure GotoNext(); override;
end;
TReverseListIterator<TElement> = class(TIterator<TElement>)
protected
Elements: TList<TElement>;
Index: TInteger32;
function GetCurrent(): TElement; override;
public
constructor Create(Elements: TList<TElement>); virtual;
function IsValid(): TBoolean; override;
procedure GotoNext(); override;
end;
implementation
uses
Collection.List.Sublist,
Exception.NotImplemented,
Iterator.Exception,
Mathematics.Sign;
{ TList<TElement> }
procedure TList<TElement>.AddFirst(Element: TElement);
begin
AddAt(0, Element);
end;
procedure TList<TElement>.AddLast(Element: TElement);
begin
Add(Element);
end;
function TList<TElement>.Contains(Element: TElement): TBoolean;
begin
Result := IndexOfElement(Element) <> -1;
end;
function TList<TElement>.CreateIterator(): TIterator<TElement>;
begin
Result := TListIterator<TElement>.Create(Self);
end;
function TList<TElement>.CreateReverseIterator(): TIterator<TElement>;
begin
Result := TReverseListIterator<TElement>.Create(Self);
end;
function TList<TElement>.CreateSublist(const Range: TInteger32Interval): TList<TElement>;
begin
Result := TSublist<TElement>.Create(Self, Range);
end;
function TList<TElement>.Dequeue(): TElement;
begin
Result := ExtractLast();
end;
procedure TList<TElement>.ExchangeAt(Index1: TInteger32; Index2: TInteger32);
begin
raise ENotSupported.Create(ClassType, 'ExchangeAt');
end;
function TList<TElement>.Extract(Element: TElement): TElement;
var
Index: TInteger32;
begin
Index := IndexOfElement(Element);
if Index <> -1 then
Result := ExtractAt(Index)
else
Result := Unassigned;
end;
function TList<TElement>.Extract(Condition: TCondition<TElement>): TElement;
var
Index: TInteger32;
begin
Index := IndexOfCondition(Condition);
if Index <> -1 then
Result := ExtractAt(Index)
else
Result := Unassigned;
end;
function TList<TElement>.ExtractFirst(): TElement;
begin
Result := ExtractAt(0);
end;
function TList<TElement>.ExtractLast(): TElement;
begin
Result := ExtractAt(Count - 1);
end;
function TList<TElement>.GetFirst(): TElement;
begin
Result := Self[0];
end;
function TList<TElement>.GetLast(): TElement;
begin
Result := Self[Count - 1];
end;
function TList<TElement>.IndexOf(Element: TElement): TInteger32;
begin
Result := IndexOfElement(Element);
end;
function TList<TElement>.IndexOf(Condition: TCondition<TElement>): TInteger32;
begin
Result := IndexOfCondition(Condition);
end;
function TList<TElement>.IndexOfCondition(Condition: TCondition<TElement>): TInteger32;
var
i: TInteger32;
begin
Condition.AddReference();
Result := -1;
i := 0;
while (Result = -1) and (i < Count) do
begin
if Condition.Matches(Self[i]) then
Result := i
else
Inc(i);
end;
Condition.ReleaseReference();
end;
function TList<TElement>.IndexOfElement(Element: TElement): TInteger32;
var
i: TInteger32;
Iterator: TIterator<TElement>;
begin
Result := -1;
i := 0;
Iterator := CreateIterator();
while (Result = -1) and Iterator.IsValid() do
begin
if Comparator.Compare(Iterator.Current, Element) = sZero then
Result := i
else
begin
Iterator.GotoNext();
Inc(i);
end;
end;
Iterator.Free();
end;
procedure TList<TElement>.AddAllAt(Index: TInteger32; Elements: TCollection<TElement>);
var
Element: TElement;
begin
for Element in Elements do
begin
AddAt(Index, Element);
Inc(Index);
end;
end;
function TList<TElement>.Remove(Element: TElement): TBoolean;
var
Index: TInteger32;
begin
Index := IndexOfElement(Element);
Result := Index <> -1;
if Result then
RemoveAt(Index);
end;
procedure TList<TElement>.RemoveAt(Index: TInteger32);
var
Element: TElement;
begin
Element := ExtractAt(Index);
ReleaseElement(Element);
end;
function TList<TElement>.RemoveFirst(): TElement;
begin
Result := ExtractFirst();
ReleaseElement(Result);
end;
function TList<TElement>.RemoveLast(): TElement;
begin
Result := ExtractLast();
ReleaseElement(Result);
end;
procedure TList<TElement>.RemoveRange(const Range: TInteger32Interval);
var
i: TInteger32;
begin
for i := Range.High downto Range.Low do
RemoveAt(i);
end;
{ TListIterator<TElement> }
constructor TListIterator<TElement>.Create(Elements: TList<TElement>);
begin
inherited Create();
Self.Elements := Elements;
end;
function TListIterator<TElement>.GetCurrent(): TElement;
begin
if IsValid() then
Result := Elements[Index]
else
raise EIteratorNotValid.Create();
end;
procedure TListIterator<TElement>.GotoNext();
begin
if IsValid() then
Inc(Index)
else
raise EIteratorPassedEnd.Create();
end;
function TListIterator<TElement>.IsValid(): TBoolean;
begin
Result := Index < Elements.Count;
end;
{ TReverseListIterator<TElement> }
constructor TReverseListIterator<TElement>.Create(Elements: TList<TElement>);
begin
inherited Create();
Self.Elements := Elements;
Index := Elements.Count - 1;
end;
function TReverseListIterator<TElement>.GetCurrent(): TElement;
begin
if IsValid() then
Result := Elements[Index]
else
raise EIteratorNotValid.Create();
end;
procedure TReverseListIterator<TElement>.GotoNext();
begin
if IsValid() then
Dec(Index)
else
raise EIteratorPassedEnd.Create();
end;
function TReverseListIterator<TElement>.IsValid(): TBoolean;
begin
Result := Index >= 0;
end;
end.
|