Method 2 of traversing the tree
Release： 2016-07-25 09:10:54
Original
1072 people have browsed it
Non-recursive depth-first algorithm, implemented using a stack
-
define('DS', DIRECTORY_SEPARATOR);
- function deep_first_list_files($from = '.')
- {
- if(!is_dir($from)) {
- return false;
- }
- $ files = array();
- $dirs = array($from);
- while(NULL !== ($dir = array_pop($dirs))) {
- if( $dh = opendir($dir)) {
- while ( false !== ($file = readdir($dh))) {
- if($file == '.' || $file == '..') {
- continue;
- }
- $path = $dir . DS . $file;
- if(is_dir($path)) {
- $dirs[] = $path;
- } else {
- $files[] = $path;
- }
- }
- closedir($dh);
- }
- }
- return $files;
- }
- function profile($func, $trydir)
- {
- $mem1 = memory_get_usage();
- echo '
------------- ---------- Test run for '.$func.'() '; - flush();
- $time_start = microtime(true);
- $list = $func($trydir);
- / /print_r($list);
- $time = microtime(true) - $time_start;
- echo 'Finished : '.count($list).' files';
- $mem2 = memory_get_peak_usage();
- printf ('
Max memory for '.$func.'() : %0.2f kbytes Running time for '.$func.'() : %0.f s ',
- ($mem2- $mem1)/1024.0, $time);
- return $list;
- }
- profile('deep_first_list_files', "D:wwwserver");
- ?>
Copy code
|
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Latest Articles by Author
-
2024-08-27 21:43:11
-
2024-08-27 21:41:11
-
2024-08-27 21:40:11
-
2024-08-27 21:39:11
-
2024-08-27 21:38:11
-
2024-08-27 21:37:11
-
2024-08-27 21:35:33
-
2024-08-27 21:35:14
-
2024-08-27 21:35:11
-
2024-08-27 21:34:19
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
