procedure MakeTree(var slFile: TStrings; const FileExt: string);
var
Sr : TSearchRec;
Err : integer;
TrSize, FilePath : string;
begin
Err:=FindFirst('*.*', $11, Sr) ;
While (Err = 0) do
begin
if Sr.Name[1] <> '.' then
begin
if FileExt = '' then
slFile.Add(sr.Name)
else
begin
if AnsiUpperCase(Copy(sr.Name, Length(sr.Name) - 3, 4)) = AnsiUpperCase(FileExt) then
slFile.Add(sr.Name);
end;
end;
if ((Sr.Attr and faDirectory) <> 0) AND (Sr.Name[1] <> '.') then
begin
ChDir(Sr.Name) ;
MakeTree(slFile, FileExt);
ChDir('..') ;
end ;
Err:=FindNext(Sr) ;
end ;
end;
Delphi下遍历文件夹下所有文件的递归算法
var
Sr : TSearchRec;
Err : integer;
TrSize, FilePath : string ;
begin
Err: = FindFirst( ' *.* ' , $ 11 , Sr) ;
While (Err = 0 ) do
begin
if Sr.Name[ 1 ] <> ' . ' then
begin
if FileExt = '' then
slFile.Add(sr.Name)
else
begin
if AnsiUpperCase(Copy(sr.Name, Length(sr.Name) - 3 , 4 )) = AnsiUpperCase(FileExt) then
slFile.Add(sr.Name);
end;
end;
if ((Sr.Attr and faDirectory) <> 0 ) AND (Sr.Name[ 1 ] <> ' . ' ) then
begin
ChDir(Sr.Name) ;
MakeTree(slFile, FileExt);
ChDir( ' .. ' ) ;
end ;
Err: = FindNext(Sr) ;
end ;
end;