我的计算机中目录的级别，深度

Question

我有两个目录路径：
Path 1 = "C:\Users\SomeUser\Documents\Embarcadero\Studio\"
Path 2 = "C:\Users\SomeUser\Documents\"
如您所见，Path 1 比 Path 2 深两层
换句话说，路径 1 深度为 6，路径 2 深度为 4
我需要一个可以计算这个深度的函数

编辑：
这是误解我问题的任何人的另一个例子

Path A :="c:\"  {This is level 1 or depth 1}  
Path B := "c:\foo"  {This is level 2 or depth 2}  
Path C := "c:\bar"  {This is level 2 or depth 2}  
Path D := "c:\foo\folder1"  {this is level 3 or depth 3}  
Path E := "c:\bar\folder2"  {this is level 3 or depth 3}  

我认为现在很清楚，当我说 depth 时，我的意思是如果我在驱动器 C 中我应该潜多深才能到达最终文件夹
我为什么需要这个？
因为在我的程序中，用户从他给出的基本目录中设置深度，我必须搜索并找到该基地根目录中的所有文件（如果深度为 1），例如深度为 2 我也必须在根目录中的任何文件夹内进行搜索，如果是 3，我将在该文件夹位于根目录的另一个文件夹内的文件夹内搜索任何文件
我的程序中的另一个功能也需要我需要的距离或深度差异，可以计算为

abs(depthFolder1 - depthFolder 2)

Answer 1

const 
  Path1 = "C:\Users\SomeUser\Documents\Embarcadero\Studio\";
  Path2 = "C:\Users\SomeUser\Documents\";

var 
  sl1, sl2: iJclStringList;

procedure Init(out sl: iJclStringList; const CanonicalPath: string);
begin
  sl := JclStringList();
  sl.Split( AnsiUpperCase( CanonicalPath ), '\' );
  if sl.Count <= 0 then exit;
  if sl.Last = '' then sl.Delete( sl.LastIndex );
end;

var i: integer;

begin
  Init( sl1, Path1 );
  Init( sl2, Path2 );

  i := 0;
  while (i < sl1.Count) and (i < sl2.Count)
    and (sl1[i] = sl2[i]) 
  do
      Inc(i);

  // now i maps to the first different element
  Difference := Max(sl1.Count, sl2.Count) - i;

  sl1 := nil;
  sl2 := nil;
end;

http://wiki.delphi-jedi.org/wiki/Category:IJclStringList_Methods

Answer 2

获取两条路径的差，统计\的个数。

未经测试，因为没有打开Delphi

uses Math;

function GetSamePart(const A,B: string): string;
var
  i: integer;
  MinLen: integer;
begin
  i:= 0;
  MinLen:= Min(Length(A), Length(B));
  while i < MinLen do begin
    if lowercase(A[i+1]) = Lowercase(B[i+1]) then inc(i)
    else break;
  end; {while}
  if i = 0 then Result:= ''
  else Result:= Copy(A, 1, i);
end;

function OccurrencesOfChar(const S: string; const C: char): integer;
var
  i: Integer;
begin
  result := 0;
  for i := 1 to Length(S) do
    if S[i] = C then
      inc(result);
end;

function CountPaths(const Pathname: string; PathChar: char = '\'): integer;
begin
  if PathName = '' then Exit(0);
  Result:= OccurrencesOfChar(PathName, PathChar);
  if PathName[Length(PathName)] <> PathChar then Inc(Result);
end;

function GetPathDistance(const A,B: string): integer;
var
  ADiff, BDiff: string;
  FirstDiff: integer;
begin
  FirstDiff:= Length(GetSamePart(A,B));
  if FirstDiff < Length(A) then ADiff:= Copy(A, FirstDiff+1, Length(A)-FirstDiff);
  if FirstDiff < Length(B) then BDiff:= Copy(B, FirstDiff+1, Length(B)-FirstDiff);
  Result:= CountPaths(ADiff) + CountPaths(BDiff);
end;

Answer 3

function GetDirLevel(aDirectory: string): integer;
var
  a_Index: integer;
begin
  Result := 0;
  aDirectory := IncludeTrailingPathDelimiter(aDirectory);
  for a_Index := 1 to Length(aDirectory) do
    if IsPathDelimiter(aDirectory, a_Index) then
      inc(Result);
end;

function GetComparedLevel(aBase, aDirectory: string): integer;
begin
  aBase := IncludeTrailingPathDelimiter(aBase);
  aDirectory := ExtractRelativePath(aBase, aDirectory);
  if POS('..', aDirectory) = 1 then
    Result := -1
  else
    Result := GetDirLevel(aDirectory);
end;

这使用RelativePath 到基础来确定级别。因此，如果您的目录不在 BaseDir 中，它将返回 -1。

procedure TForm1.Button1Click(Sender: TObject);
begin
  Label1.Caption := IntToStr(GetComparedLevel('c:\temp', 'c:\temp\level2\level3\level4'));//will return 3
  Label2.Caption := IntToStr(GetComparedLevel('c:\temp\level', 'c:\temp\level2\level3\level4'));//will return -1

end;

Answer 4

首先我感谢所有其他答案
但在其他人发布他们的答案之前，我已经找到了我的

function findPathDepth(path: String): integer;
var
  I: Integer;
  depthCounter: Integer;
begin
  depthCounter := 0;
  // path.Length - 2 in case there is an extra "\" at the end
  for I := 0 to path.Length - 2 do
    if (path[i] = '\') then
      inc(depthCounter);

  Result := depthCounter;
end;

function findPathDepthDistance(path1: String; path2: String): integer;
begin
  if (ExtractFileDrive(path1) = ExtractFileDrive(path2)) then
      Result := abs(findPathDepth(path1) - findPathDepth(path2));
  else 
      Result := -1;
end;  

再次感谢。