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
|
unit dbf_prssupp;
// parse support
{$I dbf_common.inc}
interface
uses
Classes;
type
{TOCollection interfaces between OWL TCollection and VCL TList}
TOCollection = class(TList)
public
procedure AtFree(Index: Integer);
procedure FreeAll;
procedure DoFree(Item: Pointer);
procedure FreeItem(Item: Pointer); virtual;
destructor Destroy; override;
end;
TNoOwnerCollection = class(TOCollection)
public
procedure FreeItem(Item: Pointer); override;
end;
{ TSortedCollection object }
TSortedCollection = class(TOCollection)
public
function Compare(Key1, Key2: Pointer): Integer; virtual; abstract;
function IndexOf(Item: Pointer): Integer; virtual;
procedure Add(Item: Pointer); virtual;
procedure AddReplace(Item: Pointer); virtual;
procedure AddList(Source: TList; FromIndex, ToIndex: Integer);
{if duplicate then replace the duplicate else add}
function KeyOf(Item: Pointer): Pointer; virtual;
function Search(Key: Pointer; var Index: Integer): Boolean; virtual;
end;
{ TStrCollection object }
TStrCollection = class(TSortedCollection)
public
function Compare(Key1, Key2: Pointer): Integer; override;
procedure FreeItem(Item: Pointer); override;
end;
function GetStrFromInt(Val: Integer; const Dst: PChar): Integer;
procedure GetStrFromInt_Width(Val: Integer; const Width: Integer; const Dst: PChar; const PadChar: Char);
{$ifdef SUPPORT_INT64}
function GetStrFromInt64(Val: Int64; const Dst: PChar): Integer;
procedure GetStrFromInt64_Width(Val: Int64; const Width: Integer; const Dst: PChar; const PadChar: Char);
{$endif}
implementation
uses SysUtils;
destructor TOCollection.Destroy;
begin
FreeAll;
inherited Destroy;
end;
procedure TOCollection.AtFree(Index: Integer);
var
Item: Pointer;
begin
Item := Items[Index];
Delete(Index);
FreeItem(Item);
end;
procedure TOCollection.FreeAll;
var
I: Integer;
begin
try
for I := 0 to Count - 1 do
FreeItem(Items[I]);
finally
Count := 0;
end;
end;
procedure TOCollection.DoFree(Item: Pointer);
begin
AtFree(IndexOf(Item));
end;
procedure TOCollection.FreeItem(Item: Pointer);
begin
if (Item <> nil) then
with TObject(Item) as TObject do
Free;
end;
{----------------------------------------------------------------virtual;
Implementing TNoOwnerCollection
-----------------------------------------------------------------}
procedure TNoOwnerCollection.FreeItem(Item: Pointer);
begin
end;
{ TSortedCollection }
function TSortedCollection.IndexOf(Item: Pointer): Integer;
var
I: Integer;
begin
IndexOf := -1;
if Search(KeyOf(Item), I) then
begin
while (I < Count) and (Item <> Items[I]) do
Inc(I);
if I < Count then IndexOf := I;
end;
end;
procedure TSortedCollection.AddReplace(Item: Pointer);
var
Index: Integer;
begin
if Search(KeyOf(Item), Index) then
Delete(Index);
Add(Item);
end;
procedure TSortedCollection.Add(Item: Pointer);
var
I: Integer;
begin
Search(KeyOf(Item), I);
Insert(I, Item);
end;
procedure TSortedCollection.AddList(Source: TList; FromIndex, ToIndex: Integer);
var
I: Integer;
begin
for I := FromIndex to ToIndex do
Add(Source.Items[I]);
end;
function TSortedCollection.KeyOf(Item: Pointer): Pointer;
begin
Result := Item;
end;
function TSortedCollection.Search(Key: Pointer; var Index: Integer): Boolean;
var
L, H, I, C: Integer;
begin
Result := false;
L := 0;
H := Count - 1;
while L <= H do
begin
I := (L + H) div 2;
C := Compare(KeyOf(Items[I]), Key);
if C < 0 then
L := I + 1
else begin
H := I - 1;
Result := C = 0;
end;
end;
Index := L;
end;
{ TStrCollection }
function TStrCollection.Compare(Key1, Key2: Pointer): Integer;
begin
Compare := StrComp(Key1, Key2);
end;
procedure TStrCollection.FreeItem(Item: Pointer);
begin
StrDispose(Item);
end;
// it seems there is no pascal function to convert an integer into a PChar???
// NOTE: in dbf_dbffile.pas there is also a convert routine, but is slightly different
function GetStrFromInt(Val: Integer; const Dst: PChar): Integer;
var
Temp: array[0..10] of Char;
I, J: Integer;
begin
Val := Abs(Val);
// we'll have to store characters backwards first
I := 0;
J := 0;
repeat
Temp[I] := Chr((Val mod 10) + Ord('0'));
Val := Val div 10;
Inc(I);
until Val = 0;
// remember number of digits
Result := I;
// copy value, remember: stored backwards
repeat
Dst[J] := Temp[I-1];
Inc(J);
Dec(I);
until I = 0;
// done!
end;
// it seems there is no pascal function to convert an integer into a PChar???
procedure GetStrFromInt_Width(Val: Integer; const Width: Integer; const Dst: PChar; const PadChar: Char);
var
Temp: array[0..10] of Char;
I, J: Integer;
NegSign: boolean;
begin
{$I getstrfromint.inc}
end;
{$ifdef SUPPORT_INT64}
procedure GetStrFromInt64_Width(Val: Int64; const Width: Integer; const Dst: PChar; const PadChar: Char);
var
Temp: array[0..19] of Char;
I, J: Integer;
NegSign: boolean;
begin
{$I getstrfromint.inc}
end;
function GetStrFromInt64(Val: Int64; const Dst: PChar): Integer;
var
Temp: array[0..19] of Char;
I, J: Integer;
begin
Val := Abs(Val);
// we'll have to store characters backwards first
I := 0;
J := 0;
repeat
Temp[I] := Chr((Val mod 10) + Ord('0'));
Val := Val div 10;
Inc(I);
until Val = 0;
// remember number of digits
Result := I;
// copy value, remember: stored backwards
repeat
Dst[J] := Temp[I-1];
inc(J);
dec(I);
until I = 0;
// done!
end;
{$endif}
end.
|