| Код |
function ExtractWord(N : Byte; const S : String; WordDelims : CharSet) : String;
{-Given a set of word delimiters, return the N'th word in S}
var
I,LL : Word; {!!.12}
Count, Len : Integer;
Res:string;
begin
Count := 0;
I := 1;
LL:=length(s);
Len := 1;
Res:='';
while (I <= LL) and (Count <> N) do begin
{skip over delimiters}
while (I <= LL) 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 <= LL then
Inc(Count);
if Count = N then Len:= I;
{find the end of the current word}
while (I <= LL) and not(S[I] in WordDelims) do Inc(I);
{if this is the N'th word, add the I'th character to Tmp}
if Count = N then begin
Result := Copy(S,Len,I-Len);
Exit;
end;
end;
Result := '';
end;
|
Добавлено @ 14:40
пример использования
| Код |
for i := 1 to G_CountOfChar(s,';')+1 do
ListBox.Add(ExtractWord(i,s,[';',' ']));
ListBox.EndUpdate;
|
ф-ция G_CountOfChar
| Код |
function G_CountOfChar(const S: string; C: Char): Integer;
asm
TEST EAX,EAX
JE @@qt
MOV ECX,[EAX-4]
TEST ECX,ECX
JE @@zq
PUSH EBX
LEA EBX,[EAX-1]
XOR EAX,EAX
@@lp: CMP DL,BYTE PTR [EBX+ECX]
JE @@fn
DEC ECX
JNE @@lp
POP EBX
RET
@@fn: INC EAX
DEC ECX
JNE @@lp
POP EBX
RET
@@zq: XOR EAX,EAX
@@qt:
end;
|
предложенна Matematik |
