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
|
{*******************************************************}
{ }
{ Add FastReport String Lbrary }
{ }
{ Copyright (c) 1995, 1996 AO ROSNO }
{ Copyright (c) 1997, 1998 Master-Bank }
{ }
{ Copyright (c) 2001 by Stalker SoftWare }
{ }
{*******************************************************}
unit frFuncStr;
interface
{$mode objfpc}
{$B-} {- Complete Boolean Evaluation }
{$R-} {- Range-Checking }
{$V-} {- Var-String Checking }
{$T-} {- Typed @ operator }
{$X+} {- Extended syntax }
{$P+} {- Open string params }
{$J+} {- Writeable structured consts }
{$H+} {- Use long strings by default }
{$DEFINE HASVARIANT}
{.$I LR_Vers.inc}
uses
SysUtils;
type
TfrCharSet = set of Char;
// RxLib
function frWordPosition(const N: Integer; const S: string; const WordDelims: TfrCharSet): Integer;
function frExtractWord(N: Integer; const S: string; const WordDelims: TfrCharSet): string;
function frWordCount(const S: string; const WordDelims: TfrCharSet): Integer;
function frIsWordPresent(const W, S: string; const WordDelims: TfrCharSet): Boolean;
function frNPos(const C: string; S: string; N: Integer): Integer;
function frReplaceStr(const S, Srch, Replace: string): string;
// StLib
function frReplicate(cStr: String; nLen :Integer) :String;
function frPadRight(cStr: String; nLen: Integer; cChar :String) :String;
function frPadLeft(cStr: String; nLen: Integer; cChar :String) :String;
function frPadCenter( cStr: String; nWidth: Integer; cChar: String): String;
function frEndPos(cStr, cSubStr: String) :Integer;
function frCompareStr(cStr1, cStr2: String) :Integer;
function frLeftCopy(cStr: String; nNum: Integer): String;
function frRightCopy(cStr: String; nNum: Integer): String;
// Delphi
function frDelete(cStr: String; nIndex, nCount:Integer) :String;
function frInsert(cStr1, cStr2: String; nIndex:Integer) :String;
implementation
uses LazUTF8;
{--------------------------------------------------------------------}
{ Return position first character N words in string S, use }
{ const WordDelims (type TCharSet) as delimiter between words }
{--------------------------------------------------------------------}
function frWordPosition(const N: Integer; const S: string; const WordDelims: TfrCharSet): Integer;
var
Count, I: Integer;
begin
Count := 0;
I := 1;
Result := 0;
while (I <= Length(S)) and (Count <> N) do begin
{ skip over delimiters }
while (I <= Length(S)) and (S[I] in WordDelims) do Inc(I);
{ if we're not beyond end of S, we're at the start of a word }
if I <= Length(S) then Inc(Count);
{ if not finished, find the end of the current word }
if Count <> N then
while (I <= Length(S)) and not (S[I] in WordDelims) do Inc(I)
else Result := I;
end; { while }
end; { frWordPosition }
{--------------------------------------------------------------------}
{ Extract N word from string S, use WordDelims as }
{ delimiter between words }
{--------------------------------------------------------------------}
function frExtractWord(N: Integer; const S: string; const WordDelims: TfrCharSet): string;
var
I: Integer;
Len: Integer;
begin
Len := 0;
I := frWordPosition(N, S, WordDelims);
if I <> 0 then
{ find the end of the current word }
while (I <= Length(S)) and not(S[I] in WordDelims) do begin
{ add the I'th character to result }
Inc(Len);
SetLength(Result, Len);
Result[Len] := S[I];
Inc(I);
end; { while }
SetLength(Result, Len);
end; { frExtractWord }
{--------------------------------------------------------------------}
{ Count words in string S, use WordDelims as delimiter }
{ between words }
{--------------------------------------------------------------------}
function frWordCount(const S: string; const WordDelims: TfrCharSet): Integer;
var
SLen, I: Cardinal;
begin
Result := 0;
I := 1;
SLen := Length(S);
while I <= SLen do begin
while (I <= SLen) and (S[I] in WordDelims) do Inc(I);
if I <= SLen then Inc(Result);
while (I <= SLen) and not(S[I] in WordDelims) do Inc(I);
end; { while }
end; { frWordCount }
{--------------------------------------------------------------------}
{ Check existing word W in string S, use }
{ WordDelims as possible delimiters between words }
{--------------------------------------------------------------------}
function frIsWordPresent(const W, S: string; const WordDelims: TfrCharSet): Boolean;
var
Count, I: Integer;
begin
Result := False;
Count := frWordCount(S, WordDelims);
for I := 1 to Count do
if frExtractWord(I, S, WordDelims) = W then begin
Result := True;
Exit;
end; { if }
end; { frIsWordPresent }
{--------------------------------------------------------------------}
{ Find position N substring C in string S }
{--------------------------------------------------------------------}
function frNPos(const C: string; S: string; N: Integer): Integer;
var
I, P, K: Integer;
begin
Result := 0;
K := 0;
for I := 1 to N do begin
P := Pos(C, S);
Inc(K, P);
if (I = N) and (P > 0) then begin
Result := K;
Exit;
end; { if }
if P > 0 then Delete(S, 1, P)
else Exit;
end; { for }
end; { frNPos }
{--------------------------------------------------------------------}
{ Function exchange in string S all substrings Srch on }
{ other substring, delivered as Replace. }
{--------------------------------------------------------------------}
function frReplaceStr(const S, Srch, Replace: string): string;
var
I: Integer;
Source: string;
begin
Source := S;
Result := '';
repeat
I := Pos(Srch, Source);
if I > 0 then begin
Result := Result + UTF8Copy(Source, 1, I - 1) + Replace;
Source := UTF8Copy(Source, I + UTF8Length(Srch), MaxInt);
end
else Result := Result + Source;
until I <= 0;
end; { frReplaceStr }
{--------------------------------------------------------------------}
{ Return nLen chars as cStr }
{--------------------------------------------------------------------}
function frReplicate(cStr: String; nLen :Integer) :String;
var
nCou :Integer;
begin
Result := '';
for nCou := 1 to nLen do
Result := Result + cStr;
end; { Replicate }
{--------------------------------------------------------------------}
{ Return string filled chars cChar from left to nLen }
{--------------------------------------------------------------------}
function frPadLeft(cStr: String; nLen: Integer; cChar :String) :String;
var
S :String;
begin
S := Trim(cStr);
Result := frReplicate(cChar, nLen-Length(S))+S;
end ; { frPadLeft }
{--------------------------------------------------------------------}
{ Return string filled chars cChar from right to nLen }
{--------------------------------------------------------------------}
function frPadRight(cStr: String; nLen: Integer; cChar :String) :String ;
var
S :String;
begin
S := Trim(cStr);
Result := S+frReplicate(cChar, nLen-Length(S));
end; { frPadRight }
{--------------------------------------------------------------------}
{ Return centered string filled chars cChar with both side }
{--------------------------------------------------------------------}
function frPadCenter( cStr: String; nWidth: Integer; cChar: String): String;
var
nPerSide :Integer;
cResult :String;
begin
nPerSide := (nWidth - Length(cStr)) div 2;
cResult := frPadLeft(cStr, (Length(cStr) + nPerSide), cChar);
Result := frPadRight(cResult, nWidth, cChar);
end; { frPadCenter }
{----------------------------------------------------------------}
{ Find in string substring from end }
{ Return position substing if found, else return 0 }
{----------------------------------------------------------------}
function frEndPos(cStr, cSubStr: String) :Integer;
var
nCou :Integer;
nLenSS :Integer;
nLenS :Integer;
begin
nLenSS := Length(cSubStr);
nLenS := Length(cStr);
Result := 0 ;
if nLenSS > nLenS then Exit;
for nCou := nLenS downto 1 do
if UTF8Copy( cStr, nCou, nLenSS ) = cSubStr then
begin
Result := nCou;
Exit;
end; { if }
end; { frEndPos }
{--------------------------------------------------------------------}
{ Return substring from first char to nNum }
{--------------------------------------------------------------------}
function frLeftCopy( cStr: String; nNum: Integer ): String;
begin
Result := UTF8Copy( cStr, 1, nNum );
end; { frLeftCopy }
{--------------------------------------------------------------------}
{ Return substring from last char to position nNum }
{--------------------------------------------------------------------}
function frRightCopy( cStr: String; nNum: Integer ): String;
begin
Result := '';
if nNum > Length( cStr ) then Exit;
Result := UTF8Copy( cStr, (UTF8Length(cStr) - nNum + 1), UTF8Length(cStr) );
end; { frRightCopy }
{--------------------------------------------------------------------}
{ Delete nCount chars in string cStr from position nIndex }
{--------------------------------------------------------------------}
function frDelete(cStr: String; nIndex, nCount:Integer) :String;
begin
UTF8Delete(cStr, nIndex, nCount);
Result := cStr;
end; { frDelete }
{--------------------------------------------------------------------}
{ Insert string cStr2 into string cStr1, from position nIndex }
{--------------------------------------------------------------------}
function frInsert(cStr1, cStr2: String; nIndex:Integer) :String;
begin
UTF8Insert(cStr1, cStr2, nIndex);
Result := cStr2;
end; { frDelete }
{----------------------------------------------------------------}
{ Compare cStr1 and cStr2 and return number of the position }
{ difference strings }
{----------------------------------------------------------------}
function frCompareStr(cStr1, cStr2: String) :Integer;
var
nLenMax :Integer;
nCou :Integer;
begin
Result := 0;
if Length( cStr1 ) > Length( cStr2 ) then
nLenMax := Length( cStr1 )
else
nLenMax := Length( cStr2 );
for nCou := 1 to nLenMax do
if UTF8Copy( cStr1, nCou, 1) <> UTF8Copy( cStr2, nCou, 1) then
begin
Result := nCou;
Exit;
end; { if }
end; { frCompareStr }
end.
|