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
|
unit AuxLists;
interface
uses Classes;
type
TIntegerList = class(TObject)
private
list: TList;
function GetItem(Index: Integer): Integer;
procedure SetItem(Index: Integer; value: Integer);
function getListCount(): Integer;
public
constructor Create();
destructor Destroy(); override;
property Count: Integer read getListCount;
property Items[Index: Integer]: Integer read GetItem write SetItem; default;
function Add(Item: Integer): Integer;
procedure Delete(Index: Integer);
procedure Clear;
function First: Integer;
function Last: Integer;
procedure Pack;
procedure Sort(Compare: TListSortCompare);
procedure Exchange(Index1, Index2: Integer);
end;
TBooleanList = class(TObject)
private
list: TList;
function GetItem(Index: Integer): Boolean;
procedure SetItem(Index: Integer; value: Boolean);
function getListCount(): Integer;
public
constructor Create();
destructor Destroy(); override;
property Count: Integer read getListCount;
property Items[Index: Integer]: Boolean read GetItem write SetItem; default;
function Add(Item: Boolean): Integer;
procedure Delete(Index: Integer);
procedure Clear;
function First: Boolean;
function Last: Boolean;
procedure Pack;
procedure Sort(Compare: TListSortCompare);
procedure Exchange(Index1, Index2: Integer);
end;
implementation
uses RTLConsts;
//*************************************************
// TIntegerList
//*************************************************
constructor TIntegerList.Create();
begin
list:= TList.Create;
end;
destructor TIntegerList.Destroy();
var i: Integer;
begin
for i:=0 to list.Count-1 do
Dispose(list[i]);
list.Free;
end;
function TIntegerList.getListCount(): Integer;
begin
Result := list.Count;
end;
function TIntegerList.GetItem(Index: Integer) : Integer;
begin
Result := PInteger(list[Index])^;
end;
procedure TIntegerList.SetItem(Index: Integer; value: Integer);
var t: ^Integer;
begin
if ((Index < 0) or (Index >= list.Count)) then
list.Error(@SListIndexError, Index);
if (list[index] <> nil) then
Dispose(list[index]);
new(t);
t^ := value;
list[index] := t;
end;
function TIntegerList.Add(item: Integer) : Integer;
var t: PInteger;
begin
new(t);
t^ := item;
Result := list.add(t);
end;
procedure TIntegerList.Delete(Index: Integer);
var t: PInteger;
begin
if ((Index < 0) or (Index >= list.Count)) then
list.Error(@SListIndexError, Index);
t := list[index];
list.Delete(index);
Dispose(t);
end;
procedure TIntegerList.Clear;
var i : Integer;
begin
//free the memory
for i:=0 to list.Count-1 do
begin
Dispose(list[i]);
end;
list.Clear;
end;
function TIntegerList.First: Integer;
begin
Result := PInteger(list.First)^;
end;
function TIntegerList.Last: Integer;
begin
Result := PInteger(list.Last)^;
end;
procedure TIntegerList.Pack;
begin
list.Pack;
end;
procedure TIntegerList.Sort(Compare: TListSortCompare);
begin
list.Sort(compare);
end;
procedure TIntegerList.Exchange(Index1, Index2: Integer);
begin
list.Exchange(index1,index2);
end;
//*************************************************
// TBooleanList
//*************************************************
constructor TBooleanList.Create();
begin
list:= TList.Create;
end;
destructor TBooleanList.Destroy();
var i: Integer;
begin
for i:=0 to list.Count-1 do
Dispose(list[i]);
list.Free;
end;
function TBooleanList.getListCount(): Integer;
begin
Result := list.Count;
end;
function TBooleanList.GetItem(Index: Integer) : Boolean;
begin
Result := PBoolean(list[Index])^;
end;
procedure TBooleanList.SetItem(Index: Integer; value: Boolean);
var t: ^Boolean;
begin
if ((Index < 0) or (Index >= list.Count)) then
list.Error(@SListIndexError, Index);
if (list[index] <> nil) then
Dispose(list[index]);
new(t);
t^ := value;
list[index] := t;
end;
function TBooleanList.Add(item: Boolean) : Integer;
var t: PBoolean;
begin
new(t);
t^ := item;
Result := list.add(t);
end;
procedure TBooleanList.Delete(Index: Integer);
var t: PBoolean;
begin
if ((Index < 0) or (Index >= list.Count)) then
list.Error(@SListIndexError, Index);
t := list[index];
list.Delete(index);
Dispose(t);
end;
procedure TBooleanList.Clear;
var i : Integer;
begin
//free the memory
for i:=0 to list.Count-1 do
begin
Dispose(list[i]);
end;
list.Clear;
end;
function TBooleanList.First: Boolean;
begin
Result := PBoolean(list.First)^;
end;
function TBooleanList.Last: Boolean;
begin
Result := PBoolean(list.Last)^;
end;
procedure TBooleanList.Pack;
begin
list.Pack;
end;
procedure TBooleanList.Sort(Compare: TListSortCompare);
begin
list.Sort(compare);
end;
procedure TBooleanList.Exchange(Index1, Index2: Integer);
begin
list.Exchange(index1,index2);
end;
end.
|
