遍历树的方法二

非递归的深度优先的算法,用了一个栈来实现

1. define('DS', DIRECTORY_SEPARATOR);
2. function deep_first_list_files($from = '.')
3. {
4. if(!is_dir($from)) {
5. return false;
6. }
7. $files = array();
8. $dirs = array($from);
9. while(NULL !== ($dir = array_pop($dirs))) {
10. if( $dh = opendir($dir)) {
11. while( false !== ($file = readdir($dh))) {
12. if($file == '.' || $file == '..') {
13. continue;
14. }
15. $path = $dir . DS . $file;
16. if(is_dir($path)) {
17. $dirs[] = $path;
18. } else {
19. $files[] = $path;
20. }
21. }
22. closedir($dh);
23. }
24. }
25. return $files;
26. }
27. function profile($func, $trydir)
28. {
29. $mem1 = memory_get_usage();
30. echo '

    ----------------------- Test run for '.$func.'() ';

31. flush();
32. $time_start = microtime(true);
33. $list = $func($trydir);
34. //print_r($list);
35. $time = microtime(true) - $time_start;
36. echo 'Finished : '.count($list).' files';
37. $mem2 = memory_get_peak_usage();
38. printf('

    Max memory for '.$func.'() : %0.2f kbytes Running time for '.$func.'() : %0.f s

    ',
39. ($mem2-$mem1)/1024.0, $time);
40. return $list;
41. }
42. profile('deep_first_list_files', "D:\www\server");
43. ?>

复制代码