Анализ метода реализации дерева каталогов чтения PHP

php
function recurDir($pathName)
{
  //Save the result in the result variable
  $result = array();
  $temp = array();
  //Determine whether the variable passed in is a directory
  if(!is_dir($pathName) || !is_readable($pathName)) {
    return null;
  }
  //Take out the names of files and subdirectories in the directory, and use the scandir function
  $allFiles = scandir($pathName);
  //Traverse them
  foreach($allFiles as $fileName) {
    //Judge whether they are. And... Because these two things are not...
    if(in_array($fileName, array('.', '..'))) {
      continue;
    }
    //Path plus file name
    $fullName = $pathName.'/'.$fileName;
    //If it is a directory, continue to traverse the directory
    if(is_dir($fullName)) {
      //Save the file information in this directory into an array
      $result[$fullName] = recurDir($fullName);
    }else {
      //If it's a file, save it to a temporary variable first
      $temp[] = $fullName;
    }
  }
  //Take out the document
  if($temp) {
    foreach($temp as $f) {
      $result[] = $f;
    }
  }
  return $result;
}
//Verify that this function is easy to use!
$tree = recurDir('cart_ajax');
echo "
";
print_r($tree);
echo "
";
?>

function beautifulTree($arr, $l = '-|')
{
  static $l = '';
  static $str = '';
  //Traverse the directory tree just got
  foreach($arr as $key=>$val) {
    //If it is an array, it means that it is a directory. Then add - | to its sub file to indicate that it is the next level
    if(is_array($arr[$key])) {
      $str.=$l.$key."
";
      $l.='-|';
      beautifulTree($arr[$key], $l);
    }else {
      $str.=$l.$val."
";
    }
  }
  $l = '';
  return $str;
}
$beautifulTree = beautifulTree($tree);
echo "
";
print_r($beautiful);
echo "
";