function file_tree($path, $include = array()) { $files = array(); if (!empty($include)) { $ds = glob($path . '/{' . implode(',', $include) . '}', GLOB_BRACE); } else { $ds = glob($path . '/*'); } if (is_array($ds)) { foreach ($ds as $entry) { if (is_file($entry)) { $files[] = $entry; } if (is_dir($entry)) { $rs = file_tree($entry); foreach ($rs as $f) { $files[] = $f; } } } } return $files; }
一个微擎的递归查找目录函数记录下 以后写递归理解用
最新推荐文章于 2020-11-22 01:01:03 发布