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
|
{
This file is part of the Free Pascal run time library.
Copyright (c) 1999-2000 by Carl-Eric Codere,
member of the Free Pascal development team.
See the file COPYING.FPC, included in this distribution,
for details about the copyright.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
**********************************************************************}
{$ifndef FPC_UNIT_HAS_STREND}
Function StrEnd(P: PChar): PChar;
var
counter: SizeInt;
begin
counter := 0;
if not Assigned(P) then
StrEnd:=Nil
else
begin
while P[counter] <> #0 do
Inc(counter);
StrEnd := @(P[Counter]);
end;
end;
{$endif FPC_UNIT_HAS_STREND}
{$ifndef FPC_UNIT_HAS_STRCOPY}
{ Beware, the naive implementation (copying bytes forward until zero
is encountered) will end up in undefined behavior if source and dest
happen to overlap. So do it in a bit more reliable way.
Also this implementation should not need per-platform optimization,
given that IndexByte and Move are optimized. }
Function StrCopy(Dest, Source:PChar): PChar;
var
counter : SizeInt;
Begin
counter := IndexByte(Source^,-1,0);
{ counter+1 will move zero terminator }
Move(Source^,Dest^,counter+1);
StrCopy := Dest;
end;
{$endif FPC_UNIT_HAS_STRCOPY}
{$ifndef FPC_UNIT_HAS_STRUPPER}
function StrUpper(P: PChar): PChar;
var
counter: SizeInt;
begin
counter := 0;
while (P[counter] <> #0) do
begin
if P[Counter] in [#97..#122,#128..#255] then
P[counter] := Upcase(P[counter]);
Inc(counter);
end;
StrUpper := P;
end;
{$endif FPC_UNIT_HAS_STRUPPER}
{$ifndef FPC_UNIT_HAS_STRLOWER}
function StrLower(P: PChar): PChar;
var
counter: SizeInt;
begin
counter := 0;
while (P[counter] <> #0) do
begin
if P[counter] in [#65..#90] then
P[Counter] := chr(ord(P[Counter]) + 32);
Inc(counter);
end;
StrLower := P;
end;
{$endif FPC_UNIT_HAS_STRLOWER}
{$ifndef FPC_UNIT_HAS_STRSCAN}
function StrScan(P: PChar; C: Char): PChar;
Var
count: SizeInt;
Begin
count := 0;
{ As in Borland Pascal , if looking for NULL return null }
if C = #0 then
begin
StrScan := @(P[StrLen(P)]);
exit;
end;
{ Find first matching character of Ch in Str }
while P[count] <> #0 do
begin
if C = P[count] then
begin
StrScan := @(P[count]);
exit;
end;
Inc(count);
end;
{ nothing found. }
StrScan := nil;
end;
{$endif FPC_UNIT_HAS_STRSCAN}
{$ifndef FPC_UNIT_HAS_STRISCAN}
function StrIScan(P: PChar; C: Char): PChar;
Var
count: SizeInt;
UC: Char;
Begin
UC := upcase(C);
count := 0;
{ As in Borland Pascal , if looking for NULL return null }
if UC = #0 then
begin
StrIScan := @(P[StrLen(P)]);
exit;
end;
{ Find first matching character of Ch in Str }
while P[count] <> #0 do
begin
if UC = upcase(P[count]) then
begin
StrIScan := @(P[count]);
exit;
end;
Inc(count);
end;
{ nothing found. }
StrIScan := nil;
end;
{$endif FPC_UNIT_HAS_STRSCAN}
{$ifndef FPC_UNIT_HAS_STRRSCAN}
function StrRScan(P: PChar; C: Char): PChar;
Var
count: SizeInt;
index: SizeInt;
Begin
count := Strlen(P);
{ As in Borland Pascal , if looking for NULL return null }
if C = #0 then
begin
StrRScan := @(P[count]);
exit;
end;
Dec(count);
for index := count downto 0 do
begin
if C = P[index] then
begin
StrRScan := @(P[index]);
exit;
end;
end;
{ nothing found. }
StrRScan := nil;
end;
{$endif FPC_UNIT_HAS_STRRSCAN}
{$ifndef FPC_UNIT_HAS_STRRISCAN}
function StrRIScan(P: PChar; C: Char): PChar;
Var
count: SizeInt;
index: SizeInt;
UC: Char;
Begin
UC := upcase(C);
count := Strlen(P);
{ As in Borland Pascal , if looking for NULL return null }
if UC = #0 then
begin
StrRIScan := @(P[count]);
exit;
end;
Dec(count);
for index := count downto 0 do
begin
if UC = upcase(P[index]) then
begin
StrRIScan := @(P[index]);
exit;
end;
end;
{ nothing found. }
StrRIScan := nil;
end;
{$endif FPC_UNIT_HAS_STRRSCAN}
{$ifndef FPC_UNIT_HAS_STRECOPY}
Function StrECopy(Dest, Source: PChar): PChar;
{ Equivalent to the following: }
{ strcopy(Dest,Source); }
{ StrECopy := StrEnd(Dest); }
var
counter : SizeInt;
Begin
counter := IndexByte(Source^,-1,0);
{ counter+1 will move zero terminator }
Move(Source^,Dest^,counter+1);
StrECopy := Dest+counter;
end;
{$endif FPC_UNIT_HAS_STRECOPY}
{$ifndef FPC_UNIT_HAS_STRLCOPY}
Function StrLCopy(Dest,Source: PChar; MaxLen: SizeInt): PChar;
var
counter: SizeInt;
Begin
counter := 0;
{ To be compatible with BP, on a null string, put two nulls }
If Source[0] = #0 then
Begin
Dest[0]:=Source[0];
Inc(counter);
end;
while (Source[counter] <> #0) and (counter < MaxLen) do
Begin
Dest[counter] := char(Source[counter]);
Inc(counter);
end;
{ terminate the string }
Dest[counter] := #0;
StrLCopy := Dest;
end;
{$endif FPC_UNIT_HAS_STRLCOPY}
{$ifndef FPC_UNIT_HAS_STRCOMP}
function StrComp(Str1, Str2 : PChar): SizeInt;
var
counter: SizeInt;
Begin
counter := 0;
While str1[counter] = str2[counter] do
Begin
if (str2[counter] = #0) or (str1[counter] = #0) then
break;
Inc(counter);
end;
StrComp := ord(str1[counter]) - ord(str2[counter]);
end;
{$endif FPC_UNIT_HAS_STRCOMP}
{$ifndef FPC_UNIT_HAS_STRICOMP}
function StrIComp(Str1, Str2 : PChar): SizeInt;
var
counter: SizeInt;
c1, c2: char;
Begin
counter := 0;
c1 := upcase(str1[counter]);
c2 := upcase(str2[counter]);
While c1 = c2 do
Begin
if (c1 = #0) or (c2 = #0) then break;
Inc(counter);
c1 := upcase(str1[counter]);
c2 := upcase(str2[counter]);
end;
StrIComp := ord(c1) - ord(c2);
end;
{$endif FPC_UNIT_HAS_STRICOMP}
{$ifndef FPC_UNIT_HAS_STRLCOMP}
function StrLComp(Str1, Str2 : PChar; L: SizeInt): SizeInt;
var
counter: SizeInt;
c1, c2: char;
Begin
counter := 0;
if L = 0 then
begin
StrLComp := 0;
exit;
end;
Repeat
c1 := str1[counter];
c2 := str2[counter];
if (c1 = #0) or (c2 = #0) then break;
Inc(counter);
Until (c1 <> c2) or (counter >= L);
StrLComp := ord(c1) - ord(c2);
end;
{$endif FPC_UNIT_HAS_STRLCOMP}
{$ifndef FPC_UNIT_HAS_STRLICOMP}
function StrLIComp(Str1, Str2 : PChar; L: SizeInt): SizeInt;
var
counter: SizeInt;
c1, c2: char;
Begin
counter := 0;
if L = 0 then
begin
StrLIComp := 0;
exit;
end;
Repeat
c1 := upcase(str1[counter]);
c2 := upcase(str2[counter]);
if (c1 = #0) or (c2 = #0) then break;
Inc(counter);
Until (c1 <> c2) or (counter >= L);
StrLIComp := ord(c1) - ord(c2);
end;
{$endif FPC_UNIT_HAS_STRLICOMP}
|