forked from fernand-o/delphi-better-array
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBetterArray.pas
More file actions
394 lines (336 loc) · 9.11 KB
/
BetterArray.pas
File metadata and controls
394 lines (336 loc) · 9.11 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
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
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
unit BetterArray;
interface
uses
System.Generics.Collections,
System.Generics.Defaults,
System.Rtti,
System.SysUtils;
type
TBetterArray<T> = record
type
TEnumerator = class
private
FValue: ^TBetterArray<T>;
FIndex: integer;
function GetCurrent: T;
public
constructor Create(var AValue: TBetterArray<T>);
function MoveNext: Boolean;
property Current: T read GetCurrent;
end;
private
FItems: TArray<T>;
function GetItem(Index: Integer): T;
function TypeIsClass: Boolean;
function IndexIsValid(Index: Integer): Boolean;
function EmptyValue: T;
function Extract(Func: TFunc<T, Boolean>): TBetterArray<T>;
public
class operator Implicit(AType: TArray<T>): TBetterArray<T>;
class operator Implicit(AType: TBetterArray<T>): string;
class operator Implicit(AType: TBetterArray<T>): TArray<T>;
class operator Implicit(AType: TArray<string>): TBetterArray<T>;
class operator Explicit(AType: TArray<T>): TBetterArray<T>;
function GetEnumerator: TEnumerator;
constructor Create(Values: TArray<T>); overload;
function Add(Value: T): Integer; overload;
procedure Add(Values: TArray<T>); overload;
procedure Clear;
function Contains(Value: T): Boolean;
function Count: Integer;
function Compact: TBetterArray<T>; overload;
function Compact(Items: TBetterArray<T>): TBetterArray<T>; overload;
function Copy: TBetterArray<T>;
function DeleteIf(Func: TFunc<T, Boolean>): TBetterArray<T>;
function First: T;
function FirstIndexOf(Value: T): Integer;
procedure FreeItem(Index: Integer);
procedure FreeAll;
function Get(Index: Integer): T;
function IndexOf(Value: T; const Comparer: IComparer<T>): Integer; overload;
function IndexOf(Value: T): Integer; overload;
function IsEmpty: Boolean;
property Items[Index: Integer]: T read GetItem; default;
function Last: T;
function LastIndexOf(Value: T): Integer; overload;
function LastIndexOf(Value: T; const Comparer: IComparer<T>): Integer; overload;
function Map(Func: TFunc<T, T>): TBetterArray<T>;
function Join(Separator, Before, After: string): string; overload;
function Join(Separator: string = ','): string; overload;
function JoinQuoted(Separator: string = ','; QuoteString: string = ''''): string;
procedure Remove(Index: Integer);
function Reverse: TBetterArray<T>;
function Select(Func: TFunc<T, Boolean>): TBetterArray<T>;
function Sort: TBetterArray<T>; overload;
function Sort(const Comparison: TComparison<T>): TBetterArray<T>; overload;
function ToStrings(Func: TFunc<T, string>): TBetterArray<string>;
function Unique: TBetterArray<T>;
end;
implementation
function TBetterArray<T>.Add(Value: T): Integer;
begin
FItems := FItems + [Value];
Result := Pred(Count);
end;
procedure TBetterArray<T>.Add(Values: TArray<T>);
begin
FItems := FItems + Values;
end;
procedure TBetterArray<T>.Clear;
begin
FItems := [];
end;
function TBetterArray<T>.Compact: TBetterArray<T>;
var
Comparer: IEqualityComparer<T>;
Item: T;
begin
Comparer := TEqualityComparer<T>.Default;
for Item in FItems do
if not Comparer.Equals(Item, EmptyValue) then
Result.Add(Item);
end;
function TBetterArray<T>.Compact(Items: TBetterArray<T>): TBetterArray<T>;
var
Item: T;
Comparer: IEqualityComparer<T>;
begin
Comparer := TEqualityComparer<T>.Default;
for Item in Items do
if not Comparer.Equals(Item, EmptyValue) then
Result.Add(Item);
end;
function TBetterArray<T>.Contains(Value: T): Boolean;
begin
Result := IndexOf(Value) <> -1;
end;
function TBetterArray<T>.Copy: TBetterArray<T>;
var
Item: T;
begin
for Item in FItems do
Result.Add(Item);
end;
function TBetterArray<T>.Count: Integer;
begin
Result := Length(FItems);
end;
constructor TBetterArray<T>.Create(Values: TArray<T>);
begin
Add(Values);
end;
function TBetterArray<T>.DeleteIf(Func: TFunc<T, Boolean>): TBetterArray<T>;
begin
Result := Extract(
function(Item: T): Boolean
begin
Result := Func(Item);
end);
end;
function TBetterArray<T>.EmptyValue: T;
begin
Result := TValue.Empty.AsType<T>;
end;
class operator TBetterArray<T>.Explicit(AType: TArray<T>): TBetterArray<T>;
begin
Result.Create(AType);
end;
function TBetterArray<T>.Extract(Func: TFunc<T, Boolean>): TBetterArray<T>;
var
Empty: T;
begin
Empty := EmptyValue;
Result := Map(
function(Item: T): T
begin
Result := Item;
if Func(Item) then
Result := Empty;
end).Compact;
end;
function TBetterArray<T>.First: T;
begin
Result := Get(0);
end;
function TBetterArray<T>.FirstIndexOf(Value: T): Integer;
begin
Result := IndexOf(Value);
end;
procedure TBetterArray<T>.FreeAll;
var
Item: T;
begin
if not TypeIsClass then
Exit;
for Item in FItems do
TValue.From<T>(Item).AsObject.Free;
end;
procedure TBetterArray<T>.FreeItem(Index: Integer);
begin
if not IndexIsValid(Index) then
Exit;
if TypeIsClass then
TValue.From<T>(FItems[Index]).AsObject.Free;
Remove(Index);
end;
function TBetterArray<T>.Get(Index: Integer): T;
begin
if (Index < 0) or (Index >= Count) then
Exit(EmptyValue);
Result := FItems[Index];
end;
function TBetterArray<T>.GetEnumerator: TEnumerator;
begin
Result := TEnumerator.Create(Self);
end;
function TBetterArray<T>.GetItem(Index: Integer): T;
begin
Result := FItems[Index];
end;
class operator TBetterArray<T>.Implicit(AType: TArray<T>): TBetterArray<T>;
begin
Result.Create(AType);
end;
class operator TBetterArray<T>.Implicit(AType: TBetterArray<T>): string;
begin
Result := AType.Join;
end;
class operator TBetterArray<T>.Implicit(AType: TBetterArray<T>): TArray<T>;
begin
Result := AType.FItems;
end;
function TBetterArray<T>.Last: T;
begin
Result := Get(Pred(Count));
end;
function TBetterArray<T>.LastIndexOf(Value: T; const Comparer: IComparer<T>): Integer;
begin
for Result := High(FItems) downto Low(FItems) do
if Comparer.Compare(FItems[Result], Value) = 0 then
Exit;
Result := -1;
end;
function TBetterArray<T>.LastIndexOf(Value: T): Integer;
begin
Result := LastIndexOf(Value, TComparer<T>.Default);
end;
function TBetterArray<T>.Map(Func: TFunc<T, T>): TBetterArray<T>;
var
Item: T;
begin
for Item in FItems do
Result.Add(Func(Item));
end;
class operator TBetterArray<T>.Implicit(AType: TArray<string>): TBetterArray<T>;
begin
Result.Create(TArray<T>(AType));
end;
procedure TBetterArray<T>.Remove(Index: Integer);
begin
Delete(FItems, Index, 1);
end;
function TBetterArray<T>.Reverse: TBetterArray<T>;
var
I: Integer;
begin
Result.Clear;
for I := High(FItems) downto Low(FItems) do
Result.Add(FItems[I]);
end;
function TBetterArray<T>.Sort: TBetterArray<T>;
begin
Result := Copy;
TArray.Sort<T>(Result.FItems);
end;
function TBetterArray<T>.Select(Func: TFunc<T, Boolean>): TBetterArray<T>;
begin
Result := Extract(
function(Item: T): Boolean
begin
Result := not Func(Item);
end);
end;
function TBetterArray<T>.Sort(const Comparison: TComparison<T>): TBetterArray<T>;
begin
Result := Copy;
TArray.Sort<T>(Result.FItems, TDelegatedComparer<T>.Construct(Comparison));
end;
function TBetterArray<T>.ToStrings(Func: TFunc<T, string>): TBetterArray<string>;
var
Item: T;
begin
for Item in FItems do
Result.Add(Func(Item));
end;
function TBetterArray<T>.IndexIsValid(Index: Integer): Boolean;
begin
Result := (Index >= 0) and (Index < Count);
end;
function TBetterArray<T>.IndexOf(Value: T): Integer;
begin
Result := IndexOf(Value, TComparer<T>.Default);
end;
function TBetterArray<T>.IsEmpty: Boolean;
begin
Result := Count = 0;
end;
function TBetterArray<T>.IndexOf(Value: T; const Comparer: IComparer<T>): Integer;
begin
for Result := Low(FItems) to High(FItems) do
if Comparer.Compare(FItems[Result], Value) = 0 then
Exit;
Result := -1;
end;
function TBetterArray<T>.Join(Separator: string = ','): string;
begin
Result := Join(Separator, '', '');
end;
function TBetterArray<T>.Join(Separator, Before, After: string): string;
const
ItemFmt = '%s%s%s';
var
Item: T;
StrValues: TArray<string>;
begin
for Item in FItems do
StrValues := StrValues + [Format(ItemFmt, [Before, TValue.From<T>(Item).ToString, After])];
Result := ''.Join(Separator, StrValues);
end;
function TBetterArray<T>.JoinQuoted(Separator: string = ','; QuoteString: string = ''''): string;
begin
Result := Join(Separator, QuoteString, QuoteString);
end;
function TBetterArray<T>.TypeIsClass: Boolean;
begin
Result := TRttiContext.Create.GetType(TypeInfo(T)).TypeKind = tkClass
end;
function TBetterArray<T>.Unique: TBetterArray<T>;
var
List: TList<T>;
Item: T;
begin
List := TList<T>.Create;
try
for Item in FItems do
if not List.Contains(Item) then
List.Add(Item);
Result := List.ToArray;
finally
List.Free;
end;
end;
constructor TBetterArray<T>.TEnumerator.Create(var AValue: TBetterArray<T>);
begin
FValue := @AValue;
FIndex := -1;
end;
function TBetterArray<T>.TEnumerator.GetCurrent: T;
begin
Result := FValue^.FItems[FIndex];
end;
function TBetterArray<T>.TEnumerator.MoveNext: Boolean;
begin
Result := FIndex < High(FValue^.FItems);
Inc(FIndex);
end;
end.