-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayFunctions.pas
More file actions
349 lines (223 loc) · 6.56 KB
/
ArrayFunctions.pas
File metadata and controls
349 lines (223 loc) · 6.56 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
unit ArrayFunctions;
interface
uses
SysUtils,
Classes,
Variants,
ArrayTypes,
VariantFunctions;
function AreValuesIncludedByArray(Values: array of Variant; Arr: array of Variant): Boolean; overload;
function ArraySlice(Arr: array of Variant; StartIndex: Integer; Length: Integer = -1): TVariantArray;
function ArrayRest(Arr: array of Variant): TVariantArray;
function ArrayFirstItem(Arr: array of Variant): Variant;
function ArrayLastItem(Arr: array of Variant): Variant;
function ArrayFirsts(Arr: array of Variant): TVariantArray;
function ArrayIntersect(First, Second: array of Variant): TVariantArray;
function StringsToArray(Strings: TStrings): TVariantArray;
function StringArrayToStrings(Strings: array of String): TStrings;
function StringArrayToArray(Strings: array of String): TVariantArray;
function ArrayDiff(Values: array of Variant; SubValues: array of Variant): TVariantArray;
function AreValuesIncludedByArray(Values: array of Variant; Strings: TStrings): Boolean; overload;
function AreValuesIncludedByArray(Values: TStrings; Arr: array of Variant): Boolean; overload;
function AreArraysSame(First: array of Variant; Second: array of Variant): Boolean;
function IsArrayContains(Arr: array of Variant; const Value: Variant): Boolean; overload;
function IsArrayEmpty(Arr: array of Variant): Boolean;
function IndexOf(const Value: Variant; Arr: array of Variant): Integer;
function AreValuesEqual(Values: array of Variant): Boolean; overload;
function NextArrayItem(Items: array of Variant; var Iterator: Integer; var Item: Variant; const EndPos: Integer = -1): Boolean;
implementation
function AreValuesIncludedByArray(Values: array of Variant; Arr: array of Variant): Boolean;
var
Value: Variant;
begin
for Value in Values do begin
if not IsArrayContains(Arr, Value) then begin
Result := False;
Exit;
end;
end;
Result := True;
end;
function AreValuesIncludedByArray(Values: array of Variant; Strings: TStrings): Boolean;
var
Value: Variant;
begin
for Value in Values do begin
if Strings.IndexOf(Value) = -1 then begin
Result := False;
Exit;
end;
end;
Result := True;
end;
function AreValuesIncludedByArray(Values: TStrings; Arr: array of Variant): Boolean;
var
Str: String;
begin
for Str in Values do begin
if not IsArrayContains(Arr, Str) then begin
Result := False;
Exit;
end;
end;
Result := True;
end;
function IsArrayContains(Arr: array of Variant; const Value: Variant): Boolean;
begin
Result := IndexOf(Value, Arr) <> -1;
end;
function IndexOf(const Value: Variant; Arr: array of Variant): Integer;
begin
for Result := Low(Arr) to High(Arr) do
if Arr[Result] = Value then
Exit;
Result := -1;
end;
function AreValuesEqual(Values: array of Variant): Boolean;
var
I: Integer;
CheckValue: Variant;
begin
CheckValue := Variant(Values[0]);
for I := Low(Values) + 1 to High(Values) do begin
if CheckValue <> Values[I] then begin
Result := False;
Exit;
end;
end;
Result := True;
end;
function NextArrayItem(Items: array of Variant; var Iterator: Integer; var Item: Variant; const EndPos: Integer): Boolean;
begin
Result :=
(Iterator >= Low(Items)) and
(Iterator <= High(Items)) and
VarIfThen(EndPos <> -1, Iterator < EndPos, True);
if not Result then Exit;
Item := Items[Iterator];
Inc(Iterator);
end;
function AreArraysSame(First: array of Variant; Second: array of Variant): Boolean;
function _AreArraysSame(First: array of Variant; Second: array of Variant): Boolean;
var
I: Integer;
begin
for I := Low(First) to High(First) do begin
if First[I] <> Second[I] then begin
Result := False;
Exit;
end;
end;
Result := True;
end;
begin
Result := (Length(First) = Length(Second)) and _AreArraysSame(First, Second);
end;
function IsArrayEmpty(Arr: array of Variant): Boolean;
begin
Result := Length(Arr) = 0;
end;
function ArrayDiff(Values: array of Variant; SubValues: array of Variant): TVariantArray;
var
I: Integer;
Value: Variant;
DiffIndex: Integer;
begin
SetLength(Result, Length(Values));
I := 0; DiffIndex := 0;
while NextArrayItem(Values, I, Value) do begin
if not IsArrayContains(SubValues, Value) then
Result[DiffIndex] := Value;
Inc(DiffIndex);
end;
SetLength(Result, DiffIndex);
end;
function ArrayRest(Arr: array of Variant): TVariantArray;
begin
Result := ArraySlice(Arr, 1);
end;
function ArrayFirsts(Arr: array of Variant): TVariantArray;
begin
Result := ArraySlice(Arr, Length(Arr) - 2, 1);
end;
function ArrayFirstItem(Arr: array of Variant): Variant;
begin
Result := Arr[0];
end;
function ArrayLastItem(Arr: array of Variant): Variant;
begin
Result := Arr[Length(Arr) - 1];
end;
function ArraySlice(Arr: array of Variant; StartIndex: Integer; Length: Integer): TVariantArray;
var
ArrLen: Integer;
Value: Variant;
EndPos: Integer;
SliceIndex: Integer;
begin
ArrLen := System.Length(Arr);
if Length < 0 then
Length := ArrLen - StartIndex;
EndPos := StartIndex + Length;
if (Length <= 0) or (StartIndex < 0) or (EndPos > ArrLen) then
begin
Result := nil;
Exit;
end;
SetLength(Result, Length);
SliceIndex := 0;
while NextArrayItem(Arr, StartIndex, Value, EndPos) do begin
Result[SliceIndex] := Value;
Inc(SliceIndex);
end;
end;
function ArrayIntersect(First, Second: array of Variant): TVariantArray;
var
I: Integer;
V: Variant;
IntersectIndex: Integer;
begin
SetLength(
Result,
Integer(
VarIfThen(
Length(First) < Length(Second),
Length(Second),
Length(First)
)
)
);
IntersectIndex := 0;
while NextArrayItem(First, I, V) do begin
if IsArrayContains(Second, V) then begin
Result[IntersectIndex] := V;
Inc(IntersectIndex);
end;
end;
SetLength(Result, IntersectIndex);
end;
function StringsToArray(Strings: TStrings): TVariantArray;
var
I: Integer;
begin
SetLength(Result, Strings.Count);
for I := 0 to High(Result) do
Result[I] := Strings[I];
end;
function StringArrayToArray(Strings: array of String): TVariantArray;
var
I: Integer;
begin
SetLength(Result, Length(Strings));
for I := 0 to High(Result) do
Result[I] := Strings[I];
end;
function StringArrayToStrings(Strings: array of String): TStrings;
var
Str: String;
begin
Result := TStringList.Create;
for Str in Strings do
Result.Add(Str);
end;
end.