非递归的深度优先的算法,用了一个栈来实现
-
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:\www\server");
- ?>
|
本站声明
本文内容由网友自发贡献，版权归原作者所有，本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容，请联系admin@php.cn
作者最新文章
-
2024-10-22 09:46:29
-
2024-10-13 13:53:41
-
2024-10-12 12:15:51
-
2024-10-11 22:47:31
-
2024-10-11 19:36:51
-
2024-10-11 15:50:41
-
2024-10-11 15:07:41
-
2024-10-11 14:21:21
-
2024-10-11 12:59:11
-
2024-10-11 12:17:31
